Selecting constraints in dual-primal FETI methods for elasticity in three dimensions

Axel Klawonn, Olof B. Widlund

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

Iterative substructuring methods with Lagrange multipliers for the elliptic system of linear elasticity are considered. The algorithms belong to the family of dual-primal FETI methods which was introduced for linear elasticity problems in the plane by Farhat et al. [2001] and then extended to three dimensional elasticity problems by Farhat et al. [2000]. In dual-primal FETI methods, some continuity constraints on primal displacement variables are required to hold throughout the iterations, as in primal iterative substructuring methods, while most of the constraints are enforced by the use of dual Lagrange multipliers, as in the older one-level FETI algorithms. The primal constraints should be chosen so that the local problems become invertible. They also provide a coarse problem and they should be chosen so that the iterative method converges rapidly. Recently, the family of algorithms for scalar elliptic problems in three dimensions was extended and a theory was provided in Klawonn et al. [2002a,b]. It was shown that the condition number of the dual-primal FETI methods can be bounded polylogarithmically as a function of the dimension of the individual subregion problems and that the bounds can otherwise be made independent of the number of subdomains, the mesh size, and jumps in the coefficients. In the case of the elliptic system of partial differential equations arising from linear elasticity, essential changes in the selection of the primal constraints have to be made in order to obtain the same quality bounds for elasticity problems as in the scalar case. Special emphasis is given to developing robust condition number estimates with bounds which are independent of arbitrarily large jumps of the material coefficients. For benign coefficients, without large jumps, selecting an appropriate set of edge averages as primal constraints are sufficient to obtain good bounds, whereas for arbitrary coefficient distributions, additional primal first order moments are also required.

Original languageEnglish (US)
Title of host publicationDomain Decomposition Methods in Scienceand Engineering
EditorsRalf Kornhuber, Olivier Pironneau, Ronald Hoppe, Jacques P eriaux, Jinchao Xu, Olof Widlund
Pages67-81
Number of pages15
StatePublished - 2005

Publication series

NameLecture Notes in Computational Science and Engineering
Volume40
ISSN (Print)1439-7358

ASJC Scopus subject areas

  • Modeling and Simulation
  • Engineering(all)
  • Discrete Mathematics and Combinatorics
  • Control and Optimization
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Selecting constraints in dual-primal FETI methods for elasticity in three dimensions'. Together they form a unique fingerprint.

  • Cite this

    Klawonn, A., & Widlund, O. B. (2005). Selecting constraints in dual-primal FETI methods for elasticity in three dimensions. In R. Kornhuber, O. Pironneau, R. Hoppe, J. P eriaux, J. Xu, & O. Widlund (Eds.), Domain Decomposition Methods in Scienceand Engineering (pp. 67-81). (Lecture Notes in Computational Science and Engineering; Vol. 40).