Scalable TFETI based algorithm with adaptive augmentation for contact problems with variationally consistent discretization of contact conditions

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F19%3A10242644" target="_blank" >RIV/61989100:27240/19:10242644 - isvavai.cz</a>
Alternative codes found
RIV/61989100:27740/19:10242644
Result on the web
<a href="https://www.sciencedirect.com/science/article/pii/S0168874X18306978?via%3Dihub" target="_blank" >https://www.sciencedirect.com/science/article/pii/S0168874X18306978?via%3Dihub</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.finel.2019.01.002" target="_blank" >10.1016/j.finel.2019.01.002</a>

Result language
angličtina
Original language name
Scalable TFETI based algorithm with adaptive augmentation for contact problems with variationally consistent discretization of contact conditions
Original language description
A variationally consistent approximation of contact conditions by means of biorthogonal mortars was introduced by Wohlmuth as a powerful theoretically supported tool for the discretization of contact problems. This approach is especially useful when a potential contact interface is large and curved or when nonmatching grids are applied, but its effective implementation into FETI based algorithms is not straightforward due to the ill conditioning of related inequality constraints. In this paper we review the mortar discretization and theoretical results on scalability of the FETI based algorithm and show that the recently proposed adaptive augmentation can overcome the difficulties caused by the ill-conditioning of constraints. We demonstrate the (weak) numerical scalability by numerical experiments and present the results for a difficult real world problem discretized by mortars that show the power of the new algorithm - the number of iterations required to the solution of this problem discretized by mortars is just one third of that required by the original algorithm for the same problem discretized by node-to-node constraints. (C) 2019 Elsevier B.V.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10102 - Applied mathematics

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)