arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1810.03398stat.COcs.NAmath.NA
收藏

概率线性求解器:一种统一的观点

Probabilistic Linear Solvers: A Unifying View

University of Tübingen(蒂宾根大学);Max Planck Institute for Intelligent Systems(马克斯·普朗克智能系统研究所)

Simon Bartels, Jon Cockayne, Ilse C. F. Ipsen, Philipp Hennig

AI总结:

本文提出了一种统一的概率线性求解器框架,通过概率方法将不同线性系统求解方法统一起来,并介绍了概率求解器与投影方法之间的联系,以及预处理的概率视角。

摘要:

近年来,一些工作发展了一种新的概率解释,用于数值算法求解线性系统,其中解决方案在贝叶斯框架下被推断,无论是直接推断还是通过推断未知矩阵逆的作用。这些方法通常专注于复制共轭梯度法作为典型迭代方法的行为。在本文中,作者提出了令人惊讶的一般等价条件,将这些不同的方法统一起来。我们还描述了概率线性求解器与线性系统投影方法之间的联系,为更广泛的迭代方法类提供了概率解释。特别是,这为广义最小余数法提供了这样的解释。还引入了概率视角的预处理。这些发展统一了概率线性求解器的文献,并与线性系统迭代求解器的文献建立了基础联系。

英文摘要:

Several recent works have developed a new, probabilistic interpretation for numerical algorithms solving linear systems in which the solution is inferred in a Bayesian framework, either directly or by inferring the unknown action of the matrix inverse. These approaches have typically focused on replicating the behavior of the conjugate gradient method as a prototypical iterative method. In this work surprisingly general conditions for equivalence of these disparate methods are presented. We also describe connections between probabilistic linear solvers and projection methods for linear systems, providing a probabilistic interpretation of a far more general class of iterative methods. In particular, this provides such an interpretation of the generalised minimum residual method. A probabilistic view of preconditioning is also introduced. These developments unify the literature on probabilistic linear solvers, and provide foundational connections to the literature on iterative solvers for linear systems.

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

↑