BREAKING NEWS
Cloud Server Hosting For Online Businesses
Inexpensive SEO Services
Benefits of Wanting to play Free Online Slot machines
FETI-DP

Summary

The FETI-DP method is a domain decomposition method[1] that enforces equality of the solution at subdomain interfaces by Lagrange multipliers except at subdomain corners, which remain primal variables. The first mathematical analysis of the method was provided by Mandel and Tezaur.[2] The method was further improved by enforcing the equality of averages across the edges or faces on subdomain interfaces[3][4] which is important for parallel scalability for 3D problems. FETI-DP is a simplification and a better performing version of FETI. The eigenvalues of FETI-DP are same as those of BDDC, except for the eigenvalue equal to one, and so the performance of FETI-DP and BDDC is essentially same.[5]

FETI-DP methods are very suitable for high performance parallel computing. A structural simulation using a FETI-DP algorithm and running on 3783 processors of the ASCI White supercomputer was awarded a Gordon Bell prize in 2002.[6] A recent FETI-DP method has scaled to more than 65000 processor cores of the JUGENE supercomputer solving a model problem.[7]

See also edit

References edit

  1. ^ C. Farhat, M. Lesoinne, P. LeTallec, K. Pierson, and D. Rixen, FETI-DP: a dual-primal unified FETI method. I. A faster alternative to the two-level FETI method, Internat. J. Numer. Methods Engrg., 50 (2001), pp. 1523--1544.
  2. ^ J. Mandel and R. Tezaur, On the convergence of a dual-primal substructuring method, Numerische Mathematik, 88 (2001), pp. 543--558.
  3. ^ C. Farhat, M. Lesoinne, and K. Pierson, A scalable dual-primal domain decomposition method, Numer. Linear Algebra Appl., 7 (2000), pp. 687--714. Preconditioning techniques for large sparse matrix problems in industrial applications (Minneapolis, MN, 1999).
  4. ^ 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), pp. 159--179.
  5. ^ J. Mandel, C. R. Dohrmann, and R. Tezaur, An algebraic theory for primal and dual substructuring methods by constraints, Appl. Numer. Math., 54 (2005), pp. 167--193.
  6. ^ Manoj Bhardwaj, Kendall H. Pierson, Garth Reese, Tim Walsh, David Day, Ken Alvin, James Peery, Charbel Farhat, and Michel Lesoinne. Salinas: A scalable software for high performance structural and mechanics simulation. In ACM/IEEE Proceedings of SC02: High Performance Networking and Computing. Gordon Bell Award, pages 1–19, 2002.
  7. ^ Klawonn, A.; Rheinbach, O. (2010), "Highly scalable parallel domain decomposition methods with an application to biomechanics", Journal of Applied Mathematics and Mechanics, 90 (1): 5–32, Bibcode:2010ZaMM...90....5K, doi:10.1002/zamm.200900329, S2CID 121609186.