Scientific article
OA Policy
English

Schwarz Methods over the Course of Time

Published in

Electronic transactions on numerical analysis, vol. 31, p. 228-255

Publication date

2008

Abstract

Schwarz domain decomposition methods are the oldest domain decomposition methods. They were invented by Hermann Amandus Schwarz in 1869 as an analytical tool to rigorously prove results obtained by Riemann through a minimization principle. Renewed interest in these methods was sparked by the arrival of parallel computers, and variants of the method have been introduced and analyzed, both at the continuous and discrete level. It can be daunting to understand the similarities and subtle differences between all the variants, even for the specialist. This paper presents Schwarz methods as they were developed historically. From quotes by major contributors over time, we learn about the reasons for similarities and subtle differences between continuous and discrete variants. We also formally prove at the algebraic level equivalence and/or non-equivalence among the major variants for very general decompositions and many subdomains. We finally trace the motivations that led to the newest class called optimized Schwarz methods, illustrate how they can greatly enhance the performance of the solver, and show why one has to be cautious when testing them numerically.

Citation (ISO format)

GANDER, Martin Jakob. Schwarz Methods over the Course of Time. In: Electronic transactions on numerical analysis, 2008, vol. 31, p. 228–255.

Main files (1)

Article (Accepted version)

Secondary files (1)

Supplemental data

Identifiers

  • PID : unige:6313

Journal ISSN

1068-9613
727views
443downloads

Technical informations

Creation

20/04/2010 10:10:32

First validation

20/04/2010 10:10:32

Update

20/09/2023 14:14:45

Status update

20/09/2023 14:14:45

Last indexation

29/10/2024 14:39:38
All rights reserved by Archive ouverte UNIGE and the University of Geneva
OpenAIRE Indexed & Validated