DOI QR코드

DOI QR Code

A DUAL ITERATIVE SUBSTRUCTURING METHOD WITH A SMALL PENALTY PARAMETER

  • Received : 2016.01.26
  • Published : 2017.03.01

Abstract

A dual substructuring method with a penalty term was introduced in the previous works by the authors, which is a variant of the FETI-DP method. The proposed method imposes the continuity not only by using Lagrange multipliers but also by adding a penalty term which consists of a positive penalty parameter ${\eta}$ and a measure of the jump across the interface. Due to the penalty term, the proposed iterative method has a better convergence property than the standard FETI-DP method in the sense that the condition number of the resulting dual problem is bounded by a constant independent of the subdomain size and the mesh size. In this paper, a further study for a dual iterative substructuring method with a penalty term is discussed in terms of its convergence analysis. We provide an improved estimate of the condition number which shows the relationship between the condition number and ${\eta}$ as well as a close spectral connection of the proposed method with the FETI-DP method. As a result, a choice of a moderately small penalty parameter is guaranteed.

Keywords

References

  1. I. Babuska, The finite element method with penalty, Math. Comp. 27 (1973), 221-228. https://doi.org/10.1090/S0025-5718-1973-0351118-5
  2. O. A. Bauchau, Parallel computation approaches for flexible multibody dynamics simulations, J. Franklin Inst. 347 (2010), no. 1, 53-68. https://doi.org/10.1016/j.jfranklin.2009.10.001
  3. P. Bochev and R. B. Lehoucq, On the finite element solution of the pure Neumann problem, SIAM Rev. 47 (2005), no. 1, 50-66. https://doi.org/10.1137/S0036144503426074
  4. E. Burman and P. Zunino, A domain decomposition method based on weighted interior penalties for advection-diffusion-reaction problems, SIAM J. Numer. Anal. 44 (2006), no. 4, 1612-1638. https://doi.org/10.1137/050634736
  5. C. Farhat, M. Lesoinne, and K. Pierson, A scalable dual-primal domain decomposition method, Numer. Linear Algebra Appl. 7 (2000), no. 7-8, 687-714. https://doi.org/10.1002/1099-1506(200010/12)7:7/8<687::AID-NLA219>3.0.CO;2-S
  6. C. Farhat and F.-X. Roux, A method of finite element tearing and interconnecting and its parallel solution algorithm, Internat. J. Numer. Methods Engrg. 32 (1991), 1205-1227. https://doi.org/10.1002/nme.1620320604
  7. R. Glowinski and 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), 224-231, SIAM, Philadelphia, PA, 1990.
  8. G. H. Golub and C. F. Van Loan, Matrix Computations, Johns Hopkins University Press, Baltimore, MD, 1996.
  9. A. Iserles, A First Course in the Numerical Analysis of Differential Equations, Cambridge University Press, Cambridge, 1996.
  10. 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 (2002), no. 1, 159-179. https://doi.org/10.1137/S0036142901388081
  11. J. Kwak, T. Chun, S. Shin, and O. A. Bauchau, Domain decomposition approach to flexible multibody dynamics simulation, Comput. Mech. 53 (2014), no. 1, 147-158. https://doi.org/10.1007/s00466-013-0898-8
  12. C.-O. Lee and E.-H. Park, A dual iterative substructuring method with a penalty term, Numer. Math. 112 (2009), no. 1, 89-113. https://doi.org/10.1007/s00211-008-0202-6
  13. C.-O. Lee and E.-H. Park, A dual iterative substructuring method with a penalty term in three dimensions, Comput. Math. Appl. 64 (2012), no. 9, 2787-2805. https://doi.org/10.1016/j.camwa.2012.04.011
  14. J. Mandel and R. Tezaur, On the convergence of a dual-primal substructuring method, Numer. Math. 88 (2001), no. 3, 543-558. https://doi.org/10.1007/s211-001-8014-1
  15. T. Chacon Rebollo and E. Chacon Vera, A non-overlapping domain decomposition method for the Stokes equations via a penalty term on the interface, C. R. Math. Acad. Sci. Paris 334 (2002), no. 3, 221-226. https://doi.org/10.1016/S1631-073X(02)02249-5
  16. A. Toselli and O. B. Widlund, Domain Decomposition Methods-Algorithms and Theory, Springer-Verlag, Berlin, 2005.