دورية أكاديمية
Simultaneous-FETI and Block-FETI: robust domain decomposition with multiple search directions.
| العنوان: | Simultaneous-FETI and Block-FETI: robust domain decomposition with multiple search directions. |
|---|---|
| المؤلفون: | Gosselet, Pierre, Rixen, Daniel, Roux, François-Xavier, Spillane, Nicole |
| المساهمون: | Laboratoire de Mécanique et Technologie (LMT), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS), Institute of Applied Mechanics Garching, Technische Universität Munchen - Technical University Munich - Université Technique de Munich (TUM), Laboratoire Jacques-Louis Lions (LJLL), Université Pierre et Marie Curie - Paris 6 (UPMC)-Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS), ONERA - The French Aerospace Lab Châtillon, ONERA-Université Paris Saclay (COmUE), Facultad de Ciencias, Universidad de Chile |
| المصدر: | ISSN: 0029-5981. |
| بيانات النشر: | HAL CCSD Wiley |
| سنة النشر: | 2015 |
| مصطلحات موضوعية: | FETI, BDD, heterogeneity, multiple preconditioner, Block Krylov methods, Domain decomposition, MSC 65F10 * 65N22 * 65N30 * 65N55, [MATH.MATH-NA]Mathematics [math]/Numerical Analysis [math.NA], [PHYS.MECA.STRU]Physics [physics]/Mechanics [physics]/Structural mechanics [physics.class-ph] |
| الوصف: | International audience ; Domain Decomposition methods often exhibit very poor performance when applied to engineering problems with large heterogeneities. In particular for heterogeneities along domain interfaces the iterative techniques to solve the interface problem are lacking an efficient preconditioner. Recently a robust approach, named FETI-Geneo, was proposed where troublesome modes are precomputed and deflated from the interface problem. The cost of the FETI-Geneo is however high. We propose in this paper techniques that share similar ideas with FETI-Geneo but where no pre-processing is needed and that can be easily and efficiently implemented as an alternative to standard Domain Decomposition methods. In the block iterative approaches presented in this paper, the search space at every iteration on the interface problem contains as many directions as there are domains in the decomposition. Those search directions originate either from the domain-wise preconditioner (in the Simultaneous FETI method) or from the block structure of the right-hand side of the interface problem (Block FETI). We show on 2D structural examples that both methods are robust and provide good convergence in the presence of high heterogeneities, even when the interface is jagged or when the domains have a bad aspect ratio. The Simultaneous FETI was also efficiently implemented in an optimized parallel code and exhibited excellent performance compared to the regular FETI method. |
| نوع الوثيقة: | article in journal/newspaper |
| اللغة: | English |
| العلاقة: | hal-01056928; https://hal.science/hal-01056928Test; https://hal.science/hal-01056928v2/documentTest; https://hal.science/hal-01056928v2/file/main.pdfTest |
| DOI: | 10.1002/nme.4946 |
| الإتاحة: | https://doi.org/10.1002/nme.4946Test https://hal.science/hal-01056928Test https://hal.science/hal-01056928v2/documentTest https://hal.science/hal-01056928v2/file/main.pdfTest |
| حقوق: | http://creativecommons.org/licenses/by-nc-ndTest/ ; info:eu-repo/semantics/OpenAccess |
| رقم الانضمام: | edsbas.26EC684E |
| قاعدة البيانات: | BASE |
| DOI: | 10.1002/nme.4946 |
|---|