论文信息 - Further results on stability of asynchronous discrete-time linear systems

Further results on stability of asynchronous discrete-time linear systems

Focuses on the stability problem of discrete-time asynchronous linear systems, which can be viewed as linear systems with time-varying delays. Within this context, a stronger version of the necessity part of the classical Chazan-Miranker theorem is proved and new results for special classes of system matrices are also presented.

[1] Debasis Mitra,et al. A chaotic asynchronous algorithm for computing the fixed point of a nonnegative matrix of unit spectral radius , 1986, JACM.

[2] D. Siljak,et al. On the convergence of parallel asynchronous block-iterative computations , 1990 .

[3] M. Tarazi. Some convergence results for asynchronous algorithms , 1982 .

[4] J. Donnelly. Periodic chaotic relaxation , 1971 .

[5] A. Ostrowski. Determinanten mit überwiegender Hauptdiagonale und die absolute Konvergenz von linearen Iterationsprozessen , 1956 .

[6] A. Bhaya,et al. A delay-independent robust stability condition for linear discrete-time systems , 1993, Proceedings of 32nd IEEE Conference on Decision and Control.

[7] L. Elsner,et al. Models of parallel chaotic iteration methods , 1988 .

[8] Michel Dubois,et al. Asynchronous iterative algorithms: models and convergence , 1992 .

[9] Markku Verkama. Random Relaxation of Fixed-Point Iteration , 1996, SIAM J. Sci. Comput..