The Scaling, Splitting and Squaring Method for the Exponential of Perturbed Matrices

Abstract

We propose splitting methods for the computation of the exponential of perturbed matrices which can be written as the sum $A=D+\epsilon B$ of a sparse and efficiently exponentiable matrix $D$ with sparse exponential $e^D$ and a dense matrix $\epsilon B$ which is of small norm in comparison with $D$. The predominant algorithm is based on scaling the large matrix $A$ by a small number $2^{-s}$, which is then exponentiated by efficient Padé or Taylor methods and finally squared in order to obtain an approximation for the full exponential. In this setting, the main portion of the computational cost arises from dense-matrix multiplications and we present a modified squaring which takes advantage of the smallness of the perturbed matrix $B$ in order to reduce the number of squarings necessary. Theoretical results on local error and error propagation for splitting methods are complemented with numerical experiments and show a clear improvement over existing methods when medium precision is sought.

20 pages, 6 figures, as submitted to journal

References in corpus (1)

• An efficient algorithm for computing the Baker-Campbell-Hausdorff series and some of its applications

Cited by in corpus (1)

• An improved algorithm to compute the exponential of a matrix