A probabilistic model for the numerical solution of initial value problems

From MaRDI portal
Publication:2329752

DOI10.1007/S11222-017-9798-7zbMATH Open1505.62361arXiv1610.05261OpenAlexW2534928453MaRDI QIDQ2329752FDOQ2329752


Authors: Michael Schober, Simo Särkkä, Philipp Hennig Edit this on Wikidata


Publication date: 18 October 2019

Published in: Statistics and Computing (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/1610.05261




Recommendations




Cites Work


Cited In (18)

Uses Software





This page was built for publication: A probabilistic model for the numerical solution of initial value problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2329752)