Abstract
An iterative substructuring method with Lagrange multipliers is considered for second order elliptic problems, which is a variant of the FETI-DP method. The standard FETI-DP formulation is associated with the 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. Computational issues and numerical results are presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Arrow K.J., Solow R.M. (1958) Gradient methods for constrained maxima with weakened assumptions. In: Arrow K.J., Hurwitz L., Uzawa H.(eds) Studies in Linear and Nonlinear Programming. Stanford University Press, Stanford, pp 166–176
Axelsson O. (1994) Iterative Solution Methods. Cambridge University Press, New York
Axelsson O., Gustafsson I. (1983) Preconditioning and two-level multigrid methods of arbitrary degree of approximation. Math. Comp. 40: 219–242
Bavestrello H., Avery P., Farhat C. (2007) 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. Eng. 196: 1347–1368
Bertsekas D.P. (1996) Constrained optimization and Lagrange multiplier methods. Athena Scientific, Belmont
Bramble J.H., Pasciak J.E., Schatz A.H. (1986) The construction of preconditioners for elliptic problems by substructuring. I. Math. Comp. 47: 103–134
Farhat C., Lacour C., Rixen D. (1998) Incorporation of linear multipoint constraints in substructure based iterative solvers. Part I: a numerically scalable algorithm. Int. J. Numer. Methods Eng. 43: 997–1016
Farhat C., Lesoinne M., Pierson K. (2000) A scalable dual-primal domain decomposition method. Numer. Lin. Alg. Appl. 7: 687–714
Farhat C., Mandel J., Roux F.-X. (1994) Optimal convergence properties of the FETI domain decomposition method. Comput. Methods Appl. Mech. Eng. 115: 365–385
Farhat C., Roux F.-X. (1991) A method of finite element tearing and interconnecting and its parallel solution algorithm. Int. J. Numer. Methods Eng. 32: 1205–1227
Farhat C., Roux F.-X. (1994) Implicit parallel processing in structural mechanics. Comput. Mech. Adv. 2: 1–124
Fiacco A.V., McCormick G.P. (1968) Nonlinear Programming: Sequential Unconstrained Minimization Techniques. Wiley, New York
Fortin M., Glowinski R. (1983) Augmented Lagrangian Methods. North-Holland, Amsterdam
Girault V., Raviart P.A. (1986) Finite Element Methods for Navier-Stokes Equations. Springer, Berlin
Glowinski, R., Le Tallec, 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), pp. 224–231. SIAM, Philadelphia (1990)
Gropp W.D., Keyes D.E. (1988) Complexity of parallel implementation of domain decomposition techniques for elliptic partial differential equations. SIAM J. Sci. Stat. Comput. 9: 312–326
Hestenes M.R. (1969) Multiplier and gradient methods. J. Optim. Theory Appl. 4: 303–320
Iserles A. (1996) A First Course in the Numerical Analysis of Differential Equations. Cambridge University Press, Cambridge
Klawonn A., Widlund O.B., Dryja M. (2002) Dual-primal FETI methods for three-dimensional elliptic problems with heterogeneous coefficients. SIAM J. Numer. Anal. 40: 159–179
Mandel J. (1990) On block diagonal and Schur complement preconditioning. Numer. Math. 58: 79–93
Mandel J., Tezaur R. (1996) Convergence of a substructuring method with Lagrange multipliers. Numer. Math. 73: 473–487
Mandel J., Tezaur R. (2001) On the convergence of a dual-primal substructuring method. Numer. Math. 88: 543–558
Meyer A. (2006) Basic approach to parallel finite element computations: the DD data splitting. In: Hoffmann K.H., Meyer A.(eds) Parallel Algorithms and Cluster Computing. Springer, Berlin, pp 23–35
Saad Y., Schultz M.H. (1989) Data communication in parallel architectures. Parallel Comput. 11: 131–150
Le Tallec P., Sassi T. (1995) Domain decomposition with nonmatching grids: augmented Lagrangian approach. Math. Comp. 64: 1367–1396
Toselli A., Widlund O.B. (2005) Domain Decomposition Methods—Algorithms and Theory. Springer, Berlin
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was partially supported by the SRC/ERC program of MOST/KOSEF(R11-2002-103).
Rights and permissions
About this article
Cite this article
Lee, CO., Park, EH. A dual iterative substructuring method with a penalty term. Numer. Math. 112, 89–113 (2009). https://doi.org/10.1007/s00211-008-0202-6
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00211-008-0202-6