Block SOR for Kronecker structured representations
DOI10.1016/j.laa.2003.12.017zbMath1055.65014OpenAlexW2111424439MaRDI QIDQ1434413
Publication date: 4 August 2004
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/27455
Markov chainsnumerical experimentsLU factorizationGauss-Seidel methodblock successive over-relaxationcolumn approximate minimum degree ordering algorithmhierarchical Markovian modelsKronecker based numerical techniquesreal Schur factorization
Computational methods in Markov chains (60J22) Numerical analysis or methods applied to Markov chains (65C40) Iterative numerical methods for linear systems (65F10) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Iterative methods based on splittings for stochastic automata networks
- A class of hierarchical queueing networks and their analysis
- The ubiquitous Kronecker product
- Structured analysis approaches for large Markov chains
- Lumpable continuous-time stochastic automata networks.
- Matrix Algorithms
- Efficient descriptor-vector multiplications in stochastic automata networks
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Superposed stochastic automata: a class of stochastic Petri nets with parallel solution and distributed state space
- Complexity of Memory-Efficient Kronecker Operations with Applications to the Solution of Markov Models
- Comparison of Partitioning Techniques for Two-Level Iterative Solvers on Large, Sparse Markov Chains
- Asynchronous composition of high level Petri Nets: A quantitative approach
- A column approximate minimum degree ordering algorithm
- Algorithm 836
This page was built for publication: Block SOR for Kronecker structured representations
