ROM for Viscous, Incompressible Flow in Polygons -- exponential $n$-width bounds and convergence rate
Francesco Romor, Federico Pichi, Giovanni Stabile, Gianluigi Rozza, Christoph Schwab

TL;DR
This paper proves exponential convergence rates for reduced order models of stationary incompressible Navier-Stokes equations in polygonal domains, supported by theoretical bounds and numerical experiments.
Contribution
It establishes exponential bounds for Kolmogorov n-widths and convergence rates of POD Galerkin methods for mixed boundary value problems in polygonal domains.
Findings
Exponential convergence of ROM approximations demonstrated.
Kolmogorov n-widths decay exponentially for analytic data.
Numerical experiments confirm theoretical exponential rates.
Abstract
We demonstrate exponential convergence of Reduced Order Model (ROM) approximations for mixed boundary value problems of the stationary, incompressible Navier-Stokes equations in plane, polygonal domains . Admissible boundary conditions comprise mixed BCs, no-slip, slip and open boundary conditions, subject to corner-weighted analytic boundary data and volume forcing. The small data hypothesis is assumed to ensure existence of a unique weak solution in the sense of Leray-Hopf. Recent results on corner-weighted, analytic regularity of velocity and pressure fields in , imply exponential convergence rates of so-called mixed -Finite Element Methods in on sequences of geometric partitions of , with corner-refinement. Based on these exponential convergence rate bounds, we infer exponential bounds for the Kolmogorov -widths of…
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.
Taxonomy
TopicsModel Reduction and Neural Networks · Advanced Numerical Methods in Computational Mathematics · Matrix Theory and Algorithms
