Some computational results for dual-primal FETI methods for elliptic problems in 3D

Axel Klawonn, Oliver Rheinbach, Olof B. Widlund

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

Iterative substructuring methods with Lagrange multipliers for elliptic problems are considered. The algorithms belong to the family of dual-primal FETI methods which were introduced for linear elasticity problems in the plane by Farhat et al. [2001] and were later extended to three dimensional elasticity problems by Farhat et al. [2000]. Recently, the family of algorithms for scalar diffusion problems was extended to three dimensions and successfully analyzed by Klawonn et al. [2002a,b]. It was shown that the condition number of these dual-primal FETI algorithms can be bounded polylogarithmically as a function of the dimension of the individual subregion problems and that the bounds are otherwise independent of the number of subdomains, the mesh size, and jumps in the diffusion coefficients. In this article, numerical results for some of these algorithms are presented and their relation to the theoretical bounds is studied. The algorithms have been implemented in PETSc, see Balay et al. [2001], and their parallel scalability is analyzed.

Original languageEnglish (US)
Title of host publicationDomain Decomposition Methods in Scienceand Engineering
PublisherSpringer Verlag
Pages361-368
Number of pages8
ISBN (Print)3540225234, 9783540225232
DOIs
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 'Some computational results for dual-primal FETI methods for elliptic problems in 3D'. Together they form a unique fingerprint.

Cite this