Summary
An iterative substructuring method with Lagrange multipliers is considered for the second order elliptic problem, which is a variant of the FETI-DP method. The standard FETI-DP formulation is associated with a saddle-point problem which is induced from the minimization problem with a constraint for imposing the continuity across the interface. Starting from the slightly changed saddle-point problem by addition of a penalty term with a positive penalization parameter η, we propose a dual substructuring method which is implemented iteratively by the conjugate gradient method. In spite of the absence of any preconditioners, it is shown that the proposed method is numerically scalable in the sense that for a large value of η, the condition number of the resultant dual problem is bounded by a constant independent of both the subdomain size H and the mesh size h. We discuss computational issues and present numerical results.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bavestrello, H., Avery, P., Farhat, C.: Incorporation of linear multipoint constraints in domain-decomposition-based iterative solvers. Part II: Blending FETI-DP and mortar methods and assembling floating substructures. Comput. Methods Appl. Mech. Engrg., 196:1347–1368, 2007.
Bramble, J.H., Pasciak, J.E., Schatz, A.H.: The construction of preconditioners for elliptic problems by substructuring. I. Math. Comp., 47:103–134, 1986.
Farhat, C., Lacour, C., Rixen, D.: Incorporation of linear multipoint constraints in substructure based iterative solvers. Part I: A numerically scalable algorithm. Internat. J. Numer. Methods Engrg., 43:997–1016, 1998.
Farhat, C., Lesoinne, M., Pierson, K. A scalable dual-primal domain decomposition method. Numer. Linear Algebra Appl., 7:687–714, 2000.
Farhat, C., Mandel, J., Roux, F.-X.: Optimal convergence properties of the FETI domain decomposition method. Comput. Methods Appl. Mech. Engrg., 115: 365–385, 1994.
Farhat, C., Roux, F.-X.: A method of finite element tearing and interconnecting and its parallel solution algorithm. Internat. J. Numer. Methods Engrg., 32: 1205–1227, 1991.
Girault, V., Raviart, P.-A.: Finite element methods for Navier-Stokes equations. Springer, Berlin, 1986.
Glowinski, R., LeTallec, P.: Augmented Lagrangian interpretation of the nonoverlapping Schwarz alternating method. In Third International Symposium on Domain Decomposition Methods for Partial Differential Equations (Houston, TX, 1989), pages 224–231. SIAM, Philadelphia, PA, 1990.
Lee, C.-O., Park, E.-H.: A dual iterative substructuring method with a penalty term. In KAIST DMS Applied Mathematics Research Report Series 07-2. KAIST, 2007.
Mandel, J., Tezaur, R.: Convergence of a substructuring method with Lagrange multipliers. Numer. Math., 73:473–487, 1996.
Le Tallec, P., Sassim, T.: Domain decomposition with nonmatching grids: augmented Lagrangian approach. Math. Comp., 64:1367–1396, 1995.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, CO., Park, EH. (2009). A Domain Decomposition Method Based on Augmented Lagrangian with a Penalty Term. In: Bercovier, M., Gander, M.J., Kornhuber, R., Widlund, O. (eds) Domain Decomposition Methods in Science and Engineering XVIII. Lecture Notes in Computational Science and Engineering, vol 70. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02677-5_38
Download citation
DOI: https://doi.org/10.1007/978-3-642-02677-5_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02676-8
Online ISBN: 978-3-642-02677-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)