On scalable algorithms for numerical solution of variational inequalities based on FETI and semi-monotonic augmented Lagrangians

Kód výsledku v 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>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

On scalable algorithms for numerical solution of variational inequalities based on FETI and semi-monotonic augmented Lagrangians

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

On scalable algorithms for numerical solution of variational inequalities based on FETI and semi-monotonic augmented Lagrangians

Popis výsledku anglicky

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.

Druh

C - Kapitola v odborné knize

CEP obor

BA - Obecná matematika

OECD FORD obor

—

Projekt

<a href="/cs/project/GA101%2F04%2F1145" target="_blank" >GA101/04/1145: Vývoj a implementace škálovatelných numerických metod pro řešení fyzikálně realistických modelů kontaktních úloh se třením ve 2 a 3D</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2004

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název knihy nebo sborníku

Domain Decomposition Methods in Science and Engineering

ISBN

1439-7358

Počet stran výsledku

7

Strana od-do

487-494

Počet stran knihy

—

Název nakladatele

Springer-Verlag Berlin Heidelberg

Místo vydání

Berlin

Kód UT WoS kapitoly

—