International audienceThis paper deals with the solution of nonlinear systems of equations via asynchronous iterative algorithms. New conditions underlying convergence of asynchonous relaxation algorithms are given. Conditions of convergence of asynchronous versions of a generalization of Richardson's method for nonlinear systems of equations are also presented. Application to nonlinear network flow problems are considered and computational experiences using a distributed memory multiprocessor are presented
Abstract. The problem of computing a fixed point of a nonexpansive function f is considered. Suffici...
International audienceIterative asynchronous parallel methods are nowadays gaining renewed interest ...
International audienceThe solution of nonlinear systems of equations Fx=z via parallel asynchronous ...
International audienceThis paper deals with the solution of nonlinear systems of equations via async...
International audienceThis paper deals with a new class of parallel asynchronous iterative algorithm...
International audienceThis paper deals with a new class of parallel asynchronous iterative algorithm...
Asynchronous iterations arise naturally on parallel computers if one wants to minimize idle times. T...
International audienceThe strictly convex network flow problem is considered. The dual of this probl...
International audienceThe strictly convex network flow problem is considered. The dual of this probl...
International audienceThe strictly convex network flow problem is considered. The dual of this probl...
International audienceThe strictly convex network flow problem is considered. The dual of this probl...
International audienceThe strictly convex network flow problem is considered. The dual of this probl...
AbstractIn this paper, parallel algorithms are proposed for solving both systems of nonlinear algebr...
AbstractAsynchronous iterations arise naturally on parallel computers if one wants to minimize idle ...
Asynchronous iterations arise naturally on parallel computers if one wants to minimize idle times. T...
Abstract. The problem of computing a fixed point of a nonexpansive function f is considered. Suffici...
International audienceIterative asynchronous parallel methods are nowadays gaining renewed interest ...
International audienceThe solution of nonlinear systems of equations Fx=z via parallel asynchronous ...
International audienceThis paper deals with the solution of nonlinear systems of equations via async...
International audienceThis paper deals with a new class of parallel asynchronous iterative algorithm...
International audienceThis paper deals with a new class of parallel asynchronous iterative algorithm...
Asynchronous iterations arise naturally on parallel computers if one wants to minimize idle times. T...
International audienceThe strictly convex network flow problem is considered. The dual of this probl...
International audienceThe strictly convex network flow problem is considered. The dual of this probl...
International audienceThe strictly convex network flow problem is considered. The dual of this probl...
International audienceThe strictly convex network flow problem is considered. The dual of this probl...
International audienceThe strictly convex network flow problem is considered. The dual of this probl...
AbstractIn this paper, parallel algorithms are proposed for solving both systems of nonlinear algebr...
AbstractAsynchronous iterations arise naturally on parallel computers if one wants to minimize idle ...
Asynchronous iterations arise naturally on parallel computers if one wants to minimize idle times. T...
Abstract. The problem of computing a fixed point of a nonexpansive function f is considered. Suffici...
International audienceIterative asynchronous parallel methods are nowadays gaining renewed interest ...
International audienceThe solution of nonlinear systems of equations Fx=z via parallel asynchronous ...