Exponentials of symmetric matrices through tridiagonal reductions Original Research Article

A simple and efficient numerical algorithm for computing the exponential of a symmetric matrix is developed in this paper. For an n × n matrix, the required number of operations is around 10/3 n3. It is based on the orthogonal reduction to a tridiagonal form and the Chebyshev uniform approximation of e−x on [0, ∞).