## Exponential Almost Runge-Kutta Methods for Semilinear Problems

- John Carroll, Eóin O’Callaghan
- 2014

- Published 1998

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 n. It is based on the orthogonal reduction to a tridiagonal form and the Chebyshev uniform approximation of e−x on [0,∞).

### Presentations referencing similar topics