Computing the fundamental matrix of an M/G/1–type Markov chain
From MaRDI portal
Publication:3407616
DOI10.1007/978-0-387-98096-6_9zbMATH Open1200.60058OpenAlexW154341005MaRDI QIDQ3407616FDOQ3407616
Authors: Emma Hunt 
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_9
Recommendations
- A probabilistic algorithm for determining the fundamental matrix of a block M/G/1 Markov chain
- scientific article; zbMATH DE number 510835
- A probabilistic interpretation of cyclic reduction and its relationships with logarithmic reduction
- A comparison of probabilistic and invariant subspace methods for the block \(M/G/1\) Markov chain
- Computing the fundamental matrix for a nonirreducible Markov chain
- Computation of Steady-State Probabilities for Infinite-State Markov Chains with Repeating Rows
- A probabilistic algorithm for finding the rate matrix of a block-GI/M/1 Markov chain
- Non-Skip-Free M/G/1 and G/M/1 Type Markov Chains
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Discrete-time Markov processes on general state spaces (60J05)
Cited In (6)
- Computing the Fundamental Matrix for a Reducible Markov Chain
- A probabilistic interpretation of cyclic reduction and its relationships with logarithmic reduction
- A probabilistic algorithm for determining the fundamental matrix of a block M/G/1 Markov chain
- Accurate Computation of the Fundamental Matrix of a Markov Chain
- A comparison of probabilistic and invariant subspace methods for the block \(M/G/1\) Markov chain
- Stable computation with the fundamental matrix of a Markov chain
This page was built for publication: Computing the fundamental matrix of an M/G/1–type Markov chain
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3407616)
