Computing performability measures in Markov chains by means of matrix functions
From MaRDI portal
Publication:2292012
Recommendations
Cites work
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- Analysis of queueing networks with blocking
- Computing the action of the matrix exponential, with an application to exponential integrators
- Decay bounds for the numerical quasiseparable preservation in matrix functions
- Decay properties for functions of matrices over \(C^\ast\)-algebras
- Efficient and stable Arnoldi restarts for matrix functions based on quadrature
- Efficient cyclic reduction for quasi-birth-death problems with rank structured blocks
- Exponential Integrators for Large Systems of Differential Equations
- Functions of Matrices
- Implementation of a restarted Krylov subspace method for the evaluation of matrix functions
- M-matrix characterizations. I: nonsingular M-matrices
- Markov and Markov reward model transient analysis: An overview of numerical approaches
- Network analysis via partial spectral factorization and Gauss quadrature
- Network properties revealed through matrix functions
- Novel numerical methods for solving the time-space fractional diffusion equation in two dimensions
- On Evaluating the Performability of Degradable Computing Systems
- On the decay of the off-diagonal singular values in cyclic reduction
- PARAEXP: a parallel integrator for linear initial-value problems
- Riemannian geometry for the statistical analysis of diffusion tensor data
- The numerical range is a \((1+\sqrt{2})\)-spectral set
- Transient analysis of cumulative measures of markov model behavior
Cited in
(2)
This page was built for publication: Computing performability measures in Markov chains by means of matrix functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292012)