Asynchronous Schwarz methods for peta and exascale computing

Optimized Schwarz methods are very efficient iterative algorithms for the parallel solution of computational mechanics problems. These methods are similar to the classical Schwarz methods, but they use absorbing interface conditions between the subdomains. These interface conditions are then optimized for efficiency and lead to a fast and robust convergence behavior of the iterative algorithm. A wide range of optimization techniques have been proposed and developed in the literature. In this chapter, optimized Schwarz methods are extended to an asynchronous context. The word asynchronous here is related to the iterations of the mathematical algorithm. Numerical experiments illustrate the robustness and efficiency of this original approach when solving the Helmholtz equation on parallel computers.

Data and Resources

Additional Info

Field Value
Source Developments in Parallel, Distributed, Grid and Cloud Computing for Engineering
Author Magoules, F.
Maintainer CCSD
Last Updated May 11, 2026, 10:02 (UTC)
Created May 11, 2026, 10:02 (UTC)
Identifier hal-00815487
Language en
contributor Mathématiques Appliquées aux Systèmes - EA 4037 (MAS) ; École centrale Paris
creator Magoules, F.
date 2013-05-11T00:00:00
harvest_object_id 3681f4ce-70d1-43c6-a2f2-73a3b6683f16
harvest_source_id 3374d638-d20b-4672-ba96-a23232d55657
harvest_source_title test moissonnage SELUNE
metadata_modified 2026-03-22T00:00:00
relation info:eu-repo/semantics/altIdentifier/doi/10.4203/csets.31.10
set_spec type:COUV