multigrid |
|
We present a novel decomposition of spaces based on the geometric structure of bisection grids in any dimension and use it to bridge the gap between graded and quasi-uniform grids. We show that local smoothing for a new added node needs to be performed only for three vertices.
We develop an efficient and easy-to-implement coarsening algorithm to find the decomposition bisection grids. The coarsening algorithm does not require storing the binary refinement tree explicitly. Numerical experiments demonstrate that the proposed coarsening algorithm is very efficient when applied for multilevel preconditioners and mesh adaptivity for time-dependent problems.
We design and analyze multigrid methods for H(curl) and H(div) systems on adaptive grids obtained by bisection methods. We improve the existing results by removing the regularity assumptions on the solution and the grid.
We summarize our work in this book chapter.
We use local mutilevel method as a preconditioner and show it is robust for symmetric elliptic problems with piecewise constant coefficients with possibly large jump.
For elliptic equations with anisotropic diffusion, we prove uniform convergence of multigrid algorithms without using "regularity assumption" in both the semi-coarsening and uniform coarsening cases.
The X-Z identity is derived from the method of auxiliary spaces.