Circulant preconditioners for stochastic automata networks
DOI10.1007/S002110000173zbMATH Open0964.65034OpenAlexW2068712394MaRDI QIDQ1590184FDOQ1590184
Authors: Raymond H. Chan, Wai-Ki Ching 
Publication date: 26 June 2001
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10722/75198
Recommendations
- Circulant approximation for preconditioning in stochastic automata networks
- Toeplitz-Circulant Preconditioners for Toeplitz Systems and their Applications to Queueing Networks with Batch Arrivals
- scientific article; zbMATH DE number 2103887
- A tensor sum preconditioner for stochastic automata networks
- Multipreconditioned GMRES for simulating stochastic automata networks
preconditioningnormal equationscirculant matricesstochastic automata networksiterative solutionsqueueing networksToeplitz matricesblock Gauss-Seidel methodmanufacturing systemtelecommunication systemsconjugate gradient type methodsoverflow queueing systems
Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)
Cited In (14)
- A tensor sum preconditioner for stochastic automata networks
- Multipreconditioned GMRES for simulating stochastic automata networks
- Exact algorithms for singular tridiagonal systems with applications to Markov chains
- Iterative methods for overflow queuing models. II
- A Kronecker product approximate preconditioner for SANs
- Multigrid algorithm from cyclic reduction for Markovian queueing networks
- Triangular and skew-symmetric splitting method for numerical solutions of Markov chains
- Explicit form of the inverse matrices of tribonacci circulant type matrices
- Testing the nearest Kronecker product preconditioner on Markov chains and stochastic automata networks
- Boundary value methods for solving transient solutions of Markovian queueing networks
- Steady state probability vector of positive definite regularized linear systems of circulant stochastic matrices
- Circulant approximation for preconditioning in stochastic automata networks
- Lumpable continuous-time stochastic automata networks.
- A minimum residual algorithm for solving linear systems
This page was built for publication: Circulant preconditioners for stochastic automata networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1590184)
