Sensitive Growth Analysis of Multiplicative Systems I: The Dynamic Approach

DOI10.1137/0602004zbMath0498.60047OpenAlexW1981417663MaRDI QIDQ3963789

Uriel G. Rothblum

Publication date: 1981

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0602004

zbMATH Keywords

combinatorial characterizationperiodic asymptotic behaviorpower growth rate

Mathematics Subject Classification ID

Signal detection and filtering (aspects of stochastic processes) (60G35) Combinatorial probability (60C05) General systems theory (93A99) Stochastic analysis (60H99)

Related Items (8)

Asymptotic expansions for dynamic programming recursions with general nonnegative matrices ⋮ The influence of the marked reduced graph of a nonnegative matrix on the Jordan form and on related properties: a survey ⋮ Asymptotic properties of powers of nonnegative matrices, with applications ⋮ Limiting polytopes and periodic markov chains ⋮ On the growth of infinite products of slowly varying primitive matrices ⋮ Dynamics of piecewise linear maps and sets of nonnegative matrices ⋮ Totally expanding multiplicative systems ⋮ Multiplicative processes reaching stationarity in finite time

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic eigenspaces of nonnegative matrices
• Multiplicative Markov Decision Chains
• Expansions of Sums of Matrix Powers
• The Role of the Group Generalized Inverse in the Theory of Finite Markov Chains
• Capital Accumulation Optimal in the Final State
• Spectral Properties of Matrices which have Invariant Cones
• Risk-Sensitive Markov Decision Processes

This page was built for publication: Sensitive Growth Analysis of Multiplicative Systems I: The Dynamic Approach