Overlapping schwarz methods with a standard coarse space for almost incompressible linear elasticity

Mingchao Cai, Luca F. Pavarino, Olof B. Widlund

Research output: Contribution to journalArticle

Abstract

Low-order finite element discretizations of the linear elasticity system suffer increasingly from locking effects and ill-conditioning, when the material approaches the incompressible limit, if only the displacement variables are used. Mixed finite elements using both displacement and pressure variables provide a well-known remedy, but they yield larger and indefinite discrete systems for which the design of scalable and efficient iterative solvers is challenging. Two-level overlapping Schwarz preconditioners for the almost incompressible system of linear elasticity, discretized by mixed finite elements with discontinuous pressures, are constructed and analyzed. The preconditioned systems are accelerated either by a GMRES (generalized minimum residual) method applied to the resulting discrete saddle point problem or by a PCG (preconditioned conjugate gradient) method applied to a positive definite, although extremely ill-conditioned, reformulation of the problem obtained by eliminating all pressure variables on the element level. A novel theoretical analysis of the algorithm for the positive definite reformulation is given by extending some earlier results by Dohrmann and Widlund. The main result of the paper is a bound on the condition number of the algorithm which is cubic in the relative overlap and grows logarithmically with the number of elements across individual subdomains but is otherwise independent of the number of subdomains, their diameters and mesh sizes, the incompressibility of the material, and possible discontinuities of the material parameters across the subdomain interfaces. Numerical results in the plane confirm the theory and also indicate that an analogous result should hold for the saddle point formulation, as well as for spectral element discretizations.

Original languageEnglish (US)
Pages (from-to)A811-A830
JournalSIAM Journal on Scientific Computing
Volume37
Issue number2
DOIs
StatePublished - 2015

Fingerprint

Schwarz Methods
Linear Elasticity
Overlapping
Elasticity
Mixed Finite Elements
Reformulation
Positive definite
Incompressible Limit
Indefinite Systems
Spectral Elements
Iterative Solvers
Ill-conditioning
Preconditioned Conjugate Gradient Method
Saddle Point Problems
Conjugate gradient method
Incompressibility
Finite Element Discretization
Locking
Saddlepoint
Condition number

Keywords

  • Almost incompressible linear elasticity
  • Domain decomposition methods
  • Mixed finite and spectral elements
  • Saddle point problems
  • Two-level overlapping Schwarz preconditioners

ASJC Scopus subject areas

  • Applied Mathematics
  • Computational Mathematics

Cite this

Overlapping schwarz methods with a standard coarse space for almost incompressible linear elasticity. / Cai, Mingchao; Pavarino, Luca F.; Widlund, Olof B.

In: SIAM Journal on Scientific Computing, Vol. 37, No. 2, 2015, p. A811-A830.

Research output: Contribution to journalArticle

Cai, Mingchao ; Pavarino, Luca F. ; Widlund, Olof B. / Overlapping schwarz methods with a standard coarse space for almost incompressible linear elasticity. In: SIAM Journal on Scientific Computing. 2015 ; Vol. 37, No. 2. pp. A811-A830.
@article{af4d5a19aa884bcbb4f3e628302c36c1,
title = "Overlapping schwarz methods with a standard coarse space for almost incompressible linear elasticity",
abstract = "Low-order finite element discretizations of the linear elasticity system suffer increasingly from locking effects and ill-conditioning, when the material approaches the incompressible limit, if only the displacement variables are used. Mixed finite elements using both displacement and pressure variables provide a well-known remedy, but they yield larger and indefinite discrete systems for which the design of scalable and efficient iterative solvers is challenging. Two-level overlapping Schwarz preconditioners for the almost incompressible system of linear elasticity, discretized by mixed finite elements with discontinuous pressures, are constructed and analyzed. The preconditioned systems are accelerated either by a GMRES (generalized minimum residual) method applied to the resulting discrete saddle point problem or by a PCG (preconditioned conjugate gradient) method applied to a positive definite, although extremely ill-conditioned, reformulation of the problem obtained by eliminating all pressure variables on the element level. A novel theoretical analysis of the algorithm for the positive definite reformulation is given by extending some earlier results by Dohrmann and Widlund. The main result of the paper is a bound on the condition number of the algorithm which is cubic in the relative overlap and grows logarithmically with the number of elements across individual subdomains but is otherwise independent of the number of subdomains, their diameters and mesh sizes, the incompressibility of the material, and possible discontinuities of the material parameters across the subdomain interfaces. Numerical results in the plane confirm the theory and also indicate that an analogous result should hold for the saddle point formulation, as well as for spectral element discretizations.",
keywords = "Almost incompressible linear elasticity, Domain decomposition methods, Mixed finite and spectral elements, Saddle point problems, Two-level overlapping Schwarz preconditioners",
author = "Mingchao Cai and Pavarino, {Luca F.} and Widlund, {Olof B.}",
year = "2015",
doi = "10.1137/140981861",
language = "English (US)",
volume = "37",
pages = "A811--A830",
journal = "SIAM Journal of Scientific Computing",
issn = "1064-8275",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "2",

}

TY - JOUR

T1 - Overlapping schwarz methods with a standard coarse space for almost incompressible linear elasticity

AU - Cai, Mingchao

AU - Pavarino, Luca F.

AU - Widlund, Olof B.

PY - 2015

Y1 - 2015

N2 - Low-order finite element discretizations of the linear elasticity system suffer increasingly from locking effects and ill-conditioning, when the material approaches the incompressible limit, if only the displacement variables are used. Mixed finite elements using both displacement and pressure variables provide a well-known remedy, but they yield larger and indefinite discrete systems for which the design of scalable and efficient iterative solvers is challenging. Two-level overlapping Schwarz preconditioners for the almost incompressible system of linear elasticity, discretized by mixed finite elements with discontinuous pressures, are constructed and analyzed. The preconditioned systems are accelerated either by a GMRES (generalized minimum residual) method applied to the resulting discrete saddle point problem or by a PCG (preconditioned conjugate gradient) method applied to a positive definite, although extremely ill-conditioned, reformulation of the problem obtained by eliminating all pressure variables on the element level. A novel theoretical analysis of the algorithm for the positive definite reformulation is given by extending some earlier results by Dohrmann and Widlund. The main result of the paper is a bound on the condition number of the algorithm which is cubic in the relative overlap and grows logarithmically with the number of elements across individual subdomains but is otherwise independent of the number of subdomains, their diameters and mesh sizes, the incompressibility of the material, and possible discontinuities of the material parameters across the subdomain interfaces. Numerical results in the plane confirm the theory and also indicate that an analogous result should hold for the saddle point formulation, as well as for spectral element discretizations.

AB - Low-order finite element discretizations of the linear elasticity system suffer increasingly from locking effects and ill-conditioning, when the material approaches the incompressible limit, if only the displacement variables are used. Mixed finite elements using both displacement and pressure variables provide a well-known remedy, but they yield larger and indefinite discrete systems for which the design of scalable and efficient iterative solvers is challenging. Two-level overlapping Schwarz preconditioners for the almost incompressible system of linear elasticity, discretized by mixed finite elements with discontinuous pressures, are constructed and analyzed. The preconditioned systems are accelerated either by a GMRES (generalized minimum residual) method applied to the resulting discrete saddle point problem or by a PCG (preconditioned conjugate gradient) method applied to a positive definite, although extremely ill-conditioned, reformulation of the problem obtained by eliminating all pressure variables on the element level. A novel theoretical analysis of the algorithm for the positive definite reformulation is given by extending some earlier results by Dohrmann and Widlund. The main result of the paper is a bound on the condition number of the algorithm which is cubic in the relative overlap and grows logarithmically with the number of elements across individual subdomains but is otherwise independent of the number of subdomains, their diameters and mesh sizes, the incompressibility of the material, and possible discontinuities of the material parameters across the subdomain interfaces. Numerical results in the plane confirm the theory and also indicate that an analogous result should hold for the saddle point formulation, as well as for spectral element discretizations.

KW - Almost incompressible linear elasticity

KW - Domain decomposition methods

KW - Mixed finite and spectral elements

KW - Saddle point problems

KW - Two-level overlapping Schwarz preconditioners

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

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

U2 - 10.1137/140981861

DO - 10.1137/140981861

M3 - Article

VL - 37

SP - A811-A830

JO - SIAM Journal of Scientific Computing

JF - SIAM Journal of Scientific Computing

SN - 1064-8275

IS - 2

ER -