Testing the Nearest Kronecker Product Preconditioner on Markov Chains and Stochastic Automata Networks

References

• Benzi M., Tuma M. A parallel solver for large-scale Markov chains. Appl. Numer. Math. (2002) 41:135–153Crossref, Google Scholar
• Brown P. H. Walker. GMRES on (nearly) singular systems. SIAM J. Matrix Anal. (1997) 18:37–51Crossref, Google Scholar
• Buchholz P., Plateau B., Stewart W. J., Silva M. Projection methods for the analysis of stochastic automata networks. Numerical Solution of Markov Chains (1999) (Prensas Universitarias de Zaragoza, Zaragoza, Spain) 149–168Google Scholar
• Buchholz P., Ciardo G., Donatelli S., Kemper P. Complexity of memory-efficient Kronecker operations with applications to the solution of Markov models. INFORMS J. Comput. (2000) 12:203–222Link, Google Scholar
• Cao Z. A note on the convergence behavior of GMRES. Appl. Numer. Math. (1997) 25:13–20Crossref, Google Scholar
• Dayar T. State space orderings for Gauss-Seidel in Markov chains revisited. SIAM J. Sci. Comput. (1998) 19:148–154Crossref, Google Scholar
• Fernandes P., Plateau B., Stewart W. J. Efficient descriptor-vector multiplications in stochastic automata networks. J. Association Comput. Machinery (1998) 45:381–414Crossref, Google Scholar
• Freund R. W., Hochbruck M. On the use of two QMR algorithms for solving singular systems and applications in Markov chain modeling. Numer. Linear Algebra Appl. (1994) 1:1–7Crossref, Google Scholar
• Golub G. H., Luk F., Overton M. A block Lanczos method for computing the singular values and corresponding singular vectors of a matrix. ACM Trans. Math. Software (1981) 7:149–169Crossref, Google Scholar
• Greenbaum A.Iterative Methods for Solving Linear Systems (1997) (SIAM, Philadelphia, PA) Crossref, Google Scholar
• Ipsen I. C. F. Expressions and bounds for the residual in GMRES. BIT (2000) 40:524–533Crossref, Google Scholar
• Ipsen I. C. F., Meyer C. D. Uniform stability of Markov chains. SIAM J. Matrix Anal. Its Appl. (1994) 15:1061–1074Crossref, Google Scholar
• Krieg G. N., Kuhn H. A decomposition method for multi-product kanban systems with setup times and lost sales. IEE Trans. (2002) 34:613–625Crossref, Google Scholar
• Langville A. N. Preconditioning for Stochastic Automata Networks. (2002) . Ph.D. thesis, Operations Research Program, North Carolina State University, Raleigh, NCGoogle Scholar
• Langville A. N., Stewart W. J. A Kronecker product approximate inverse preconditioner for SANs. Numer. Linear Algebra Appl. (2002) . ForthcomingGoogle Scholar
• O'Cinneide C. A. Entrywise perturbation theory and error analysis for Markov chains. Numerische Mathematik (1993) 65:109–120Crossref, Google Scholar
• Philippe B., Saad Y., Stewart W. J. Numerical methods in Markov chain modeling. Oper. Res. (1992) 40:1156–1179Link, Google Scholar
• Pitsianis N., Van Loan C., Moonen M. S., Golub G. H. Approximation with Kronecker products. Linear Algebra for Large Scale and Real Time Applications (1993) (Kluwer Publications, Dordrecht, The Netherlands) 293–314Google Scholar
• Plateau B. On the stochastic structure of parallelism and synchronization models for distributed algorithms. Performance Evaluation Rev. (1985) 13:142–154Crossref, Google Scholar
• Plateau B., Puigjaner R., Potier D. PEPS: Package for solving complex Markov models of parallel systems. Modelling Techniques and Tools for Computer Performance Evaluation (1990) (Plenum Press, New York) 291–306Google Scholar
• Plateau B., Fourneau J. M. A methodology for solving Markov models of parallel systems. J. Parallel Distributed Comput. (1991) 12:370–387Crossref, Google Scholar
• Plateau B., Stewart W. J., Fernandes P. On the benefits of using functional transitions in Kronecker modelling. Performance Evaluation (2001) . ForthcomingGoogle Scholar
• Rouskas G. N., Halim Zaim A., Perros H. G. Computing call blocking probabilities in LEO satellite networks: The single orbit case. IEEE Trans. Vehicular Technology (2002) 51:332–347Crossref, Google Scholar
• Saad Y., Stewart W. J. Preconditioned Krylov subpace methods for the numerical solution of Markov chains. Computations with Markov Chains (1995) (Kluwer Academic, Boston, MA) 49–64Crossref, Google Scholar
• Stewart W. J.Introduction to the Numerical Solution of Markov Chains (1994) (Princeton University Press, Princeton, NJ) Google Scholar
• Stewart W. J. (2003) . http://www.csc.ncsu.edu/faculty/WStewart/index.htmlGoogle Scholar
• Stewart W. J., Atif K., Plateau B. The numerical solution of stochastic automata networks. Eur. J. Oper. Res. (1995) 86:503–525Crossref, Google Scholar
• Toh K. GMRES vs. ideal GMRES. SIAM J. Matrix Anal. Appl. (1997) 18:30–36Crossref, Google Scholar
• Uysal E., Dayar T. Iterative methods based on splittings for stochastic automata networks. Eur. J. Oper. Res. (1998) 110:166–186Crossref, Google Scholar