Summary.
In recent years, it has been shown that many modern iterative algorithms (multigrid schemes, multilevel preconditioners, domain decomposition methods etc.) for solving problems resulting from the discretization of PDEs can be interpreted as additive (Jacobi-like) or multiplicative (Gauss-Seidel-like) subspace correction methods. The key to their analysis is the study of certain metric properties of the underlying splitting of the discretization space \(V\) into a sum of subspaces \(V_j\) and the splitting of the variational problem on \(V\) into auxiliary problems on these subspaces. In this paper, we propose a modification of the abstract convergence theory of the additive and multiplicative Schwarz methods, that makes the relation to traditional iteration methods more explicit. The analysis of the additive and multiplicative Schwarz iterations can be carried out in almost the same spirit as in the traditional block-matrix situation, making convergence proofs of multilevel and domain decomposition methods clearer, or, at least, more classical. In addition, we present a new bound for the convergence rate of the appropriately scaled multiplicative Schwarz method directly in terms of the condition number of the corresponding additive Schwarz operator. These results may be viewed as an appendix to the recent surveys [X], [Ys].
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received February 1, 1994 / Revised version received August 1, 1994
Rights and permissions
About this article
Cite this article
Griebel, M., Oswald, P. On the abstract theory of additive and multiplicative Schwarz algorithms . Numer. Math. 70, 163–180 (1995). https://doi.org/10.1007/s002110050115
Issue Date:
DOI: https://doi.org/10.1007/s002110050115