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

大规模结构化矩阵逆的可证明低秩张量列(Tensor-Train)逼近

Provable Low-Rank Tensor-Train Approximations in the Inverse of Large-Scale Structured Matrices

Chuanfu Xiao, Kejun Tang, Zhitao Zhu

AI总结:

本文研究大规模结构化矩阵逆的TT低秩特性,提出可计算验证的充分条件,证明多类PDE对应的微分算子导出矩阵的逆具有低秩TT格式,开发高效TT逆矩阵算法,数值实验验证了理论与方法的有效性。

摘要:

本文研究了一类通常由微分算子离散得到的大规模结构化矩阵的逆在张量列(tensor-train,TT)格式下的低秩特性。我们关注的一个核心问题是:大规模结构化矩阵的逆是否仍能以有精度保证的低秩TT形式表示?本文提出了一种可通过计算验证的充分条件,满足该条件的逆矩阵可被低秩TT格式良好逼近。这一结论不仅明确了哪类结构化矩阵的逆具有低秩TT表示,还启发我们开发了一种高效的基于TT的逆矩阵计算方法。此外,我们证明,对于由泊松(Poisson)方程、玻尔兹曼(Boltzmann)方程、福克-普朗克(Fokker-Planck)方程等若干偏微分方程(PDE)中的微分算子导出的一类大规模结构化矩阵,其逆矩阵确实具有低秩张量格式,因此所提算法适用于求解具有海量自由度的这类PDE。针对泊松方程、玻尔兹曼方程和福克-普朗克方程的数值实验结果,验证了我们理论的正确性以及方法的优势。

英文摘要:

This paper studies the low-rank property of the inverse of a class of large-scale structured matrices in the tensor-train (TT) format, which is typically discretized from differential operators. An interesting question that we are concerned with is: Does the inverse of the large-scale structured matrix still admit the low-rank TT representation with guaranteed accuracy? In this paper, we provide a computationally verifiable sufficient condition such that the inverse matrix can be well approximated in a low-rank TT format. It not only answers what kind of structured matrix whose inverse has the low-rank TT representation but also motivates us to develop an efficient TT-based method to compute the inverse matrix. Furthermore, we prove that the inverse matrix indeed has the low-rank tensor format for a class of large-scale structured matrices induced by differential operators involved in several PDEs, such as the Poisson, Boltzmann, and Fokker-Planck equations. Thus, the proposed algorithm is suitable for solving these PDEs with massive degrees of freedom. Numerical results on the Poisson, Boltzmann, and Fokker-Planck equations validate the correctness of our theory and the advantages of our methodology.

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

↑