Two domain decomposition methods for auxiliary linear problems of a multibody elliptic variational inequality (Q2847716)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Two domain decomposition methods for auxiliary linear problems of a multibody elliptic variational inequality |
scientific article; zbMATH DE number 6207525
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two domain decomposition methods for auxiliary linear problems of a multibody elliptic variational inequality |
scientific article; zbMATH DE number 6207525 |
Statements
11 September 2013
0 references
domain decomposition
0 references
one-level finite element tearing and interconnecting
0 references
dual-primal finite element tearing and interconnecting
0 references
balanced domain decomposition by constraints
0 references
elliptic variational inequalities
0 references
active set method
0 references
dual-primal method
0 references
condition number
0 references
numerical result
0 references
Two domain decomposition methods for auxiliary linear problems of a multibody elliptic variational inequality (English)
0 references
Elliptic variational inequalities with multiple bodies in two dimensions are considered. It is assumed that an active set method is used to handle the nonlinearity of the inequality constraint, which results in auxiliary linear problems. For solving such linear problems, two domain decomposition methods called the finite element tearing and interconnecting (FETI-FETI) and hybrid methods, are studied. Bodies are decomposed into several subdomains in both methods. The FETI-FETI method combines the one-level FETI and the dual-primal FETI (FETI-DP) methods. A proof that this combined method has a condition number that depends linearly on the number of subdomains across each body and polylogarithmically on the number of elements across each subdomain, is given. The numerical results suggest that this is the best possible bound. The hybrid method combines the one-level FETI and the balanced domain decomposition by constraints (BDDC) methods; it is proved that the condition number of this method has two polylogarithmic factors depending on the number of elements across each subdomain and across each body. Numerical results confirming this theoretical finding are presented, too.
0 references