Complexity of Memory-Efficient Kronecker Operations with Applications to the Solution of Markov Models
From MaRDI portal
Publication:4427332
DOI10.1287/IJOC.12.3.203.12634zbMath1040.65504OpenAlexW2107561541MaRDI QIDQ4427332
Peter Kemper, Gianfranco Ciardo, Susanna Donatelli, Peter Buchholz
Publication date: 28 October 2003
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/a276e103aa3054c06451d88f7e0d04cea861ba76
Computational methods for sparse matrices (65F50) Symbolic computation and algebraic computation (68W30)
Related Items (9)
On Vector-Kronecker Product Multiplication with Rectangular Factors ⋮ Model-checking large structured Markov chains. ⋮ Computational Probability for Systems Biology ⋮ Block SOR for Kronecker structured representations ⋮ Symbolic state-space exploration and numerical analysis of state-sharing composed models ⋮ Two-layer symbolic representation for stochastic models with phase-type distributed events ⋮ Integrating simulation and numerical analysis in the evaluation of generalized stochastic Petri nets ⋮ Lumpable continuous-time stochastic automata networks. ⋮ Efficient Decomposition Algorithm for Stationary Analysis of Complex Stochastic Petri Net Models
Uses Software
This page was built for publication: Complexity of Memory-Efficient Kronecker Operations with Applications to the Solution of Markov Models
