Verifiability of the Data-Driven Variational Multiscale Reduced Order Model
Birgul Koc, Changhong Mou, Honghu Liu, Zhu Wang, Gianluigi Rozza,, Traian Iliescu

TL;DR
This paper establishes the verifiability of data-driven variational multiscale reduced order models (ROMs), ensuring small closure errors lead to small overall ROM errors, and demonstrates this property through numerical simulations of fluid flow problems.
Contribution
It extends the concept of verifiability to ROM closures, proves that data-driven variational multiscale ROMs are verifiable, and validates this through numerical experiments.
Findings
Verifiability holds for the data-driven variational multiscale ROM.
Small closure model errors imply small overall ROM errors.
Numerical simulations confirm theoretical verifiability results.
Abstract
In this paper, we focus on the mathematical foundations of reduced order model (ROM) closures. First, we extend the verifiability concept from large eddy simulation to the ROM setting. Specifically, we call a ROM closure model verifiable if a small ROM closure model error (i.e., a small difference between the true ROM closure and the modeled ROM closure) implies a small ROM error. Second, we prove that a data-driven ROM closure (i.e., the data-driven variational multiscale ROM) is verifiable. Finally, we investigate the verifiability of the data-driven variational multiscale ROM in the numerical simulation of the one-dimensional Burgers equation and a two-dimensional flow past a circular cylinder at Reynolds numbers and .
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 · Fluid Dynamics and Vibration Analysis · Advanced Numerical Methods in Computational Mathematics
