TL;DR
This paper introduces a new, efficient algorithm for computing the action of trigonometric and hyperbolic matrix functions on matrices without explicitly calculating the functions, leveraging existing exponential algorithms for improved stability and speed.
Contribution
The authors develop a novel algorithm that computes multiple matrix functions simultaneously using real arithmetic, enhancing efficiency and stability over previous methods.
Findings
The new algorithm is forward stable.
It outperforms methods based on multiple invocations of expmv.
It can compute cosine, sine, cosh, sinh simultaneously.
Abstract
We derive a new algorithm for computing the action of the cosine, sine, hyperbolic cosine, and hyperbolic sine of a matrix on a matrix , without first computing . The algorithm can compute and simultaneously, and likewise for and , and it uses only real arithmetic when is real. The algorithm exploits an existing algorithm \texttt{expmv} of Al-Mohy and Higham for and its underlying backward error analysis. Our experiments show that the new algorithm performs in a forward stable manner and is generally significantly faster than alternatives based on multiple invocations of \texttt{expmv} through formulas such as .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
