Scalabilities of FETI for Variational Inequalities and Contacet Shape Optimization

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F02%3A00006692" target="_blank" >RIV/61989100:27240/02:00006692 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Scalabilities of FETI for Variational Inequalities and Contacet Shape Optimization

Popis výsledku v původním jazyce

FETI based domain decomposition turned out to be an efficient tool for the solution of a number of engineering problems including those described by variational inequalities. Our basic algorithm [1,2] combines the active set strategy and augmented Lagrangians with application of the FETI algorithm proposed by Farhat and Roux to the solution of auxiliary linear problems. Starting from the discretized variational inequality, the problem is first reduced by duality to a strictly convex quadratic programming problem with simple bounds and possibly some general equality constraints. Then a variant of the augmented Lagrangian method is used for the solution of the resulting problem that is solved by the algorithm generating the approximations for Lagrange multipliers for the equality constraints in the outer loop while solving the auxiliary quadratic programming problems with simple bounds in the inner loop. The algorithm in the inner loop uses projections and adaptive precision control for

Název v anglickém jazyce

Scalabilities of FETI for Variational Inequalities and Contacet Shape Optimization

Popis výsledku anglicky

FETI based domain decomposition turned out to be an efficient tool for the solution of a number of engineering problems including those described by variational inequalities. Our basic algorithm [1,2] combines the active set strategy and augmented Lagrangians with application of the FETI algorithm proposed by Farhat and Roux to the solution of auxiliary linear problems. Starting from the discretized variational inequality, the problem is first reduced by duality to a strictly convex quadratic programming problem with simple bounds and possibly some general equality constraints. Then a variant of the augmented Lagrangian method is used for the solution of the resulting problem that is solved by the algorithm generating the approximations for Lagrange multipliers for the equality constraints in the outer loop while solving the auxiliary quadratic programming problems with simple bounds in the inner loop. The algorithm in the inner loop uses projections and adaptive precision control for

Druh

D - Stať ve sborníku

CEP obor

BA - Obecná matematika

OECD FORD obor

—

Projekt

<a href="/cs/project/GA101%2F01%2F0538" target="_blank" >GA101/01/0538: Vývoj a implementace paralelních algoritmů pro 3D kontaktní úlohy s třením a kontaktní tvarovou optimalizaci</a><br>

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2002

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 statě ve sborníku

Domain Decomposition Methods in Science and Engineering

ISBN

84-95999-07-2

ISSN

—

e-ISSN

—

Počet stran výsledku

10

Strana od-do

361-370

Název nakladatele

CIMNE

Místo vydání

Barcelona

Místo konání akce

Lyon, France

Datum konání akce

1. 1. 2000

Typ akce podle státní příslušnosti

EUR - Evropská akce

Kód UT WoS článku

—