Green矩阵拟可分表示的计算
Computation of quasiseparable representations of Green matrices
AI总结:
基于Asplund定理,本文首次推导出以线性复杂度计算带状矩阵逆的拟可分表示的算法,并通过数值实验验证了复杂度与稳定性。
摘要:
著名的Asplund定理指出,(可能单侧的)带状矩阵$A$的逆是Green矩阵。根据拟可分理论,这样的矩阵在其秩结构部分允许拟可分表示。基于此思想,我们推导出以线性复杂度计算$A^{-1}$拟可分表示的算法。文献中存在许多带状矩阵求逆算法。然而,基于通过Asplund定理在理论上进行秩结构计算的算法在本文中首次出现。数值实验证实了复杂度估计,并提供了对稳定性的见解。
英文摘要:
The well-known Asplund theorem states that the inverse of a (possibly one-sided) band matrix $A$ is a Green matrix. In accordance with quasiseparable theory, such a matrix admits a quasiseparable representation in its rank-structured part. Based on this idea, we derive algorithms that compute a quasiseparable representation of $A^{-1}$ with linear complexity. Many inversion algorithms for band matrices exist in the literature. However, algorithms based on a computation of the rank structure performed theoretically via the Asplund theorem appear for the first time in this paper. Numerical experiments confirm complexity estimates and offer insight into stability properties.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。