Search arXiv⌕ Search

arXiv · 1806.00350

Physically-Constrained Data-Driven, Filtered Reduced Order Modeling of Fluid Flows

Abstract

In our earlier work, we proposed a data-driven filtered reduced order model (DDF-ROM) framework for the numerical simulation of fluid flows, which can be formally written as \begin{equation*} \boxed{ \text{ DDF-ROM = Galerkin-ROM + Correction } } \end{equation*} The new DDF-ROM was constructed by using ROM spatial filtering and data-driven ROM closure modeling (for the Correction term) and was successfully tested in the numerical simulation of a 2D channel flow past a circular cylinder at Reynolds numbers $Re=100, Re=500$ and $Re=1000$. In this paper, we propose a {\it physically-constrained} DDF-ROM (CDDF-ROM), which aims at improving the physical accuracy of the DDF-ROM. The new physical constraints require that the CDDF-ROM operators satisfy the same type of physical laws (i.e., the nonlinear operator should conserve energy and the ROM closure term should be dissipative) as those satisfied by the fluid flow equations. To implement these physical constraints, in the data-driven modeling step of the DDF-ROM, we replace the unconstrained least squares problem with a constrained least squares problem. We perform a numerical investigation of the new CDDF-ROM and standard DDF-ROM for a 2D channel flow past a circular cylinder at Reynolds numbers $Re=100, Re=500$ and $Re=1000$. To this end, we consider a reproductive regime as well as a predictive (i.e., cross-validation) regime in which we use as little as $50\%$ of the original training data. The numerical investigation clearly shows that the new CDDF-ROM is significantly more accurate than the DDF-ROM in both regimes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

M. Mohebujjaman, L. G. Rebholz, T. Iliescu. 2018-05-30. Physically-Constrained Data-Driven, Filtered Reduced Order Modeling of Fluid Flows. https://doi.org/10.1002/fld.4684

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

$L^{p}$-convergence of Kantorovich-type Max-Min Neural Network Operators

In this work, we study the Kantorovich variant of max-min neural network operators, in which the operator kernel is defined in terms of sigmoidal functions. Our main aim is to demonstrate the $L^{p}$-convergence of these nonlinear operators for $1\leq p<\infty$, which makes it possible to obtain approximation results for functions that are not necessarily continuous. In addition, we will derive quantitative estimates for the rate of approximation in the $L^{p}$-norm. We will provide some explicit examples, studying the approximation of discontinuous functions with the max-min operator, and varying additionally the underlying sigmoidal function of the kernel. Further, we numerically compare the $L^{p}$-approximation error with the respective error of the Kantorovich variants of other popular neural network operators. As a final application, we show that the Kantorovich variant has advantages compared to the sampling variant of the max-min operator and Kantorovich variant of the max-product operator when it comes to approximate noisy functions as for instance biomedical ECG signals.

math.NA↗

Quotient geometry of tensor ring decomposition

Differential geometries derived from tensor decompositions have been extensively studied and provided the foundations for a variety of efficient numerical methods. Despite the practical success of the tensor ring (TR) decomposition, its intrinsic geometry remains less understood, primarily due to the underlying ring structure and the resulting nontrivial gauge invariance. We establish the quotient geometry and immersed-submanifold structure of TR decomposition by imposing full-rank conditions on all unfolding matrices of the core tensors and capturing the gauge invariance. The intrinsic ring structure of TR leads to an analysis that is substantially different from other tensor formats. Additionally, for the uniform TR decomposition, where all core tensors are identical and the manifold structure is known, we derive explicit parameterizations for the vertical and horizontal spaces, which enable Riemannian optimization. Numerical experiments validate the developed geometries via tensor ring completion tasks.

math.NA↗

Boundary elements for clamped Kirchhoff--Love plates

We present a Galerkin boundary element method for clamped Kirchhoff--Love plates with piecewise smooth boundary. It is a direct method based on the representation formula and requires the inversion of the single-layer operator, an application of the double-layer operator to the Dirichlet data, and, in the presence of a vertical load, an application of the Dirichlet trace of the Newton potential to that load. We present trace approximation spaces of arbitrary order, required for both the Dirichlet data and the unknown Neumann trace. Our boundary element method is quasi-optimal with respect to the natural trace norm and achieves optimal convergence order under minimal regularity assumptions. We provide explicit representations of all three integral operators and discuss the implementation of the appearing integrals. Numerical experiments for smooth and non-smooth domains confirm predicted convergence rates.

math.NA↗