A Tensor Sum Preconditioner for Stochastic Automata Networks
Published Online:26 Nov 2007https://doi.org/10.1287/ijoc.1070.0236
References
- Modelisation du parallelism et de la synchronisation. (1991) . PhD thesis, l'Institut National Polytechnique de Grenoble, Grenolde, FranceGoogle Scholar
- Stochastic automata network for modeling parallel systems. IEEE Trans. Software Engrg. (1991) 17:1093–1108Crossref, Google Scholar
- Algorithm 432: The solution of the matrix equation AX − XB =C. Comm. ACM (1972) 8:820–826Crossref, Google Scholar
- On the benefits of using functional transition in Kronecker algebra. Performance Eval. (2004) 58:367–390Crossref, Google Scholar
- , 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
- Structured analysis approaches for large Markov chains. Appl. Numer. Math. (1999b) 31:375–404Crossref, Google Scholar
- Circulant preconditioners for stochastic automata networks. Numerische Mathematik (2000) 87:35–57Crossref, Google Scholar
- Efficient descriptor-vector multiplication in stochastic automata networks. J. ACM (1998) 3:381–414Crossref, Google Scholar
- Uniform stability of Markov chains. SIAM J. Matrix Anal. Appl. (1994) 15:1061–1074Crossref, Google Scholar
- Preconditioning for stochastic automata networks. (2002) . PhD Thesis, Department of Computer Science, North Carolina State University, RaleighGoogle Scholar
- A Kronecker product approximate preconditioner for SANs. Numer. Linear Algebra Appl. (2004) 11:723–752Crossref, Google Scholar
- Entrywise perturbation theory and error analysis for Markov chains. Numerishe Mathematik (1993) 65:109–120Crossref, Google Scholar
- Numerical methods in Markov chain modeling. Oper. Res. (1992) 40:1156–1179Link, Google Scholar
- 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–154Crossref, Google Scholar
- , 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
- , Grassmann W. K. Stochastic automata networks. Computational Probability (2000) (Kluwer Academic Publishers, Boston) Crossref, Google Scholar
- Krylov subspace methods for solving unsymmetrical linear systems. Math. Comput. (1981) 37:105–126Crossref, Google Scholar
- GMRES: A generalized minimal residual algorithm for solving non-symmetric linear systems. SIAM J. Sci. Stat. Comput. (1986) 7:856–869Crossref, Google Scholar
- Stochastic automata, tensors operation, and matrix formulas. (1996) . Technical Report CS-TR-3598, Department of Computer Science, University of Maryland, College ParkGoogle Scholar
- An Introduction to the Numerical Solution of Markov Chains (1994) (Princeton University Press, Princeton, NJ) Google Scholar
- The numerical solution of stochastic automata networks. Eur. J. Oper. Res. (1995) 86:503–525Crossref, Google Scholar
- 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
- Iterative methods based on splitting for stochastic automata networks. Eur. J. Oper. Res. (1998) 110:166–186Crossref, Google Scholar
- The ubiquitous Kronecker product. J. Computational Appl. Math. (2000) 123:85–100Crossref, Google Scholar

