An efficient data-driven solver for Fokker-Planck equations: algorithm and analysis

From MaRDI portal
Publication:2129665

DOI10.4310/CMS.2022.V20.N3.A8zbMATH Open1497.65016arXiv1906.02600OpenAlexW2948904999MaRDI QIDQ2129665FDOQ2129665

M. Dobson, Yao Li, Jiayu Zhai

Publication date: 22 April 2022

Published in: Communications in Mathematical Sciences (Search for Journal in Brave)

Abstract: Computing the invariant probability measure of a randomly perturbed dynamical system usually means solving the stationary Fokker-Planck equation. This paper studies several key properties of a novel data-driven solver for low-dimensional Fokker-Planck equations proposed in [15]. Based on these results, we propose a new `block solver' for the stationary Fokker-Planck equation, which significantly improves the performance of the original algorithm. Some possible ways of reducing numerical artifacts caused by the block solver are discussed and tested with examples.


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






Cited In (6)






This page was built for publication: An efficient data-driven solver for Fokker-Planck equations: algorithm and analysis

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