Multigrid Methods for Anisotropic Edge Refinement

@article{Apel2002MultigridMF,
  title={Multigrid Methods for Anisotropic Edge Refinement},
  author={Thomas Apel and Joachim Sch{\"o}berl},
  journal={SIAM J. Numer. Anal.},
  year={2002},
  volume={40},
  pages={1993-2006}
}
A finite element method with optimal convergence on nonsmooth three dimensional domains requires anisotropic mesh refinement towards the edges. Multigrid methods for anisotropic tensor product meshes are available and are based either on line (or plane) smoothers or on semicoarsening strategies. In this paper we suggest and analyze a new multigrid scheme combining semicoarsening and line smoothers to obtain a solver of optimal algorithmic complexity for anisotropic meshes along edges. 

An anisotropic finite element method on polyhedral domains: interpolation error analysis

This work develops interpolation error estimates in suitable weighted spaces for the anisotropic mesh, especially for the tetrahedra violating the maximum angle condition, which can be used to design optimal finite element methods approximating singular solutions.

Uniform convergence of the multigrid V‐cycle on graded meshes for corner singularities

It is proved that the MG V-cycle with standard smoothers and piecewise linear interpolation converges uniformly for the linear systems obtained by finite element discretization of the Poisson equation on graded meshes.

On the robustness of a multigrid method for anisotropic reaction-diffusion problems

This paper analyzes the convergence of a multigrid method with a robust (line) smoother and derives contraction number bounds smaller than one uniform with respect to the mesh size and the parameters ε and μ.

On a nested refinement of anisotropic tetrahedral grids under Hessian metrics

This paper will show that, given an arbitrary set of mid-edge points, for example, produced by a Hessian metric, a tetrahedral grid can be nestedly refined without any other new points introduced.

Optimal anisotropic meshes for minimizing interpolation errors in Lp-norm

This paper presents a new optimal interpolation error estimate in L p norm (1 < p ≤ ∞) for finite element simplicial meshes in any spatial dimension and gives new functionals for the global moving mesh method.

A Priori Analysis of an Anisotropic Finite Element Method for Elliptic Equations in Polyhedral Domains

A by-product of the result is to extend the application of these anisotropic meshes to broader practical computations with the price to have “smoother” interior data.

Multigrid Methods for Linear Elliptic Optimal Control Problems

Multigrid optimization schemes that solve linear elliptic optimal control problems are discussed and a comparison is made between the multigrid for optimization (MGOPT) method and the collective smoothing multigrids (CSMG) method.

Multilevel methods for nonuniformly elliptic operators and fractional diffusion

A multilevel method with line smoothers and a nearly uniform convergence result on anisotropic meshes is presented and the so-called Xu-Zikatanov (XZ) identity is derived under the assumption that the underlying mesh is quasi-uniform.

References

SHOWING 1-10 OF 22 REFERENCES

Optimal-order nonnested multigrid methods for solving finite element equations III: on degenerate meshes

In this paper, we consider several model problems where finite element triangular meshes with arbitrarily small angles (high aspect ratios) are utilized to deal with anisotropy, interfaces, or

The finite element method with anisotropic mesh grading for elliptic problems in domains with corners and edges

This paper is concerned with a specific finite element strategy for solving elliptic boundary value problems in domains with corners and edges. First, the anisotropic singular behaviour of the

Uniform convergence of the multigrid {V}-cycle for an anisotropic problem

It is shown that the V-cycle multigrid iteration with a line smoother is a uniform contraction in the energy norm, and a weighted L 2 -norm estimate for the error in the Galerkin finite element approximation and a smoothing property of the line smoothers are proved.

THE ANALYSIS OF SMOOTHERS FOR MULTIGRID ALGORITHMS

The smoothing operators considered are based on subspace decomposition and include point, line, and block versions of Jacobi and Gauss-Seidel iteration as well as generalizations and it is shown that these smoothers will be effective in multigrid algorithms provided that the sub space decomposition satisfies two simple conditions.

A New Convergence Proof for the Multigrid Method Including the V-Cycle

The presented proof applies to procedures with any number of smoothing iterations and to the V-cycle and proves convergence under natural assumptions on the discretization and the elliptic problem.

Tensor product type subspace splittings and multilevel iterative methods for anisotropic problems

This work presents multilevel- and prewavelet-based methods that are robust for anisotropic diffusion operators with additional Helmholtz term and the resulting convergence rates are independent of the discretization level.

Finite element interpolation of nonsmooth functions satisfying boundary conditions

In this paper, we propose a modified Lagrange type interpolation operator to approximate functions in Sobolev spaces by continuous piecewise polynomials. In order to define interpolators for "rough"

Analysis of tensor product multigrid

This work considers anisotropic second order elliptic boundary value problems in two dimensions, for which the anisotropy is exactly aligned with the coordinate axes, and employs eigenspace techniques to separate the coordinate directions.

The Convergence of Multi-Level Methods for Solving Finite-Element Equations in the Presence of Singularities

The known convergence proofs for multi-level methods assume the quasi-uniformity of the family of domain triangulations used. Such triangulations are not suitable for problems with singularities