Related papers: Greedy recursion parameter selection for one-way s…
Spatial marching methods, in which the flow state is spatially evolved in the downstream direction, can be used to produce low-cost models of flows containing a slowly varying direction, such as mixing layers, jets, and boundary layers. The…
We extend the One-Way Navier Stokes (OWNS) approach to support nonlinear interactions between waves of different frequencies, which will enable nonlinear analysis of instability and transition. In OWNS, the linearized Navier-Stokes…
This paper presents a method to solve the modal form of the linearised one-way Navier-Stokes (OWNS) equations for investigating disturbance development in developing subsonic and supersonic boundary layers. The modal framework offers…
In this study, we develop an efficient approach for approximating resolvent modes via spatial marching. Building on the methodology from Part 1, we leverage the ability of the projection-based formulation of the one-way Navier-Stokes…
In this manuscript we propose and analyze weighted reduced order methods for stochastic Stokes and Navier-Stokes problems depending on random input data (such as forcing terms, physical or geometrical coefficients, boundary conditions). We…
Finding the optimal embedding of networks into low-dimensional hyperbolic spaces is a challenge that received considerable interest in recent years, with several different approaches proposed in the literature. In general, these methods…
We investigate a projection-based reduced-order model of the steady incompressible Navier-Stokes equations for moderate Reynolds numbers. In particular, we construct an "embedded" reduced basis space, by applying proper orthogonal…
A new iterative projection method is proposed to solve the unsteady Navier-Stokes equations with high Reynolds numbers. The convectional projection method attempts to project the intermediate velocity to the divergence free space only once…
Several sparsity-constrained algorithms such as Orthogonal Matching Pursuit or the Frank-Wolfe algorithm with sparsity constraints work by iteratively selecting a novel atom to add to the current non-zero set of variables. This selection…
Greedy optimization methods such as Matching Pursuit (MP) and Frank-Wolfe (FW) algorithms regained popularity in recent years due to their simplicity, effectiveness and theoretical guarantees. MP and FW address optimization over the linear…
This paper presents and analyzes two robust, efficient, and optimally accurate fully discrete finite element algorithms for computing the parameterized Navier-Stokes Equations (NSEs) flow ensemble. The timestepping algorithms are…
We present two different reduced order strategies for incompressible parameterized Navier-Stokes equations characterized by varying Reynolds numbers. The first strategy deals with low Reynolds number (laminar flow) and is based on a…
High-order methods and hybrid turbulence models have independently shown promise as means of decreasing the computational cost of scale-resolving simulations. The objective of this work is to develop the combination of these methods and…
The background of this work is the problem of reducing the aerodynamic turbulent friction drag, which is an important source of energy waste in innumerable technological fields. We develop a theoretical framework aimed at predicting the…
We consider settings for which one needs to perform multiple flow simulations based on the Navier-Stokes equations, each having different values for the physical parameters and/or different initial condition data, boundary conditions data,…
Direct methods to obtain global stability modes are restricted by the daunting sizes and complexity of Jacobians encountered in general three-dimensional flows. Jacobian-free iterative approaches such as Arnoldi methods have greatly…
Greedy Sampling Methods (GSMs) are widely used to construct approximate solutions of Configuration Optimization Problems (COPs), where a loss functional is minimized over finite configurations of points in a compact domain. While effective…
We present a component-based model order reduction procedure to efficiently and accurately solve parameterized incompressible flows governed by the Navier-Stokes equations. Our approach leverages a non-overlapping optimization-based domain…
We consider the Navier-Stokes equations in a channel with a narrowing and walls of varying curvature. By applying the empirical interpolation method to generate an affine parameter dependency, the offline-online procedure can be used to…
In this project, we propose a Variational Inference algorithm to approximate posterior distributions. Building on prior methods, we develop the Gradient-Steered Stein Variational Gradient Descent (G-SVGD) approach. This method introduces a…