Residual, restarting, and Richardson iteration for the matrix exponential (Q2847717)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Residual, restarting, and Richardson iteration for the matrix exponential |
scientific article; zbMATH DE number 6207526
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Residual, restarting, and Richardson iteration for the matrix exponential |
scientific article; zbMATH DE number 6207526 |
Statements
11 September 2013
0 references
matrix exponential
0 references
residual
0 references
Krylov subspace methods
0 references
restarting
0 references
Chebyshev polynomials
0 references
stopping criterion
0 references
Richardson iteration
0 references
backward stability
0 references
matrix cosine
0 references
numerical examples
0 references
Residual, restarting, and Richardson iteration for the matrix exponential (English)
0 references
The matrix exponential residual within Krylov subspace methods is explained. Then, it is shown how the Chebyshev iterations can be modified to adopt the residual control. This is followed by the presentation of some simple residual-based error estimates and the Richardson iteration for the matrix exponential. Numerical tests show that the proposed residual notion provides a reliable stopping criterion for the iterative methods for computing the matrix exponential. This resolves the question of reliable stopping criteria for these methods. Furthermore, the residual concept seems to set up a whole framework for a new class of methods for evaluating the matrix exponential. Some basic methods of this class are proposed.
0 references