arXiv (Cornell University) · 2020 · 10 citations · 63 references
EngineeringComputational EngineeringMechanical EngineeringComputational Fluid DynamicsComputational MechanicsFluid DynamicsConvergence AnalysisFinite Volume MethodsIncompressible FlowNavier-stokes EquationsPressure-velocity CouplingReduced-order ModelingDiscretizationFinite Volume DiscretizationFinite Volume Methods For Incompressible FlowGalerkin ProjectionIncompressible Navier-stokes EquationsModel Order ReductionModel Reduction For Fluid DynamicsTime Discretization
A novel reduced order model (ROM) for incompressible flows is developed by\nperforming a Galerkin projection based on a fully (space and time) discrete\nfull order model (FOM) formulation. This 'discretize-then-project' approach\nrequires no pressure stabilization technique (even though the pressure term is\npresent in the ROM) nor a boundary control technique (to impose the boundary\nconditions at the ROM level). These are two main advantages compared to\nexisting approaches. The fully discrete FOM is obtained by a finite volume\ndiscretization of the incompressible Navier-Stokes equations on a collocated\ngrid, with a forward Euler time discretization. Two variants of the time\ndiscretization method, the inconsistent and consistent flux method, have been\ninvestigated. The latter leads to divergence-free velocity fields, also on the\nROM level, whereas the velocity fields are only approximately divergence-free\nin the former method. For both methods, accurate results have been obtained for\ntest cases with different types of boundary conditions: a lid-driven cavity and\nan open-cavity (with an inlet and outlet). The ROM obtained with the consistent\nflux method, having divergence-free velocity fields, is slightly more accurate\nbut also slightly more expensive to solve compared to the inconsistent flux\nmethod. The speedup ratio of the ROM and FOM computation times is the highest\nfor the open cavity test case with the inconsistent flux method.\n
63
Numerical solution of the Navier-Stokes equations
Alexandre J. Chorin · Mathematics of Computation · 1968 · 5.3K citations