Selecting Constraints in Dual-Primal FETI Methods for Elasticity in Three Dimensions

  • Axel Klawonn1
  • Olof B. Widlund
Part of the Lecture Notes in Computational Science and Engineering book series (LNCSE, volume 40)


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.


Domain Decomposition Method Primal Vertex Primal Constraint Edge Average Rigid Body Mode 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. P. G. Ciarlet. Mathematical Elasticity Volume I: Three-Dimensional Elasticity. North-Holland, 1988.Google Scholar
  2. C. Farhat, M. Lesoinne, P. LeTallec, K. Pierson, and D. Rixen. FETI-DP: A dual-primal unified FETI method — part i: A faster alternative to the two-level FETI method. Int. J. Numer. Meth. Engrg., 50:1523–1544, 2001.MathSciNetCrossRefGoogle Scholar
  3. C. Farhat, M. Lesoinne, and K. Pierson. A scalable dual-primal domain decomposition method. Numer. Lin. Alg. Appl., 7:687–714, 2000.MathSciNetCrossRefGoogle Scholar
  4. A. Klawonn, O. Rheinbach, and O. B. Widlund. Some computational results for Dual-Primal FETI methods for three dimensional elliptic problems. In R. Kornhuber, R. Hoppe, D. Keyes, J. Périaux, O. Pironneau, and J. Xu, editors, Domain Decomposition Methods. Springer-Verlag, Lecture Notes in Computational Science and Engineering, 2003. Proceedings of the 15th International Conference on Domain Decomposition Methods, Berlin, July 21–25, 2003.Google Scholar
  5. A. Klawonn and O. Widlund. Dual-Primal FETI methods for linear elasticity. Technical report, Courant Institute of Mathematical Sciences, Department of Computer Science, 2004. In preparation.Google Scholar
  6. A. Klawonn and O. B. Widlund. FETI and Neumann-Neumann iterative substructuring methods: Connections and new results. Comm. Pure Appl. Math., 54:57–90, January 2001.MathSciNetCrossRefGoogle Scholar
  7. A. Klawonn, O. B. Widlund, and M. Dryja. Dual-Primal FETI methods for three-dimensional elliptic problems with heterogeneous coefficients. SIAM J.Numer.Anal., 40, 159–179 2002a.MathSciNetCrossRefGoogle Scholar
  8. A. Klawonn, O. B. Widlund, and M. Dryja. Dual-Primal FETI methods with face constraints. In L. F. Pavarino and A. Toselli, editors, Recent developments in domain decomposition methods, pages 27–40. Springer-Verlag, Lecture Notes in Computational Science and Engineering, Volume 23, 2002b.Google Scholar
  9. J. Mandel and R. Tezaur. On the convergence of a dual-primal substructuring method. Numer. Math., 88:543–558, 2001.MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Axel Klawonn1
    • 1
  • Olof B. Widlund
    • 2
  1. 1.Fachbereich MathematikUniversität Duisburg-EssenEssen
  2. 2.Courant Institute of Mathematical SciencesNew York UniversityNew York

Personalised recommendations