arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0707.2701math.NAcs.DScs.NA
收藏

计算矩阵对数的定点迭代法

A fixed point iteration for computing the matrix logarithm

Technische Universität Dresden(德累斯顿工业大学)

Gernot Schaller

AI总结:

针对矩阵对数计算问题,提出一种基于逐次矩阵指数计算的新算法,并证明其收敛性及初始矩阵的优选策略。

摘要:

在应用数值计算的各个领域,都会出现计算矩阵 A 的对数的问题。由于对数的级数展开通常对于远离单位矩阵的矩阵收敛不佳,标准数值方法会计算逐次平方根。本文提出一种新算法,该算法依赖于逐次矩阵指数的计算。对于一大类初始矩阵,证明了该方法的收敛性,并讨论了初始矩阵的有利选择。

英文摘要:

In various areas of applied numerics, the problem of calculating the logarithm of a matrix A emerges. Since series expansions of the logarithm usually do not converge well for matrices far away from the identity, the standard numerical method calculates successive square roots. In this article, a new algorithm is presented that relies on the computation of successive matrix exponentials. Convergence of the method is demonstrated for a large class of initial matrices and favorable choices of the initial matrix are discussed.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑