Premium
A unified framework for accelerating the convergence of iterative substructuring methods with Lagrange multipliers
Author(s) -
Farhat Charbel,
Chen PoShu,
Risler Franck,
Roux FrancoisXavier
Publication year - 1998
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/(sici)1097-0207(19980530)42:2<257::aid-nme361>3.0.co;2-r
Subject(s) - feti , lagrange multiplier , mortar methods , finite element method , discretization , computer science , mathematical optimization , constraint algorithm , robustness (evolution) , iterative method , mathematics , computational science , domain decomposition methods , structural engineering , mathematical analysis , engineering , biochemistry , chemistry , gene
The FETI algorithms are a family of numerically scalable substructuring methods with Lagrange multipliers that have been designed for solving iteratively large‐scale systems of equations arising from the finite element discretization of structural engineering, solid mechanics, and structural dynamics problems. In this paper, we present a unified framework that simplifies the interpretation of several of the previously presented FETI concepts. This framework has enabled the improvement of the robustness and performance of the transient FETI method, and the design of a new family of coarse operators for iterative substructuring algorithms with Lagrange multipliers. We report on both of these new developments, discuss their impact on the iterative solution of large‐scale finite element systems of equations by the FETI method, and illustrate them with a few static and dynamic structural analyses on an IBM SP2 parallel processor. © 1998 John Wiley & Sons, Ltd.