arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1610.05261math.NAcs.LGcs.NAstat.ML
收藏

初值问题数值解的概率模型

A probabilistic model for the numerical solution of initial value problems

Max Planck Institute for Intelligent Systems(马克斯·普朗克智能系统研究所);Aalto University(阿莱大学)

Michael Schober, Simo Särkkä, Philipp Hennig

AI总结:

本文提出将初值问题解法视为对潜在路径的推断,连接了广义线性方法、Runge-Kutta方法和Nordsieck方法,揭示了经典方法的隐含假设和不确定性处理。

摘要:

与许多数值方法类似,初值问题求解器通过可计算结果估计不可解析量。本文将求解过程视为从高斯过程概率测度中抽取路径的推断,展示了该类算法与广义线性方法、Runge-Kutta方法和Nordsieck方法的联系。这种概率框架在分析上突显了隐含的先验假设,并在实践中为不确定性处理提供了 docking points。

英文摘要:

Like many numerical methods, solvers for initial value problems (IVPs) on ordinary differential equations estimate an analytically intractable quantity, using the results of tractable computations as inputs. This structure is closely connected to the notion of inference on latent variables in statistics. We describe a class of algorithms that formulate the solution to an IVP as inference on a latent path that is a draw from a Gaussian process probability measure (or equivalently, the solution of a linear stochastic differential equation). We then show that certain members of this class are connected precisely to generalized linear methods for ODEs, a number of Runge--Kutta methods, and Nordsieck methods. This probabilistic formulation of classic methods is valuable in two ways: analytically, it highlights implicit prior assumptions favoring certain approximate solutions to the IVP over others, and gives a precise meaning to the old observation that these methods act like filters. Practically, it endows the classic solvers with `docking points' for notions of uncertainty and prior information about the initial value, the value of the ODE itself, and the solution of the problem.

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

↑