Search NASA⌕ Search

SEARCH · Search NASA

Results for “network flow equations”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

B-PINNs: Bayesian Physics-informal Neural Networks for Forward and Inverse PDE Problems with Noisy Data

We propose a Bayesian physics-informed neural network (B-PINN) to solve both forward and inverse nonlinear problems described by partial differential equations (PDEs) and noisy data. In this Bayesian framework, the Bayesian neural network (BNN) combined with a PINN for PDEs serves as the prior while the Hamiltonian Monte Carlo (HMC) or the variational inference (VI) could serve as an estimator of the posterior. B-PINNs make use of both physical laws and scattered noisy measurements to provide predictions and quantify the aleatoric uncertainty arising from the noisy data in the Bayesian framework. Compared with PINNs, in addition to uncertainty quantification, B-PINNs obtain more accurate predictions in scenarios with large noise due to their capability of avoiding overfitting. We conduct a systematic comparison between the two different approaches for the B-PINNs posterior estimation (i.e., HMC or VI), along with dropout used for quantifying uncertainty in deep neural networks. Our experiments show that HMC is more suitable than VI with mean field Gaussian approximation for the B-PINNs posterior estimation, while dropout employed in PINNs can hardly provide accurate predictions with reasonable uncertainty. Finally, we replace the BNN in the prior with a truncated Karhunen-Loève (KL) expansion combined with HMC or a deep normalizing flow (DNF) model as posterior estimators. The KL is as accurate as BNN and much faster but this framework cannot be easily extended to high-dimensional problems unlike the BNN based framework.

Non linear PDEs, Noisy data, Bysian physics inform↗
DOE OSTI2022

Dynamic calibration of differential equations using machine learning, with application to turbulence models

We present a methodology for calibration of parametric ordinary and partial differential equation models, using off-the-shelf software for back-propagation in Neural Networks (NN). As a prototypical example, we consider calibration of a Reynolds-averaged Navier-Stokes (RANS) turbulence closure model, against ground truth data from direct numerical simulations (DNS) of two different turbulent flows. Numerical time integration is represented as a custom NN, where only the RANS model parameters are trainable. A loss function is defined to quantify the mismatch between the NN prediction and the ground truth over a predefined, finite time integration window. This loss function is then minimized using a gradient descent method utilizing the back-propagation algorithm. Furthermore, this dynamic approach to training is to be contrasted with a static approach, wherein a least square regression estimate for parameters is obtained in the limit of an infinitesimal time integration window. In a first test of static and dynamic approaches against ground truth data generated by the model, the former proves to be significantly faster and more accurate than the latter at recovering the parameters. When both calibration approaches are tested against DNS data, for which it is known that the model cannot achieve a perfect fit, the static approach yields a good prediction only for short times, while the dynamic approach results in physical and stable predictions over the entire integration window. After optimization of the dynamic approach for time step, spatial resolution, stability, and physics-based constraints, we obtain a 50% improvement of outcomes over those obtained from the existing, manually calibrated set of parameters, demonstrating the merits of this systematic and automated procedure.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Synergistic learning with multi-task DeepONet for efficient PDE problem solving

Multi-task learning (MTL) is an inductive transfer mechanism designed to leverage useful information from multiple tasks to improve generalization performance compared to single-task learning. It has been extensively explored in traditional machine learning to address issues such as data sparsity and overfitting in neural networks. In this work, we apply MTL to problems in science and engineering governed by partial differential equations (PDEs). However, implementing MTL in this context is complex, as it requires task-specific modifications to accommodate various scenarios representing different physical processes. To this end, we present a multi-task deep operator network (MT-DeepONet) to learn solutions across various functional forms of source terms in a PDE and multiple geometries in a single concurrent training session. We introduce modifications in the branch network of the vanilla DeepONet to account for various functional forms of a parameterized coefficient in a PDE. Additionally, we handle parameterized geometries by introducing a binary mask in the branch network and incorporating it into the loss term to improve convergence and generalization to new geometry tasks. Our approach is demonstrated on three benchmark problems: (1) learning different functional forms of the source term in the Fisher equation; (2) learning multiple geometries in a 2D Darcy Flow problem and showcasing better transfer learning capabilities to new geometries; and (3) learning 3D parameterized geometries for a heat transfer problem and demonstrate the ability to predict on new but similar geometries. Finally, our MT-DeepONet framework offers a novel approach to solving PDE problems in engineering and science under a unified umbrella based on synergistic learning that reduces the overall training cost for neural operators.

42 ENGINEERING↗
DOE OSTI2020

A new form of the Saint-Venant equations for variable topography

The solution stability of river models using the one-dimensional (1D) Saint-Venant equations can be easily undermined when source terms in the discrete equations do not satisfy the Lipschitz smoothness condition for partial differential equations. Although instability issues have been previously noted, they are typically treated as model implementation issues rather than as underlying problems associated with the form of the governing equations. This study proposes a new reference slope form of the Saint-Venant equations to ensure smooth slope source terms and eliminate one source of potential numerical oscillations. It is shown that a simple algebraic transformation of channel geometry provides a smooth reference slope while preserving the correct cross-section flow area and the total Piezometric pressure gradient that drives the flow. The reference slope method ensures the slope source term in the governing equations is Lipschitz continuous while maintaining all the underlying complexity of the real-world geometry. The validity of the mathematical concept is demonstrated with the open-source Simulation Program for River Networks (SPRNT) model in a series of artificial test cases and a simulation of a small urban creek. Validation comparisons are made with analytical solutions and the Hydrologic Engineering Center's River Analysis System (HEC-RAS) model. The new method reduces numerical oscillations and instabilities without requiring ad hoc smoothing algorithms.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

A learning-augmented approach for AC optimal power flow

Because of the high nonlinearity of AC optimal power flow (OPF), numerous efforts have been made in recent decades to find efficient methods. Machine learning (ML) has proven to significantly reduce the computational costs in many real-world problems. Thus, this paper develops a learning-augmented method for solving AC OPF, which integrates both power network equations and ML to yield near-optimal solutions. More specifically, ML models are developed to first predict bus voltage magnitudes and angles. Then, physics-based network equations are employed to calculate the power injection at different buses. Three ML algorithms, i.e., random forest, multi-target decision tree, and extreme learning machine, are explored and compared. To evaluate the efficiency of the proposed learning-augmented AC OPF solver, the MATPOWER Interior Point Solver is adopted as a baseline. Case studies on both 500-bus and 4918-bus test networks show that the proposed learning-augmented method has reduced the computational time by 15–100 times depending on the network size with a minimal loss in optimality.

42 ENGINEERING↗
DOE OSTI2024

Role of physics in physics-informed machine learning

Physical systems are characterized by inherent symmetries, one of which is encapsulated in the units of their parameters and system states. These symmetries enable a lossless order-reduction, e.g., via dimensional analysis based on the Buckingham theorem. Despite the latter's benefits, machine learning (ML) strategies for the discovery of constitutive laws seldom subject experimental and/or numerical data to dimensional analysis. We demonstrate the potential of dimensional analysis to significantly enhance the interpretability and generalizability of ML-discovered secondary laws. Our numerical experiments with creeping fluid flow past solid ellipsoids show how dimensional analysis enable both deep neural networks and sparse regression reproduce old results, e.g., Stokes law for a sphere, and generate new ones, e.g., an expression for an ellipsoid misaligned with the flow direction. Furthermore, our results suggest the need to incorporate other physics-based symmetries and invariances into ML-based techniques for equation discovery.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Flow dynamics and heat transfer in simplified battery energy storage systems with heated battery modules

Large-scale energy storage systems (ESSs) composed of batteries show promise in addressing current energy challenges, but dissipation of generated heat is important. Here, this paper focuses on buoyant convective flows in simplified ESS battery racks. Natural convection is not generally the primary cooling strategy but can be important in abnormal scenarios where there is module overheat or potentially thermal runaway. We use computational fluid dynamics to investigate the flow dynamics and heat transfer mechanisms in a simplified parameterized rack design. Despite its simplicity, this configuration produces many of the relevant features expected in real ESSs without details of module geometry or hardware, allowing broad conclusions independent of manufacture-specific designs. We start by providing visualizations of the flowfield and measurements of entrainment, heat flux, and pressure. To characterize the dependence on the system parameters, we develop an integral-scale analysis of the average temperature equation to highlight the dominant source terms. We use results from this analysis to derive a steady network model composed of simple algebraic expressions to provide first-order predictions of entrainment through the rack. The network model leads to a linear scaling of the Reynolds number based on convective mass flux with respect to the Grashof number based on the heat source. We deduce empirical relationships that relate the heat exchanged between modules using a surface-averaged Nusselt number as a function of the local Reynolds and Rayleigh numbers. Lastly, we investigate how space between the modules and rack in the spanwise direction creates flow bypass, resulting in different flow pathways.

Battery thermal management↗
DOE OSTI2021

A physics-informed and hierarchically regularized data-driven model for predicting fluid flow through porous media

This paper presents a new deep learning data-driven model for predicting structure dependent pore-fluid velocity fields in rock. The model is based on a Convolutional Auto-Encoder (CAE) artificial neural network capable of learning from image data generated by direct numerical simulations of fluid flow through pore-structures, such as by Lattice Boltzmann or molecular dynamics methods. The main novelty of the model in comparison to previous CAE-based data-driven approaches consists of three parts. The first is a methodology for decomposing the full-domain of the porous media into sub-regions, or “sub-domains”, in order to reduce the overall size of the CAE, batch process the sub-domains in parallel, and enable the CAE to learn local and generalizable nonlinear mappings of pore-fluid velocities. The second consists of embedding the finite difference solutions of the incompressible Navier-Stokes and continuity equations into convolutional layers prior to the CAE in order to provide the CAE with knowledge of fluid dynamics physics (PhyFlow). The third main novelty is that the training of the CAE is regularized with a hierarchical loss function that encourages the learning of fluid flow patterns (in a way similar to ranked modes in principal component analysis), ranking from most to least important. This is shown to increase the stability in learning, reduce over-fitting, and promote interpretability of the CAE neural network layers (HierCAE). The comprehensive new data-driven model, which we call the PhyFlow-HierCAE model, is shown to exhibit improved accuracy and generalizability of flow field predictions over conventional CAE models, attributable to the embedded physical knowledge and the hierarchical regularization, as well as realize orders of magnitude speed-ups in computation times as a surrogate for the direct numerical simulations. Examples of training and forward predictions on unseen pore-structures are provided and evaluated for data from Lattice Boltzmann and molecular dynamics simulations of pore-fluid flow. The model is shown to be a fast and accurate emulator (or “surrogate”) for predicting effective permeability of unseen pore-structures based on learning from relatively small direct numerical simulation datasets.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Reactive Flows in Porous Media: Challenges in Theoretical and Numerical Methods

We review theoretical and computational research, primarily from the past 10 years, addressing the flow of reactive fluids in porous media. The focus is on systems where chemical reactions at the solid–fluid interface cause dissolution of the surrounding porous matrix, creating nonlinear feedback mechanisms that can often lead to greatly enhanced permeability. Here, we discuss insights into the evolution of geological forms that can be inferred from these feedback mechanisms, as well as some geotechnical applications such as enhanced oil recovery, hydraulic fracturing, and carbon sequestration. Until recently, most practical applications of reactive transport have been based on Darcy-scale modeling, where averaged equations for the flow and reactant transport are solved. We summarize the successes and limitations of volume averaging, which leads to Darcy-scale equations, as an introduction to pore-scale modeling. Pore-scale modeling is computationally intensive but offers new insights as well as tests of averaging theories and pore-network models. We include recent research devoted to validation of pore-scale simulations, particularly the use of visual observations from microfluidic experiments.

wormhole formation↗
DOE OSTI2023

The hidden structure of hydrodynamic transport in random fracture networks

We study the large-scale dynamics and prediction of hydrodynamic transport in random fracture networks. The flow and transport behaviour is characterized by first passage times and displacement statistics, which show heavy tails and anomalous dispersion with a strong dependence on the injection condition. The origin of these behaviours is investigated in terms of Lagrangian velocities sampled equidistantly along particle trajectories, unlike classical sampling strategies at a constant rate. The velocity series are analysed by their copula density, the joint distribution of the velocity unit scores, which reveals a simple, albeit hidden, correlation structure that can be described by a Gaussian copula. Based on this insight, we derive a Langevin equation for the evolution of equidistant particle speeds. In this framework, particle motion is quantified by a stochastic time-domain random walk, the joint density of particle position, and speed satisfies a Klein–Kramers equation. The upscaled theory quantifies particle motion in terms of the characteristic fracture length scale and the distribution of Eulerian flow velocities. That is, it is predictive in the sense that it does not require the a priori knowledge of transport attributes. The upscaled model captures non-Fickian transport features, and their dependence on the injection conditions in terms of the velocity point statistics and average fracture length. It shows that the first passage times and displacement moments are dominated by extremes occurring at the first step. The presented approach integrates the interaction of flow and structure into a predictive model for large-scale transport in random fracture networks.

42 ENGINEERING↗
DOE OSTI2020

Sliding Mode Network Perimeter Control

Urban traffic congestion is a chronic problem faced by many cities in the US and worldwide. It results in inefficient infrastructure use as well as increased vehicle fuel consumption and emission levels. Congestion is intertwined with delay, as road users waste precious hours on the road, which in turn reduces productivity. Researchers have developed, and continue to design, tools and systems to alleviate this problem. Network perimeter control is one such tool that has been studied extensively. It attempts to control the flow of vehicles entering a protected area to ensure that the congested regime predetermined by the Network Fundamental Diagram (NFD) is not reached. In this paper, a method derived from sliding mode control theory is presented. Its main advantages over proportional-integral controllers include (1) minimal tuning, (2) no linearization of the governing equations, (3) no assumptions with regard to the shape of the NFD, and (4) ability to handle various demand profiles without the need to retune the controller. A sliding mode controller was implemented and tested on a congested grid network. The results show that the proposed controller produces network-wide delay savings and disperses congestion effectively.

42 ENGINEERING↗
DOE OSTI2021

Topology optimization of additively manufactured fluidic components free of internal support structures

This report integrates projection-based approaches for implementing overhang constraints with fluid topology optimization to design additively manufactured fluidic components that do not require internal support structures. Internal support structures are challenging, potentially impossible to remove in complex fluid networks, yet would degrade fluidic performance if left within the part. This presents a major challenge in coupling topology optimization with additive manufacturing in the design of fluid components. The proposed approach leverages past work in overhang constraints for solid mechanics, including projection formulations and adjoint sensitivity analysis, and considers incompressible Navier–Stokes equations for laminar fluid flow. The approach is demonstrated on 2D and 3D fluid topology optimization problems to minimize pressure drop and constrain mass flow rates in pipes and manifolds. Resulting designs are crisp, logical, satisfy performance constraints, and satisfy overhang constraints, eliminating the need for internal support structures.

42 ENGINEERING↗
DOE OSTI2022

Learning functional priors and posteriors from data and physics

In this work, we develop a new Bayesian framework based on deep neural networks to be able to extrapolate in space-time using historical data and to quantify uncertainties arising from both noisy and gappy data in physical problems. Specifically, the proposed approach has two stages: (1) prior learning and (2) posterior estimation. At the first stage, we employ the physics-informed Generative Adversarial Networks (PI-GAN) to learn a functional prior either from a prescribed function distribution, e.g., Gaussian process, or from historical data and physics. At the second stage, we employ the Hamiltonian Monte Carlo (HMC) method to estimate the posterior in the latent space of PI-GANs. In addition, we use two different approaches to encode the physics: (1) automatic differentiation, used in the physicsinformed neural networks (PINNs) for scenarios with explicitly known partial differential equations (PDEs), and (2) operator regression using the deep operator network (DeepONet) for PDE-agnostic scenarios. We then test the proposed method for (1) meta-learning for one-dimensional regression, and forward/inverse PDE problems (combined with PINNs); (2) PDE-agnostic physical problems (combined with DeepONet), e.g., fractional diffusion as well as saturated stochastic (100-dimensional) flows in heterogeneous porous media; and (3) spatial-temporal regression problems, i.e., inference of a marine riser displacement field using experimental data from the Norwegian Deepwater Programme (NDP). The results demonstrate that the proposed approach can provide accurate predictions as well as uncertainty quantification given very limited scattered and noisy data, since historical data could be available to provide informative priors. In summary, the proposed method is capable of learning flexible functional priors, e.g., both Gaussian and non-Gaussian process, and can be readily extended to big data problems by enabling mini-batch training using stochastic HMC or normalizing flows since the latent space is generally characterized as low dimensional.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Deep Kronecker neural networks: A general framework for neural networks with adaptive activation functions

Here we propose a new type of neural networks, Kronecker neural networks (KNNs), that form a general framework for neural networks with adaptive activation functions. KNNs employ the Kronecker product, which provides an efficient way of constructing a very wide network while keeping the number of parameters low. Our theoretical analysis reveals that under suitable conditions, KNNs induce a faster decay of the loss than that by the feed-forward networks. This is also empirically verified through a set of computational examples. Furthermore, under certain technical assumptions, we establish global convergence of gradient descent for KNNs. As a specific case, we propose the Rowdy activation function that is designed to get rid of any saturation region by injecting sinusoidal fluctuations, which include trainable parameters. The proposed Rowdy activation function can be employed in any neural network architecture like feed-forward neural networks, Recurrent neural networks, Convolutional neural networks etc. The effectiveness of KNNs with Rowdy activation is demonstrated through various computational experiments including function approximation using feed-forward neural networks, solution inference of partial differential equations using the physics-informed neural networks, and standard deep learning benchmark problems using convolutional and fully-connected neural networks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Sequentially coupled flow and geomechanical simulation with a discrete fracture model for analyzing fracturing fluid recovery and distribution in fractured ultra-low permeability gas reservoirs

More accurate characterization and prediction of the in-situ distribution of fracturing fluid in fractured reservoirs are needed for enhancing well productivity. In this study, an implicit-sequentially coupled flow/geomechanics simulator incorporating an efficient discrete fracture model is developed to model fluid distribution and recovery performance of ultra-low permeability gas reservoirs. The finite-volume and finite-element methods are used for space discretization of the flow and geomechanics equations, respectively, while the backward Euler method is employed for time discretization. The flow and geomechanics equations are solved sequentially based on fixed-stress splitting. An efficient discrete-fracture model is used to explicitly model the fractured system. Flexible unstructured gridding is employed to model arbitrarily-oriented fractures. The interrelations among pore volume, permeability and geomechanical conditions are considered dynamically using two-way coupled flow and geomechanics computations. The geometry of fracture (networks) due to hydraulic fracturing has significant impacts on the fracturing fluid recovery efficiency and ensuing fluid distribution. Under the same injection volume, the fracturing fluid recovery is higher when the fracture geometry is planar. Fluid recovery is relatively lower whenever natural fractures are activated during fracturing treatments; flowback time is also shortened when complex fracture network with enlarged fracture interface is present. Fracturing fluid in hydraulic fractures may leak off into the natural fractures and subsequently imbibes into the surrounding matrix due to capillarity effects. The fracturing fluid recovery and in-situ fluid distribution are sensitive to the shut-in duration and fracture closure behavior. This study analyzes the coupled flow-geomechanical responses of fractured gas reservoirs during the post-fracturing periods. Understanding the fate of the fracturing fluid can provide insights on, to some extent, the stimulated fracture volume, size of the water invasion zone, and efficiency of the fracturing design. The simulation predictions can also provide more accurate initial reservoir conditions (e.g. distributions of different phases and pressure) for long-term well performance estimation.

42 ENGINEERING↗
DOE OSTI2023

Emissions minimization on road networks via Generic Second Order Models

In this paper we consider the problem of estimating emissions due to vehicular traffic on complex networks, and minimizing their effect by regulating traffic at junctions. For the traffic evolution, we consider a Generic Second Order Model, which encompasses the majority of two-equations (i.e., second-order) models available in the literature, and extend it to road networks with merge and diverge junctions. The dynamics on the whole network is determined by selecting a solution to the Riemann Problems at junctions, i.e., the Cauchy problems with constant initial data on each incident road. The latter are solved by assuming the maximization of the flow and assigning a traffic distribution coefficient for outgoing roads of diverges, and a priority rule for incoming roads of merges. A general emission model is considered and its parameters are tuned to the $ {\mathrm{NO_{x}}} $ emission rate. The minimization of emissions is then formulated in terms of the traffic distribution and priority parameters, taking into account travel times. A comparison is provided between roundabouts with optimized parameters and traffic lights, which correspond to time-varying traffic priorities. Our approach can be adapted to manage traffic in complex networks in order to reduce emissions while keeping travel time at acceptable levels.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2024

A Pseudoreversible Normalizing Flow for Stochastic Dynamical Systems with Various Initial Distributions

Here, we present a pseudoreversible normalizing flow method for efficiently generating samples of the state of a stochastic differential equation (SDE) with various initial distributions. The primary objective is to construct an accurate and efficient sampler that can be used as a surrogate model for computationally expensive numerical integration of SDEs, such as those employed in particle simulation. After training, the normalizing flow model can directly generate samples of the SDE’s final state without simulating trajectories. The existing normalizing flow model for SDEs depends on the initial distribution, meaning the model needs to be retrained when the initial distribution changes. The main novelty of our normalizing flow model is that it can learn the conditional distribution of the state, i.e., the distribution of the final state conditional on any initial state, such that the model only needs to be trained once and the trained model can be used to handle various initial distributions. This feature can provide a significant computational saving in studies of how the final state varies with the initial distribution. Additionally, we propose to use a pseudoreversible network architecture to define the normalizing flow model, which has sufficient expressive power and training efficiency for a variety of SDEs in science and engineering, e.g., in particle physics. We provide a rigorous convergence analysis of the pseudoreversible normalizing flow model to the target probability density function in the Kullback–Leibler divergence metric. Numerical experiments are provided to demonstrate the effectiveness of the proposed normalizing flow model.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Memory embedded non-intrusive reduced order modeling of non-ergodic flows

Generating a digital twin of any complex system requires modeling and computational approaches that are efficient, accurate, and modular. Traditional reduced order modeling techniques are targeted at only the first two, but the novel nonintrusive approach we present in this study is an attempt at taking all three into account effectively compared to their traditional counterparts. Based on dimensionality reduction using proper orthogonal decomposition (POD), we introduce a long short-term memory neural network architecture together with a principal interval decomposition (PID) framework as an enabler to account for localized modal deformation. As an effective partitioning tool for breaking the Kolmogorov barrier, our PID framework, therefore, can be considered a key element in the accurate reduced order modeling of convective flows. Our applications for convection-dominated systems governed by Burgers, Navier-Stokes, and Boussinesq equations demonstrate that the proposed approach yields significantly more accurate predictions than the POD-Galerkin method and could be a key enabler toward near real-time predictions of unsteady flows.

42 ENGINEERING↗