English

An optimal polynomial approximation of Brownian motion

Numerical Analysis 2020-05-21 v3 Numerical Analysis Probability

Abstract

In this paper, we will present a strong (or pathwise) approximation of standard Brownian motion by a class of orthogonal polynomials. The coefficients that are obtained from the expansion of Brownian motion in this polynomial basis are independent Gaussian random variables. Therefore it is practical (requires NN independent Gaussian coefficients) to generate an approximate sample path of Brownian motion that respects integration of polynomials with degree less than NN. Moreover, since these orthogonal polynomials appear naturally as eigenfunctions of an integral operator defined by the Brownian bridge covariance function, the proposed approximation is optimal in a certain weighted L2(P)L^{2}(\mathbb{P}) sense. In addition, discretizing Brownian paths as piecewise parabolas gives a locally higher order numerical method for stochastic differential equations (SDEs) when compared to the standard piecewise linear approach. We shall demonstrate these ideas by simulating Inhomogeneous Geometric Brownian Motion (IGBM). This numerical example will also illustrate the deficiencies of the piecewise parabola approximation when compared to a new version of the asymptotically efficient log-ODE (or Castell-Gaines) method.

Keywords

Cite

@article{arxiv.1904.06998,
  title  = {An optimal polynomial approximation of Brownian motion},
  author = {James Foster and Terry Lyons and Harald Oberhauser},
  journal= {arXiv preprint arXiv:1904.06998},
  year   = {2020}
}

Comments

27 pages, 8 figures

R2 v1 2026-06-23T08:39:42.069Z