Adaptive multipreconditioned FETI: scalability results and robustness assessment - Archive ouverte HAL
Article Dans Une Revue Computers & Structures Année : 2017

Adaptive multipreconditioned FETI: scalability results and robustness assessment

Résumé

The purpose of this article is to assess the adaptive multipreconditioned FETI solvers (AMPFETI) on realistic industrial problems and hardware. The multi-preconditioned FETI algorithm (first introduced as Simultaneous FETI [1]) is a non-overlapping domain decomposition method which exhibits good robust-ness properties without requiring the explicit knowledge of the original partial differential equation, or any a priori analysis of the algebraic system through eigenvalues problems. Multipreconditioned FETI solves critical problems in significantly fewer iterations than classical FETI but each iteration involves a larger computational effort. An adaptive strategy (known as the adaptive mul-tipreconditioned conjugate gradient algorithm [2]) has been proposed to achieve balance between robustness and efficiency and we will observe that it provides an efficient solver for the problems considered here.
Fichier principal
Vignette du fichier
ampfeti-submitted.pdf (1.18 Mo) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01458725 , version 1 (06-02-2017)

Identifiants

Citer

Christophe Bovet, Augustin Parret-Fréaud, Nicole Spillane, Pierre Gosselet. Adaptive multipreconditioned FETI: scalability results and robustness assessment. Computers & Structures, 2017, 193, pp.1-20. ⟨10.1016/j.compstruc.2017.07.010⟩. ⟨hal-01458725⟩
708 Consultations
576 Téléchargements

Altmetric

Partager

More