New implementations for the simultaneous-FETI method. (English) Zbl 07865232
Summary: In this work, we present alternative implementations for the Simultaneous-FETI (S-FETI) method. Developed in recent years, this method has shown to be very robust for highly heterogeneous problems. However, the memory cost in S-FETI is greatly increased and can be a limitation to its use. Our main objective is to reduce this memory usage without losing significant time performance. The algorithm is based on the exploitation of the sparsity patterns found on the block of search directions, allowing to store less vectors per iteration in comparison to a full storage scheme. In addition, different variations for the S-FETI method are also proposed, including a new treatment for the possible dependencies between directions and the use of the Lumped preconditioner. Several tests are performed in order to establish the impact of the modifications presented in this work compared to the original S-FETI algorithm.
{© 2019 John Wiley & Sons, Ltd.}
{© 2019 John Wiley & Sons, Ltd.}
MSC:
| 65Nxx | Numerical methods for partial differential equations, boundary value problems |
| 74Sxx | Numerical and other methods in solid mechanics |
| 65Fxx | Numerical linear algebra |
References:
| [1] | FarhatC, LesoinneM, PiersonK. A scalable dual‐primal domain decomposition method. Numer Linear Algebra Appl. 2000;7(7‐8):687‐714. · Zbl 1051.65119 |
| [2] | de La BourdonnayeA, FarhatC, MacedoA, MagoulesF, RouxFX. A non‐overlapping domain decomposition method for the exterior Helmholtz problem. Contemporary Math. 1998;218:42‐66. · Zbl 0909.65103 |
| [3] | DureisseixD, FarhatC. A numerically scalable domain decomposition method for the solution of frictionless contact problems. Int J Numer Methods Eng. 2001;50(12):2643‐2666. · Zbl 0988.74064 |
| [4] | SpillaneN, RixenD. Automatic spectral coarse spaces for robust finite element tearing and interconnecting and balanced domain decomposition algorithms. Int J Numer Methods Eng. 2013;95(11):953‐990. · Zbl 1352.65553 |
| [5] | FarhatC, RouxFX. A method of finite element tearing and interconnecting and its parallel solution algorithm. Int J Numer Methods Eng. 1991;32(6):1205‐1227. · Zbl 0758.65075 |
| [6] | MandelJ. Balancing domain decomposition. Commun Numer Methods Eng. 1993;9(3):233‐241. · Zbl 0796.65126 |
| [7] | FarhatC, ChenPS, MandelJ, RouxFX. The two‐level FETI method Part II: extension to shell problems, parallel implementation and performance results. Comput Methods Appl Mech Eng. 1998;155(1):153‐179. · Zbl 1040.74513 |
| [8] | RixenDJ. Substructuring and Dual Methods in Structural Analysis [PhD thesis]. Berlin, Belgium: Faculté des Sciences Appliquées, Université de Liège; 1997. |
| [9] | GosseletP, RixenDJ, RouxFX, SpillaneN. Simultaneous FETI and block FETI: robust domain decomposition with multiple search directions. Int J Numer Methods Eng. 2015;104(10):905‐927. · Zbl 1352.65625 |
| [10] | RixenDJ, FarhatC. A simple and efficient extension of a class of substructure based preconditioners to heterogeneous structural mechanics problems. Int J Numer Methods Eng. 1999;44(4):489‐516. · Zbl 0940.74067 |
| [11] | HammarlingS, HighamNJ, LucasC. LAPACK‐style codes for pivoted Cholesky and QR updating. In: KågströmB (ed.), ElmrothE (ed.), DongarraJ (ed.), WaśniewskiJ (ed.), eds. Applied Parallel Computing: State of the Art in Scientific Computing. Berlin, Germany: Springer; 2007:137‐146. |
| [12] | DongarraJ, Du CrozJ, DuffI, HammarlingS. A proposal for a set of level 3 basic linear algebra subprograms. SIGNUM Newsl. 1987;22(3):2‐14. |
| [13] | FarhatC, RouxFX, International Association for Computational Mechanics. Implicit parallel processing in structural mechanics. Comput Mech Adv. 1994;2. · Zbl 0805.73062 |
| [14] | HighamNJ. Accuracy and Stability of Numerical Algorithms. 2nd ed. Philadelphia, PA: Society for Industrial and Applied Mathematics; 2002. · Zbl 1011.65010 |
| [15] | PetraCG, SchenkO, LubinM, GärtnerK. An augmented incomplete factorization approach for computing the Schur complement in stochastic optimization. SIAM J Sci Comput. 2014;36(2):C139‐C162. · Zbl 1296.65091 |
| [16] | SaadY. Iterative Methods for Sparse Linear Systems. 2nd ed. Philadelphia, PA: Society for Industrial and Applied Mathematics; 2003. · Zbl 1031.65046 |
| [17] | SuzukiA, RouxFX. A dissection solver with kernel detection for symmetric finite element matrices on shared memory computers. Int J Numer Methods Eng. 2014;100(2):136‐164. · Zbl 1352.65457 |
| [18] | KarypisG, KumarV. MeTiS: a software package for partitioning unstructured graphs and computing fill‐reduced orderings of sparse matrices. Minneapolis, MN: Department of Computer Science and Engineering, University of Minnesota. 1998;180. |
| [19] | SpillaneN. An adaptive multipreconditioned conjugate gradient algorithm. SIAM J Sci Comput. 2016;38(3):A1896‐A1918. · Zbl 1416.65087 |
| [20] | BovetC, Parret‐FréaudA, SpillaneN, GosseletP. Adaptive multipreconditioned FETI: scalability results and robustness assessment. Comput Struct. 2017;193:1‐20. |
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.
