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

Result code in 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>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Scalability and FETI for Large Discretized Variational Inequalities and Non-linear Composits
Original language description
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.
Czech name
—
Czech description
—

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

Similar results(10)