Double-shift-invert Arnoldi method for computing the matrix exponential (Q1756729)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6996768
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Double-shift-invert Arnoldi method for computing the matrix exponential |
scientific article; zbMATH DE number 6996768 |
Statements
Double-shift-invert Arnoldi method for computing the matrix exponential (English)
0 references
21 December 2018
0 references
This paper develops a double shift Arnoldi process and error bounds for approximating the matrix exponential as needed to solve evolution DEs. Its aim is to deal with DEs in large sparse discretized form for $10^6$ by $10^6$ or larger matrices. Numerical tests compare this method to and its advantages over single shift Arnoldi regarding the respective accuracies, run times, and needed iterations. The interested reader might also want to consult the multi shift Arnoldi process of \textit{M. S. Pranić} et al. [Numer. Linear Algebra Appl. 23, No. 6, 1007--1022 (2016; Zbl 1424.65042)].
0 references
double shift Arnoldi
0 references
matrix exponential
0 references
evolution differential equation
0 references
0 references
0 references
0.7899296879768372
0 references
0.7708232998847961
0 references
0.7684502601623535
0 references
0.762479305267334
0 references
0.7558794617652893
0 references
