Iterative and Semi-Iterative Methods for Computing Stationary Probability Vectors of Markov Operators
DOI10.2307/2153249zbMath0788.65142OpenAlexW4238580594MaRDI QIDQ4274392
Publication date: 30 May 1994
Full work available at URL: https://doi.org/10.2307/2153249
convergencestochastic matrixsemi-iterative methodsstationary probability vectors\(K\)-stochastic operatorsMarkov-type operators
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Stationary stochastic processes (60G10) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Iterative numerical methods for linear systems (65F10) Probabilistic methods, stochastic differential equations (65C99)
Related Items (7)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Comparison theorems for weak splittings of bounded operators
- The conjugate gradient method for computing all the extremal stationary probability vectors of a stochastic matrix
- A study of semiiterative methods for nonsymmetric systems of linear equations
- On the solution of singular linear systems of algebraic equations by semiiterative methods
- The analysis of k-step iterative methods for linear systems from summability theory
- Algebraic eigenspaces of nonnegative matrices
- Splittings ofM-operators: Irreducibility and the index of the iteration operator
- On the Construction of Semi-Iterative Methods
- Convergent Regular Splittings for Singular M-Matrices
- Semi-Iterative and Iterative Methods for Singular M-Matrices
- Numerical solution of sparse singular systems of equations arising from ergodic markov chains
- Convergent Iterations for Computing Stationary Distributions of Markov Chains
This page was built for publication: Iterative and Semi-Iterative Methods for Computing Stationary Probability Vectors of Markov Operators