A convergence theory of multilevel additive Schwarz methods on unstructured meshes

T.F. Chan, J. Zou

Research output: Contribution to journalArticlepeer-review

20 Scopus citations


We develop a convergence theory for two level and multilevel additive Schwarz domain decomposition methods for elliptic and parabolic problems on general unstructured meshes in two and three dimensions. The coarse and fine grids are assumed only to be shape regular, and the domains formed by the coarse and fine grids need not be identical. In this general setting, our convergence theory leads to completely local bounds for the condition numbers of two level additive Schwarz methods, which imply that these condition numbers are optimal, or independent of fine and coarse mesh sizes and subdomain sizes if the overlap amount of a subdomain with its neighbors varies proportionally to the subdomain size. In particular, we will show that additive Schwarz algorithms are still very efficient for nonselfadjoint parabolic problems with only symmetric, positive definite solvers both for local subproblems and for the global coarse problem. These conclusions for elliptic and parabolic problems improve our earlier results in [12, 15, 16]. Finally, the convergence theory is applied to multilevel additive Schwarz algorithms. Under some very weak assumptions on the fine mesh and coarser meshes, e.g., no requirements on the relation between neighboring coarse level meshes, we are able to derive a condition number bound of the order O(ρ2L2), where ρ = max1≤l≤L(hl + hl-1)/δl, hl is the element size of the lth level mesh, δl the overlap of subdomains on the lth level mesh, and L the number of mesh levels.
Original languageEnglish
Pages (from-to)365-398
Number of pages34
JournalNumerical Algorithms
Issue number3-4
StatePublished - 1996
Externally publishedYes

Bibliographical note

cited By 18


Dive into the research topics of 'A convergence theory of multilevel additive Schwarz methods on unstructured meshes'. Together they form a unique fingerprint.

Cite this