Circulant preconditioners for stochastic automata networks

DOI10.1007/s002110000173zbMath0964.65034MaRDI 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

preconditioning; manufacturing system; iterative solutions; normal equations; queueing networks; Toeplitz matrices; circulant matrices; telecommunication systems; stochastic automata networks; block Gauss-Seidel method; conjugate gradient type methods; overflow queueing systems

Mathematics Subject Classification ID

65F10: Iterative numerical methods for linear systems

65F35: Numerical computation of matrix norms, conditioning, scaling

60K30: Applications of queueing theory (congestion, allocation, storage, traffic, etc.)

Related Items

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