Convergence estimates for multigrid algorithms without regularity assumptions

  title={Convergence estimates for multigrid algorithms without regularity assumptions},
  author={James H. Bramble and Joseph E. Pasciak and Jun Ping Wang and Jinchao Xu},
  journal={Mathematics of Computation},
A new technique for proving rate of convergence estimates of multi- grid algorithms for symmetric positive definite problems will be given in this paper. The standard multigrid theory requires a "regularity and approxima- tion" assumption. In contrast, the new theory requires only an easily verified approximation assumption. This leads to convergence results for multigrid re- finement applications, problems with irregular coefficients, and problems whose coefficients have large jumps. In… 

Figures and Tables from this paper

A refined convergence analysis of multigrid algorithms for elliptic equations
A general theory for convergence of the multigrid algorithm under certain approximation conditions and smoothing conditions is established and can be applied to a wide range of problems.
The analysis of multigrid algorithms for cell centered finite difference methods
An analysis is provided which guarantees that the W-cycle and variable V-cycle multigrid algorithms converge with a rate of iterative convergence which can be bounded independently of the number of multilevel spaces.
Uniform convergence estimates for multigrid V-cycle algorithms with less than full elliptic regularity
In this paper, we provide uniform estimates for V-cycle algorithms with one smoothing on each level. This theory is based on some elliptic regularity but does not require a smoother interaction
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.
Old and new convergence proofs for multigrid methods
Multigrid methods are the fastest known methods for the solution of the large systems of equations arising from the discretization of partial differential equations. For self-adjoint and coercive
New estimates for multilevel algorithms including the V-cycle
It is proved that the simple additive multilevel algorithm discussed recently together with J. Xu and the standard V-cycle algorithm with one smoothing step per grid have a uniform reduction per iteration independent of the mesh sizes and number of levels, even on nonconvex domains which do not provide full elliptic regularity.
Applications of Multigrid Algorithms to Finite Difference Schemes for Elliptic Equations with Variable Coefficients
  • R. Jia
  • Computer Science, Mathematics
    SIAM J. Sci. Comput.
  • 2014
The authors' convergence analysis does not require any additional regularity of the solution and is valid for commonly used smoothing operators including the standard Gauss--Seidel method.
An Energy-minimizing Interpolation for Robust Multigrid Methods
A robust interpolation for multigrid based on the concepts of energy minimization and approximation is proposed, primarily designed for second-order elliptic PDEs, with possible extensions to other classes of problems such as integral equations.
Convergence Analysis of V-Cycle Multigrid Methods for Anisotropic Elliptic Equations
Fast multigrid solvers are considered for the linear systems arising from the bilinear finite element discretizations of second order elliptic equations with anisotropic diffusion and optimal convergence in the semi-coarsening case is established using the XZ identity.


The analysis of multigrid algorithms for nonsymmetric and indefinite elliptic problems
It is shown that for the variable V- script-cycle and the W-script-cycle schemes, multigrid algorithms with any amount of smoothing on the finest grid converge at a rate that is independent of the number of levels or unknowns, provided that the initial grid is sufficiently fine.
New convergence estimates for multigrid algorithms
New convergence estimates are proved for both symmetric and nonsymmetric multigrid algorithms applied to symmetric positive definite problems and a generalized cycle algorithm which involves exponentially increasing the number of smoothings on successively coarser grids is defined.
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.
Sharp Estimates for Multigrid Rates of Convergence with General Smoothing and Acceleration
This paper proves the convergence of the multilevel iterative method for solving linear equations that arise from elliptic partial differential equations in terms of the generalized condition number $\kappa $ of the matrix A and the smoothing matrix B.
The analysis of multigrid algorithms with nonnested spaces or noninherited quadratic forms
A theory for the analysis of multigrid algorithms for symmetric positive definite problems with nonnested spaces and noninherited quadratic forms is provided and various numerical approximations of second-order elliptic boundary value problems are applied.
Algebraic multigrid theory: The symmetric case
Convergence estimates for product iterative methods with applications to domain decomposition
In this paper, we consider iterative methods for the solution of symmetric positive definite problems on a space % which are defined in terms of products of operators defined with respect to a number
Parallel multilevel preconditioners
This paper discusses an approach for developing completely parallel multilevel preconditioners and describes the simplest application of the technique to a model elliptic problem.
Local mesh refinement multilevel techniques
Extra local relaxation sweeps near structural singularities are employed to restore the asymptotic convergence rates to their values in regular domains and an exchange-rate algorithm is introduced to maintain linear dependence of solution time on number of gridpoints.
An optimal order process for solving finite element equations
A k-level iterative procedure for solving the algebraic equations which arise from the finite element approximation of elliptic boundary value problems is presented and analyzed. The work estimate