×

A dual iterative substructuring method with a penalty term in three dimensions. (English) Zbl 1268.65155

Summary: The FETI-DP method is one of the most advanced dual substructuring methods, which introduces Lagrange multipliers to enforce the pointwise matching condition on the interface. In our previous work for two dimensional problems, a dual iterative substructuring method was proposed, which is a variant of the FETI-DP method based on the way to deal with the continuity constraint on the interface. The proposed method imposes the continuity not only by the pointwise matching condition on the interface but also by using a penalty term which measures the jump across the interface. In this paper, a dual substructuring method with a penalty term is extended to three dimensional problems. A penalty term with a penalization parameter \(\eta \) is constructed by focusing on the geometric complexity of an interface in three dimensions caused by the coupling among adjacent subdomains. For a large \(\eta\), it is shown that the condition number of the resultant dual problem is bounded by a constant independent of both subdomain size \(H\) and mesh size \(h\). From the implementational viewpoint of the proposed method, the difference from the FETI-DP method is to solve subdomain problems which contain a penalty term with a penalization parameter \(\eta\). To prevent a large penalization parameter from making subdomain problems ill-conditioned, special attention is paid to establish an optimal preconditioner with respect to a penalization parameter \(\eta \). Finally, numerical results are presented.

MSC:

65N30 Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs
65N55 Multigrid methods; domain decomposition for boundary value problems involving PDEs

Software:

MUMPS
Full Text: DOI

References:

[1] Arrow, K. J.; Solow, R. M., Gradient methods for constrained maxima with weakened assumptions, (Arrow, K. J.; Hurwitz, L.; Uzawa, U., Studies in Linear and Nonlinear Programming (1958), Stanford University Press: Stanford University Press Standford, Califonia), 166-176 · Zbl 0091.16002
[2] Fiacco, A. V.; McCormick, G. P., Nonlinear Programming: Sequential Unconstrained Minimization Techniques (1968), Wiley: Wiley New York · Zbl 0193.18805
[3] Hestenes, M. R., Multiplier and gradient methods, J. Optim. Theory Appl., 4, 303-320 (1969) · Zbl 0174.20705
[4] Glowinski, R.; Le Tallec, P., Augmented Lagrangian interpretation of the nonoverlapping Schwarz alternating method, (Third International Symposium on Domain Decomposition Methods for Partial Differential Equations (Houston, TX, 1989) (1990), SIAM: SIAM Philadelphia), 224-231 · Zbl 0706.65100
[5] 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) · Zbl 0758.65075
[6] Farhat, C.; Lesoinne, M.; Pierson, K., A scalable dual-primal domain decomposition method, Numer. Linear Algebra Appl., 7, 687-714 (2000) · Zbl 1051.65119
[7] Le Tallec, P.; Sassi, T., Domain decomposition with nonmatching grids: augmented Lagrangian approach, Math. Comp., 64, 1367-1396 (1995) · Zbl 0849.65087
[8] 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) · Zbl 0944.74071
[9] 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) · Zbl 1173.74399
[10] Lee, C.-O.; Park, E.-H., A dual iterative substructuring method with a penalty term, Numer. Math., 112, 89-113 (2009) · Zbl 1165.65078
[11] Mandel, J.; Tezaur, R., Convergence of a substructuring method with Lagrange multipliers, Numer. Math., 73, 473-487 (1996) · Zbl 0880.65087
[12] Klawonn, A.; Widlund, O. B., FETI and Neumann-Neumann iterative substructuring methods: connections and new results, Comm. Pure Appl. Math., 54, 57-90 (2001) · Zbl 1023.65120
[13] Toselli, A.; Widlund, O. B., Domain Decomposition Methods—Algorithms and Theory (2005), Springer-Verlag: Springer-Verlag Berlin · Zbl 1069.65138
[14] Mandel, J.; Tezaur, R., On the convergence of a dual-primal substructuring method, Numer. Math., 88, 543-558 (2001) · Zbl 1003.65126
[15] Klawonn, A.; Widlund, O. B.; Dryja, M., Dual-primal FETI methods for three-dimensional elliptic problems with heterogeneous coefficients, SIAM J. Numer. Anal., 40, 159-179 (2002) · Zbl 1032.65031
[16] Bochev, P.; Lehoucq, R. B., On the finite element solution of the pure Neumann problem, SIAM Rev., 47, 50-66 (2005) · Zbl 1084.65111
[17] Axelsson, O.; Gustafsson, I., Preconditioning and two-level multigrid methods of arbitrary degree of approximation, Math. Comp., 40, 219-242 (1983) · Zbl 0511.65079
[18] Mandel, J., On block diagonal and Schur complement preconditioning, Numer. Math., 58, 79-93 (1990) · Zbl 0687.65036
[19] Axelsson, O., Iterative Solution Methods (1994), Cambridge University Press: Cambridge University Press New York · Zbl 0795.65014
[20] R.E. Bank, T.F. Dupont, Analysis of a two-level scheme for solving finite element equations, Technical Report CNA-159, Center for Numerical Analysis, University of Texas at Austin, 1980.; R.E. Bank, T.F. Dupont, Analysis of a two-level scheme for solving finite element equations, Technical Report CNA-159, Center for Numerical Analysis, University of Texas at Austin, 1980.
[21] Amestoy, P. R.; Duff, I. S.; L’Excellent, J.-Y., Multifrontal parallel distributed symmetric and unsymmetric solvers, Comput. Methods Appl. Mech. Engrg., 184, 501-520 (2000) · Zbl 0956.65017
[22] Schenk, O.; Gärtner, K.; Fichtner, W., Efficient sparse LU factorization with left-right looking strategy on shared memory multiprocessors, BIT. Numerical Mathematics, 40, 158-176 (1999) · Zbl 0957.65016
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.