Bounds for the Positive Eigenvectors of Nonnegative Matrices and for their Approximations by Decomposition
DOI10.1145/1634.1637zbMATH Open0628.65029OpenAlexW2067747265MaRDI QIDQ3765110FDOQ3765110
Authors: Pierre Courtois, Pierre Semal 
Publication date: 1984
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1634.1637
Recommendations
- Error bounds on an approximation to the dominant eigenvector of a nonnegative matrix
- Approximations of the Spectral Radius Corresponding Eigenvector, and Second Largest Modulus of an Eigenvalue for Square, Nonnegative, Irreducible Matrices
- Entrywise lower and upper bounds for the Perron vector
- scientific article; zbMATH DE number 27100
- A Remark on Minc’s Maximal Eigenvector Bound for Positive Matrices
aggregationdecompositionspectral radiusnumerical examplestochastic matricesstochastic analysisupper and lower boundsstationary probabilityqueuing theorynonnegative irreducible matricespositive eigenvectorsbounded aggregation
Inequalities involving eigenvalues and eigenvectors (15A42) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Positive matrices and their generalizations; cones of matrices (15B48) Stochastic matrices (15B51)
Cited In (24)
- Bounding reward measures of Markov models using the Markov decision processes.
- A Remark on Minc’s Maximal Eigenvector Bound for Positive Matrices
- A New Algorithm for Computing the Ergodic Probability Vector for Large Markov Chains
- On the Positive Eigenvalues and Eigenvectors of a Non-negative Matrix
- Bounding the equilibrium distribution of Markov population models.
- Lumping and reversed processes in cooperating automata
- Stationary distributions of continuous-time Markov chains: a review of theory and truncation-based approximations
- An Approximation to the Stationary Distribution of a Nearly Completely Decomposable Markov Chain and Its Error Analysis
- Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering
- Exact decomposition approaches for Markov decision processes: a survey
- Sub-stochastic matrix analysis for bounds computation -- theoretical results
- Estimating equilibrium probabilities for band diagonal Markov chains using aggregation and disaggregation techniques
- Asymptotic expansions for stationary distributions of perturbed semi-Markov processes
- Improving bounds for nonmaximal eigenvalues of positive matrices
- An embedded Markov chain approach to stock rationing
- Guaranteed approximation of Markov chains with applications to multiplexer engineering in ATM networks
- GENERALIZED CLASS [script C] MARKOV CHAINS AND COMPUTATION OF CLOSED-FORM BOUNDING DISTRIBUTIONS
- On polyhedra of Perron-Frobenius eigenvectors
- Title not available (Why is that?)
- Error bounds on an approximation to the dominant eigenvector of a nonnegative matrix
- An embedded Markov chain approach to stock rationing under batch orders
- Approximations of the Spectral Radius Corresponding Eigenvector, and Second Largest Modulus of an Eigenvalue for Square, Nonnegative, Irreducible Matrices
- Block iterative algorithms for stochastic matrices
- An Approximation to the Stationary Distribution of a Nearly Completely Decomposable Markov Chain and Its Error Bound
This page was built for publication: Bounds for the Positive Eigenvectors of Nonnegative Matrices and for their Approximations by Decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3765110)
