A well-known problem in computing some matrix functions iteratively is a lack of a clear, commonly accepted residual notion. An important matrix function for which this is the case is the matrix exponential. Assume, the matrix exponential of a given matrix times a given vector has to be computed. We interpret the sought after vector as a value of a vector function satisfying the linear system of ordinary differential equations (ODE), whose coefficients form the given matrix. The residual is then defined with respect to the initial-value problem for this ODE system. The residual introduced in this way can be seen as a backward error. We show how the residual can efficiently be computed within several iterative methods for the matrix exponential. This completely resolves the question of reliable stopping criteria for these methods. Furthermore, we show that the residual concept can be used to construct new residual-based iterative methods. In particular, a variant of the Richardson method for the new residual appears to provide an efficient way to restart Krylov subspace methods for evaluating the matrix exponential.
|Place of Publication||Enschede|
|Publisher||University of Twente, Department of Applied Mathematics|
|Number of pages||20|
|Publication status||Published - Nov 2010|
|Name||Memorandum / Department of Applied Mathematics|
|Publisher||Department of Applied Mathematics, University of Twente|
- Stopping criterion
- Richardson iteration
- Matrix exponential
- Matrix cosine
- Backward stability
- Chebyshev polynomials
- Krylov subspace methods
Bochev, M. A. (2010). Residual, restarting and Richardson iteration for the matrix exponential. (Memorandum / Department of Applied Mathematics; No. 1928). Enschede: University of Twente, Department of Applied Mathematics.