A new solution algorithm for skip-free processes to the left

DOI10.4067/S0719-06462010000200011MaRDI QIDQ3061833zbMATH OpenOpenAlexFDO

Authors C. Bauer

Publication date 3 January 2011

Published in Cubo (Temuco) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4067/s0719-06462010000200011

zbMATH Keywords

stationary distributionMarkovian environmentskip-free processes

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Numerical analysis or methods applied to Markov chains (65C40) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Recommendations

• Finite Markov chain models skip-free in one direction
• scientific article; zbMATH DE number 1538062
• An algorithmic approach for a special class of Markov chains
• Uniform algorithm for transient solutions of generalized quasi-birth-death processes
• A novel computational method for solving finite qbd processes

This page was built for publication: A new solution algorithm for skip-free processes to the left

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3061833)