Iterative component-wise bounds for the steady-state distribution of a Markov chain
✍ Scribed by Ana Bušić; Jean-Michel Fourneau
- Publisher
- John Wiley and Sons
- Year
- 2011
- Tongue
- English
- Weight
- 644 KB
- Volume
- 18
- Category
- Article
- ISSN
- 1070-5325
- DOI
- 10.1002/nla.824
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Median based smoothing algorithms have received considerable attention in the last few years. Their properties make them sometimes superior to linear smoothers. In this paper we develop an expression for the bivariate distribution of a mediansmoothed Markov chain and we illustrate one application of
For a discrete-time Markov chain with finite state space [1, ..., r] we consider the joint distribution of the numbers of visits in states 1, ..., r&1 during the first N steps or before the N th visit to r. From the explicit expressions for the corresponding generating functions we obtain the limiti
## Abstract An iterative method for numerically solving the time independent Navier–Stokes equations for viscous compressible flows is presented. The method is based upon partial application of the Gauss–Seidel principle in block form to the systems of the non‐linear algebraic equations which arise