On scalable algorithms for numerical solution of variational inequalities based on FETI and semi-monotonic augmented Lagrangians
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F04%3A00010925" target="_blank" >RIV/61989100:27240/04:00010925 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
On scalable algorithms for numerical solution of variational inequalities based on FETI and semi-monotonic augmented Lagrangians
Original language description
Theoretical and experimental results concerning a new FETI based algorithm for numerical solution of variational inequalities are reviewed. A discretized model problem is first reduced by the duality theory of convex optimization to the quadratic programming problem with bound and equality constraints. The latter is then optionally modified by means of orthogonal projectors to the natural coarse space introduced by Farhat and Roux in the framework of their FETI method. The resulting problem is then solved by a new variant of the augmented Lagrangian type algorithm with the inner loop for the solution of bound constrained quadratic programming problems. Recent theoretical results are reported that guarantee scalability of the algorithm. The results areconfirmed by numerical experiments.
Czech name
On scalable algorithms for numerical solution of variational inequalities based on FETI and semi-monotonic augmented Lagrangians
Czech description
Theoretical and experimental results concerning a new FETI based algorithm for numerical solution of variational inequalities are reviewed. A discretized model problem is first reduced by the duality theory of convex optimization to the quadratic programming problem with bound and equality constraints. The latter is then optionally modified by means of orthogonal projectors to the natural coarse space introduced by Farhat and Roux in the framework of their FETI method. The resulting problem is then solved by a new variant of the augmented Lagrangian type algorithm with the inner loop for the solution of bound constrained quadratic programming problems. Recent theoretical results are reported that guarantee scalability of the algorithm. The results areconfirmed by numerical experiments.
Classification
Type
C - Chapter in a specialist book
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA101%2F04%2F1145" target="_blank" >GA101/04/1145: Development and implementation of scalable numerical methods for solving physically realistic models of contact problems with friction in 2D and 3D</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2004
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Book/collection name
Domain Decomposition Methods in Science and Engineering
ISBN
1439-7358
Number of pages of the result
7
Pages from-to
487-494
Number of pages of the book
—
Publisher name
Springer-Verlag Berlin Heidelberg
Place of publication
Berlin
UT code for WoS chapter
—