Can the discretization modify the performance of Schwarz methods?

Victorita Dolean, Martin J. Gander

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

4 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationDomain Decomposition Methods in Science and Engineering XIX
PublisherSpringer
Pages117-124
Number of pages8
Volume78
ISBN (Print)9783642113031
DOIs
Publication statusPublished - 3 Dec 2010
Event19th International Conference on Domain Decomposition, DD19 - Zhanjiajie, China
Duration: 17 Aug 200922 Aug 2009

Publication series

NameLecture Notes in Computational Science and Engineering
Volume78 LNCSE
ISSN (Print)1439-7358

Conference

Conference19th International Conference on Domain Decomposition, DD19
CountryChina
CityZhanjiajie
Period17/08/0922/08/09

Keywords

  • discretization
  • Schwarz methods
  • domain decomposition methods
  • operations research
  • continuous analysis
  • convergence speed
  • discrete levels

Fingerprint Dive into the research topics of 'Can the discretization modify the performance of Schwarz methods?'. Together they form a unique fingerprint.

  • Cite this

    Dolean, V., & Gander, M. J. (2010). Can the discretization modify the performance of Schwarz methods? In Domain Decomposition Methods in Science and Engineering XIX (Vol. 78, pp. 117-124). (Lecture Notes in Computational Science and Engineering; Vol. 78 LNCSE). Springer. https://doi.org/10.1007/978-3-642-11304-8_11