Asynchronous iterative sub-structuring methods

Frédéric Magoulès and Cédric Venet

Mathematics and Computers in Simulation (MATCOM), 2018, vol. 145, issue C, 34-49

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.

Keywords: Sub-structuring methods; Domain decomposition methods; Iterative methods; Asynchronous iterations; Parallel computing (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S037847541630115X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:145:y:2018:i:c:p:34-49

DOI: 10.1016/j.matcom.2016.05.009

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().