Skip to main content
SpringerLink
Log in

On the stability of asynchronous iterative processes

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

We consider an iterative process in which one out of a finite set of possible operators is applied at each iteration. We obtain necessary and sufficient conditions for convergence to a common fixed point of these operators, when the order at which different operators are applied is left completely free, except for the requirement that each operator is applied infinitely many times. The theory developed is similar in spirit to Lyapunov stability theory. We also derive some very different, qualitatively, results for partially asynchronous iterative processes, that is, for the case where certain constraints are imposed on the order at which the different operators are applied.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. G. M. Baudet, Asynchronous iterative algorithms for multiprocessors,J. Assoc. Comput. Mach.,25 (1978), 226–244.

    Google Scholar 

  2. D. P. Bertsekas, Distributed dynamic programming,IEEE Trans. Automat. Control,27 (1982), 610–616.

    Google Scholar 

  3. D. P. Bertsekas, Distributed asynchronous computation of fixed points,Math. Programming,27 (1983), 107–120.

    Google Scholar 

  4. V. Borkar and P. Varaiya, Asymptotic agreement in distributed estimation,IEEE Trans. Automat. Control,27 (1982), 650–655.

    Google Scholar 

  5. R. K. Brayton and C. H. Tong, Stability of dynamical systems: a constructive approach,IEEE Trans. Circuits and Systems,26 (1980), 224–234.

    Google Scholar 

  6. R. K. Brayton and C. H. Tong, Constructive stability and asymptotic stability of dynamical systems,IEEE Trans. Circuits and Systems,27 (1980), 1121–1130.

    Google Scholar 

  7. D. Bushaw, A stability criterion for general systems,Math. Systems Theory,1 (1967), 79–88.

    Google Scholar 

  8. D. Chazan and W. Miranker, Chaotic relaxation,Linear Algebra Appl.,2 (1969), 199–222.

    Google Scholar 

  9. M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.

    Google Scholar 

  10. C. A. R. Hoare,Communicating Sequential Processes, Prentice-Hall, Englewood Cliffs, NJ, 1985.

    Google Scholar 

  11. B. Lubachevsky and D. Mitra, A chaotic asynchronous algorithm for computing the fixed point of a nonnegative matrix of unit spectral radius,J. Assoc. Comput. Mach.,33 (1986), 130–150.

    Google Scholar 

  12. D. Mitra, Asynchronous relaxations for the numerical solution of differential equations by parallel processors,SIAM J. Sci. Statist. Comput.,8 (1987), 43–59.

    Google Scholar 

  13. J. R. Munkres,Topology: A First Course, Prentice-Hall, Englewood Cliffs, NJ, 1975.

    Google Scholar 

  14. C. H. Papadimitriou and K. Steiglitz,Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1982.

    Google Scholar 

  15. G. Peterson and M. Fischer, Economical solutions for the critical section problem in a distributed system,Proceedings of the Ninth Symposium on Theory of Computing, Boulder, CO, 1977, pp. 91–97.

  16. P. J. Ramadge, Control and supervision of discrete event processes, Ph.D. thesis, Department of Electrical Engineering, University of Toronto, 1983.

  17. P. J. Ramadge and W. M. Wonham, Supervisory control of a class of discrete-event processes,Proceedings of the Sixth International Conference on Analysis and Optimization of Systems, Nice, 1984.

  18. F. Robert, Methodes iteratives “Serie Parallele”,C. R. Acad. Sci. Paris,271 (1970), 847–850.

    Google Scholar 

  19. F. Robert, Contraction en norme vectorielle: convergence d'iterations chaotiques pour des equations non lineaires de point fixe a plusieurs variables,Linear Algebra Appl.,13 (1976), 19–35.

    Google Scholar 

  20. J. N. Tsitsiklis, Problems in decentralized decision making and computation, Ph.D. thesis, Department of Electrical Engineering and Computer Science, M.I.T., Cambridge, MA, 1984.

    Google Scholar 

  21. J. N. Tsitsiklis and M. Athans, Convergence and asymptotic agreement in distributed decision problems,IEEE Trans. Automat. Control,29 (1984), 690–696.

    Google Scholar 

  22. J. N. Tsitsiklis and D. P. Bertsekas, Distributed asynchronous routing in data communication networks,IEEE Trans. Automat. Control,31 (1986), 325–332.

    Google Scholar 

  23. J. N. Tsitsiklis, D. P. Bertsekas, and M. Athans, Distributed asynchronous deterministic and stochastic gradient optimization algorithms,IEEE Trans. Automat. Control,31 (1986), 803–812.

    Google Scholar 

  24. R. S. Varga,Matrix Iterative Analysis, Prentice-Hall, Englewood Cliffs, NJ, 1962.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory for Information and Decision Systems, M.I.T., Room 35-214, 02139, Cambridge, MA, USA

    John N. Tsitsiklis

Authors
  1. John N. Tsitsiklis
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research supported by an IBM Faculty Development Award and the Army Research Office under Contract DAAAG-29-84-K-0005.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tsitsiklis, J.N. On the stability of asynchronous iterative processes. Math. Systems Theory 20, 137–153 (1987). https://doi.org/10.1007/BF01692062

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01692062

Keywords

Search

Navigation