Regular Article
Asynchronous Iterative Algorithms for Nonexpansive Linear Systems

https://doi.org/10.1006/jpdc.1999.1587Get rights and content

Abstract

In this paper we give a convergence result for parallel synchronous or asynchronous algorithms with bounded delays, associated with nonexpansive linear systems which are not necessarily contractive. This result allows us to apply these algorithms to consistent singular linear systems and to finite homogenous Markov chains.

References (23)

  • J. Bahi

    Algorithmes parallèles asynchrones pour des systèmes singuliers

    C. R. Acad. Sci.

    (1998)
  • R. Bru et al.

    Models of parallel chaotic iteration methods

    Linear Algebra Appl.

    (1988)
  • D. Chazan et al.

    Chaotic relaxation

    Linear Algebra Appl.

    (1969)
  • J. Bahi

    Parallel chaotic algorithms for singular linear systems

    Parallel Algorithms Appl.

    (1999)
  • G.M. Baudet

    Asynchronous iterative methods for multiprocessors

    J. Assoc. Comput. Mach.

    (1978)
  • D.P. Bertsekas et al.

    Parallel and Distributed Computation: Numerical Methods

    (1989)
  • A. Berman et al.

    Nonnegative Matrices in the Mathematical Sciences

    (1979)
  • R. Bru et al.

    Convergence of infinite products of matrices and inner-outer iteration schemes

    Electronic Transactions on Numerical Analysis

    (1994)
  • R. Bru et al.

    Parallel synchronous and asynchronous two-stage multisplitting methods

    Electronic Transactions on Numerical Analysis

    (1995)
  • L. Elsner

    Comparison of weak regular splittings and multisplitting methods

    Numer. Math.

    (1989)
  • M.N. El Tarazi

    Contraction et ordre partiel pour l'étude d'algorithmes synchrones et asynchrones en analyse numérique

    (1981)
  • Cited by (0)

    View full text