Economical cascadic multigrid method (ECMG). (English) Zbl 1153.65046

Summary: An economical cascadic multigrid method is proposed. Compared with the usual cascadic multigrid method developed by F. A. Bornemann and P. Deuflhard [Numer. Math. 75, No. 2, 135–152 (1996; Zbl 0873.65107)], the new one requires less iterations on each level, especially on the coarser grids. Many operations can be saved in the new cascadic multigrid algorithms. The main ingredient is the control of the iteration numbers on the each level to preserve the accuracy without over iterations. The theoretical justification is based on the observations that the error reduction rate of an iteration scheme in terms of the smoothing property is no longer accurate while the iteration number is big enough. A new formulae of the error reduction rate is employed in our new algorithm. Numerical experiments are reported to support our theory.


65F50 Computational methods for sparse matrices
65N30 Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs


Zbl 0873.65107
Full Text: DOI


[1] Bornemann F, Deuflhard P. The cascadic multigrid method for elliptic problems. Numer Math, 75: 135–152 (1996) · Zbl 0873.65107
[2] Bornemann F, Deuflhard P. The cascadic multigrid method. In: The Eighth International Conference on Domain Decomposition Methods for Partial Differential Equations. Glowinski R, Periaux J, Shi Z C, Widlund O, eds. New York: Wiley and Sons, 1997
[3] Bornemann F, Krause R. Classical and cascadic multigrid methodogical comparison. In: Proceedings of the 9th International Conference on Domain Decomposition. Bjorstad P, Espedal M, Keyes D, eds. New York: John Wiley and Sons, 1998
[4] Shaidurov V. Some estimates of the rate of convergence for the cascadic conjugate gradient method. Comp Math Applic, 31(4/5): 161–171 (1996) · Zbl 0886.65107
[5] Shi Z C, Xu X. Cascadic multigrid method for elliptic problems. East-West J Numer Math, 7: 199–209 (1999) · Zbl 0943.65143
[6] Stevenson R. Nonconforming finite elements and the cascadic multigrid method. Numer Math, 91: 351–387 (2002) · Zbl 0996.65139
[7] Shi Z C, Xu X. Cascadic multigrid methods for parabolic problems. J Comput Math, 18: 551–560 (2000) · Zbl 0964.65103
[8] Huang Y, Shi Z C, Tang T, et al. A multilevel successive iteration method for nonlinear elliptic problems. Math Comp, 57: 525–539 (2004) · Zbl 1042.65101
[9] Timmermann G. A cascadic multigrid algorithm for semilinear elliptic problems. Numer Math, 86: 717–731 (2000) · Zbl 0969.65111
[10] Braess D, Dahmen W. A cascade multigrid algorithm for the Stokes equations. Numer Math, 82: 179–192 (1999) · Zbl 0929.65125
[11] Braess D, Deuflhard P, Lipnikov K. A subspace cascadic multigrid method for mortar elements. Computing, 69: 205–225 (2002) · Zbl 1239.65076
[12] Shi Z C, Xu X, Man H. Cascadic multigrid for the finite volume methods for elliptic problems. J Comput Math, 22: 905–920 (2004) · Zbl 1069.65137
[13] Bramble J H. Multigrid Methods. London: Pitman Publishing, 1993
[14] Bramble J H, Pasciak J E. The analysis of smoothers for multigrid algorithms. Math Comp, 58: 467–488 (1992) · Zbl 0771.65082
[15] Hackbusch W. Multi-grid Methods and Applications. Berlin: Springer-Verlag, 1985 · Zbl 0595.65106
[16] Bank R E, Dupont T. An optimal order process for solving finite element equations. Math Comp, 36: 35–51 (1981) · Zbl 0466.65059
[17] Brenner S C. An optimal order multigrid method for P1 nonconforming finite elements. Math Comp, 52: 1–16 (1989) · Zbl 0664.65103
[18] Ciarlet P G. The Finite Element Method for Elliptic Problems. Amsterdam: North-Holland, 1978 · Zbl 0383.65058
[19] Shi Z C. On the error estimates of Morley element (in Chinese). Math Numer Sinica, 12: 279–286, 53–62 (1990)
[20] Brenner S C. An optimal order nonconforming multigrid method for the biharmonic equation. SIAM J Numer Anal, 26: 1124–1138 (1989) · Zbl 0679.65083
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.