计算矩阵自变量的Mittag-Leffler函数
Computing the Mittag-Leffler Function of a Matrix Argument
AI总结:
本文针对方阵自变量的双参数Mittag-Leffler函数计算问题,提出无需导数、基于IEEE双精度算术的方法,结合泰勒级数与带柯西积分的Schur-Parlett技术,精度和效率可比肩现有最优方法,在特征值聚集的矩阵场景表现更优且易扩展。
摘要:
众所周知,双参数Mittag-Leffler(ML,米塔格-莱弗勒)函数在分数阶微积分中发挥着关键作用。本文研究自变量为方阵时该函数的计算问题。现有求解该问题的有效方法要么需要计算高阶导数,要么要求使用混合精度算术。本文提出了一种无需导数、完全基于IEEE标准双精度算术运行的替代方法。当满足特定条件时,我们的方法采用ML函数的泰勒级数表示;若不满足条件,则切换为结合柯西积分公式的Schur-Parlett技术,文中还对合适积分围道的选择进行了详细讨论。本文讨论了所提算法性能相关的理论与数值问题。一组数值实验表明,在IEEE双精度算术下,我们的新方法在精度和CPU时间方面与当前最优方法具有竞争力。对于舒尔分解中存在特征值聚集的大块矩阵,我们的方法性能远优于对比方法。由于该方法无需高效计算高阶导数,还具备易于扩展到其他矩阵函数(如特殊函数)的额外优势。
英文摘要:
It is well-known that the two-parameter Mittag-Leffler (ML) function plays a key role in Fractional Calculus. In this paper, we address the problem of computing this function, when its argument is a square matrix. Effective methods for solving this problem involve the computation of higher order derivatives or require the use of mixed precision arithmetic. In this paper, we provide an alternative method that is derivative-free and works entirely using IEEE standard double precision arithmetic. If certain conditions are satisfied, our method uses a Taylor series representation for the ML function; if not, it switches to a Schur-Parlett technique that will be combined with the Cauchy integral formula. A detailed discussion on the choice of a convenient contour is included. Theoretical and numerical issues regarding the performance of the proposed algorithm are discussed. A set of numerical experiments shows that our novel approach is competitive with the state-of-the-art method for IEEE double precision arithmetic, in terms of accuracy and CPU time. For matrices whose Schur decomposition has large blocks with clustered eigenvalues, our method far outperforms the other. Since our method does not require the efficient computation of higher order derivatives, it has the additional advantage of being easily extended to other matrix functions (e.g., special functions).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。