William Stewart

A first course in probability

[Place of publication not identified]: [CreateSpace Independent Publishing Platform].

An algebraic condition for product form in stochastic automata networks without synchronizations

Performance Evaluation, 65(11-12), 854–868.

Phase-type distributions in stochastic automata networks

European Journal of Operational Research, 186(3), 1008–1028.

Memory-efficient Kronecker algorithms with applications to the modelling of parallel systems

Future Generations Computer Systems, 22(7), 838–847.

Kronecker product approximate preconditioner for SANs

Numerical Linear Algebra With Applications, 11(09-Aug), 723–752.

On the benefits of using functional transitions and Kronecker algebra

Performance Evaluation, 58(4), 367–390.

Special issue devoted to papers presented at the Conference on the Numerical Solution of Markov Chains 2003 - Preface

Linear Algebra and Its Applications, 386(Jul 15 2004), 02-.

Testing the nearest Kronecker product preconditioner on Markov chains and stochastic automata networks

INFORMS Journal on Computing, 16(3), 300–315.

The Kronecker product and stochastic automata networks

Journal of Computational and Applied Mathematics, 167(2), 429–447.

The PEPS software tool

In Computer performance evaluation: Modelling techniques and tools: 13th international conference, TOOLS 2003, Urbana, IL, USA, September 2-5, 2003 (Vol. 2794, pp. 98–115).

Fast simulation for road traffic network

RAIRO. Recherche Operationnelle = Operations Research, 35(2), 229–250.

Comparison of partitioning techniques for two-level iterative solvers on large, sparse Markov chains

SIAM Journal on Scientific Computing, 21(5), 1691–1705.

Numerical analysis methods

In Performance evaluation: Origins and directions (Vol. 1769, pp. 355–376).

A numerical study of large sparse matrix exponentials arising in Markov chains

Computational Statistics & Data Analysis, 29(3), 345–368.

Cornelius Lanczos: Collected published papers with commentaries

Raleigh, NC: College of Physical and Mathematical Sciences, North Carolina State University.

Efficient descriptor-vector multiplications in stochastic automata networks

Journal of the Association for Computing Machinery, 45(3), 381–414.

Optimizing tensor product computations in stochastic automata networks

RAIRO. Recherche Operationnelle = Operations Research, 32(3), 325–351.

Quasi lumpability, lower-bounding coupling matrices, and nearly completely decomposable Markov chains

SIAM Journal on Matrix Analysis and Applications, 18(2), 482–498.

Computations with Markov chains: Proceedings of the 2nd International Workshop on the Numerical Solution of Markov Chains

Boston: Kluwer Academic Publishers.