Circulant approximation for preconditioning in stochastic automata networks

DOI10.1016/S0898-1221(99)00341-7zbMath0954.68088OpenAlexW2047098538MaRDI QIDQ1570136

Wai-Ki Ching, Xun Yu Zhou

Publication date: 20 September 2000

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(99)00341-7

zbMATH Keywords

conjugate gradientstochastic automata networks

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Uses Software

• CGS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Iterative methods for overflow queueing models. I
• A class of hierarchical queueing networks and their analysis
• Circulant preconditioners for failure prone manufacturing systems
• The numerical solution of stochastic automata networks
• An inventory model for manufacturing systems with delivery time guarantees.
• Optimal trigonometric preconditioners for elliptic and queueing problems
• Iterative methods for manufacturing systems of two stations in tandem
• Matrix Analysis
• Approximations for the time spent in a dynamic job shop with applications to due-date assignment
• CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
• Performance analysis of leaky-bucket bandwidth enforcement strategy for bursty traffics in an ATM network
• Toeplitz-Circulant Preconditioners for Toeplitz Systems and their Applications to Queueing Networks with Batch Arrivals

This page was built for publication: Circulant approximation for preconditioning in stochastic automata networks