Preconditioned iteration for saddle-point systems with bound constraints arising in contact problems

Maliki, A. El; Fortin, M.; Deteix, Jean; Fortin, A.

doi:10.1016/j.cma.2012.10.008

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2019

2024

Publication Types

Select...

Article2

Other1

Book1

Relationship

Self Cite0

Independent4

Authors

Journals

Cited by 4 publications

(1 citation statement)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Solving saddle point problems with parallel algorithms is very important for many branches of scientific computing: fluid (see e.g. [13]) and solid mechanics, computational electromagnetism, inverse problem and optimization.…”

Section: Introductionmentioning

confidence: 99%

A GenEO Domain Decomposition method for Saddle Point problems

Nataf,

Tournier

2019

Preprint

View full text Add to dashboard Cite

We introduce an adaptive domain decomposition (DD) method for solving saddle point problems defined as a block two by two matrix. The algorithm does not require any knowledge of the constrained space. We assume that all sub matrices are sparse and that the diagonal blocks are the sum of positive semi definite matrices. The latter assumption enables the design of adaptive coarse space for DD methods, see [5].

show abstract

Section: Introductionmentioning

confidence: 99%