Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
On iterative methods in Markov modelling
Schatte P. Journal of Information Processing and Cybernetics23 (1):49-51,1987.Type:Article
Date Reviewed: Oct 1 1987

It is shown that the deletion of row i and column i in an irreducible stochastic matrix results in a matrix of spectral radius less than 1. It is proposed to use this fact for iteratively solving systems of linear equations of the form xA = 0, where A is special singular. It is conjectured that choosing i so as to maximize the row total is a good idea.

Reviewer:  C. Hoffmann Review #: CR111802
Bookmark and Share
 
Probabilistic Algorithms (Including Monte Carlo) (G.3 ... )
 
 
Computations On Matrices (F.2.1 ... )
 
 
Iterative Methods (G.1.5 ... )
 
 
Reducibility And Completeness (F.1.3 ... )
 
 
Systems Of Equations (G.1.5 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Probabilistic Algorithms (Including Monte Carlo)": Date

Type: Article
Jul 1 1987
A probabilistic lower bound for checking disjointness of sets
Manber U. (ed) Information Processing Letters 19(1): 51-53, 1984. Type: Article
Feb 1 1985
Finite-data algorithms for approximate stochastic realization
Vaccaro R., Kluwer B.V., Deventer, The Netherlands, 1986. Type: Book (9789780898381771)
Jul 1 1989
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy