An introduction to multitrace formulations and associated domain decomposition solvers

X. Claeys, V. Dolean, M. J. Gander

Research output: Contribution to journalArticle

Abstract

Multi-trace formulations (MTFs) are based on a decomposition of the problem domain into subdomains, and thus domain decomposition solvers are of interest. The fully rigorous mathematical MTF can however be daunting for the non-specialist. The first aim of the present contribution is to provide a gentle introduction to MTFs. We introduce these formulations on a simple model problem using concepts familiar to researchers in domain decomposition. This allows us to get a new understanding of MTFs and a natural block Jacobi iteration, for which we determine optimal relaxation parameters. We then show how iterative multi-trace formulation solvers are related to a well known domain decomposition method called optimal Schwarz method: a method which used Dirichlet to Neumann maps in the transmission condition. We finally show that the insight gained from the simple model problem leads to remarkable identities for Calderón projectors and related operators, and the convergence results and optimal choice of the relaxation parameter we obtained is independent of the geometry, the space dimension of the problem, and the precise form of the spatial elliptic operator, like for optimal Schwarz methods. We illustrate our analysis with numerical experiments.

LanguageEnglish
Pages69-86
Number of pages18
JournalApplied Numerical Mathematics
Volume135
Early online date24 Jul 2018
DOIs
Publication statusPublished - 1 Jan 2019

Fingerprint

Domain Decomposition
Decomposition
Trace
Formulation
Schwarz Methods
Domain decomposition methods
Dirichlet-to-Neumann Map
Transmission Conditions
Geometry
Domain Decomposition Method
Projector
Elliptic Operator
Jacobi
Convergence Results
Experiments
Numerical Experiment
Iteration
Decompose
Operator
Model

Keywords

  • multi-trace formulations
  • Calderon projectors
  • Dirichlet to Neumann operators
  • optimal Schwarz methods

Cite this

@article{9731a36f59ce494996cd23611c136028,
title = "An introduction to multitrace formulations and associated domain decomposition solvers",
abstract = "Multi-trace formulations (MTFs) are based on a decomposition of the problem domain into subdomains, and thus domain decomposition solvers are of interest. The fully rigorous mathematical MTF can however be daunting for the non-specialist. The first aim of the present contribution is to provide a gentle introduction to MTFs. We introduce these formulations on a simple model problem using concepts familiar to researchers in domain decomposition. This allows us to get a new understanding of MTFs and a natural block Jacobi iteration, for which we determine optimal relaxation parameters. We then show how iterative multi-trace formulation solvers are related to a well known domain decomposition method called optimal Schwarz method: a method which used Dirichlet to Neumann maps in the transmission condition. We finally show that the insight gained from the simple model problem leads to remarkable identities for Calder{\'o}n projectors and related operators, and the convergence results and optimal choice of the relaxation parameter we obtained is independent of the geometry, the space dimension of the problem, and the precise form of the spatial elliptic operator, like for optimal Schwarz methods. We illustrate our analysis with numerical experiments.",
keywords = "multi-trace formulations, Calderon projectors, Dirichlet to Neumann operators, optimal Schwarz methods",
author = "X. Claeys and V. Dolean and Gander, {M. J.}",
year = "2019",
month = "1",
day = "1",
doi = "10.1016/j.apnum.2018.07.006",
language = "English",
volume = "135",
pages = "69--86",
journal = "Applied Numerical Mathematics",
issn = "0168-9274",

}

An introduction to multitrace formulations and associated domain decomposition solvers. / Claeys, X.; Dolean, V.; Gander, M. J.

In: Applied Numerical Mathematics, Vol. 135, 01.01.2019, p. 69-86.

Research output: Contribution to journalArticle

TY - JOUR

T1 - An introduction to multitrace formulations and associated domain decomposition solvers

AU - Claeys, X.

AU - Dolean, V.

AU - Gander, M. J.

PY - 2019/1/1

Y1 - 2019/1/1

N2 - Multi-trace formulations (MTFs) are based on a decomposition of the problem domain into subdomains, and thus domain decomposition solvers are of interest. The fully rigorous mathematical MTF can however be daunting for the non-specialist. The first aim of the present contribution is to provide a gentle introduction to MTFs. We introduce these formulations on a simple model problem using concepts familiar to researchers in domain decomposition. This allows us to get a new understanding of MTFs and a natural block Jacobi iteration, for which we determine optimal relaxation parameters. We then show how iterative multi-trace formulation solvers are related to a well known domain decomposition method called optimal Schwarz method: a method which used Dirichlet to Neumann maps in the transmission condition. We finally show that the insight gained from the simple model problem leads to remarkable identities for Calderón projectors and related operators, and the convergence results and optimal choice of the relaxation parameter we obtained is independent of the geometry, the space dimension of the problem, and the precise form of the spatial elliptic operator, like for optimal Schwarz methods. We illustrate our analysis with numerical experiments.

AB - Multi-trace formulations (MTFs) are based on a decomposition of the problem domain into subdomains, and thus domain decomposition solvers are of interest. The fully rigorous mathematical MTF can however be daunting for the non-specialist. The first aim of the present contribution is to provide a gentle introduction to MTFs. We introduce these formulations on a simple model problem using concepts familiar to researchers in domain decomposition. This allows us to get a new understanding of MTFs and a natural block Jacobi iteration, for which we determine optimal relaxation parameters. We then show how iterative multi-trace formulation solvers are related to a well known domain decomposition method called optimal Schwarz method: a method which used Dirichlet to Neumann maps in the transmission condition. We finally show that the insight gained from the simple model problem leads to remarkable identities for Calderón projectors and related operators, and the convergence results and optimal choice of the relaxation parameter we obtained is independent of the geometry, the space dimension of the problem, and the precise form of the spatial elliptic operator, like for optimal Schwarz methods. We illustrate our analysis with numerical experiments.

KW - multi-trace formulations

KW - Calderon projectors

KW - Dirichlet to Neumann operators

KW - optimal Schwarz methods

U2 - 10.1016/j.apnum.2018.07.006

DO - 10.1016/j.apnum.2018.07.006

M3 - Article

VL - 135

SP - 69

EP - 86

JO - Applied Numerical Mathematics

T2 - Applied Numerical Mathematics

JF - Applied Numerical Mathematics

SN - 0168-9274

ER -