English

A Recursive Polynomial Chaos Evolution Method for Stochastic Differential Equations

Numerical Analysis 2026-05-06 v1 Numerical Analysis

Abstract

Numerical simulation of stochastic differential equations over long time intervals poses significant computational challenges. In this paper, we propose a novel recursive polynomial chaos evolution method that achieves model reduction without sampling by exploiting the Markov property to maintain a fixed low-dimensional representation throughout the time evolution. At each time step, we construct orthogonal polynomial bases adapted to the current probability measure, and project the one-step-ahead solution onto this new basis together with the new Brownian increments. This dynamic updating strategy effectively reduces the dimension of the random variables during long-time evolution. Under appropriate assumptions, we prove the convergence of the method, specifically that the distributions generated by the method preserve convergence in the Wasserstein-1 distance. We present numerical results demonstrating that the method can accurately capture complex dynamical behaviors with high accuracy and low computational cost.

Keywords

Cite

@article{arxiv.2605.03853,
  title  = {A Recursive Polynomial Chaos Evolution Method for Stochastic Differential Equations},
  author = {Guillaume Bal and Shengbo Ma and Su Zhang and Zhiwen Zhang},
  journal= {arXiv preprint arXiv:2605.03853},
  year   = {2026}
}

Comments

37 pages, 10 figures

R2 v1 2026-07-01T12:51:01.337Z