Circulant preconditioners for stochastic automata networks

DOI10.1007/s002110000173zbMath0964.65034OpenAlexW2068712394MaRDI QIDQ1590184

Wai-Ki Ching, Raymond Honfu Chan

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

zbMATH Keywords

preconditioningmanufacturing systemiterative solutionsnormal equationsqueueing networksToeplitz matricescirculant matricestelecommunication systemsstochastic automata networksblock Gauss-Seidel methodconjugate gradient type methodsoverflow queueing systems

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items (9)

Boundary value methods for solving transient solutions of Markovian queueing networks ⋮ Explicit form of the inverse matrices of tribonacci circulant type matrices ⋮ Steady state probability vector of positive definite regularized linear systems of circulant stochastic matrices ⋮ Triangular and skew-symmetric splitting method for numerical solutions of Markov chains ⋮ A minimum residual algorithm for solving linear systems ⋮ Multipreconditioned GMRES for simulating stochastic automata networks ⋮ Exact algorithms for singular tridiagonal systems with applications to Markov chains ⋮ Multigrid algorithm from cyclic reduction for Markovian queueing networks ⋮ Lumpable continuous-time stochastic automata networks.

This page was built for publication: Circulant preconditioners for stochastic automata networks