Incorporation of linear multipoint constraints in substructure based iterative solvers. Part 1: A numerically scalable algorithm

Charbel Farhat, Catherine Lacour, Daniel Rixen

Research output: Contribution to journalArticlepeer-review

46 Scopus citations

Abstract

We consider the iterative solution by a class of substructuring methods of the large-scale systems of equations arising from the finite element discretization of structural models with an arbitrary set of linear multipoint constraints. We present a methodology for generalizing to such problems numerically scalable substructure based iterative solvers, without interfering with their formulations and their well-established local and global preconditioners. We apply this methodology to the FETI method, and show that the resulting algorithm is numerically scalable with respect to both the substructure and problem sizes.

Original languageEnglish
Pages (from-to)997-1016
Number of pages20
JournalInternational Journal for Numerical Methods in Engineering
Volume43
Issue number6
DOIs
StatePublished - 30 Nov 1998
Externally publishedYes

Keywords

  • Domain decomposition
  • Multipoint constraints
  • Numerical scalability

Fingerprint

Dive into the research topics of 'Incorporation of linear multipoint constraints in substructure based iterative solvers. Part 1: A numerically scalable algorithm'. Together they form a unique fingerprint.

Cite this