Premium
A numerically scalable domain decomposition method for the solution of frictionless contact problems
Author(s) -
Dureisseix D.,
Farhat C.
Publication year - 2001
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.140
Subject(s) - feti , domain decomposition methods , lagrange multiplier , mortar methods , scalability , decomposition method (queueing theory) , decomposition , mathematics , domain (mathematical analysis) , mathematical optimization , iterative method , constraint algorithm , computer science , mathematical analysis , algorithm , finite element method , structural engineering , engineering , discrete mathematics , ecology , database , biology
We present a domain decomposition method with Lagrange multipliers for solving iteratively frictionless contact problems. This method, which is based on the FETI method and therefore is named here the FETI‐C method, incorporates a coarse contact system that guides the iterative prediction of the active zone of contact. We demonstrate numerically that this method is numerically scalable with respect to both the problem size and the number of subdomains. Copyright © 2001 John Wiley & Sons, Ltd.