Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

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

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Convergence estimates for multigrid algorithms without regularity assumptions
HTML articles powered by AMS MathViewer

by James H. Bramble, Joseph E. Pasciak, Jun Ping Wang and Jinchao Xu PDF
Math. Comp. 57 (1991), 23-45 Request permission

Abstract:

A new technique for proving rate of convergence estimates of multigrid algorithms for symmetric positive definite problems will be given in this paper. The standard multigrid theory requires a "regularity and approximation" assumption. In contrast, the new theory requires only an easily verified approximation assumption. This leads to convergence results for multigrid refinement applications, problems with irregular coefficients, and problems whose coefficients have large jumps. In addition, the new theory shows why it suffices to smooth only in the regions where new nodes are being added in multigrid refinement applications.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 65J10, 65N55
  • Retrieve articles in all journals with MSC: 65J10, 65N55
Additional Information
  • © Copyright 1991 American Mathematical Society
  • Journal: Math. Comp. 57 (1991), 23-45
  • MSC: Primary 65J10; Secondary 65N55
  • DOI: https://doi.org/10.1090/S0025-5718-1991-1079008-4
  • MathSciNet review: 1079008