论文信息 - Inexact uniformization and GMRES methods for large Markov chains

Inexact uniformization and GMRES methods for large Markov chains

SUMMARY Inexact algorithms allow certain operations (typically matrix–vector products or certain function evaluations) to be performed inexactly, either out of necessity or deliberately, in view of trading accuracy for speed. We review recent findings that show the impact of the inexact approach in the uniformization and generalized minimal residual (GMRES) methods when computing the transient, stationary, and cumulative solutions of realistic Markov chain problems of large size arising from computer systems and biochemical reactions. Copyright © 2011 John Wiley & Sons, Ltd.

Roger B. Sidje | R. B. Sidje

[1] Yousef Saad,et al. Numerical Methods in Markov Chain Modelling , 1996 .

[2] Roger B. Sidje,et al. Evaluation of the performance of inexact GMRES , 2011, J. Comput. Appl. Math..

[3] Valeria Simoncini,et al. Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing , 2003, SIAM J. Sci. Comput..

[4] Gerard L. G. Sleijpen,et al. Inexact Krylov Subspace Methods for Linear Systems , 2004, SIAM J. Matrix Anal. Appl..

[5] Roger B. Sidje,et al. Inexact Uniformization Method for Computing Transient Distributions of Markov Chains , 2007, SIAM J. Sci. Comput..

[6] R. Chan. Iterative methods for overflow queuing models II , 1988 .

[7] Valérie Frayssé,et al. Inexact Matrix-Vector Products in Krylov Methods for Solving Linear Systems: A Relaxation Strategy , 2005, SIAM J. Matrix Anal. Appl..

[8] Nicholas J. Higham,et al. Functions of matrices - theory and computation , 2008 .

[9] T. Y. WilliamJ,et al. Numerical Methods in Markov Chain Modeling , 1992, Operational Research.

[10] Roger B. Sidje,et al. Expokit: a software package for computing matrix exponentials , 1998, TOMS.