Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Advection problems”

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.

At least 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Spatial coupling of gyrokinetic simulations, a generalized scheme based on first-principles

In this paper, we present a scheme that spatially couples two gyrokinetic codes using first-principles. Coupled equations are presented and a necessary and sufficient condition for ensuring accuracy is derived. This new scheme couples both the field and the particle distribution function. The coupling of the distribution function is only performed once every few time-steps, using a five-dimensional (5D) grid to communicate the distribution function between the two codes. This 5D grid interface enables the coupling of different types of codes and models, such as particle and continuum codes, or delta-f and total-f models. Transferring information from the 5D grid to the marker particle weights is achieved using a new resampling technique. Demonstration of the coupling scheme is shown using two XGC gyrokinetic simulations for both the core and edge. We also apply the coupling scheme to two continuum simulations for a one-dimensional advection–diffusion problem.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

Elastic Flow Modeling for Hydropower Digital Twins

This report details the elastic, unsteady, one-dimensional flow equations that are used to model flow through a penstock in a hydropower facility. The elastic flow model is accurate even in cases of fast transients, long penstock length, and high gravitation head. The compressibility of the water and elasticity of the pipe walls are explicitly accounted for in the developed models so that the water hammer phenomena can be accurately captured. The elastic flow model is coupled to a mechanistic turbine model to resolve the dynamic feedbacks between the elastic water column and the turbine rotation rate. A finite volume method is employed to solve the governing equations, and the method is shown to have low numerical diffusion in sharp gradient phenomena, such as those encountered when simulating water hammer. The method is applied to single dimensional linear advection benchmark problem and numerical results are compared with analytic results. This is followed on by an application to a full hydropower system with a coupled turbine. The elastic flow model results are compared against an inelastic model.

13 HYDRO ENERGY↗
NASA NTRS2002

Discontinuous Galerkin Methods for Turbulence Simulation

A discontinuous Galerkin (DG) method is formulated, implemented, and tested for simulation of compressible turbulent flows. The method is applied to turbulent channel flow at low Reynolds number, where it is found to successfully predict low-order statistics with fewer degrees of freedom than traditional numerical methods. This reduction is achieved by utilizing local hp-refinement such that the computational grid is refined simultaneously in all three spatial coordinates with decreasing distance from the wall. Another advantage of DG is that Dirichlet boundary conditions can be enforced weakly through integrals of the numerical fluxes. Both for a model advection-diffusion problem and for turbulent channel flow, weak enforcement of wall boundaries is found to improve results at low resolution. Such weak boundary conditions may play a pivotal role in wall modeling for large-eddy simulation.

Collis, S. Scott↗
NASA NTRS2005

Matching Multistage Schemes to Viscous Flow

Multistage, explicit time stepping can be tailored to accelerate convergence for scalar advection-diffusion problems by using optimized multistage coefficients that vary with the local cell Reynolds number. And, when combined with local preconditioning, variable-coefficient multistage schemes for computational fluid dynamics codes can also provide an order of magnitude faster convergence, relative to standard, fixed-coefficient schemes, for the Navier-Stokes system of equations.

Kleb, William L.↗
NASA NTRS2019

Verification of Unstructured Grid Adaptation Components

Adaptive unstructured grid techniques have made limited impact on production analysis workflows where the control of discretization error is critical to obtaining reliable simulation results. Recent progress has matured a number of independent implementations of flow solvers, error estimation methods, and anisotropic grid adaptation mechanics. Known differences and previously unknown differences in grid adaptation components and their integrated processes are identified here for study. Unstructured grid adaptation tools are verified using analytic functions and the Code Comparison Principle. Three analytic functions with different smoothness properties are adapted to show the impact of smoothness on implementation differences. A scalar advection-diffusion problem with an analytic solution that models a boundary layer is adapted to test individual grid adaptation components. Laminar flow over a delta wing and turbulent flow over an ONERA M6 wing are verified with multiple, independent grid adaptation procedures to show consistent convergence to fine-grid forces and a moment. The scalar problems illustrate known differences in a grid adaptation component implementation and a previously unknown interaction between components. The wing adaptation cases in the current study document a clear improvement to existing grid adaptation procedures. The stage is set for the infusion of verified grid adaptation into production fluid flow simulations.

Park, Michael A.↗
NASA NTRS2019

Verification of Unstructured Grid Adaptation Components

Adaptive unstructured grid techniques have made limited impact on production analysis workflows where the control of discretization error is critical to obtaining reliable simulation results. Recent progress has matured a number of independent implementations of flow solvers, error estimation methods, and anisotropic grid adaptation mechanics. Known differences and previously unknown differences in grid adaptation components and their integrated processes are identified here for study. Unstructured grid adaptation tools are verified using analytic functions and the Code Comparison Principle. Three analytic functions with different smoothness properties are adapted to show the impact of smoothness on implementation differences. A scalar advection-diffusion problem with an analytic solution that models a boundary layer is adapted to test individual grid adaptation components. The scalar problems illustrate known differences in a grid adaptation component implementation and a previously unknown interaction between components. Laminar flow over a delta wing is verified with multiple, independent grid adaptation procedures to show consistent convergence to fine-grid forces and pitching moment.

Park, Michael A.↗
DOE OSTI2025

A dynamic likelihood approach to filtering transport processes: advection-diffusion dynamics

A Bayesian data assimilation scheme is formulated for advection-dominated advective and diffusive evolutionary problems, based upon the Dynamic Likelihood (DLF) approach to filtering. The DLF was developed specifically for hyperbolic problems –waves–, and in this paper, it is extended via a split step formulation, to handle advection-diffusion problems. In the dynamic likelihood approach, observations and their statistics are used to propagate probabilities along characteristics, evolving the likelihood in time. The estimate posterior thus inherits phase information. For advection-diffusion the advective part of the time evolution is handled on the basis of observations alone, while the diffusive part is informed through the model as well as observations. We expect, and indeed show here, that in advection-dominated problems, the DLF approach produces better estimates than other assimilation approaches, particularly when the observations are sparse and have low uncertainty. The added computational expense of the method is cubic in the total number of observations over time, which is on the same order of magnitude as a standard Kalman filter and can be mitigated by bounding the number of forward propagated observations, discarding the least informative data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Differentiable physics-enabled closure modeling for Burgers’ turbulence

Abstract Data-driven turbulence modeling is experiencing a surge in interest following algorithmic and hardware developments in the data sciences. We discuss an approach using the differentiable physics paradigm that combines known physics with machine learning to develop closure models for Burgers’ turbulence. We consider the one-dimensional Burgers system as a prototypical test problem for modeling the unresolved terms in advection-dominated turbulence problems. We train a series of models that incorporate varying degrees of physical assumptions on an a posteriori loss function to test the efficacy of models across a range of system parameters, including viscosity, time, and grid resolution. We find that constraining models with inductive biases in the form of partial differential equations that contain known physics or existing closure approaches produces highly data-efficient, accurate, and generalizable models, outperforming state-of-the-art baselines. Addition of structure in the form of physics information also brings a level of interpretability to the models, potentially offering a stepping stone to the future of closure modeling.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Non-Diffusive Volume Advection with A High Order Interface Reconstruction Method

We show that non-diffusive volume advection in two-dimensions is achieved with several benchmark problems using a newly developed high-order volume of fluids (VOF) interface reconstruction method. (1) A new VOF interface reconstruction method using circular/corner facets (linear facets are a degenerate case of arcs). We create a circular interface facet in each mixed zone by matching neighbor volume with a hybrid Newton’s-bisection method and the local solution is final. In the general case, the new VOF interface reconstruction has 3rd order accuracy and can be easily made seamless. The new method addresses intrinsic issues with Young’s method such as gaps between interface facets in the case of a curved interface, and inability to define curvature nor identify corners. (2) A non-diffusive volume advection scheme. In an ALE advection step, a well-defined interface can be carried over through a Lagrange step and used to compute volume distribution into a relaxed mesh. Then, an interface reconstruction step is performed to redefine the interface in the relaxed mesh. We must point out that the interface carried over is also a solution of interface reconstruction because all the volume fractions in the relaxed mesh are naturally matched. We provide an interface tracking method compatible with our reconstruction scheme, where it is granted to use the prior info as an initial guess to capture sub-mesh resolution features. As a result, we are able to treat multiple facets inside a single mixed cell and obtain highly accurate, non-diffusive solution for advection problems with rather coarse meshes. We show our solutions for two-dimensional incompressible flows with two materials with a) the X + O diagonal translation; b) the Zalesak rotational test; and c) the single vortex spiral test.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

An implicit-explicit time splitting strategy for the far SOL plasma fluid model with DG-FEM discretization

We consider a far scrape-off layer (SOL) plasma fluid model of ions that is governed by a Braginskiitype model: a one-dimensional, nonlinear system of advection-diffusion equations coupled with a diffusion equation for neutral particles. Our motivation for studying this system arises from the coupling between the edge plasma and radio-frequency (RF) heating, where solving a far SOL plasma fluid model provides critical insights into edge plasma dynamics. Numerical simulations of plasma fluid models require advanced computational techniques to achieve both efficiency and accuracy, especially when resolving the boundary layer in magnetically confined plasmas. In this work, we propose an implicit-explicit time operator splitting strategy that allows for an efficient solution algorithm, where the diffusive terms are treated semi-implicitly requiring only a linear solve, while the advection part is handled explicitly using a strong-stability-preserving Runge-Kutta (SSP-RK3) scheme. This leads to a fully decoupled system in which the diffusion and advection sub-problems can be solved separately, simplifying the overall solution procedure and allowing for efficient parallelization, which is particularly relevant for exploring the impact of RF heating on the SOL plasma. The main challenge of the discretization is due to the strong coupling between diffusion and advection, particularly through the boundary conditions. This makes implementation of such a scheme in an accurate and stable manner nontrivial. We discuss in detail how to split the equations and manage boundary conditions to maintain stability and well-posedness for each subsystem. We also describe a spatial discretization approach, based on the discontinuous Galerkin finite element method (DG-FEM) and present numerical results for a one-dimensional system.

Burkovska, Olena [ORNL] (ORCID:0000000163101130)↗
DOE OSTI2023

Efficient Multigrid Reduction-in-Time for Method-of-Lines Discretizations of Linear Advection

Parallel-in-time methods for partial differential equations (PDEs) have been the subject of intense development over recent decades, particularly for diffusion-dominated problems. It has been widely reported in the literature, however, that many of these methods perform quite poorly for advection-dominated problems. In this report we analyze the particular iterative parallel-in-time algorithm of multigrid reduction-in-time (MGRIT) for discretizations of constant-wave-speed linear advection problems. We focus on common method-of-lines discretizations that employ upwind finite differences in space and Runge-Kutta methods in time. Using a convergence framework we developed in previous work, we prove for a subclass of these discretizations that, if using the standard approach of rediscretizing the fine-grid problem on the coarse grid, robust MGRIT convergence with respect to CFL number and coarsening factor is not possible. This poor convergence and non-robustness is caused, at least in part, by an inadequate coarse-grid correction for smooth Fourier modes in space-time known as characteristic components. We propose an alternative coarse-grid operator that provides a better correction of these modes. This coarse-grid operator is related to previous work and uses a semi-Lagrangian discretization combined with an implicitly treated truncation error correction. Theory and numerical experiments show the proposed coarse-grid operator yields fast MGRIT convergence for many of the method-of-lines discretizations considered, including for both implicit and explicit discretizations of high order. Parallel results demonstrate speed-up over sequential time-stepping.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

An Optimization-Based Coupling of Reduced Order Models with an Efficient Reduced Adjoint Basis Generation Approach

Optimization-based coupling (OBC) is an attractive alternative to traditional Lagrange multiplier approaches in multiple modeling and simulation contexts. However, application of OBC to time-dependent problems has been hindered by the computational cost of finding the stationary points of the associated Lagrangian, which requires primal and adjoint solves. This issue can be mitigated by using OBC in conjunction with computationally efficient reduced order models (ROMs). To demonstrate the potential of this combination, in this paper, we develop an optimization-based ROM-ROM coupling for a transient advection-diffusion transmission problem. We pursue the “optimize-then-reduce” path toward solving the minimization problem at each time step and solve reduced space adjoint system of equations, where the main challenge in this formulation is the generation of adjoint snapshots and reduced bases for the adjoint systems required by the optimizer. One of the main contributions of the paper is a new technique for an efficient adjoint snapshot collection for gradient-based optimizers in the context of optimization-based ROM-ROM couplings. In conclusion, we present numerical studies demonstrating the accuracy of the approach along with comparison between various approaches for selecting a reduced order basis for the adjoint systems, including decay of snapshot energy, average iteration counts, and timings.

coupled problems↗
DOE OSTI2026

ECLEIRS: Exact conservation law embedded identification of reduced states for parameterized nonlinear conservation laws from sparse and noisy data

Multi-query applications such as parameter estimation, uncertainty quantification and design optimization for parameterized partial differential equation (PDE) systems are expensive. While reduced/latent state dynamics approaches for parameterized PDEs offer a viable alternative, these approaches rely on high-quality data and struggle with highly sparse spatiotemporal noisy measurements typically obtained from experiments. Furthermore, there is no guarantee that these models satisfy governing physical conservation laws. In this article, we propose a reduced state dynamics approach, referred to as ECLEIRS, that embeds exact conservation in the solution and flux representation by utilizing a space-time divergence-free neural network formulation. We compare ECLEIRS with other reduced state dynamics approaches, those that do not enforce any physical constraints and those with physics-informed loss functions, for three shock-propagation problems: 1-D advection, 1-D Burgers and 2-D Euler equations. In conclusion, the numerical experiments conducted in this study demonstrate that ECLEIRS provides the most accurate prediction of dynamics for unseen parameters even in the presence of highly sparse and noisy data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A mineral precipitation model based on the volume of fluid method

A novel volume of fluid method is presented for mineral precipitation coupled with fluid flow and reactive transport. The approach describes the fluid-solid interface as a smooth transitional region, which is designed to provide the same precipitation rate and viscous drag force as a sharp interface. Specifically, the governing equation of mineral precipitation is discretized by an upwind scheme, and a rigorous effective viscosity model is derived around the interface. The model is validated against analytical solutions for mineral precipitation in channel and ring-shaped structures. It also compares well with interface tracking simulations of advection-diffusion-reaction problems. Here, the methodology is finally employed to model mineral precipitation in fracture networks, which is challenging due to the low porosity and complex geometry. Compared to other approaches, the proposed model has a concise algorithm and contains no free parameters. In the modeling, only the pore space requires meshing, which improves the computational effciency especially for low-porosity media.

58 GEOSCIENCES↗
DOE OSTI2023

PyApprox: A software package for sensitivity analysis, Bayesian inference, optimal experimental design, and multi-fidelity uncertainty quantification and surrogate modeling

PyApprox is a Python-based one-stop-shop for probabilistic analysis of numerical models such as those used in the earth, environmental and engineering sciences. Easy to use and extendable tools are provided for constructing surrogates, sensitivity analysis, Bayesian inference, experimental design, and forward uncertainty quantification. The algorithms implemented represent a wide range of methods for model analysis developed over the past two decades, including recent advances in multi-fidelity approaches that use multiple model discretizations and/or simplified physics to significantly reduce the computational cost of various types of analyses. An extensive set of Benchmarks from the literature is also provided to facilitate the easy comparison of new or existing algorithms for a wide range of model analyses. Here, this paper introduces PyApprox and its various features, and presents results demonstrating the utility of PyApprox on a benchmark problem modeling the advection of a tracer in groundwater.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

Assessment of diffuse-interface methods for compressible multiphase fluid flows and elastic-plastic deformation in solids

This work describes three diffuse-interface methods for the simulation of immiscible, compressible multiphase fluid flows and elastic-plastic deformation in solids. The first method is the localized-artificial-diffusivity approach of Cook, Subramaniam et al., and Adler and Lele, in which artificial diffusion terms are added to the individual phase mass fraction transport equations and are coupled with the other conservation equations. The second method is the gradient-form approach that is based on the quasi-conservative method of Shukla et al., in which the diffusion and sharpening terms (together called regularization terms) are added to the individual phase volume fraction transport equations and are coupled with the other conservation equations. The third approach is the divergence-form approach that is based on the fully conservative method of Jain et al., in which the regularization terms are added to the individual phase volume fraction transport equations and are coupled with the other conservation equations. In the present study, all three diffuse-interface methods are used in conjunction with a four-equation, multicomponent mixture model, in which pressure and temperature equilibria are assumed among the various phases. The primary objective of this work is to compare these three methods in terms of their ability to: maintain constant interface thickness throughout the simulation; conserve mass, momentum, and energy; and maintain accurate interface shape for long-time integration. The second objective of this work is to consistently extend these methods to model interfaces between solid materials with strength. To assess and compare the methods, they are used to simulate a wide variety of problems, including (1) advection of an air bubble in water, (2) shock interaction with a helium bubble in air, (3) shock interaction and the collapse of an air bubble in water, and (4) Richtmyer–Meshkov instability of a copper–aluminum interface. The current work focuses on comparing these methods in the limit of relatively coarse grid resolution, which illustrates the true performance of these methods. In conclusion, this is because it is rarely practical to use hundreds of grid points to resolve a single bubble or drop in large-scale simulations of engineering interest.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Constructing field-aligned coordinate systems for gyrokinetic simulations of tokamaks in X-point geometries

Structures in tokamak plasmas are elongated along the direction of the magnetic field and short in the directions perpendicular to the magnetic field. Many tokamak simulation codes take advantage of this by using a field-aligned coordinate system. However, field-aligned coordinate systems have a coordinate singularity at magnetic X-points where the poloidal magnetic field vanishes, which makes it difficult to use field-aligned coordinate systems when simulating the core and scrape-off layer simultaneously. Here, we present an algorithm for grid generation and computing geometric quantities in a standard field-aligned coordinate system that avoids the singularity and allows one to conduct two-dimensional gyrokinetic axisymmetric simulations in X-point geometries. Convergence tests of advection, boundary value problems and geometric quantities all show greater than first-order convergence even in the vicinity of the X-point. We also demonstrate the geometric consistency of our algorithm with an example simulation of the spherical tokamak for energy production, which shows machine-precision particle conservation.

fusion plasma↗
DOE OSTI2022

PyApprox: Enabling efficient model analysis

PyApprox is a Python-based one-stop-shop for probabilistic analysis of scientific numerical models. Easy to use and extendable tools are provided for constructing surrogates, sensitivity analysis, Bayesian inference, experimental design, and forward uncertainty quantification. The algorithms implemented represent the most popular methods for model analysis developed over the past two decades, including recent advances in multi-fidelity approaches that use multiple model discretizations and/or simplified physics to significantly reduce the computational cost of various types of analyses. Simple interfaces are provided for the most commonly-used algorithms to limit a user’s need to tune the various hyper-parameters of each algorithm. However, more advanced work flows that require customization of hyper-parameters is also supported. An extensive set of Benchmarks from the literature is also provided to facilitate the easy comparison of different algorithms for a wide range of model analyses. This paper introduces PyApprox and its various features, and presents results demonstrating the utility of PyApprox on a benchmark problem modeling the advection of a tracer in ground water.

97 MATHEMATICS AND COMPUTING↗