Greedy approximation of high-dimensional Ornstein-Uhlenbeck operators
Leonardo E. Figueroa, Endre S\"uli

TL;DR
This paper extends the convergence analysis of greedy approximation algorithms for high-dimensional Fokker-Planck equations, relevant in kinetic polymer models, from Poisson to Ornstein-Uhlenbeck operators.
Contribution
It generalizes the convergence results of greedy algorithms to complex Ornstein-Uhlenbeck operators in high-dimensional settings.
Findings
Proved convergence of greedy algorithms for Ornstein-Uhlenbeck operators.
Extended analysis to high-dimensional Cartesian product domains.
Applicable to kinetic models of dilute polymers.
Abstract
We investigate the convergence of a nonlinear approximation method introduced by Ammar et al. (J. Non-Newtonian Fluid Mech. 139:153-176, 2006) for the numerical solution of high-dimensional Fokker-Planck equations featuring in Navier-Stokes-Fokker-Planck systems that arise in kinetic models of dilute polymers. In the case of Poisson's equation on a rectangular domain in R^2, subject to a homogeneous Dirichlet boundary condition, the mathematical analysis of the algorithm was carried out recently by Le Bris, Leli\`evre and Maday (Const. Approx. 30:621-651, 2009), by exploiting its connection to greedy algorithms from nonlinear approximation theory, explored, for example, by DeVore and Temlyakov (Adv. Comput. Math. 5:173-187, 1996); hence, the variational version of the algorithm, based on the minimization of a sequence of Dirichlet energies, was shown to converge. Here, we extend the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
