UNIGE document Scientific Article
previous document  unige:6282  next document
add to browser collection

Why Restricted Additive Schwarz Converges Faster than Additive Schwarz

Efstathiou, Evridiki
Published in BIT Numerical Mathematics. 2003, vol. 43, no. 5, p. 945-959
Abstract Recently a variant of the additive Schwarz (AS) preconditioner, the restricted additive Schwarz (RAS) preconditioner has been introduced, and numerical experiments showed that RAS converges faster and requires less communication than AS. We show in this paper how RAS, which is defined at the matrix level, can be interpreted as an iteration at the continuous level of the underlying problem. This interpretation reveals why RAS converges faster than classical AS.
Keywords Domain decompositionAdditive SchwarzpreconditionerRestricted additive Schwarz preconditionerMultiplicative Schwarz preconditionerRestricted multiplicative Schwarz preconditionerConvergencePreconditioningNumerical experiments
Full text
(ISO format)
EFSTATHIOU, Evridiki, GANDER, Martin Jakob. Why Restricted Additive Schwarz Converges Faster than Additive Schwarz. In: BIT Numerical Mathematics, 2003, vol. 43, n° 5, p. 945-959. https://archive-ouverte.unige.ch/unige:6282

304 hits



Deposited on : 2010-04-20

Export document
Format :
Citation style :