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

具有可变系数的计算矩阵逆的算法

Algorithm with variable coefficients for computing matrix inverses

University of Niš, Faculty of Mechanical Engineering(尼什大学机械工程学院);University of Belgrade, Faculty of Mathematics(贝尔格莱德大学数学系);University of Niš, Faculty of Sciences and Mathematics(尼什大学理学院)

Mihailo Krstić, Marko D. Petković, Kostadin Rajković, Marko Kostadinov

AI总结:

本文提出了一种具有可变系数的高效算法,用于计算矩阵逆,并通过理论分析和数值实验验证了其优化性和稳定性。

摘要:

我们提出了一种通用方案,用于构造新的高效广义Schultz迭代方法以计算逆矩阵。这些方法的形式为$$ X_{k+1} = X_k(a_0^{(k)}I+a_1^{(k)}AX_k),\quad k\in\mathbb{N}, $$其中$A$是实方阵,$a_0^{(k)}$和$a_0^{(k)}$是动态系数。我们将讨论问题的基本情况,而其他情况的公式推导则更为复杂。所构造的方法是优化的,意味着系数在Frobenius范数的意义下被最优选择。我们进行了某些数值测试以验证理论方法。通过方法的构造和数值测试,我们还考虑了数值稳定性。最后,构造的方法在最终形式下是数值稳定且优化的。

英文摘要:

We present a general scheme for the construction of new eficient generalized Schultz iterative methods for computing the inverse matrix. These methods have the form $$ X_{k+1} = X_k(a_0^{(k)}I+a_1^{(k)}AX_k),\quad k\in\mathbb{N}, $$ where $A$ is square real matrix and $a_0^{(k)}$ and $a_0^{(k)}$ are dynamical coefficients. We are going to present basic case of the problem, while formulas are derived analogically in other cases but are more complicated. Constructed method is optimal, meaning that coefficients are chosen in optimal way in terms of Frobenius norm. We have done some numerical testing that confirm theoretical approach. Through construction and numerical testing of method we have considered numerical stability as well. In the end, constructed method in it's final form is numerically stable and optimal.

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

↑