arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1304.1222math.NAcs.NA
收藏

高维线性系统的交替最小能量方法。第二部分:更快的算法及在非对称系统中的应用

Alternating minimal energy methods for linear systems in higher dimensions. Part II: Faster algorithm and application to nonsymmetric systems

Max-Planck-Institut für Mathematik in den Naturwissenschaften(德国马克斯·普朗克自然科学数学研究所);Institute of Numerical Mathematics, Russian Academy of Sciences(俄罗斯科学院计算数学研究所);University of Southampton(南安普顿大学)

Sergey V. Dolgov, Dmitry V. Savostyanov

AI总结:

本文提出一种快速秩自适应求解器,通过交替最小化能量函数并结合基扩展步骤,实现高维对称正定线性系统的高效求解,并推广到非对称系统。

摘要:

在本文中,我们完成了高维张量结构对称正定线性系统的快速秩自适应求解器的开发。在[arXiv:1301.6068]中,通过交替最小化能量函数来处理该问题,我们将其与基于最速下降算法的基扩展步骤相结合。在本文中,我们以每次只处理一个或两个相邻核心的方式组合相同的步骤。该算法的循环解释允许证明全局收敛性并估计收敛速度。我们还提出了几种策略,包括严格的和启发式的,以更有效的方式计算用于基丰富的新子空间。我们在多个高维问题上测试了该算法,包括非对称的Fokker-Planck和化学主方程,对于这些问题,该方法的效率并未得到理论的完全支持。在所有例子中,我们观察到所提方法具有令人信服的快速收敛性和高效率。

英文摘要:

In this paper we accomplish the development of the fast rank-adaptive solver for tensor-structured symmetric positive definite linear systems in higher dimensions. In [arXiv:1301.6068] this problem is approached by alternating minimization of the energy function, which we combine with steps of the basis expansion in accordance with the steepest descent algorithm. In this paper we combine the same steps in such a way that the resulted algorithm works with one or two neighboring cores at a time. The recurrent interpretation of the algorithm allows to prove the global convergence and to estimate the convergence rate. We also propose several strategies, both rigorous and heuristic, to compute new subspaces for the basis enrichment in a more efficient way. We test the algorithm on a number of high-dimensional problems, including the non-symmetrical Fokker-Planck and chemical master equations, for which the efficiency of the method is not fully supported by the theory. In all examples we observe a convincing fast convergence and high efficiency of the proposed method.

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

↑