Expokit: a software package for computing matrix exponentials

Expokit provides a set of routines aimed at computing matrix exponentials. More precisely, it computes either a small matrix exponential in full, the action of a large sparse matrix exponential on an operand vector, or the solution of a system of linear OBEs with constant inhomogeneity. The backbone of the sparse routines consists of matrix-free Krylov subspace projection methods (Arnoldi and Lanczos processes), and that is why the toolkit is capable of coping with sparse matrices of large dimension. The software handles real and complex matrices and provides specific routines for symmetric and Hermitian matrices. The computation of matrix exponentials is a numerical issue of critical importance in the area of Markov chains and furthermore, the computed solution is subject to probabilistic constraints. In addition to addressing general matrix exponentials, a distinct attention is assigned to the computation of transient states of Markov chains.

[1]  J. D. Lawson.  Generalized Runge-Kutta Processes for Stable Systems with Large Lipschitz Constants , 1967 .

[2]  R. Varga,et al.  Chebyshev rational approximations to e−x in [0, +∞) and applications to heat-conduction problems , 1969 .

[3]  B. Parlett.  A recurrence among the elements of functions of triangular matrices , 1976 .

[4]  C. Loan.  The Sensitivity of the Matrix Exponential , 1977 .

[5]  R. Ward.  Numerical Computation of the Matrix Exponential with Accuracy Estimate , 1977 .

[6]  C. Loan,et al.  Nineteen Dubious Ways to Compute the Exponential of a Matrix , 1978 .

[7]  Steven A. Orszag,et al.  CBMS-NSF REGIONAL CONFERENCE SERIES IN APPLIED MATHEMATICS , 1978 .

[8]  A. Berman.  CHAPTER 2 – NONNEGATIVE MATRICES , 1979 .

[9]  John G. Lewis,et al.  Sparse matrix test problems , 1982, SGNM.

[10]  Marcel F. Neuts,et al.  Matrix-geometric solutions in stochastic models - an algorithmic approach , 1982 .

[11]  R. Varga,et al.  Extended numerical computations on the “1/9” conjecture in rational approximation theory , 1984 .

[12]  B N Parlett,et al.  Development of an Accurate Algorithm for EXP(Bt). Appendix , 1985 .

[13]  R. Varga.  Scientific Computations on Mathematical Problems and Conjectures , 1987 .

[14]  Raymond Mariez,et al.  Performability Analysis Us ing Semi-Markov Reward Processes , 1990 .

[15]  Youcef Saad,et al.  A Basic Tool Kit for Sparse Matrix Computations , 1990 .

[16]  Peter Borwein,et al.  Scientific computation on mathematical problems and conjectures , 1991 .

[17]  Kjell Gustafsson,et al.  Control theoretic techniques for stepsize selection in explicit Runge-Kutta methods , 1991, TOMS.

[18]  Yousef Saad,et al.  Efficient Solution of Parabolic Equations by Krylov Approximation Methods , 1992, SIAM J. Sci. Comput..

[19]  Y. Saad.  Analysis of some Krylov subspace approximations to the matrix exponential operator , 1992 .

[20]  Robert J. Plemmons,et al.  Nonnegative Matrices in the Mathematical Sciences , 1979, Classics in Applied Mathematics.

[21]  Richard Barrett,et al.  Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods , 1994, Other Titles in Applied Mathematics.

[22]  Vladimir Druskin,et al.  Krylov subspace approximation of eigenpairs and matrix functions in exact and computer arithmetic , 1995, Numer. Linear Algebra Appl..

[23]  B. Philippe,et al.  Transient Solutions of Markov Processes by Krylov Subspaces , 1995 .

[24]  D. Stewart,et al.  Error estimates for Krylov subspace approximations of matrix exponentials , 1996 .

[25]  Gene H. Golub,et al.  Matrix computations (3rd ed.) , 1996 .

[26]  B. Roger,et al.  A Survey of Methods for Computing Large Sparse Matrix Exponentials Arising in Markov Chains (cid:3) , 1996 .

[27]  Roger B. Sidje,et al.  Alternatives for parallel Krylov subspace basis computation , 1997, Numer. Linear Algebra Appl..

[28]  C. Lubich,et al.  On Krylov Subspace Approximations to the Matrix Exponential Operator , 1997 .

[29]  Marlis Hochbruck,et al.  Exponential Integrators for Large Systems of Differential Equations , 1998, SIAM J. Sci. Comput..

[30]  W. Stewart,et al.  A numerical study of large sparse matrix exponentials arising in Markov chains 1 1 This work has ben , 1999 .

[31]  K. Meerbergen,et al.  Using Krylov approximations to the matrix exponential operator in Davidson's method , 1999 .