A class of iteration methods based on the Moser formula for nonlinear equations in Markov chains
DOI10.1016/S0024-3795(97)86522-6zbMath0889.65056MaRDI QIDQ1372973
Publication date: 2 June 1998
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
numerical examplesNewton iterationMarkov chainnonnegative solutionstransition matrixmonotone convergencenonlinear matrix equationssuccessive substitution iteration
Numerical computation of solutions to systems of equations (65H10) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Matrix equations and identities (15A24) Probabilistic methods, stochastic differential equations (65C99)
Related Items (7)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matrix-analytic methods in queueing theory
- The busy period of queues which have a matrix-geometric steady state probability vector
- On a Newton-Moser type method
- The M/M/1 queue with randomly varying arrival and service rates
- Further results on the M/M/1 queue with randomly varying rates
- A duality theorem for the matrix paradigms in queueing theory
- An experimental evaluation of the matrix-geometric method for theGI/PH/1 queue
- Nonlinear Matrix Equations in Applied Probability—Solution Techniques and Open Problems
- A stable recursion for the steady state vector in markov chains of m/g/1 type
- The N/G/1 queue and its detailed analysis
- Queues Solvable without Rouché's Theorem
- Moment formulas for the Markov renewal branching process
- Markov chains with applications in queueing theory, which have a matrix-geometric invariant probability vector
- Newton's iteration for non-linear equations in Markov chains
- On the Solution of a Nonlinear Matrix Equation Arising in Queueing Problems
This page was built for publication: A class of iteration methods based on the Moser formula for nonlinear equations in Markov chains