Published 2010
| Version v1
Publication
Can the Discretization Modify the Performance of Schwarz Methods?
Creators
Contributors
Others:
- Numerical modeling and high performance computing for evolution problems in complex domains and heterogeneous media (NACHOS) ; Inria Sophia Antipolis - Méditerranée (CRISAM) ; Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Jean Alexandre Dieudonné (JAD) ; Université Nice Sophia Antipolis (1965 - 2019) (UNS) ; COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS) ; COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)
- Section de mathématiques [Genève] ; Université de Genève = University of Geneva (UNIGE)
Description
Schwarz domain decomposition methods can be analyzed both at the continuous and discrete level. For consistent discretizations, one would naturally expect that the discretized method performs as predicted by the continuous analysis. We show in this short note for two model problems that this is not always the case, and that the discretization can both increase and decrease the convergence speed predicted by the continuous analysis.
Abstract
Decomposition Methods in Science and Engineering XV, Lecture Notes in Computational Science and Engineering, Springer-Verlag.Additional details
Identifiers
- URL
- https://hal.archives-ouvertes.fr/hal-00487519
- URN
- urn:oai:HAL:hal-00487519v1