A DUAL ITERATIVE SUBSTRUCTURING METHOD WITH A SMALL PENALTY PARAMETER
0
조회
0
다운로드
2
인용
0
참고문헌
키워드
초록
A dual substructuring method with a penalty term was introduced in the previous works by the authors, which is a variant of the \fetidp \ 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 \fetidp \ 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 \fetidp \ method. As a result, a choice of a moderately small penalty parameter is guaranteed.
Abstract
A dual substructuring method with a penalty term was introduced in the previous works by the authors, which is a variant of the \fetidp \ 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 \fetidp \ 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 \fetidp \ method. As a result, a choice of a moderately small penalty parameter is guaranteed.
참고문헌 (16)
- I. Babuska, "The finite element method with penalty", Math. Comp, 27, pp.221~228 (1973)
- O. A. Bauchau, "Parallel computation approaches for flexible multibody dynamics simu-lations", J. Franklin Inst, 347(1), pp.53~68 (2010)
- P. Bochev, "On the finite element solution of the pure Neumann problem", SIAM Rev, 47(1), pp.50~66 (2005)
- E. Burman, "A domain decomposition method based on weighted interior penalties for advection-diffusion-reaction problems", SIAM J. Numer. Anal, 44(4), pp.1612~1638 (2006)
- C. Farhat, "A scalable dual-primal domain decomposition method", Numer. Linear Algebra Appl, 7(7-8), pp.687~714 (2000)
- C. Farhat, "A method of finite element tearing and interconnecting and its parallel solution algorithm", Internat. J. Numer. Methods Engrg, 32, pp.1205~1227 (1991)
- R. Glowinski, "Augmented Lagrangian interpretation of the nonover-lapping Schwarz alternating method", Third International Symposium on Domain De-composition Methods for Partial Differential Equations, pp.224~231 (1990), SIAM
- G. H. Golub, "Matrix Computations" (1996), Johns Hopkins University Press
- A. Iserles, "A First Course in the Numerical Analysis of Differential Equations" (1996), Cam-bridge University Press
- A. Klawonn, "Dual-primal FETI methods for three-dimensional elliptic problems with heterogeneous coefficients", SIAM J. Numer. Anal, 40(1), pp.159~179 (2002)
- J. Kwak, "Domain decomposition approach to flexible multibody dynamics simulation", Comput. Mech, 53(1), pp.147~158 (2014)
- C.-O. Lee, "A dual iterative substructuring method with a penalty term", Numer. Math, 112(1), pp.89~113 (2009)
- C.-O. Lee, "A dual iterative substructuring method with a penalty term in three dimensions", Comput. Math. Appl, 64(9), pp.2787~2805 (2012)
- J. Mandel, "On the convergence of a dual-primal substructuring method", Numer. Math, 88(3), pp.543~558 (2001)
- T. Chacon Rebollo, "A non-overlapping domain decomposition method for the Stokes equations via a penalty term on the interface", C. R. Math. Acad. Sci. Paris, 334(3), pp.221~226 (2002)
- A. Toselli, "Domain Decomposition Methods–Algorithms and Theory" (2005), Springer-Verlag