Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



The analysis of multigrid algorithms for nonsymmetric and indefinite elliptic problems

Authors: James H. Bramble, Joseph E. Pasciak and Jinchao Xu
Journal: Math. Comp. 51 (1988), 389-414
MSC: Primary 65N30; Secondary 65F10
MathSciNet review: 930228
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: We prove some new estimates for the convergence of multigrid algorithms applied to nonsymmetric and indefinite elliptic boundary value problems. We provide results for the so-called 'symmetric' multigrid schemes. We show that for the variable $ \mathcal{V}$-cycle and the $ \mathcal{W}$-cycle schemes, multigrid algorithms with any amount of smoothing on the finest grid converge at a rate that is independent of the number of levels or unknowns, provided that the initial grid is sufficiently fine. We show that the $ \mathcal{V}$-cycle algorithm also converges (under appropriate assumptions on the coarsest grid) but at a rate which may deteriorate as the number of levels increases. This deterioration for the $ \mathcal{V}$-cycle may occur even in the case of full elliptic regularity. Finally, the results of numerical experiments are given which illustrate the convergence behavior suggested by the theory.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 65N30, 65F10

Retrieve articles in all journals with MSC: 65N30, 65F10

Additional Information

Article copyright: © Copyright 1988 American Mathematical Society

American Mathematical Society