A domain decomposition strategy to efficiently solve structures containing repeated patterns - Université Pierre et Marie Curie Accéder directement au contenu
Article Dans Une Revue International Journal for Numerical Methods in Engineering Année : 2008

A domain decomposition strategy to efficiently solve structures containing repeated patterns

Résumé

This paper presents a strategy for the computation of structures with repeated patterns based on domain decomposition and block Krylov solvers. It can be seen as a special variant of the FETI method. We propose using the presence of repeated domains in the problem to compute the solution by minimizing the interface error on several directions simultaneously. The method not only drastically decreases the size of the problems to solve but also accelerates the convergence of interface problem for nearly no additional computational cost and minimizes expensive memory accesses. The numerical performances are illustrated on some thermal and elastic academic problems.
Fichier principal
Vignette du fichier
ddpattern2.pdf (293.88 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00436993 , version 1 (28-11-2009)
hal-00436993 , version 2 (23-08-2012)

Identifiants

Citer

Pierre Gosselet, Daniel J. Rixen, Christian Rey. A domain decomposition strategy to efficiently solve structures containing repeated patterns. International Journal for Numerical Methods in Engineering, 2008, 78 (7), pp.828 - 842. ⟨10.1002/nme.2517⟩. ⟨hal-00436993v2⟩
73 Consultations
237 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More