An iterative substructuring algorithm for two-dimensional problems in H(curl)

Clark R. Dohrmann, Olof B. Widlund

Research output: Contribution to journalArticle

Abstract

A domain decomposition algorithm, similar to classical iterative substructuring algorithms, is presented for two-dimensional problems in the space H0(curl; ω). It is defined in terms of a coarse space and local subspaces associated with individual edges of the subdomains into which the domain of the problem has been subdivided. The algorithm differs from others in three basic respects. First, it can be implemented in an algebraic manner that does not require access to individual subdomain matrices or a coarse discretization of the domain; this is in contrast to algorithms of the BDDC, FETI-DP, and classical two-level overlapping Schwarz families. Second, favorable condition number bounds can be established over a broader range of subdomain material properties than in previous studies. Third, we are able to develop theory for quite irregular subdomains and bounds for the condition number of our preconditioned conjugate gradient algorithm, which depend only on a few geometric parameters. The coarse space for the algorithm is based on simple energy minimization concepts, and its dimension equals the number of subdomain edges. Numerical results are presented which confirm the theory and demonstrate the usefulness of the algorithm for a variety of mesh decompositions and distributions of material properties.

Original languageEnglish (US)
Pages (from-to)1004-1028
Number of pages25
JournalSIAM Journal on Numerical Analysis
Volume50
Issue number3
DOIs
StatePublished - 2012

Fingerprint

Iterative Substructuring
Curl
Condition number
Material Properties
FETI-DP
Preconditioned Conjugate Gradient
Conjugate Gradient Algorithm
Materials properties
Energy Minimization
Decomposition Algorithm
Domain Decomposition
Decomposition
Overlapping
Irregular
Discretization
Subspace
Mesh
Decompose
Numerical Results
Range of data

Keywords

  • Discontinuous coefficients
  • Domain decomposition
  • H(curl)
  • Irregular subdomain boundaries
  • Iterative substructuring
  • Maxwell's equations
  • Preconditioners

ASJC Scopus subject areas

  • Numerical Analysis

Cite this

An iterative substructuring algorithm for two-dimensional problems in H(curl). / Dohrmann, Clark R.; Widlund, Olof B.

In: SIAM Journal on Numerical Analysis, Vol. 50, No. 3, 2012, p. 1004-1028.

Research output: Contribution to journalArticle

Dohrmann, Clark R. ; Widlund, Olof B. / An iterative substructuring algorithm for two-dimensional problems in H(curl). In: SIAM Journal on Numerical Analysis. 2012 ; Vol. 50, No. 3. pp. 1004-1028.
@article{fbfcd02612fc46fab166be000f8bb90e,
title = "An iterative substructuring algorithm for two-dimensional problems in H(curl)",
abstract = "A domain decomposition algorithm, similar to classical iterative substructuring algorithms, is presented for two-dimensional problems in the space H0(curl; ω). It is defined in terms of a coarse space and local subspaces associated with individual edges of the subdomains into which the domain of the problem has been subdivided. The algorithm differs from others in three basic respects. First, it can be implemented in an algebraic manner that does not require access to individual subdomain matrices or a coarse discretization of the domain; this is in contrast to algorithms of the BDDC, FETI-DP, and classical two-level overlapping Schwarz families. Second, favorable condition number bounds can be established over a broader range of subdomain material properties than in previous studies. Third, we are able to develop theory for quite irregular subdomains and bounds for the condition number of our preconditioned conjugate gradient algorithm, which depend only on a few geometric parameters. The coarse space for the algorithm is based on simple energy minimization concepts, and its dimension equals the number of subdomain edges. Numerical results are presented which confirm the theory and demonstrate the usefulness of the algorithm for a variety of mesh decompositions and distributions of material properties.",
keywords = "Discontinuous coefficients, Domain decomposition, H(curl), Irregular subdomain boundaries, Iterative substructuring, Maxwell's equations, Preconditioners",
author = "Dohrmann, {Clark R.} and Widlund, {Olof B.}",
year = "2012",
doi = "10.1137/100818145",
language = "English (US)",
volume = "50",
pages = "1004--1028",
journal = "SIAM Journal on Numerical Analysis",
issn = "0036-1429",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "3",

}

TY - JOUR

T1 - An iterative substructuring algorithm for two-dimensional problems in H(curl)

AU - Dohrmann, Clark R.

AU - Widlund, Olof B.

PY - 2012

Y1 - 2012

N2 - A domain decomposition algorithm, similar to classical iterative substructuring algorithms, is presented for two-dimensional problems in the space H0(curl; ω). It is defined in terms of a coarse space and local subspaces associated with individual edges of the subdomains into which the domain of the problem has been subdivided. The algorithm differs from others in three basic respects. First, it can be implemented in an algebraic manner that does not require access to individual subdomain matrices or a coarse discretization of the domain; this is in contrast to algorithms of the BDDC, FETI-DP, and classical two-level overlapping Schwarz families. Second, favorable condition number bounds can be established over a broader range of subdomain material properties than in previous studies. Third, we are able to develop theory for quite irregular subdomains and bounds for the condition number of our preconditioned conjugate gradient algorithm, which depend only on a few geometric parameters. The coarse space for the algorithm is based on simple energy minimization concepts, and its dimension equals the number of subdomain edges. Numerical results are presented which confirm the theory and demonstrate the usefulness of the algorithm for a variety of mesh decompositions and distributions of material properties.

AB - A domain decomposition algorithm, similar to classical iterative substructuring algorithms, is presented for two-dimensional problems in the space H0(curl; ω). It is defined in terms of a coarse space and local subspaces associated with individual edges of the subdomains into which the domain of the problem has been subdivided. The algorithm differs from others in three basic respects. First, it can be implemented in an algebraic manner that does not require access to individual subdomain matrices or a coarse discretization of the domain; this is in contrast to algorithms of the BDDC, FETI-DP, and classical two-level overlapping Schwarz families. Second, favorable condition number bounds can be established over a broader range of subdomain material properties than in previous studies. Third, we are able to develop theory for quite irregular subdomains and bounds for the condition number of our preconditioned conjugate gradient algorithm, which depend only on a few geometric parameters. The coarse space for the algorithm is based on simple energy minimization concepts, and its dimension equals the number of subdomain edges. Numerical results are presented which confirm the theory and demonstrate the usefulness of the algorithm for a variety of mesh decompositions and distributions of material properties.

KW - Discontinuous coefficients

KW - Domain decomposition

KW - H(curl)

KW - Irregular subdomain boundaries

KW - Iterative substructuring

KW - Maxwell's equations

KW - Preconditioners

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

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

U2 - 10.1137/100818145

DO - 10.1137/100818145

M3 - Article

AN - SCOPUS:84865587677

VL - 50

SP - 1004

EP - 1028

JO - SIAM Journal on Numerical Analysis

JF - SIAM Journal on Numerical Analysis

SN - 0036-1429

IS - 3

ER -