When does two‐grid optimality carry over to the V‐cycle?
Authors:
Open Access
- 21 December 2009
- journal article
- research article
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 17 (2-3) , 273-290
Abstract
We investigate additional condition(s) that confirm that a V‐cycle multigrid method is satisfactory (say, optimal) when it is based on a two‐grid cycle with satisfactory (say, level‐independent) convergence properties. The main tool is McCormick's bound on the convergence factor (SIAM J. Numer. Anal. 1985; 22:634–643), which we showed in previous work to be the best bound for V‐cycle multigrid among those that are characterized by a constant that is the maximum (or minimum) over all levels of an expression involving only two consecutive levels; that is, that can be assessed considering only two levels at a time. We show that, given a satisfactorily converging two‐grid method, McCormick's bound allows us to prove satisfactory convergence for the V‐cycle if and only if the norm of a given projector is bounded at each level. Moreover, this projector norm is simple to estimate within the framework of Fourier analysis, making it easy to supplement a standard two‐grid analysis with an assessment of the V‐cycle potentialities. The theory is illustrated with a few examples that also show that the provided bounds may give a satisfactory sharp prediction of the actual multigrid convergence. Copyright © 2009 John Wiley & Sons, Ltd.Keywords
This publication has 22 references indexed in Scilit:
- Comparison of bounds for V-cycle multigridApplied Numerical Mathematics, 2010
- Convergence Analysis of Perturbed Two‐Grid and Multigrid MethodsSIAM Journal on Numerical Analysis, 2007
- On two‐grid convergence estimatesNumerical Linear Algebra with Applications, 2005
- Algebraic multigrid and algebraic multilevel methods: a theoretical comparisonNumerical Linear Algebra with Applications, 2005
- Old and new convergence proofs for multigrid methodsActa Numerica, 1993
- Convergence estimates for multigrid algorithms without regularity assumptionsMathematics of Computation, 1991
- Algebraic multigrid theory: The symmetric caseApplied Mathematics and Computation, 1986
- Multigrid methods: Fundamental algorithms, model problem analysis and applications1982
- The convergence rate of a multigrid method with Gauss-Seidel relaxation for the poisson equation1982
- Multi-grid convergence theory1982