Convergence Estimates for Multigrid Algorithms without Regularity Assumptions
James H. Bramble, Joseph E. Pasciak, Jun Ping Wang et al. · Mathematics of Computation · 1991
A new technique for proving rate of convergence estimates of multigrid algorithms for symmetric positive definite problems will be given in this paper. The standard multigrid theory requires a "regularity and approximation" assumption. In contrast, the new theory requires only an easily verified approximation assumption. This leads to convergence results for multigrid refinement applications, problems with irregular coefficients, and problems whose coefficients have large jumps. In addition, the new theory shows why it suffices to smooth only in the regions where new nodes are being added in multigrid refinement applications.
Cited by 261 works. doi:10.1090/s0025-5718-1991-1079008-4 Open-access PDF
Authors
References
- Multi-Level Adaptive Solutions to Boundary-Value Problems
- Multi-Grid Methods and Applications
- Multi-grid methods and applications.
- An Optimal Order Process for Solving Finite Element Equations
- Parallel Multilevel Preconditioners
- Algebraic multigrid theory: The symmetric case
- A New Convergence Proof for the Multigrid Method Including the V -Cycle
- Convergence Estimates for Product Iterative Methods with Applications to Domain Decomposition
- The Analysis of Multigrid Algorithms with Nonnested Spaces or Noninherited Quadratic Forms
- Local Mesh Refinement Multilevel Techniques