A Tensor Sum Preconditioner for Stochastic Automata Networks

Published Online:https://doi.org/10.1287/ijoc.1070.0236

References

  • Atif K. Modelisation du parallelism et de la synchronisation. (1991) . PhD thesis, l'Institut National Polytechnique de Grenoble, Grenolde, FranceGoogle Scholar
  • Atif K., Plateau B. Stochastic automata network for modeling parallel systems. IEEE Trans. Software Engrg. (1991) 17:1093–1108CrossrefGoogle Scholar
  • Bartels R. H., Stewart G. W. Algorithm 432: The solution of the matrix equation AX − XB =C. Comm. ACM (1972) 8:820–826CrossrefGoogle Scholar
  • Benoit A., Plateau B., Stewart W. J., Fernandes P. On the benefits of using functional transition in Kronecker algebra. Performance Eval. (2004) 58:367–390CrossrefGoogle Scholar
  • Buchholz P., Plateau B., Stewart W., Silva M. Projection methods for the analysis of stochastic automata networks. Numerical Solutions for Markov Chains (1999a) (Prensas Universitarias de Zaragoza, Zaragoza, Spain) 149–168Google Scholar
  • Buchholz P. Structured analysis approaches for large Markov chains. Appl. Numer. Math. (1999b) 31:375–404CrossrefGoogle Scholar
  • Chan R. H., Ching W. K. Circulant preconditioners for stochastic automata networks. Numerische Mathematik (2000) 87:35–57CrossrefGoogle Scholar
  • Fernandes P., Plateau B., Stewart W. J. Efficient descriptor-vector multiplication in stochastic automata networks. J. ACM (1998) 3:381–414CrossrefGoogle Scholar
  • Ipsen I. C. F., Meyer C. D. Uniform stability of Markov chains. SIAM J. Matrix Anal. Appl. (1994) 15:1061–1074CrossrefGoogle Scholar
  • Langville A. Preconditioning for stochastic automata networks. (2002) . PhD Thesis, Department of Computer Science, North Carolina State University, RaleighGoogle Scholar
  • Langville A., Stewart W. A Kronecker product approximate preconditioner for SANs. Numer. Linear Algebra Appl. (2004) 11:723–752CrossrefGoogle Scholar
  • O'Cinneide C. A. Entrywise perturbation theory and error analysis for Markov chains. Numerishe Mathematik (1993) 65:109–120CrossrefGoogle Scholar
  • Philippe B., Saad Y., Stewart W. J. Numerical methods in Markov chain modeling. Oper. Res. (1992) 40:1156–1179LinkGoogle Scholar
  • Plateau B. On the stochastic structure of parallelism and synchronization models for distributed algorithms. Proc. ACM SIGMETRICS Conf. Measurement and Modeling of Comput. Systems (1985) (ACM Press, New York) 147–154CrossrefGoogle Scholar
  • Plateau B., Puigjaner R., Potier D. PEPS: A 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., Stewart W. J., Grassmann W. K. Stochastic automata networks. Computational Probability (2000) (Kluwer Academic Publishers, Boston) CrossrefGoogle Scholar
  • Saad Y. Krylov subspace methods for solving unsymmetrical linear systems. Math. Comput. (1981) 37:105–126CrossrefGoogle Scholar
  • Saad Y., Shultz M. H. GMRES: A generalized minimal residual algorithm for solving non-symmetric linear systems. SIAM J. Sci. Stat. Comput. (1986) 7:856–869CrossrefGoogle Scholar
  • Stewart G. W. Stochastic automata, tensors operation, and matrix formulas. (1996) . Technical Report CS-TR-3598, Department of Computer Science, University of Maryland, College ParkGoogle Scholar
  • Stewart W. J.An Introduction to the Numerical Solution of Markov Chains (1994) (Princeton University Press, Princeton, NJ) Google Scholar
  • Stewart W., Atif K., Plateau B. The numerical solution of stochastic automata networks. Eur. J. Oper. Res. (1995) 86:503–525CrossrefGoogle Scholar
  • Touzene A., Al-Yahyai S., Day K., Arafeh B. Load balancing grid computing middleware. Proc. Internat. Conf. Web Technologies, Appl., Services, Calgary (2005) Alberta, Canada(IASTED/ACTA Press, Calgary, AB, Canada) 29–34Google Scholar
  • Uysal E., Dayar T. Iterative methods based on splitting for stochastic automata networks. Eur. J. Oper. Res. (1998) 110:166–186CrossrefGoogle Scholar
  • Van Loan C. F. The ubiquitous Kronecker product. J. Computational Appl. Math. (2000) 123:85–100CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.