Convergence estimates for multigrid algorithms
Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55)
The rate of convergence of multigrid algorithms is known to depend on assumptions concerning the smoothing process. The authors give a condition on smoothing that grants the optimal convergence of the multigrid method and is weaker than that considered by \textit{J. H. Bramble} and \textit{J. E. Pasciak} [Math. Comput. 58, No. 198, 467-488 (1992; Zbl 0771.65082)]. The new condition is shown to be satisfied also by the Kaczmarz smoother, unlike the conditions analyzed by Bramble and Pasciak [loc. cit.]. The importance of the new results is illustrated by numerical experiments.
- Convergence Estimates for Multigrid Algorithms without Regularity Assumptions
- Convergence Analysis without Regularity Assumptions for Multigrid Algorithms Based on SOR Smoothing
- scientific article; zbMATH DE number 205768
- Sharp Estimates for Multigrid Rates of Convergence with General Smoothing and Acceleration
- Algebraic study of multigrid methods for symmetric, definite problems
- A New Convergence Proof for the Multigrid Method Including the V-Cycle
- An Optimal Order Process for Solving Finite Element Equations
- Convergence Estimates for Multigrid Algorithms without Regularity Assumptions
- scientific article; zbMATH DE number 3958638 (Why is no real title available?)
- scientific article; zbMATH DE number 4078693 (Why is no real title available?)
- New Convergence Estimates for Multigrid Algorithms
- New Estimates for Multilevel Algorithms Including the V-Cycle
- Sharp Estimates for Multigrid Rates of Convergence with General Smoothing and Acceleration
- The Analysis of Smoothers for Multigrid Algorithms
- Uniform Convergence of Multigrid V-Cycle Iterations for Indefinite and Nonsymmetric Problems
- Remarks on multigrid convergence theorems
- Estimates for multigrid methods based on red-black Gauss-Seidel smoothings
- On the accuracy of multigrid truncation error estimates
- Convergence estimates for multigrid algorithms with SSC smoothers and applications to overlapping domain decomposition
- A note on Reusken's lemma
- Multigrid convergence for the MDCA curvature estimator
- Notes on convergence of an algebraic multigrid method
- Convergence results for 3D sparse grid approaches
- Convergence Estimates for Multigrid Algorithms without Regularity Assumptions
- Convergence analysis on multigrid methods for elliptic problems with large jumps in coefficients
- Sharp Estimates for Multigrid Rates of Convergence with General Smoothing and Acceleration
- Nearly optimal convergence result for multigrid with aggressive coarsening and polynomial smoothing.
- scientific article; zbMATH DE number 4074406 (Why is no real title available?)
- Convergence Analysis without Regularity Assumptions for Multigrid Algorithms Based on SOR Smoothing
- Grid Independent Convergence of the Multigrid Method for First-Order Equations
- scientific article; zbMATH DE number 567676 (Why is no real title available?)
- Multigrid-convergence of digital curvature estimators
- scientific article; zbMATH DE number 205768 (Why is no real title available?)
- Multigrid Convergent Curvature Estimator
- scientific article; zbMATH DE number 1404623 (Why is no real title available?)
- Multigrid convergence: A brief trip down memory lane
- Improvement of the rate of convergence estimates for multigrid algorithm
- Convergence analysis of multigrid methods with residual scaling techniques
This page was built for publication: Convergence estimates for multigrid algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1376695)
