Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS

Remote Access
Green Open Access
Mathematics of Computation
Mathematics of Computation
ISSN 1088-6842(online) ISSN 0025-5718(print)


The analysis of smoothers for multigrid algorithms

Authors: James H. Bramble and Joseph E. Pasciak
Journal: Math. Comp. 58 (1992), 467-488
MSC: Primary 65N55
MathSciNet review: 1122058
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

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 [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 65N55

Retrieve articles in all journals with MSC: 65N55

Additional Information

PII: S 0025-5718(1992)1122058-0
Article copyright: © Copyright 1992 American Mathematical Society

Comments: Email Webmaster

© Copyright , American Mathematical Society
Contact Us · Sitemap · Privacy Statement

Connect with us Facebook Twitter Google+ LinkedIn Instagram RSS feeds Blogs YouTube Podcasts Wikipedia