A Scalable FETI-DP Algorithm for a Coercive Variational Inequality
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F05%3A00012363" target="_blank" >RIV/61989100:27240/05:00012363 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
A Scalable FETI-DP Algorithm for a Coercive Variational Inequality
Original language description
We 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 convergencegiven 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.
Czech name
A Scalable FETI-DP Algorithm for a Coercive Variational Inequality
Czech description
We 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 convergencegiven 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.
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/ME%20641" target="_blank" >ME 641: Development of scale allowed solutors for solution of contact problems by elastical and shape optimalization.</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2005
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
IMA Journal Applied Numerical Mathematics
ISSN
0045-7825
e-ISSN
—
Volume of the periodical
54
Issue of the periodical within the volume
3-4
Country of publishing house
GB - UNITED KINGDOM
Number of pages
13
Pages from-to
378-390
UT code for WoS article
—
EID of the result in the Scopus database
—