An algebraic theory for primal and dual substructuring methods by constraints

  • Authors:

  • Jan Mandel;Clark R. Dohrmann;Radek Tezaur

  • Affiliations:

  • Department of Mathematics, University of Colorado at Denver, Denver, CO 80 217-3364, USA;Structural Dynamics Research Department, Sandia National Laboratories, Albuquerque, NM, USA;Institute for Computational and Mathematical Engineering, Stanford University, Stanford, CA 94305, USA

  • Venue:
  • Applied Numerical Mathematics - 6th IMACS International symposium on iterative methods in scientific computing
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

FETI and BDD are two widely used substructuring methods for the solution of large sparse systems of linear algebraic equations arising from discretization of elliptic boundary value problems. The two most advanced variants of these methods are the FETI-DP and the BDDC methods, whose formulation does not require any information beyond the algebraic system of equations in a substructure form. We formulate the FETI-DP and the BDDC methods in a common framework as methods based on general constraints between the substructures, and provide a simplified algebraic convergence theory. The basic implementation blocks including transfer operators are common to both methods. It is shown that commonly used properties of the transfer operators in fact determine the operators uniquely. Identical algebraic condition number bounds for both methods are given in terms of a single inequality, and, under natural additional assumptions, it is proved that the eigenvalues of the preconditioned problems are the same. The algebraic bounds imply the usual polylogarithmic bounds for finite elements, independent of coefficient jumps between substructures. Computational experiments confirm the theory.