Comparison of Solvers for Contact Problems

Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27740%2F20%3A10247995" target="_blank" >RIV/61989100:27740/20:10247995 - isvavai.cz</a>
Výsledek na webu
<a href="https://aip.scitation.org/doi/abs/10.1063/5.0027222" target="_blank" >https://aip.scitation.org/doi/abs/10.1063/5.0027222</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1063/5.0027222" target="_blank" >10.1063/5.0027222</a>

Jazyk výsledku
angličtina
Název v původním jazyce
Comparison of Solvers for Contact Problems
Popis výsledku v původním jazyce
The paper focuses on the comparison of sequential solvers used for solving quadratic programming problems which have a wide variety of applications including contact modeling. The complex algebraic formulation generated from the contact problems may be reduced in some cases to fairly simple quadratic programming problem using dualization theory and can be effectively solved using different multigrid or domain decomposition based massively parallel solvers. In the paper, selected solvers are applied on benchmark problems and the achieved results are compared.
Název v anglickém jazyce
Comparison of Solvers for Contact Problems
Popis výsledku anglicky
The paper focuses on the comparison of sequential solvers used for solving quadratic programming problems which have a wide variety of applications including contact modeling. The complex algebraic formulation generated from the contact problems may be reduced in some cases to fairly simple quadratic programming problem using dualization theory and can be effectively solved using different multigrid or domain decomposition based massively parallel solvers. In the paper, selected solvers are applied on benchmark problems and the achieved results are compared.

Rok uplatnění
2020
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Podobné výsledky(10)