FETI and Neumann-Neumann iterative substructuring methods: Connections and new results

Axel Klawonn, Olof B. Widlund

Research output: Contribution to journalArticle

Abstract

The FETI and Neumann-Neumann families of algorithms are among the best known and most severely tested domain decomposition methods for elliptic partial differential equations. They are iterative substructuring methods and have many algorithmic components in common, but there are also differences. The purpose of this paper is to further unify the theory for these two families of methods and to introduce a new family of FETI algorithms. Bounds on the rate of convergence, which are uniform with respect to the coefficients of a family of elliptic problems with heterogeneous coefficients, are established for these new algorithms. The theory for a variant of the Neumann-Neumann algorithm is also redeveloped stressing similarities to that for the FETI methods.

Original languageEnglish (US)
Pages (from-to)57-90
Number of pages34
JournalCommunications on Pure and Applied Mathematics
Volume54
Issue number1
DOIs
StatePublished - Jan 2001

Fingerprint

Iterative Substructuring
Iterative methods
Domain decomposition methods
Domain Decomposition Method
Elliptic Partial Differential Equations
Coefficient
Elliptic Problems
Partial differential equations
Rate of Convergence
Family

ASJC Scopus subject areas

  • Mathematics(all)
  • Applied Mathematics

Cite this

FETI and Neumann-Neumann iterative substructuring methods : Connections and new results. / Klawonn, Axel; Widlund, Olof B.

In: Communications on Pure and Applied Mathematics, Vol. 54, No. 1, 01.2001, p. 57-90.

Research output: Contribution to journalArticle

@article{4f82b8d4bb654f8a9063515e4710ffba,
title = "FETI and Neumann-Neumann iterative substructuring methods: Connections and new results",
abstract = "The FETI and Neumann-Neumann families of algorithms are among the best known and most severely tested domain decomposition methods for elliptic partial differential equations. They are iterative substructuring methods and have many algorithmic components in common, but there are also differences. The purpose of this paper is to further unify the theory for these two families of methods and to introduce a new family of FETI algorithms. Bounds on the rate of convergence, which are uniform with respect to the coefficients of a family of elliptic problems with heterogeneous coefficients, are established for these new algorithms. The theory for a variant of the Neumann-Neumann algorithm is also redeveloped stressing similarities to that for the FETI methods.",
author = "Axel Klawonn and Widlund, {Olof B.}",
year = "2001",
month = "1",
doi = "10.1002/1097-0312(200101)54:1<57::AID-CPA3>3.0.CO;2-D",
language = "English (US)",
volume = "54",
pages = "57--90",
journal = "Communications on Pure and Applied Mathematics",
issn = "0010-3640",
publisher = "Wiley-Liss Inc.",
number = "1",

}

TY - JOUR

T1 - FETI and Neumann-Neumann iterative substructuring methods

T2 - Connections and new results

AU - Klawonn, Axel

AU - Widlund, Olof B.

PY - 2001/1

Y1 - 2001/1

N2 - The FETI and Neumann-Neumann families of algorithms are among the best known and most severely tested domain decomposition methods for elliptic partial differential equations. They are iterative substructuring methods and have many algorithmic components in common, but there are also differences. The purpose of this paper is to further unify the theory for these two families of methods and to introduce a new family of FETI algorithms. Bounds on the rate of convergence, which are uniform with respect to the coefficients of a family of elliptic problems with heterogeneous coefficients, are established for these new algorithms. The theory for a variant of the Neumann-Neumann algorithm is also redeveloped stressing similarities to that for the FETI methods.

AB - The FETI and Neumann-Neumann families of algorithms are among the best known and most severely tested domain decomposition methods for elliptic partial differential equations. They are iterative substructuring methods and have many algorithmic components in common, but there are also differences. The purpose of this paper is to further unify the theory for these two families of methods and to introduce a new family of FETI algorithms. Bounds on the rate of convergence, which are uniform with respect to the coefficients of a family of elliptic problems with heterogeneous coefficients, are established for these new algorithms. The theory for a variant of the Neumann-Neumann algorithm is also redeveloped stressing similarities to that for the FETI methods.

UR - http://www.scopus.com/inward/record.url?scp=0035526706&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035526706&partnerID=8YFLogxK

U2 - 10.1002/1097-0312(200101)54:1<57::AID-CPA3>3.0.CO;2-D

DO - 10.1002/1097-0312(200101)54:1<57::AID-CPA3>3.0.CO;2-D

M3 - Article

AN - SCOPUS:0035526706

VL - 54

SP - 57

EP - 90

JO - Communications on Pure and Applied Mathematics

JF - Communications on Pure and Applied Mathematics

SN - 0010-3640

IS - 1

ER -