This is the authors' abstract. We don't add key points for this paper.
This article considers the computation of the matrix exponential <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:msup> <m:mrow> <m:mi mathvariant="normal">e</m:mi> </m:mrow> <m:mrow> <m:mi>A</m:mi> </m:mrow> </m:msup> </m:math> {{e}}A with numerical quadrature. Although several quadrature-based algorithms have been proposed, they focus on (near) Hermitian matrices. In order to deal with non-Hermitian matrices, we use another integral representation including an oscillatory term and consider applying the double exponential (DE) formula specialized to Fourier integrals. The DE formula transforms the given integral into another integral whose interval is infinite, and therefore, it is necessary to truncate the infinite interval. In this article, to utilize the DE formula, we analyze the truncation error and propose two algorithms. The first one approximates <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:msup> <m:mrow> <m:mi mathvariant="normal">e</m:mi> </m:mrow> <m:mrow> <m:mi>A</m:mi> </m:mrow> </m:msup> </m:math> {{e}}A with the fixed mesh size, which is a parameter in the DE formula affecting the accuracy. The second one computes <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:msup> <m:mrow> <m:mi mathvariant="normal">e</m:mi> </m:mrow> <m:mrow> <m:mi>A</m:mi> </m:mrow> </m:msup> </m:math> {{e}}A based on the first one with automatic selection of the mesh size depending on the given error tolerance.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Tatsuoka et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: