Asynchronous Additive Coarse-Space Correction

Abstract. Data access time is an essential part of the mathematical design of asynchronous iterative methods, which makes it necessary to strongly link theoretical analysis and practical implementation. In particular, coarse-space correction implies two independent communications stages, one for updating the right-hand side (RHS) of each local fine problem, and the other one for updating the RHS of the coarse problem. This results in two different sets of communication delays, creating a gap between the fine- and the coarse-projected RHSs. So far, asynchronous domain decomposition methods (DDMs) have applied additive coarse-space correction only on a subset of iterations, depending on the average gap between the RHSs. Here, we achieve asynchronous additive coarse-space correction at all iterations and hence propose the first totally two-level asynchronous DDMs of such kind. The approach is presented using a general Schwarz-type domain decomposition framework formulated as a multisplitting one. Several iterative models are considered with implied implementation aspects. Both weak and strong scaling experimental results for the standard Poisson’s equation in two and three dimensions show some remarkable performances of our approach.

Authors

Institutions

Publication Details

Journal
SIAM Journal on Scientific Computing
Published
2026-10-13
DOI
https://doi.org/10.1137/24m1713958
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Asynchronous Additive Coarse-Space Correction

Frédéric Magoulès, Guillaume Gbikpi‐Benissan
SIAM Journal on Scientific Computing
Matrix Theory and Algorithms
article

Asynchronous Additive Coarse-Space Correction

Frédéric Magoulès, Guillaume Gbikpi‐Benissan
article en

Abstract

Abstract. Data access time is an essential part of the mathematical design of asynchronous iterative methods, which makes it necessary to strongly link theoretical analysis and practical implementation. In particular, coarse-space correction implies two independent communications stages, one for updating the right-hand side (RHS) of each local fine problem, and the other one for updating the RHS of the coarse problem. This results in two different sets of communication delays, creating a gap between the fine- and the coarse-projected RHSs. So far, asynchronous domain decomposition methods (DDMs) have applied additive coarse-space correction only on a subset of iterations, depending on the average gap between the RHSs. Here, we achieve asynchronous additive coarse-space correction at all iterations and hence propose the first totally two-level asynchronous DDMs of such kind. The approach is presented using a general Schwarz-type domain decomposition framework formulated as a multisplitting one. Several iterative models are considered with implied implementation aspects. Both weak and strong scaling experimental results for the standard Poisson’s equation in two and three dimensions show some remarkable performances of our approach.

SIAM Journal on Scientific ComputingVol. 48(5)
Université Paris-Saclay (FR), CentraleSupélec (FR)
Openalex Percentile: Top 14%
Matrix Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.