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 …

Solving large sparse linear systems is essential in numerous scientific domains. Several
algorithms, based on direct or iterative methods, have been developed for parallel …

Abstract Modern trends in Computational Science and Engineering are moving towards the
use of computer systems with ever increasing numbers of computational cores. A …

In this paper, we revisit the Krylov multisplitting algorithm presented in Huang and O'Leary
(Linear Algebra Appl 194: 9–29, 1993) which uses a sequential method to minimize 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 …

This paper describes an efficient iterative algorithm for solving large sparse linear systems
on Grid computers. The algorithm is a combination of a synchronous flexible outer iterative …

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 …

Efficiently solving large sparse linear systems on loosely coupled networks of computers is a
rich and vibrant field of research. The induced heterogeneity and volatile nature of the …