A Domain Decomposition Method with Lagrange Multipliers and Inexact Solvers for Linear Elasticity

Authors:
Axel Klawonn;Olof B. Widlund
Affiliations:
-;-
Venue:
SIAM Journal on Scientific Computing
Year:
2000

Citing 0
Cited 10

An iterative substructuring method for coupled fluid-solid acoustic problems

Journal of Computational Physics
FETI and FETI-DP Methods for Spectral and Mortar Spectral Elements: A Performance Comparison

Journal of Scientific Computing
An algebraic theory for primal and dual substructuring methods by constraints

Applied Numerical Mathematics - 6th IMACS International symposium on iterative methods in scientific computing
Parallel FETI algorithms for mortars

Applied Numerical Mathematics - 6th IMACS International symposium on iterative methods in scientific computing
A scalable FETI-DP algorithm with non-penetration mortar conditions on contact interface

Journal of Computational and Applied Mathematics
An algebraic theory for primal and dual substructuring methods by constraints

Applied Numerical Mathematics - 6th IMACS International symposium on iterative methods in scientific computing
Parallel FETI algorithms for mortars

Applied Numerical Mathematics - 6th IMACS International symposium on iterative methods in scientific computing
Parallel finite element simulations of incompressible viscous fluid flow by domain decomposition with Lagrange multipliers

Journal of Computational Physics
Robust BDDC Preconditioners for Reissner-Mindlin Plate Bending Problems and MITC Elements

SIAM Journal on Numerical Analysis
Deflation, Projector Preconditioning, and Balancing in Iterative Substructuring Methods: Connections and New Results

SIAM Journal on Scientific Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

A new domain decomposition method with Lagrange multipliers for elliptic problems is introduced. It is based on a reformulation of the well-known finite element tearing and interconnecting (FETI) method as a saddle point problem with both primal and dual variables as unknowns. The resulting linear system is solved with block-structured preconditioners combined with a suitable Krylov subspace method. This approach allows the use of inexact subdomain solvers for the positive definite subproblems. It is shown that the condition number of the preconditioned saddle point problem is bounded independently of the number of subregions and depends only polylogarithmically on the number of degrees of freedom of individual local subproblems. Numerical results are presented for a plane stress cantilever membrane problem.