MINISYMPOSIUM 7: FETI and Neumann-Neumann Methods with Primal Constraints

  • Axel Klawonn
  • Kendall Pierson
Conference paper
Part of the Lecture Notes in Computational Science and Engineering book series (LNCSE, volume 55)


FETI and Neumann-Neumann iterative substructuring algorithms are among the best known and most severely tested domain decomposition methods. Most of the recent developments are on methods with primal constraints, namely dual-primal FETI and balancing domain decomposition with constraints (BDDC) algorithms. In this minisymposium, we bring together active researchers in the field of dual-primal FETI and BDDC algorithms coming from the fields of numerical analysis, scienti fic computing and computational mechanics. The talks will be on new algorithmic developments and new theoretical results as well as on large-scale computational applications.

Copyright information

© Springer 2007

Authors and Affiliations

  • Axel Klawonn
    • 1
  • Kendall Pierson
    • 2
  1. 1.University of Duisburg-EssenGermany
  2. 2.Sandia National LaboratoriesCaliforniaUSA

Personalised recommendations