A Deep Least Squares Method for the Stokes Equations
Explore the source record for details and available documents.
SEARCH · Engineering Papers
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
We intend to submit to "Results in Applied Mathematics" - an Elsevier journal. https://www.journals.elsevier.com/results-in-applied-mathematics/
Abstract not provided.
Explore the source record for details and available documents.
Consider an algebraic two-level method applied to the 𝑛-dimensional linear system 𝐴𝒙 = 𝒃 using fine-space preconditioner (i.e., “relaxation” or “smoother”) 𝑀, with 𝑀 ≈ 𝐴, restriction and interpolation 𝑅 and 𝑃, and algebraic coarse-space operator 𝐴 𝑐 : = 𝑅 ∗ 𝐴𝑃. Then, what are the best possible transfer operators 𝑅 and 𝑃 of a given dimension 𝑛 𝑐 < 𝑛? Brannick et al. [12] showed that when 𝐴 and 𝑀 are Hermitian positive definite (HPD), the optimal interpolation is such that its range contains the 𝑛 𝑐 smallest generalized eigenvectors of the matrix pencil (𝐴, 𝑀). Recently, in Ali et al. [5] we generalized this framework to the non-HPD setting, by considering both right (interpolation) and left (restriction) generalized eigenvectors of (𝐴, 𝑀) and defining corresponding nonsymmetric transfer operators {𝑅#, 𝑃#}. Tight convergence bounds for {𝑅#, 𝑃#} are derived in spectral radius, as well as a proof of pseudo-optimality. Note, {𝑅#, 𝑃#} are typically complex valued, which is not practical for real-valued problems. Here, in this work, we build on [5], first characterizing all inner products in which the coarse-space correction defined by {𝑅#, 𝑃#} is orthogonal. We then develop tight two-level convergence bounds in these norms, and prove that the underlying transfer operators {𝑅#, 𝑃#} are genuinely optimal. As a special case, our theory both recovers and extends the HPD results from [12]. Finally, we show how to construct optimal, real-valued transfer operators in the case of that 𝐴 and 𝑀 are real valued, but are not HPD. Numerical examples arising from a discretized advection-reaction equation, wave-equation, and Stokes equations are used to verify and illustrate the theory.
For centuries, flow visualization has been the art of making fluid motion visible in physical and biological systems. Although such flow patterns can be, in principle, described by the Navier-Stokes equations, extracting the velocity and pressure fields directly from the images is challenging. We addressed this problem by developing hidden fluid mechanics (HFM), a physics-informed deep-learning framework capable of encoding the Navier-Stokes equations into the neural networks while being agnostic to the geometry or the initial and boundary conditions. We demonstrate HFM for several physical and biomedical problems by extracting quantitative information for which direct measurements may not be possible.
Droplet formation happens in finite time due to the surface tension force. The linear stability analysis is useful to estimate the size of a droplet but fails to approximate the shape of the droplet. This is due to a highly nonlinear flow description near the point where the first pinch-off happens. A one-dimensional axisymmetric mathematical model was first developed by Eggers and Dupont [“Drop formation in a one-dimensional approximation of the Navier–Stokes equation,” J. Fluid Mech. 262, 205–221 (1994)] using asymptotic analysis. This asymptotic approach to the Navier–Stokes equations leads to a universal scaling explaining the self-similar nature of the solution. Numerical models for the one-dimensional model were developed using the finite difference [Eggers and Dupont, “Drop formation in a one-dimensional approximation of the Navier–Stokes equation,” J. Fluid Mech. 262, 205–221 (1994)] and finite element method [Ambravaneswaran et al., “Drop formation from a capillary tube: Comparison of one-dimensional and two-dimensional analyses and occurrence of satellite drops,” Phys. Fluids 14, 2606–2621 (2002)]. The focus of this study is to provide a robust computational model for one-dimensional axisymmetric droplet formation using the Portable, Extensible Toolkit for Scientific Computation. The code is verified using the Method of Manufactured Solutions and validated using previous experimental studies done by Zhang and Basaran [“An experimental study of dynamics of drop formation,” Phys. Fluids 7, 1184–1203 (1995)]. The present model is used for simulating pendant drops of water, glycerol, and paraffin wax, with an aspiration of extending the application to simulate more complex pinch-off phenomena.
We outline a methodology for the simulation of particle-laden flows whereby the dispersed and fluid phases are two-way coupled. The drag force which couples fluid and particle momentum depends on the undisturbed fluid velocity at the particle location, and this latter quantity requires modelling. We demonstrate that the undisturbed fluid velocity, in the low particle Reynolds number limit, can be related exactly to the discrete Green's function of the discrete Stokes equations. The method is general in that it can be extended to other partial differential equations which may be associated with particle-laden flows, such as the thermal energy equation or Maxwell's equations. In this work, we demonstrate the method of discrete Green's functions by obtaining these functions for the Navier-Stokes equations at low particle Reynolds number in a two-plane channel geometry. We perform verification at low and finite particle Reynolds number for the case of a point-particle settling under gravity parallel to a plane wall, for different wall normal separations. In comparing to other point-particle schemes the discrete Green's function approach is the most robust at low particle Reynolds number, accurate at all wall-normal separations and is the most accurate in the near wall region at finite Reynolds number. We discuss how the accuracy away from the wall at finite Reynolds number could be improved by appealing to Oseen-like discrete Green's functions. Finally we demonstrate that the discrete Green's function approach can have important implications on statistics of particle-laden turbulent channel flow.
We outline a methodology for the simulation of two-way coupled particle-laden flows. The drag force that couples fluid and particle momentum depends on the undisturbed fluid velocity at the particle location, and this latter quantity requires modelling. We demonstrate that the undisturbed fluid velocity, in the low particle Reynolds number limit, can be related exactly to the discrete Green's function of the discrete Stokes equations. In addition to hydrodynamics, the method can be extended to other physics present in particle-laden flows such as heat transfer and electromagnetism. The discrete Green's functions for the Navier–Stokes equations are obtained at low particle Reynolds number in a two-plane channel geometry. We perform verification at different Reynolds numbers for a particle settling under gravity parallel to a plane wall, for different wall-normal separations. Compared with other point-particle schemes, the Stokesian discrete Green's function approach is the most robust at low particle Reynolds number, accurate at all wall-normal separations. To account for degradation in accuracy away from the wall at finite Reynolds number, we extend the present methodology to an Oseen-like discrete Green's function. The extended discrete Green's function method is found to be accurate within 6% at all wall-normal separations for particle Reynolds numbers up to 24. Furthermore, the discrete Green's function approach is well suited to dilute systems with significant mass loading and this is highlighted by comparison against other Euler–Lagrange as well as particle-resolved simulations of gas–solid turbulent channel flow. Strong particle–turbulence coupling is observed in the form of turbulence modification and turbophoresis suppression, and these observations are placed in context of the different methods.
Fully implicit Runge--Kutta (IRK) methods have many desirable accuracy and stability properties as time integration schemes, but high-order IRK methods are not commonly used in practice with large-scale numerical PDEs because of the difficulty of solving the stage equations. This paper introduces a theoretical and algorithmic framework for solving the nonlinear equations that arise from IRK methods (and discontinuous Galerkin discretizations in time) applied to nonlinear numerical PDEs, including PDEs with algebraic constraints. Several new linearizations of the nonlinear IRK equations are developed, offering faster and more robust convergence than the often-considered simplified Newton, as well as an effective preconditioner for the true Jacobian if exact Newton iterations are desired. Inverting these linearizations requires solving a set of block 2 x 2 systems. Under quite general assumptions, it is proven that the preconditioned 2 x 2 operator's condition number is bounded by a small constant close to one, independent of the spatial discretization, spatial mesh, and time step, and with only weak dependence on the number of stages or integration accuracy. Moreover, the new method is built using the same preconditioners needed for backward Euler-type time stepping schemes, so can be readily added to existing codes. The new methods are applied to several challenging fluid flow problems, including the compressible Euler and Navier--Stokes equations, and the vorticity-streamfunction formulation of the incompressible Euler and Navier--Stokes equations. Up to 10th-order accuracy is demonstrated using Gauss IRK, while in all cases fourth-order Gauss IRK requires roughly half the number of preconditioner applications as required by standard Singly diagonally implicit Runge--Kutta methods.
Simulating flow through porous media with explicit considerations of complex microstructures is very challenging using conventional sharp-interface methods because of the difficulties in generating meshes conformal to complex geometries. In this work, a diffuse interface embedded boundary method known as the Smoothed Boundary Method (SBM) is utilized to facilitate simulations of fluid dynamics involving complex geometries. In diffuse-interface methods, the geometry is described by a domain parameter. The SBM allows the straightforward reformulation of the time-dependent Navier-Stokes equations in terms of this domain parameter, using only algebraic identities. Thus, enforcing the appropriate boundary conditions at the irregular embedded boundary is greatly simplified. Adaptive mesh refinement is used to increase the accuracy of the diffuse interface method by allowing thinner interfacial thickness to be used in the domain parameter. Here, the SBM-formulated Navier-Stokes equations are solved with the Finite Difference Method on refined mesh systems. Sharp-interface Finite Element Method simulations using the commercial software COMSOL on body-conforming meshes are also provided for comparison. Favorable agreement between the two methods is observed. Since it is no longer necessary for the mesh to conform to the complex geometry, the grid system for the SBM simulations can be generated rapidly and without additional manual interventions, making the entire simulation process more expedient.
Next, a robust and efficient framework for simulating NSPD in multiple dimensions is developed. The reactive Navier-Stokes equations are extended to include a drift-diffusion plasma-fluid model with a local field approximation (LFA) in a finite-volume solver, which uses an adaptive mesh refinement (AMR) strategy to address the wide separation of length scales in the problem. A two-way coupling strategy is used whereby the plasma-fluid model and reactive Navier-Stokes equations are integrated simultaneously. The oxidation of ethylene/air mixtures mediated by NSPD is simulated in a pin-to-pin configuration. All phases of the plasma discharge are simulated explicitly (including streamer ignition, propagation, and connection, as well as the subsequent spark phase), along with the evolution of the plasma during the inter-pulse period. Temporally and spatially-resolved results are presented, with an emphasis on the analysis of heating and energy deposition, as well as of the evolution of the concentration of active particles generated during the NSPD and their influence on ignition.
This review evaluates the state-of-the-practice numerical tools used to predict the performance of Oscillating Water Column (OWC). The OWC is a widely studied Wave Energy Converter that provides a reliable form of renewable form of electricity that can potentially meet global energy needs. However, the fluid-flow phenomena affecting its hydrodynamic performance are not fully understood. While there has been the successful full-scale deployment of OWCs, various computational methods are being explored to optimize this technology. Potential flow theory is commonly used to evaluate the efficiency of OWCs; however, this assumption tends to over-predict the hydrodynamic performance. Recently, numerical studies using a diverse set of commercial, open-source, or in-house Computational Fluid Dynamics (CFD) using Reynolds Averaged Navier Stokes (RANS) and Large-Eddy Simulation codes show a better comparison to available experimental results but are computationally expensive. ANSYS Fluent was found to be the most widely used CFD code applied to the study of the OWCs, with a high degree of accuracy in terms of experimental validation of numerical results.
In this work, we present a matrix-free flow solver for high-order finite element discretizations of the incompressible Navier-Stokes and Stokes equations with GPU acceleration. For high polynomial degrees, assembling the matrix for the linear systems resulting from the finite element discretization can be prohibitively expensive, both in terms of computational complexity and memory. For this reason, it is necessary to develop matrix-free operators and preconditioners, which can be used to efficiently solve these linear systems without access to the matrix entries themselves. The matrix-free operator evaluations utilize GPU-accelerated sum-factorization techniques to minimize memory movement and maximize throughput. The preconditioners developed in this work are based on a low-order refined methodology with parallel subspace corrections, as described for diffusion problems in [1]. The saddle-point Stokes system is solved using block-preconditioning techniques, which are robust in mesh size, polynomial degree, time step, and viscosity. For the incompressible Navier-Stokes equations, we make use of projection (fractional step) methods, which require Helmholtz and Poisson solves at each time step. The performance of our flow solvers is assessed on several benchmark problems in two and three spatial dimensions.
This numerical work investigates the potential of a high-order finite-difference spectral vanishing viscosity approach to simulate gravity currents at high Reynolds numbers. The method introduces targeted numerical dissipation at small scales through altering the discretisation of the second derivatives of the viscous terms in the incompressible Navier-Stokes equations to mimic the spectral vanishing viscosity (SVV) operator, originally designed for the regularisation of spectral element method (SEM) solutions of pure advection problems. Using a sixth-order accurate finite-difference scheme, the adoption of the SVV method is straightforward and comes with a negligible additional computational cost. In order to assess the ability of this high-order finite-difference spectral vanishing viscosity approach, we performed large-eddy simulations (LES) of a gravity current in a channelised lock-exchange set-up with our SVV model and with the well-known explicit static and dynamic Smagorinsky sub-grid scale (SGS) models. The obtained data are compared with a direct numerical simulation (DNS) based on more than 800 million mesh nodes, and with experimental measurements. A framework for the energy budget is introduced to investigate the behaviour of the gravity current. First, it is found that the DNS is in good agreement with the experimental data for the evolution of the front location and velocity field as well as for the stirring and mixing inside the gravity current. Secondly, the LES performed with less than 0.4% of the total number of mesh nodes compared to the DNS, can reproduce the main features of the gravity currents, with the SVV model yielding slightly more accurate results. It is also found that the dynamic Smagorinsky model performs better than its static version. For the present study, the static and dynamic Smagorinsky models are 1.8 and 2.5 times more expensive than the SVV model, because the latter does not require the calculation of explicit SGS terms in the Navier-Stokes equations nor spatial filtering operations.
Unveiling the rheological properties of fiber suspensions is of paramount interest to many industrial applications like biofuel production. The 3D numerical simulations of the suspension of fibers are often computationally expensive and time-consuming. Machine learning methods such as neural networks can simplify the prediction of rheological behavior; however, they require a relatively large training data set. Multi -fidelity models, which combine high-fidelity data from numerical simulations and less expensive lower fidelity data from resources such as simplified physical equations, can lead to optimized predictions. Here, we focus on a neural network with two levels of fidelity, i.e., high and low fidelity networks. To produce high-fidelity data, we perform direct numerical simulations to model the fibers as one-dimensional inextensible slender bodies that obey the Euler- Bernoulli beam equation. The Navier-Stokes equations govern the suspended fluid, and an immersed boundary method is used to couple the fluid and solid motion. The low-fidelity data is produced by using constitutive equations. Noticeable improvements have been observed in the accuracy of predicting the rheological behavior when a multi-fidelity network is used compared to the single-fidelity network.