Abstract
A number of algorithms involving Markov chains contain no subtractions. This property makes the analysis of rounding errors particularly simple. To show this, some principles for analyzing the propagation and generation of rounding errors in algorithms containing no subtraction are discussed first. These principles are then applied in the context of a simple recursive algorithm involving the transient solution of discrete-time Markov chains, Jensen's algorithm, and state reduction. Jensen's algorithm, also known as randomization or uniformization, is an algorithm for finding transient solutions of continuous-time Markov chains. State reduction is a method for finding equilibrium probabilities for discrete-time or continuous-time Markov chains.
Publisher
Association for Computing Machinery (ACM)
Subject
Applied Mathematics,Software
Reference21 articles.
1. ANDREWS P. B. 1986. An Introduction to Mathematical Logic and Type Theory. Academic Press Orlando Fla. ANDREWS P. B. 1986. An Introduction to Mathematical Logic and Type Theory. Academic Press Orlando Fla.
2. The weak and strong stability of algorithms in numerical linear algebra;BUNCH J.F.;Linear Algebra Appl.,1987
3. Backward error analysis for totally positive linear systems;DEBOOR C.;Numer. Math.,1977
4. Computing Poisson probabilities
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献