On the stability of asynchronous iterative processes
From MaRDI portal
DOI10.1007/BF01692062zbMATH Open0637.65056MaRDI QIDQ3777342FDOQ3777342
Publication date: 1987
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Constructive stability and asymptotic stability of dynamical systems
- Stability of dynamical systems: A constructive approach
- Distributed asynchronous optimal routing in data networks
- Distributed asynchronous deterministic and stochastic gradient optimization algorithms
- Asynchronous Iterative Methods for Multiprocessors
- Distributed asynchronous computation of fixed points
- Convexity and characterization of optimal policies in a dynamic routing problem
- Asymptotic agreement in distributed estimation
- Chaotic relaxation
- Distributed dynamic programming
- A chaotic asynchronous algorithm for computing the fixed point of a nonnegative matrix of unit spectral radius
- A stability criterion for general systems
- Contraction en norme vectorielle: Convergence d'itérations chaotiques pour des équations non linéaires de point fixe à plusieurs variables
- Asynchronous Relaxations for the Numerical Solution of Differential Equations by Parallel Processors
- Guaranteed robustness properties of multivariable nonlinear stochastic optimal regulators
Cited In (13)
- Convergence of sequential and asynchronous nonlinear paracontractions
- Some aspects of parallel and distributed iterative algorithms - a survey
- Chaotic phenomena in desynchronized systems and stability analysis
- Verification of distributed systems with local-global predicates
- Asynchronous iterative sub-structuring methods
- The boundedness of all products of a pair of matrices is undecidable
- Title not available (Why is that?)
- The Lyapunov exponent and joint spectral radius of pairs of matrices are hard - when not impossible - to compute and to approximate
- Title not available (Why is that?)
- On Convergence of Concurrent Systems under Regular Interactions
- Lagrange stability and boundedness of discrete event systems
- Optimal norms and the computation of joint spectral radius of matrices
- A Formalized Theory for Verifying Stability and Convergence of Automata in PVS
This page was built for publication: On the stability of asynchronous iterative processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3777342)
