Approximating the phi-function action on linear combinations of Krylov bases

From MaRDI portal





This interesting paper studies approximating the phi-function action on linear combinations of Krylov bases. To set the scene, let \(\phi(z):=\frac{\exp(z)-1}{z}.\) This is the well known \(\phi\) function which appears in many places for example in exponential-type integrators for differential equations, in the representation of multiple integrals involving matrix exponentials and in many other places. In high dimensional integrals or in large systems of equations, the action of \(\phi\) is typically computed through Krylov-subspace methods and in many cases, the same operator acts on different vectors typically implying the use of Arnoldi algorithms and in this case, natural questions come to mind as in, is it possible to reduce the number of calls to the Arnoldi algorithm and under what conditions. The authors of the paper show that the computation of the \(\phi\) action on different vectors can be carried out with a single Arnoldi algorithm in the case that these vectors are linear combinations of Krylov bases. Errors and approximations are studied on specific examples.\N\NThe paper is well written with a good set of references.











This page was built for publication: Approximating the phi-function action on linear combinations of Krylov bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6898820)