Duality-based domain decomposition with natural coarse-space for variational inequalities (Q5928303): Difference between revisions
From MaRDI portal
Latest revision as of 15:52, 3 June 2024
scientific article; zbMATH DE number 1582374
Language | Label | Description | Also known as |
---|---|---|---|
English | Duality-based domain decomposition with natural coarse-space for variational inequalities |
scientific article; zbMATH DE number 1582374 |
Statements
Duality-based domain decomposition with natural coarse-space for variational inequalities (English)
0 references
21 October 2001
0 references
Elliptic boundary value problems are solved by duality-based domain decomposition methods. The discretized problem is first turned by the duality theory of convex programming into a quadratic programming problem with bound and equality constraints and the latter is further modified by means of orthogonal projectors to the natural coarse space. The resulting problem is then solved by an augmented Lagrangian type method with an outer loop for the Lagrangian multipliers for the equality constraints and an inner loop for the solution of the bound constrained quadratic programming problem. Optimal convergence rate is achieved and numerical examples indicate high numerial and parallel scalability of the algorithm.
0 references
variational inequalities
0 references
parallel computation
0 references
domain decomposition
0 references
convex programming
0 references
quadratic programming
0 references
Lagrangian multipliers
0 references
convergence
0 references
numerical examples
0 references
0 references
0 references