The analysis of smoothers for multigrid algorithms

Bramble, James H.; Pasciak, Joseph E.

doi:10.1090/S0025-5718-1992-1122058-0

The analysis of smoothers for multigrid algorithms
HTML articles powered by AMS MathViewer

by James H. Bramble and Joseph E. Pasciak PDF

Math. Comp. 58 (1992), 467-488 Request permission

Abstract:

The purpose of this paper is to provide a general technique for defining and analyzing smoothing operators for use in multigrid algorithms. The smoothing operators considered are based on subspace decomposition and include point, line, and block versions of Jacobi and Gauss-Seidel iteration as well as generalizations. We shall show that these smoothers will be effective in multigrid algorithms provided that the subspace decomposition satisfies two simple conditions. In many applications, these conditions are trivial to verify.

References

Randolph E. Bank and Craig C. Douglas, Sharp estimates for multigrid rates of convergence with general smoothing and acceleration, SIAM J. Numer. Anal. 22 (1985), no. 4, 617–633. MR 795944, DOI 10.1137/0722038
Randolph E. Bank and Todd Dupont, An optimal order process for solving finite element equations, Math. Comp. 36 (1981), no. 153, 35–51. MR 595040, DOI 10.1090/S0025-5718-1981-0595040-2
D. Braess and W. Hackbusch, A new convergence proof for the multigrid method including the $V$-cycle, SIAM J. Numer. Anal. 20 (1983), no. 5, 967–975. MR 714691, DOI 10.1137/0720066
James H. Bramble and Joseph E. Pasciak, New convergence estimates for multigrid algorithms, Math. Comp. 49 (1987), no. 180, 311–329. MR 906174, DOI 10.1090/S0025-5718-1987-0906174-X
James H. Bramble, Joseph E. Pasciak, and Jinchao Xu, The analysis of multigrid algorithms with nonnested spaces or noninherited quadratic forms, Math. Comp. 56 (1991), no. 193, 1–34. MR 1052086, DOI 10.1090/S0025-5718-1991-1052086-4
James H. Bramble, Joseph E. Pasciak, and Jinchao Xu, The analysis of multigrid algorithms for nonsymmetric and indefinite elliptic problems, Math. Comp. 51 (1988), no. 184, 389–414. MR 930228, DOI 10.1090/S0025-5718-1988-0930228-6
James H. Bramble, Joseph E. Pasciak, and Jinchao Xu, Parallel multilevel preconditioners, Math. Comp. 55 (1990), no. 191, 1–22. MR 1023042, DOI 10.1090/S0025-5718-1990-1023042-6
James H. Bramble, Joseph E. Pasciak, Jun Ping Wang, and Jinchao Xu, Convergence estimates for product iterative methods with applications to domain decomposition, Math. Comp. 57 (1991), no. 195, 1–21. MR 1090464, DOI 10.1090/S0025-5718-1991-1090464-8
James H. Bramble, Joseph E. Pasciak, Jun Ping Wang, and Jinchao Xu, Convergence estimates for multigrid algorithms without regularity assumptions, Math. Comp. 57 (1991), no. 195, 23–45. MR 1079008, DOI 10.1090/S0025-5718-1991-1079008-4
Achi Brandt, Multi-level adaptive solutions to boundary-value problems, Math. Comp. 31 (1977), no. 138, 333–390. MR 431719, DOI 10.1090/S0025-5718-1977-0431719-X

Multi-grid methods and applications

J. Mandel, S. McCormick, and R. Bank, Variational multigrid theory, Multigrid methods, Frontiers Appl. Math., vol. 3, SIAM, Philadelphia, PA, 1987, pp. 131–177. MR 972757

An algebraic theory for multigrid methods for variational problems

S. F. McCormick, Multigrid methods for variational problems: general theory for the $V$-cycle, SIAM J. Numer. Anal. 22 (1985), no. 4, 634–643. MR 795945, DOI 10.1137/0722039
S. F. McCormick, Multigrid methods for variational problems: further results, SIAM J. Numer. Anal. 21 (1984), no. 2, 255–263. MR 736329, DOI 10.1137/0721018
Stephen F. McCormick (ed.), Multigrid methods, Frontiers in Applied Mathematics, vol. 3, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1987. MR 972752, DOI 10.1137/1.9781611971057
S. F. McCormick and J. W. Ruge, Unigrid for multigrid simulation, Math. Comp. 41 (1983), no. 163, 43–62. MR 701623, DOI 10.1090/S0025-5718-1983-0701623-0
R. Verfürth, A multilevel algorithm for mixed problems, SIAM J. Numer. Anal. 21 (1984), no. 2, 264–271. MR 736330, DOI 10.1137/0721019
Jun Ping Wang, Convergence analysis without regularity assumptions for multigrid algorithms based on SOR smoothing, SIAM J. Numer. Anal. 29 (1992), no. 4, 987–1001. MR 1173181, DOI 10.1137/0729060
Olof B. Widlund, Optimal iterative refinement methods, Domain decomposition methods (Los Angeles, CA, 1988) SIAM, Philadelphia, PA, 1989, pp. 114–125. MR 992008