Answers are grounded in this paper and cite their sources.
Proposed method demonstrates near-machine accuracy in evaluating φ-function actions, suggesting improved reliability over existing Krylov-based algorithms.
We propose a matrix-free algorithm for evaluating linear combinations of $φ$-function actions, wᵢ := ∑ⱼ₌₀ᵖ αᵢ\,j\,φⱼ(tᵢ A)vⱼ for i=1 r, arising in exponential integrators. The method combines the scaling and recovering method with a truncated Taylor series, choosing a spectral shift and a scaling parameter by minimizing a power-based objective of the shifted operator. Accuracy is user-controlled and ultimately limited by the working precision. The algorithm decouples the stage abscissae tᵢ from the polynomial weights αᵢʲ, and a block variant enables simultaneous evaluation of ᵢ\ᵢ₌₁ʳ. Across standard benchmarks, including stiff and highly nonnormal matrices, the algorithm attains near-machine accuracy (IEEE double precision in our tests) for small step sizes and maintains reliable accuracy for larger steps where several existing Krylov-based algorithms deteriorate, providing a favorable balance of reliability and computational cost.
No takes yet. Share an insight, caveat, or question.
Awad H. Al-Mohy (2025) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: