The convergence of multiplicative Schwarz-type methods for solving linear systems when the coefficient matrix is either a nonsingular M-matrix or a symmetric positive definite matrix is studied using classical and new results from the theory of splittings. The effect on convergence of algorithmic parameters such as the number of subdomains, the amount of overlap, the result of inexact local solves and of "coarse grid" corrections (global coarse solves) is analyzed in an algebraic setting. Results on algebraic additive Schwarz are also included.
Algebraic theory of multiplicative Schwarz methods
Benzi, Michele;
2001
Abstract
The convergence of multiplicative Schwarz-type methods for solving linear systems when the coefficient matrix is either a nonsingular M-matrix or a symmetric positive definite matrix is studied using classical and new results from the theory of splittings. The effect on convergence of algorithmic parameters such as the number of subdomains, the amount of overlap, the result of inexact local solves and of "coarse grid" corrections (global coarse solves) is analyzed in an algebraic setting. Results on algebraic additive Schwarz are also included.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
