Asynchronous iterations arise naturally on parallel computers if one wants to minimize idle
times. This paper reviews certain models of asynchronous iterations, using a common …

Finding a fixed point to a nonexpansive operator, ie, x^*=Tx^*, abstracts many problems in
numerical linear algebra, optimization, and other areas of data science. To solve fixed-point …

Focusing on grid computing and asynchronism, Parallel Iterative Algorithms explores the
theoretical and practical aspects of parallel numerical algorithms. Each chapter contains a …

This paper focuses on coordinate update methods, which are useful for solving problems
involving large or high-dimensional datasets. They decompose a problem into simple …

The Krasnosel'skiı–Mann (KM) iterative method has extensively been employed to find fixed
points of nonlinear mappings (in particular, nonexpansive mappings) and solve convex …

An ecosystem is the expansion of a software product line architecture to include systems
outside the product which interact with the product. We model here the architecture of a …

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 …

We introduce a theoretical algorithm and its practical version to perform a decentralized
detection of the global convergence of parallel asynchronous iterative algorithms. We prove …

This article presents a new communication library developed to ease the implementation of
both asynchronous and synchronous iterative methods. A mathematical and algorithmic …

This article presents the asynchronous global–local non-invasive coupling in the case of
nonlinear monotone patches as encountered when inserting elastoplastic components in a …