Abstract
The objective of this chapter is to show how Jacobi-type iterative methods for the solution of linear and nonlinear equations and, more specifically asynchronous versions of these methods, can be analyzed in the framework introduced in this book. By regarding these methods as discrete-time interconnected systems with varying delays in the interconnections, the analysis based on a diagonal-type Liapunov function introduced in Chapter 3 leads to computable conditions for convergence based on nonnegative stable (and hence diagonally stable) matrices, as well as estimates for the speed of convergence of different iterative methods. A perspective on the analysis of interconnected systems using diagonal-type Liapunov functions that complements the approach in this chapter is to be found in Chapter 6.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Kaszkurewicz, E., Bhaya, A. (2000). Convergence of Asynchronous Iterative Methods. In: Matrix Diagonal Stability in Systems and Computation. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-1346-8_4
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1346-8_4
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-7105-5
Online ISBN: 978-1-4612-1346-8
eBook Packages: Springer Book Archive