Show simple item record

dc.contributor.authorDostál, Zdeněk
dc.contributor.authorHorák, David
dc.contributor.authorStefanica, Dan
dc.date.accessioned2006-09-26T09:11:17Z
dc.date.available2006-09-26T09:11:17Z
dc.date.issued2005
dc.identifier.citationApplied numerical mathematics. 2005, vol. 54, issues 3-4, p. 378-390.en
dc.identifier.issn0168-9274
dc.identifier.urihttp://hdl.handle.net/10084/56564
dc.description.abstractWe develop an optimal algorithm for the numerical solution of coercive variational inequalities, by combining FETI algorithms of dual-primal type with recent results for bound 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 constraints. The resulting problem 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.language.isoenen
dc.publisherNorth-Hollanden
dc.relation.ispartofseriesApplied numerical mathematicsen
dc.relation.urihttp://dx.doi.org/10.1016/j.apnum.2004.09.009en
dc.subjectdomain decomposition methoden
dc.subjectprimal substructuring methoden
dc.subjectnatural coarse-spaceen
dc.subjectcontact problemsen
dc.subjectlagrange multipliersen
dc.subjectconvergenceen
dc.subjectprojectionsen
dc.subjectsystemsen
dc.titleA scalable FETI-DP algorithm for a coercive variational inequalityen
dc.typearticleen
dc.identifier.locationNení ve fondu ÚKen
dc.identifier.doi10.1016/j.apnum.2004.09.009
dc.identifier.wos000230317100006


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