Zobrazit minimální záznam

dc.contributor.authorDostál, Zdeněk
dc.contributor.authorHorák, David
dc.contributor.authorStefanica, Dan
dc.date.accessioned2007-01-23T16:16:42Z
dc.date.available2007-01-23T16:16:42Z
dc.date.issued2007
dc.identifier.citationComputer Methods in Applied Mechanics and Engineering. 2007, vol. 196, issue 8, p. 1369-1379.en
dc.identifier.issn0045-7825
dc.identifier.urihttp://hdl.handle.net/10084/59659
dc.language.isoenen
dc.publisherElsevieren
dc.relation.ispartofseriesComputer Methods in Applied Mechanics and Engineeringen
dc.relation.urihttp://dx.doi.org/10.1016/j.cma.2006.03.025en
dc.subjectdomain decompositionen
dc.subjectsemicoercive contact problemen
dc.subjectscalable algorithmen
dc.subjectFETI-DPen
dc.titleA scalable FETI-DP algorithm for a semi-coercive variational inequalityen
dc.typearticleen
dc.identifier.locationNení ve fondu ÚKen
dc.description.abstract-enWe develop an optimal algorithm for the numerical solution of semi-coercive variational inequalities by combining dual-primal FETI algorithms with recent results for bound and equality constrained quadratic programming problems. The discretized version of the model problem, obtained by using the FETI-DP methodology, is reduced by the duality theory of convex optimization to a quadratic programming problem with bound and equality constraints, which is solved by a new algorithm with a known rate of convergence given in terms of the spectral condition number of the quadratic problem. We present convergence bounds that guarantee the scalability of the algorithm. These results are confirmed by numerical experiments.en
dc.identifier.doi10.1016/j.cma.2006.03.025
dc.identifier.wos000242920900003


Soubory tohoto záznamu

SouboryVelikostFormátZobrazit

K tomuto záznamu nejsou připojeny žádné soubory.

Tento záznam se objevuje v následujících kolekcích

Zobrazit minimální záznam