Iterative algorithms for large stochastic matrices
From MaRDI portal
Recommendations
- Block iterative algorithms for stochastic matrices
- Stochastic iterative projection methods for large linear systems
- Randomized Monte Carlo algorithms for matrix iterations and solving large systems of linear equations
- Approximate iterations for structured matrices
- Randomized iterative methods for linear systems
- Randomized methods for matrix computations
- Stochastic algorithms for solving structured low-rank matrix approximation problems
- scientific article; zbMATH DE number 45286
- Stochastic Approach to Matrices
- scientific article; zbMATH DE number 3886983
Cites work
- scientific article; zbMATH DE number 3760340 (Why is no real title available?)
- scientific article; zbMATH DE number 3473182 (Why is no real title available?)
- scientific article; zbMATH DE number 3574935 (Why is no real title available?)
- scientific article; zbMATH DE number 663840 (Why is no real title available?)
- scientific article; zbMATH DE number 3204642 (Why is no real title available?)
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- A Combined Direct-Iterative Method for Certain M-Matrix Linear Systems
- Abschätzungen für die Eigenwerte positiver linearer Operatoren
- Aggregation with an error of O (ε 2 )
- Block iterative algorithms for stochastic matrices
- Convergent Regular Splittings for Singular M-Matrices
- Convergent nonnegative matrices and iterative methods for consistent linear systems
- Fields of values and Gershgorin disks
- Generalized inverse-positivity and splittings of M-matrices
- Inclusion domains for the eigenvalues of stochastic matrices
- Iterative Methods for Computing Stationary Distributions of Nearly Completely Decomposable Markov Chains
- Iterative aggregation/disaggregation techniques for nearly uncoupled markov chains
- Matrix Methods for Queuing Problems
- Non-negative matrices and Markov chains.
- On a Rayleigh-Ritz refinement technique for nearly uncoupled stochastic matrices
- Return times in nearly-completely decomposable stochastic processes
- Theorems of Stein-Rosenberg type. III. The singular case
- Theorems on M-splittings of a singular M-Matrix which depend on graph structure
- Upper bounds on the maximum modulus of subdominant eigenvalues of nonnegative matrices
Cited in
(5)- Random-walk interpretations of classical iteration methods
- scientific article; zbMATH DE number 3886983 (Why is no real title available?)
- Fast algorithms for Brownian matrices
- The extrapolated gauss-seidel methods and generally consistently ordered matrices
- scientific article; zbMATH DE number 1329129 (Why is no real title available?)
This page was built for publication: Iterative algorithms for large stochastic matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q808164)