arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1604.07893math.RAcs.NAmath.NA
收藏

矩阵广义逆的高效计算

Highly Efficient Computation of Generalized Inverse of a Matrix

Lehman College of CUNY(纽约市立大学莱曼学院);Universitat Politècnica de València(瓦伦西亚理工大学);The Graduate Center of CUNY(纽约市立大学研究生中心)

V. Y. Pan, F. Soleymani, Liang Zhao

AI总结:

本文提出一种超幂迭代法,通过每次仅七次矩阵乘法实现18阶收敛,显著提升计算效率。算法在稳定性上有所牺牲,但整体效率远超现有稳定迭代方法,适用于Drazin逆、矩形矩阵及线性系统预处理等场景。

摘要:

我们提出了一种超幂迭代法用于数值计算矩阵的外广义逆,通过每次仅七次矩阵乘法实现18阶收敛。这是该计算任务的记录高效率。该算法具有相对温和的数值不稳定性,我们通过在每次迭代循环中增加一次额外的矩阵乘法来稳定它。这导致了一个显著超过已知稳定迭代方法效率的效率指数。我们的数值测试涵盖了Drazin情况、矩形情况以及线性系统预处理等多种示例。测试结果与我们的正式研究一致,表明我们的算法对用户具有吸引力。

英文摘要:

We propose a hyperpower iteration for numerical computation of the outer generalized inverse of a matrix which achieves the 18th order of convergence by using only seven matrix multiplication per iteration loop. This is the record high efficiency for that computational task. The algorithm has a relatively mild numerical instability, and we stabilize it at the price of adding one extra matrix multiplication per iteration loop. This imlplies an efficiency index that significantly exceeds the known record for numerically stable iterations for this task. Our numerical tests cover a variety of examples such as Drazin case, rectangular case, and preconditioning of linear systems. The test results are in good accordance with our formal study and indicate that our algorithms can be of interest for the user.

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

↑