A comparison of probabilistic and invariant subspace methods for the block M/G/1 Markov chain
From MaRDI portal
Publication:3407617
DOI10.1007/978-0-387-98096-6_10zbMath1190.60062OpenAlexW2166237822MaRDI QIDQ3407617
Publication date: 4 March 2010
Published in: Springer Optimization and Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-0-387-98096-6_10
fundamental matrixprobabilistic algorithmsalgorithm \(H\)block \(M/G/1\) Markov chaininvariant subspace methods
Computational methods in Markov chains (60J22) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
This page was built for publication: A comparison of probabilistic and invariant subspace methods for the block M/G/1 Markov chain
