en
Scientific article
Open access
English

Why Restricted Additive Schwarz Converges Faster than Additive Schwarz

Published inBIT, vol. 43, no. 5, p. 945-959
Publication date2003
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 decomposition
  • Additive Schwarzpreconditioner
  • Restricted additive Schwarz preconditioner
  • Multiplicative Schwarz preconditioner
  • Restricted multiplicative Schwarz preconditioner
  • Convergence
  • Preconditioning
  • Numerical experiments
Citation (ISO format)
EFSTATHIOU, Evridiki, GANDER, Martin Jakob. Why Restricted Additive Schwarz Converges Faster than Additive Schwarz. In: BIT, 2003, vol. 43, n° 5, p. 945–959.
Main files (1)
Article (Accepted version)
accessLevelPublic
Identifiers
  • PID : unige:6282
ISSN of the journal0006-3835
633views
579downloads

Technical informations

Creation04/20/2010 10:10:16 AM
First validation04/20/2010 10:10:16 AM
Update time03/14/2023 3:27:59 PM
Status update03/14/2023 3:27:59 PM
Last indexation01/15/2024 7:52:48 PM
All rights reserved by Archive ouverte UNIGE and the University of GenevaunigeBlack