Asynchronous iterative sub-structuring methods

Abstract : In this paper, a new asynchronous iterative sub-structuring method is presented. This method is based on a classical sub-structuring approach, but during the iterations of the algorithm, at the end of each iteration the synchronisation between the processors is here removed leading to totally asynchronous iterations. The mathematical proof of the convergence of this new asynchronous iterative sub-structuring method is first introduced, followed by an example of the parallel implementation. Numerical results performed on a three dimensional test case illustrate the robustness, performance and efficiency of the asynchronous version over its synchronous counterpart.
Type de document :
Article dans une revue
Mathematics and Computers in Simulation, Elsevier, 2018, 145, pp.34-49. 〈10.1016/j.matcom.2016.05.009〉
Liste complète des métadonnées

https://hal-centralesupelec.archives-ouvertes.fr/hal-01708724
Contributeur : Frédéric Magoulès <>
Soumis le : mercredi 14 février 2018 - 09:10:41
Dernière modification le : jeudi 5 avril 2018 - 12:30:26

Identifiants

Citation

Frédéric Magoulès, Cédric Venet. Asynchronous iterative sub-structuring methods. Mathematics and Computers in Simulation, Elsevier, 2018, 145, pp.34-49. 〈10.1016/j.matcom.2016.05.009〉. 〈hal-01708724〉

Partager

Métriques

Consultations de la notice

116