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

半无限拟Toeplitz $M$-矩阵的平方根算法

Algorithms for square root of semi-infinite quasi-Toeplitz $M$-matrices

Hongjia Chen, Hyun-MIn Kim, Jie Meng

AI总结:

本文研究计算可逆拟Toeplitz $M$-矩阵的保结构平方根,利用单位根求值计算Toeplitz部分,并提出定点迭代和保结构倍化算法计算校正部分,数值实验证明了其高效性。

摘要:

拟Toeplitz $M$-矩阵 $A$ 是一种无限 $M$-矩阵,可写为半无限 Toeplitz 矩阵与一个校正矩阵之和。本文研究计算可逆拟Toeplitz $M$-矩阵的平方根,且该平方根保持拟Toeplitz 结构。我们证明,平方根的 Toeplitz 部分可通过在 $m$ 次单位根处进行求值/插值轻松算出。此优势使我们能提出仅计算校正部分的算法,进而提出定点迭代和保结构倍化算法。此外,我们证明校正部分可通过求解具有限尺寸系数的非线性矩阵方程并随后将解延拓至无穷来近似。数值实验证明了所提算法的效率。

英文摘要:

A quasi-Toeplitz $M$-matrix $A$ is an infinite $M$-matrix that can be written as the sum of a semi-infinite Toeplitz matrix and a correction matrix. This paper is concerned with computing the square root of invertible quasi-Toeplitz $M$-matrices which preserves the quasi-Toeplitz structure. We show that the Toeplitz part of the square root can be easily computed through evaluation/interpolation at the $m$ roots of unity. This advantage allows to propose algorithms solely for the computation of correction part, whence we propose a fixed-point iteration and a structure-preserving doubling algorithm. Additionally, we show that the correction part can be approximated by solving a nonlinear matrix equation with coefficients of finite size followed by extending the solution to infinity. Numerical experiments showing the efficiency of the proposed algorithms are performed.

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

↑