Scalability and FETI for Large Discretized Variational Inequalities and Non-linear Composits

Kód výsledku v IS VaVaI

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

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Scalability and FETI for Large Discretized Variational Inequalities and Non-linear Composits

Popis výsledku v původním jazyce

The point of this paper is to review recent theoretical and experimental results related to scalability of the FETI based domain decomposition algorithm that was proposed recently by Dostál, Friedlander, Santos and Gomes for numerical solution of discretized variational inequalities. After briefly describing the basic algorithm with a "natural coarse grid" and its implementation, we review theoretical results that indicate a kind of optimality of the algorithm, namely that the number of iterations thatare necessary to complete some parts of the algorithm is bounded independently of the discretization parameter. Then we give some results of numerical experiments with parallel solution of a model problem discretized by up to more than eight milion of nodal variables to give an evidence of both numerical and parallel scalalbility of the algorithm presented.

Název v anglickém jazyce

Scalability and FETI for Large Discretized Variational Inequalities and Non-linear Composits

Popis výsledku anglicky

The point of this paper is to review recent theoretical and experimental results related to scalability of the FETI based domain decomposition algorithm that was proposed recently by Dostál, Friedlander, Santos and Gomes for numerical solution of discretized variational inequalities. After briefly describing the basic algorithm with a "natural coarse grid" and its implementation, we review theoretical results that indicate a kind of optimality of the algorithm, namely that the number of iterations thatare necessary to complete some parts of the algorithm is bounded independently of the discretization parameter. Then we give some results of numerical experiments with parallel solution of a model problem discretized by up to more than eight milion of nodal variables to give an evidence of both numerical and parallel scalalbility of the algorithm presented.

Druh

D - Stať ve sborníku

CEP obor

BA - Obecná matematika

OECD FORD obor

—

Projekt

—

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

Software and Algorithms of Numerical Mathematics

ISBN

80-7082-898-6

ISSN

—

e-ISSN

—

Počet stran výsledku

14

Strana od-do

73-86

Název nakladatele

Jednota českých matematiků a fyziků

Místo vydání

Praha

Místo konání akce

Kvilda

Datum konání akce

1. 1. 2002

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

CST - Celostátní akce

Kód UT WoS článku

—