A Domain Decomposition Method Based on Augmented Lagrangian with an Optimized Penalty Parameter

  • Chang-Ock Lee
  • Eun-Hee Park
Conference paper
Part of the Lecture Notes in Computational Science and Engineering book series (LNCSE, volume 104)


A non-overlapping domain decomposition method based on augmented Lagrangian with a penalty term was introduced in the previous works by the authors [6, 7], which is a variant of the FETI-DP method. In this paper we present a further study focusing on the case of small penalty parameters in terms of condition number estimate and practical efficiency. The full analysis of the proposed method can be found in [8].



The work of the first author was supported by NRF-2011-0015399. The second author was supported in part by Korea Research Council of Fundamental Science and Technology (KRCF) research fellowship for young scientists.


  1. 1.
    I. Babuška, The finite element method with penalty. Math. Comput. 27, 221–228 (1973)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    E. Burman, P. Zunino, A domain decomposition method based on weighted interior penalties for advection-diffusion-reaction problems. SIAM J. Numer. Anal. 44, 1612–1638 (2006)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    C. Farhat, F.-X. Roux, A method of finite element tearing and interconnecting and its parallel solution algorithm. Int. J. Numer. Methods Eng. 32, 1205–1227 (1991)CrossRefMATHGoogle Scholar
  4. 4.
    C. Farhat, M. Lesoinne, K. Pierson, A scalable dual-primal domain decomposition method. Numer. Linear Algebra Appl. 7, 687–714 (2000)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    R. Glowinski, P. Le Tallec, Augmented Lagrangian interpretation of the nonoverlapping Schwarz alternating method, in Third International Symposium on Domain Decomposition Methods for Partial Differential Equations (Houston, TX, 1989) (SIAM, Philadelphia, 1990), pp. 224–231Google Scholar
  6. 6.
    C.-O. Lee, E.-H. Park, A dual iterative substructuring method with a penalty term. Numer. Math. 112, 89–113 (2009)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    C.-O. Lee, E.-H. Park, A dual iterative substructuring method with a penalty term in three dimensions. Comput. Math. Appl. 64, 2787–2805 (2012)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    C.-O. Lee, E.-H. Park, A dual iterative substructuring method with a small penalty parameter. Submitted (2013)Google Scholar
  9. 9.
    J. Mandel, R. Tezaur, On the convergence of a dual-primal substructuring method. Numer. Math. 88, 543–558 (2001)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.KAISTDaejeonSouth Korea
  2. 2.Kangwon National UniversityGangwon-doSouth Korea

Personalised recommendations