Abstract
In a situation where the unique stationary distribution vector of an infinite irreducible positive-recurrent stochastic matrix P is not analytically determinable, numerical approximations are needed. This paper partially synthesizes and extends work on finite-vector approximative solutions obtained from n x n northwest corner truncations ( n ) P of P , from the standpoints of (pointwise convergence) algorithms as n →∞, and the manner of their computer implementation with a view to numerical stability and conditioning. The problem for finite n is connected with that of finding the unique stationary distribution of the finite stochastic matrix ( n ) P̃ obtained from ( n ) P by augmenting a column.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
