On approximate solutions of the incompressible Euler and Navier-Stokes equations
Carlo Morosi (Politecnico di Milano), Livio Pizzocchero (Universita', di Milano)

TL;DR
This paper develops a general theoretical framework for analyzing approximate solutions to the incompressible Euler and Navier-Stokes equations, providing bounds on solution existence time and error estimates, with applications to Galerkin approximations and global existence results.
Contribution
It introduces a novel method to infer existence bounds and error estimates for approximate solutions of Euler/NS equations using control inequalities, enhancing previous approaches.
Findings
Established a lower bound on the existence time of solutions based on approximate solutions.
Derived explicit error bounds for the difference between exact and approximate solutions.
Proved global existence for Navier-Stokes with sufficiently high viscosity.
Abstract
We consider the incompressible Euler or Navier-Stokes (NS) equations on a torus T^d in the functional setting of the Sobolev spaces H^n(T^d) of divergence free, zero mean vector fields on T^d, for n > d/2+1. We present a general theory of approximate solutions for the Euler/NS Cauchy problem; this allows to infer a lower bound T_c on the time of existence of the exact solution u analyzing a posteriori any approximate solution u_a, and also to construct a function R_n such that || u(t) - u_a(t) ||_n <= R_n(t) for all t in [0,T_c). Both T_c and R_n are determined solving suitable "control inequalities", depending on the error of u_a; the fully quantitative implementation of this scheme depends on some previous estimates of ours on the Euler/NS quadratic nonlinearity [15][16]. To keep in touch with the existing literature on the subject, our results are compared with a setting for…
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.
