Convergence estimates for multigrid algorithms without regularity assumptions

Jamesh Bramble, J. Oseph Pasciak, J. Unping Wang, Jinchao Xu

Research output: Contribution to journalArticlepeer-review

176 Scopus citations


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. © 1991 American Mathematical Society.
Original languageEnglish (US)
Pages (from-to)23-45
Number of pages23
JournalMathematics of Computation
Issue number195
StatePublished - Jan 1 1991
Externally publishedYes

Bibliographical note

Generated from Scopus record by KAUST IRTS on 2023-02-15

ASJC Scopus subject areas

  • Algebra and Number Theory
  • Computational Mathematics
  • Applied Mathematics


Dive into the research topics of 'Convergence estimates for multigrid algorithms without regularity assumptions'. Together they form a unique fingerprint.

Cite this