Bounds for the Positive Eigenvectors of Nonnegative Matrices and for their Approximations by Decomposition

DOI10.1145/1634.1637zbMath0628.65029OpenAlexW2067747265MaRDI QIDQ3765110

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

zbMATH Keywords

aggregationnumerical exampledecompositionspectral radiusupper and lower boundsstochastic matricesstochastic analysisstationary probabilityqueuing theorynonnegative irreducible matricespositive eigenvectorsbounded aggregation

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Inequalities involving eigenvalues and eigenvectors (15A42) Positive matrices and their generalizations; cones of matrices (15B48) Stochastic matrices (15B51)

Related Items (18)

GENERALIZED CLASS [script C MARKOV CHAINS AND COMPUTATION OF CLOSED-FORM BOUNDING DISTRIBUTIONS] ⋮ Lumping and reversed processes in cooperating automata ⋮ Block iterative algorithms for stochastic matrices ⋮ Sub-stochastic matrix analysis for bounds computation -- theoretical results ⋮ Exact decomposition approaches for Markov decision processes: a survey ⋮ An embedded Markov chain approach to stock rationing ⋮ Asymptotic Expansions for Stationary Distributions of Perturbed Semi-Markov Processes ⋮ An Approximation to the Stationary Distribution of a Nearly Completely Decomposable Markov Chain and Its Error Analysis ⋮ An Approximation to the Stationary Distribution of a Nearly Completely Decomposable Markov Chain and Its Error Bound ⋮ Bounding reward measures of Markov models using the Markov decision processes ⋮ Bounding the equilibrium distribution of Markov population models ⋮ Stationary Distributions of Continuous-Time Markov Chains: A Review of Theory and Truncation-Based Approximations ⋮ Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering ⋮ An embedded Markov chain approach to stock rationing under batch orders ⋮ A New Algorithm for Computing the Ergodic Probability Vector for Large Markov Chains ⋮ On polyhedra of Perron-Frobenius eigenvectors ⋮ Estimating equilibrium probabilities for band diagonal Markov chains using aggregation and disaggregation techniques ⋮ Guaranteed approximation of Markov chains with applications to multiplexer engineering in ATM networks

This page was built for publication: Bounds for the Positive Eigenvectors of Nonnegative Matrices and for their Approximations by Decomposition