Iterative algorithms for large stochastic matrices
From MaRDI portal
Publication:808164
DOI10.1016/0024-3795(91)90374-6zbMath0731.65021OpenAlexW2071029060MaRDI QIDQ808164
Publication date: 1991
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(91)90374-6
performanceconvergence ratesiterative methodsJacobi methodpower methodstochastic matrixGauss- Seidel method
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a Rayleigh-Ritz refinement technique for nearly uncoupled stochastic matrices
- Upper bounds on the maximum modulus of subdominant eigenvalues of nonnegative matrices
- Block iterative algorithms for stochastic matrices
- Theorems of Stein-Rosenberg type. III. The singular case
- Convergent nonnegative matrices and iterative methods for consistent linear systems
- Generalized inverse-positivity and splittings of M-matrices
- Theorems on M-splittings of a singular M-Matrix which depend on graph structure
- Non-negative matrices and Markov chains.
- Fields of values and Gershgorin disks
- Abschätzungen für die Eigenwerte positiver linearer Operatoren
- Inclusion domains for the eigenvalues of stochastic matrices
- A Combined Direct-Iterative Method for Certain M-Matrix Linear Systems
- Convergent Regular Splittings for Singular M-Matrices
- Matrix Methods for Queuing Problems
- Iterative Methods for Computing Stationary Distributions of Nearly Completely Decomposable Markov Chains
- Iterative aggregation/disaggregation techniques for nearly uncoupled markov chains
- Aggregation with an error of O (ε 2 )
- Return times in nearly-completely decomposable stochastic processes
This page was built for publication: Iterative algorithms for large stochastic matrices