一种计算三角函数和双曲矩阵函数作用的新算法
A New Algorithm for Computing the Actions of Trigonometric and Hyperbolic Matrix Functions
AI总结:
本文提出一种新算法,用于高效计算三角和双曲矩阵函数作用,通过矩阵缩放和切比雪夫多项式递推优化计算效率与精度。
摘要:
本文提出了一种新的算法,用于计算三角函数和双曲函数作用于矩阵的产物,如f(tA)B和f(tA^{1/2})B,其中f为余弦、正弦、双曲余弦、双曲正弦或正弦函数。A为n×n矩阵,B为n×n₀矩阵,其中n₀<<n。A^{1/2}表示A的任意平方根,无需显式计算。算法通过缩放矩阵A并利用切比雪夫多项式递推关系,优化计算成本。数值实验表明,该算法在精度和效率方面优于现有方法。
英文摘要:
A new algorithm is derived for computing the actions $f(tA)B$ and $f(tA^{1/2})B$, where $f$ is cosine, sinc, sine, hyperbolic cosine, hyperbolic sinc, or hyperbolic sine function. $A$ is an $n\times n$ matrix and $B$ is $n\times n_0$ with $n_0 \ll n$. $A^{1/2}$ denotes any matrix square root of $A$ and it is never required to be computed. The algorithm offers six independent output options given $t$, $A$, $B$, and a tolerance. For each option, actions of a pair of trigonometric or hyperbolic matrix functions are simultaneously computed. The algorithm scales the matrix $A$ down by a positive integer $s$, approximates $f(s^{-1}tA)B$ by a truncated Taylor series, and finally uses the recurrences of the Chebyshev polynomials of the first and second kind to recover $f(tA)B$. The selection of the scaling parameter and the degree of Taylor polynomial are based on a forward error analysis and a sequence of the form $\|A^k\|^{1/k}$ in such a way the overall computational cost of the algorithm is optimized. Shifting is used where applicable as a preprocessing step to reduce the scaling parameter. The algorithm works for any matrix $A$ and its computational cost is dominated by the formation of products of $A$ with $n\times n_0$ matrices that could take advantage of the implementation of level-3 BLAS. Our numerical experiments show that the new algorithm behaves in a forward stable fashion and in most problems outperforms the existing algorithms in terms of CPU time, computational cost, and accuracy.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。