Convergence of the multigrid V-cycle algorithm for second-order boundary value problems without full elliptic regularity

Authors:
Susanne C. Brenner
Affiliations:
-
Venue:
Mathematics of Computation
Year:
2002

Citing 7
Cited 2

Interpolation of operators

Interpolation of operators
Iterative methods by space decomposition and subspace correction

SIAM Review
On the abstract theory of additive and multiplicative Schwarz algorithms

Numerische Mathematik
V-cycle Convergence with Unsymmetric Smoothers and Application to an Anisotropic Model Problem

SIAM Journal on Numerical Analysis
Multigrid methods for the computation of singular solutions and stress intensity factors I: corner singularities

Mathematics of Computation
Uniform convergence of the multigrid V-cycle for an anisotropic problem

Mathematics of Computation
Finite Element Method for Elliptic Problems

Finite Element Method for Elliptic Problems

Smoothers, mesh dependent norms, interpolation and multigrid

Applied Numerical Mathematics
Analysis of a modified Schrödinger operator in 2D: Regularity, index, and FEM

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The multigrid V-cycle algorithm using the Richardson relaxation scheme as the smoother is studied in this paper. For second-order elliptic boundary value problems, the contraction number of the V-cycle algorithm is shown to improve uniformly with the increase of the number of smoothing steps, without assuming full elliptic regularity. As a consequence, the V-cycle convergence result of Braess and Hackbusch is generalized to problems without full elliptic regularity.