This paper deals with a synthetic presentation of parallel iterative asynchronous algorithms
and their extensions for the solution of large sparse linear or pseudo-linear algebraic …

Solving block-tridiagonal systems is one of the key issues in numerical simulations of many
scientific and engineering problems. Non-zero elements are mainly concentrated in the …

The paper improves a preliminary experimental study on a cluster by adding both theoretical
results and experimental tests on a grid platform. These algorithms solve univalued and …

We show that using the multi-splitting algorithm as a preconditioner for the domain wall
Dirac linear operator, arising in lattice QCD, effectively reduces the inter-node …

Lattice gauge theory is a special regularization of continuum gauge theories and the
numerical simulation of lattice quantum chromodynamics (QCD) remains as the only first …

This study seeks to understand the soft error vulnerability of asynchronous iterative methods,
with a focus on stationary iterative solvers such as Jacobi. A theoretical investigation into the …

This paper presents the behavior of general parallel synchronous and asynchronous
multisplitting and two-stage methods for the numerical simulation of steel solidification in …

Cette thèse aborde la résolution des problèmes d'interaction fluide-structure par un
algorithme consistant en un couplage entre deux solveurs: un pour le fluide et un pour la …

The present study deals with pseudo-linear problems solving using parallel asynchronous
multisplitting methods combined with Krylov methods. With appropriate and realistic …

Iterative methods for solving large sparse systems of linear equations are widely used in
many HPC applications. Extreme scaling of these methods can be difficult, however, since …