Show simple item record

dc.contributor.authorDostál, Zdeněk
dc.contributor.authorHorák, David
dc.date.accessioned2006-10-25T11:13:30Z
dc.date.available2006-10-25T11:13:30Z
dc.date.issued2003
dc.identifier.citationMathematics and Computers in Simulation. 2003, vol. 61, issues 3-6, p. 347-357.en
dc.identifier.issn0378-4754
dc.identifier.urihttp://hdl.handle.net/10084/57401
dc.description.abstractThe 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 that are 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 million of nodal variables to give an evidence of both numerical and parallel scalability of the algorithm presented.en
dc.language.isoenen
dc.publisherNorth-Hollanden
dc.relation.ispartofseriesMathematics and Computers in Simulationen
dc.relation.urihttp://dx.doi.org/10.1016/S0378-4754(02)00088-5en
dc.subjectdomain decompositionen
dc.subjectvariational inequalityen
dc.subjectparallel programmingen
dc.titleScalability and FETI based algorithm for large discretized variational inequalitiesen
dc.typearticleen
dc.identifier.locationNení ve fondu ÚKen
dc.identifier.doi10.1016/S0378-4754(02)00088-5
dc.identifier.wos000180706400017


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record