An interior-point algorithm for the minimization arising from 3D contact problems with fiction

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F13%3A33142075" target="_blank" >RIV/61989592:15310/13:33142075 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1080/10556788.2012.684352" target="_blank" >http://dx.doi.org/10.1080/10556788.2012.684352</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1080/10556788.2012.684352" target="_blank" >10.1080/10556788.2012.684352</a>

Result language
angličtina
Original language name
An interior-point algorithm for the minimization arising from 3D contact problems with fiction
Original language description
The paper deals with a variant of the interior-point method for the minimization of strictly quadratic objective function subject to simple bounds and separable quadratic inequality constraints. Such minimizations arise from the finite element approximation of contact problems of linear elasticity with friction in three space dimensions. The main goal of the paper is the convergence analysis of the algorithm and its implementation. The optimal preconditioners for solving ill-conditioned inner linear systems are proposed. Numerical experiments illustrate the computational efficiency for large scale problems.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

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

Similar results(10)