Search NASA⌕ Search

SEARCH · Search NASA

Results for “advection”

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 OSTI2025

Building a new multiphysics workflow in MOOSE: application to tritium migration, trapping and advection in TMAP8

Fusion devices are anticipated to produce and consume several kilograms of tritium per year. This rare fuel resource is both highly mobile and radioactive, making tracking inventories a priority for operation and safety. The fusion safety program at the Idaho National Laboratory has been developing the Tritium Migration and Analysis Program (TMAP), of which the latest version is a MOOSE-based application. TMAP8 is verified against its predecessors and possesses additional multi-dimensional tritium migration modeling capabilities. As we extend its capabilities towards both whole device (in multiple dimensions) and whole plant (with multiple components) simulations, the syntax of inputs must become compact, descriptive, compatible with quality assurance processes, and as error-proof as achievable. The new Physics system developed MOOSE can set up equations and instantiating them on plant components. The system permits the automatic definition of complex discretization with a consistency between object parameters achieved programmatically. The Physics system can currently instantiate the equations for heat conduction and Navier Stokes weakly compressible flow. In MOOSE-terms, it automates the definition of kernels, boundary conditions, and several core and helper materials and fields. As part of this effort, Physics classes were developed for tritium migration, trapping and advection within either a multi-dimensional Navier Stokes fluid dynamics simulation, or a 1D thermal hydraulics piping system. In this presentation, we will showcase the new syntax, its application to several verification and validation cases which were already studied using the classical TMAP8 syntax, and a demonstration of the new coupling capabilities for the migration of tritium into blanket coolant channels and the subsequent advection into the coolant loop.

70 - PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Sylvester-preconditioned adaptive-rank implicit time integrators for advection-diffusion equations with variable coefficients

Here, we consider the adaptive-rank integration of multi-dimensional time-dependent advection-diffusion partial differential equations (PDEs) with variable coefficients. We employ a standard finite-difference method for spatial discretization coupled with high-order diagonally implicit Runge-Kutta temporal schemes. The discrete equation is a generalized Sylvester equation (GSE), which we solve with a projection-based adaptive-rank algorithm structured around two key strategies: (i) constructing dimension-wise subspaces using a novel atypical extended Krylov strategy, and (ii) efficiently solving the basis coefficient matrix with a preconditioned GMRES solver. The low-rank decomposition is performed in 2D using SVD and with high-order SVD (HOSVD) in 3D to represent the tensor in a compressed Tucker format. For d-dimensional problems (here, d = 2 or 3), the computational complexity and memory storage of the approach are found numerically to scale as and $\mathscr{O}(Nr^2) + \mathscr{O} (r^{d+1})$ and $\mathscr{O}(Nr) + \mathscr{O} (r^{d})$, respectively, with the one-dimensional resolution and the maximal rank during the Krylov iteration (which we find to be largely independent of on our numerical examples). We present numerical examples that illustrate the advertised properties of the algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Approximation rates of DeepONets for learning operators arising from advection–diffusion equations

Here we present the analysis of approximation rates of operator learning in Chen and Chen (1995) and Lu et al. (2021), where continuous operators are approximated by a sum of products of branch and trunk networks. In this work, we consider the rates of learning solution operators from both linear and nonlinear advection–diffusion equations with or without reaction. We find that the approximation rates depend on the architecture of branch networks as well as the smoothness of inputs and outputs of solution operators.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Evaluation of Stratocumulus Evolution Under Contrasting Temperature Advections in CESM2 Through a Lagrangian Framework

Abstract This study leveraged a Lagrangian framework to examine the evolution of stratocumulus clouds under cold and warm advections (CADV and WADV) in the Community Earth System Model 2 (CESM2) against observations. We found that CESM2 simulates a too rapid decline in low‐cloud fraction (LCF) and cloud liquid water path (CLWP) under CADV conditions, while it better aligns closely with observed LCF under WADV conditions but overestimates the increase in CLWP. Employing an explainable machine learning approach, we found that too rapid decreases in LCF and CLWP under CADV conditions are related to overestimated drying effects induced by sea surface temperature, whereas the substantial increase in CLWP under WADV conditions is associated with the overestimated moistening effects due to free‐tropospheric moisture and surface winds. Our findings suggest that overestimated drying effects of sea surface temperature on cloud properties might be one of crucial causes for the high equilibrium climate sensitivity in CESM2.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2020

Optimization-based, property-preserving finite element methods for scalar advection equations and their connection to Algebraic Flux Correction

In this paper, we continue our efforts to exploit optimization and control ideas as a common foundation for the development of property-preserving numerical methods. Here we focus on a class of scalar advection equations whose solutions have fixed mass in a given Eulerian region and constant bounds in any Lagrangian volume. Our approach separates discretization of the equations from the preservation of their solution properties by treating the latter as optimization constraints. This relieves the discretization process from having to comply with additional restrictions and makes stability and accuracy the sole considerations in its design. A property-preserving solution is then sought as a state that minimizes the distance to an optimally accurate but not property-preserving target solution computed by the scheme, subject to constraints enforcing discrete proxies of the desired properties. Furthermore, we consider two such formulations in which the optimization variables are given by the nodal solution values and suitably defined nodal fluxes, respectively. A key result of the paper reveals that a standard Algebraic Flux Correction (AFC) scheme is a modified version of the second formulation obtained by shrinking its feasible set to a hypercube. In conclusion, we present numerical studies illustrating the optimization-based formulations and comparing them with AFC

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

The influence of permeability anisotropy in the upper ocean crust on advective heat transport by a ridge-flank hydrothermal system

Here, in this study, we highlight the importance of permeability anisotropy on the hydrogeological regime of a ridge-flank hydrothermal system. Our study site, North Pond, is a marine sediment pond on ~8 Ma seafloor in the North Atlantic, and represents a low-temperature, end-member ridge-flank hydrothermal system. Previous simulations of North Pond elucidated long-standing hypotheses concerning hydrothermal fluid and heat transport in the upper volcanic crust but failed to fully explain observed patterns of seafloor heat flux in this area. Here we use variography, a geostatistical method, to quantify relations between seafloor heat-flux measurements, and coupled numerical simulations of fluid and heat flow to simulate the hydrogeologic regime. Directional variography shows that heat-flux observations are correlated along-strike of the regional crustal fabric. Three-dimensional simulations that include permeability anisotropy are able to replicate seafloor heat-flux patterns across North Pond. The simulations that result in the best match to thermal data incorporate permeability anisotropy in the horizontal plane. We find that the feedback between permeability anisotropy and the asymmetric geometry of North Pond combine to promote advective removal of heat and mass within the crustal aquifer. These findings suggest that permeability anisotropy in the oceanic crust may influence ridge-flank hydrothermal circulation more broadly.

58 GEOSCIENCES↗
DOE OSTI2020

Learning and meta-learning of stochastic advection–diffusion–reaction systems from sparse measurements

Physics-informed neural networks (PINNs) were recently proposed in [18] as an alternative way to solve partial differential equations (PDEs). A neural network (NN) represents the solution, while a PDE-induced NN is coupled to the solution NN, and all differential operators are treated using automatic differentiation. Here, we first employ the standard PINN and a stochastic version, sPINN, to solve forward and inverse problems governed by a non-linear advection–diffusion–reaction (ADR) equation, assuming we have some sparse measurements of the concentration field at random or pre-selected locations. Subsequently, we attempt to optimise the hyper-parameters of sPINN by using the Bayesian optimisation method (meta-learning) and compare the results with the empirically selected hyper-parameters of sPINN. In particular, for the first part in solving the inverse deterministic ADR, we assume that we only have a few high-fidelity measurements, whereas the rest of the data is of lower fidelity. Hence, the PINN is trained using a composite multi-fidelity network, first introduced in [12], that learns the correlations between the multi-fidelity data and predicts the unknown values of diffusivity, transport velocity and two reaction constants as well as the concentration field. For the stochastic ADR, we employ a Karhunen–Loève (KL) expansion to represent the stochastic diffusivity, and arbitrary polynomial chaos (aPC) to represent the stochastic solution. Correspondingly, we design multiple NNs to represent the mean of the solution and learn each aPC mode separately, whereas we employ a separate NN to represent the mean of diffusivity and another NN to learn all modes of the KL expansion. For the inverse problem, in addition to stochastic diffusivity and concentration fields, we also aim to obtain the (unknown) deterministic values of transport velocity and reaction constants. The available data correspond to 7spatial points for the diffusivity and 20 space–time points for the solution, both sampled 2000 times. We obtain good accuracy for the deterministic parameters of the order of 1–2% and excellent accuracy for the mean and variance of the stochastic fields, better than three digits of accuracy. In the second part, we consider the previous stochastic inverse problem, and we use Bayesian optimisation to find five hyper-parameters of sPINN, namely the width, depth and learning rate of two NNs for learning the modes. Here, we obtain much deeper and wider optimal NNs compared to the manual tuning, leading to even better accuracy, i.e., errors less than 1% for the deterministic values, and about an order of magnitude less for the stochastic fields.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Predictive Inverse Model for Advective Heat Transfer in a Short–Circuited Fracture: Dimensional Analysis, Machine Learning, and Field Demonstration

Identifying fluid flow maldistribution in planar geometries is a well–established problem in subsurface science/engineering. Of particular importance to the thermal performance of enhanced (or “engineered”) geothermal systems is identifying the existence of nonuniform (i.e., heterogeneous) permeability and subsequently predicting advective heat transfer. Here, machine learning via a genetic algorithm (GA) identifies the spatial distribution of an unknown permeability field in a two–dimensional Hele–Shaw geometry (i.e., parallel plates). The inverse problem is solved by minimizing the L2 norm between simulated residence time distribution (RTD) and measurements of an inert tracer breakthrough curve (BTC) (C–Dot nanoparticle). Principal component analysis (PCA) of spatially correlated permeability fields enabled reduction of the parameter space by more than a factor of 10 and restricted the inverse search to reservoir–scale permeability variations. Thermal experiments and tracer tests conducted at the mesoscale Altona Field Laboratory (AFL) demonstrate that the method accurately predicts the effects of extreme flow channeling on heat transfer in a single bedding–plane rock fracture. However, this is only true when the permeability distributions provide adequate matches to both tracer RTD and frictional pressure loss. Without good agreement to frictional pressure loss, it is still possible to match a simulated RTD to measurements, but subsequent predictions of heat transfer are grossly inaccurate. Here, the results of this study suggest that it is possible to anticipate the thermal effects of flow maldistribution, but only if both simulated RTDs and frictional pressure loss between fluid inlets and outlets are in good agreement with measurements.

42 ENGINEERING↗
DOE OSTI2024

Kinetic corrections to heat-flow and Nernst advection for laser heated plasmas

Reduced models for approximating the impact of kinetic electron behavior on the transport of thermal energy and magnetic field are investigated. The thermal flux limiter has improved agreement with Vlasov–Fokker–Planck data when a harmonic form is used that adjusts the electron mean free path to account for electron–electron collisions; these results apply to both unmagnetized and magnetized plasmas. Once a magnetic field is incorporated, the mean free path should also be modified using the electron gyroradius. A flux limiter on Nernst advection of magnetic fields is also required; a form that limits Nernst by the same fraction as the thermal heat-flow best reproduces kinetic simulations. A flux limiter form for the cross terms (Righi–Leduc and cross-gradient-Nernst) is also suggested. Hohlraum simulations relevant to fusion experiments on the National Ignition Facility are found to be sensitive to all of these details.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Quantum dynamics simulation of the advection-diffusion equation

The advection-diffusion equation is simulated via several quantum algorithms. Three formulations are considered: (1) Trotterization, (2) variational quantum time evolution (VarQTE), and (3) adaptive variational quantum dynamics simulation (AVQDS). These schemes were originally developed for the Hamiltonian simulation of many-body quantum systems. The finite-difference discretized operator of the transport equation is formulated as a Hamiltonian and solved without the need for ancillary qubits. Computations are conducted on a quantum simulator (IBM Qiskit Aer) and a superconducting quantum hardware (IBM Fez). The former emulates the latter without the noise. The actual hardware implementation experiences significant noise. The results of the quantum simulator are compared with data from direct numerical simulation (DNS) with infidelities of the order 10 −5 . In the quantum simulator, Trotterization is observed to have the lowest infidelity and is suitable for fault-tolerant computation. The AVQDS algorithm requires the lowest gate count and circuit depth. The VarQTE algorithm is the next best in terms of gate counts, but the number of its optimization variables is directly proportional to the number of qubits. Due to current hardware limitations, Trotterization cannot be implemented, as it has an overwhelmingly large number of operations. Meanwhile, AVQDS and VarQTE can be executed at the hardware level. These algorithms present a new paradigm for computational transport phenomena on quantum computers.

Alipanah, Hirad [Univ. of Pittsburgh, PA (United S↗
DOE OSTI2023

Code for Value Decomposition Graph Network and environment for AMR on linear advection

This is the code for the paper [Multi-Agent Reinforcement Learning for Adaptive Mesh Refinement](https://arxiv.org/abs/2211.00801), published at AAMAS 2023. It contains the implementation of a new algorithm, called Value Decomposition Graph Network (VDGN), for applying multi-agent reinforcement learning to the problem of adaptive mesh refinement (AMR). It also contains the implementation of a multi-agent environment for AMR on a linear advection problem. VDGN is the first learning algorithm to display anticipatory refinement behavior in AMR, and it outperforms local error threshold-based heuristic strategies.

Yang, Jiachen↗
DOE OSTI2021

Hierarchical model reduction driven by a proper orthogonal decomposition for parametrized advection-diffusion-reaction problems

This work combines the Hierarchical Model (HiMod) reduction technique with a standard Proper Orthogonal Decomposition (POD) to solve parametrized partial differential equations for the modeling of advection-diffusion-reaction phenomena in elongated domains (e.g., pipes). This combination leads to what we define as HiPOD model reduction, which merges the reliability of HiMod reduction with the computational efficiency of POD. Two HiPOD techniques are presented and assessed by an extensive numerical verification.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

HyLiPoD: Parallel Particle Advection via a Hybrid of Lifeline Scheduling and Parallelization-Over-Data

Performance characteristics of parallel particle advection algorithms can vary greatly based on workload.With this short paper, we build a new algorithm based on results from a previous bake-off study which evaluated the performance of four algorithms on a variety of workloads. Our algorithm, called HyLiPoD, is a ''meta-algorithm,'' i.e., it considers the desired workload to choose from existing algorithms to maximize performance. To demonstrate HyliPoD's benefit, we analyze results from 162 tests including concurrencies of up to 8192 cores, meshes as large as 34 billion cells, and particle counts as large as 300 million. Our findings demonstrate that HyLiPoD's adaptive approach allows it to match the best performance of existing algorithms across diverse workloads.

high performance computing↗
DOE OSTI2021

Hierarchical Fractional Advection-Dispersion Equation (FADE) to Quantify Anomalous Transport in River Corridor over a Broad Spectrum of Scales: Theory and Applications

Fractional calculus-based differential equations were found by previous studies to be promising tools in simulating local-scale anomalous diffusion for pollutants transport in natural geological media (geomedia), but efficient models are still needed for simulating anomalous transport over a broad spectrum of scales. This study proposed a hierarchical framework of fractional advection-dispersion equations (FADEs) for modeling pollutants moving in the river corridor at a full spectrum of scales. Applications showed that the fixed-index FADE could model bed sediment and manganese transport in streams at the geomorphologic unit scale, whereas the variable-index FADE well fitted bedload snapshots at the reach scale with spatially varying indices. Further analyses revealed that the selection of the FADEs depended on the scale, type of the geomedium (i.e., riverbed, aquifer, or soil), and the type of available observation dataset (i.e., the tracer snapshot or breakthrough curve (BTC)). When the pollutant BTC was used, a single-index FADE with scale-dependent parameters could fit the data by upscaling anomalous transport without mapping the sub-grid, intermediate multi-index anomalous diffusion. Pollutant transport in geomedia, therefore, may exhibit complex anomalous scaling in space (and/or time), and the identification of the FADE’s index for the reach-scale anomalous transport, which links the geomorphologic unit and watershed scales, is the core for reliable applications of fractional calculus in hydrology.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Hierarchical Model Reduction Driven by Machine Learning for Parametric Advection-Diffusion-Reaction Problems in the Presence of Noisy Data

Abstract We propose a new approach to generate a reliable reduced model for a parametric elliptic problem, in the presence of noisy data. The reference model reduction procedure is the directional HiPOD method, which combines Hierarchical Model reduction with a standard Proper Orthogonal Decomposition, according to an offline/online paradigm. In this paper we show that directional HiPOD looses in terms of accuracy when problem data are affected by noise. This is due to the interpolation driving the online phase, since it replicates, by definition, the noise trend. To overcome this limit, we replace interpolation with Machine Learning fitting models which better discriminate relevant physical features in the data from irrelevant unstructured noise. The numerical assessment, although preliminary, confirms the potentialities of the new approach.

97 MATHEMATICS AND COMPUTING↗