SEARCH · Search NASA

Results for “network flow”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 343 records · Page 19

All sources NASA NTRS DOE OSTI

DOE OSTI2026

Discovery of Probabilistic Dirichlet-to-Neumann Maps on Graphs

Dirichlet-to-Neumann maps enable the coupling of multiphysics simulations across computational subdomains by ensuring continuity of state variables and fluxes at artificial interfaces. We present a novel method for learning Dirichlet-to-Neumann maps on graphs using Gaussian processes, specifically for problems where the data obey a conservation law arising from an underlying partial differential equation. Our approach combines discrete exterior calculus and nonlinear optimal recovery to infer relationships between vertex and edge values. This framework yields data-driven predictions with uncertainty quantification across the entire graph, even when observations are limited to a subset of vertices and edges. By minimizing the reproducing kernel Hilbert space norm while penalizing kernel complexity through maximum likelihood estimation, our method ensures that the resulting surrogate strictly enforces conservation laws without overfitting. We demonstrate our method on two representative applications: subsurface flow in fracture networks and arterial blood flow. Finally, the results demonstrate that the method maintains high accuracy and well-calibrated uncertainty estimates even under severe data scarcity, highlighting its potential for scientific applications where limited data and reliable uncertainty quantification are critical.

Dirichlet-to-Neumann map↗

NASA NTRS2008

Toward Optimal Transport Networks

Strictly evolutionary approaches to improving the air transport system a highly complex network of interacting systems no longer suffice in the face of demand that is projected to double or triple in the near future. Thus evolutionary approaches should be augmented with active design methods. The ability to actively design, optimize and control a system presupposes the existence of predictive modeling and reasonably well-defined functional dependences between the controllable variables of the system and objective and constraint functions for optimization. Following recent advances in the studies of the effects of network topology structure on dynamics, we investigate the performance of dynamic processes on transport networks as a function of the first nontrivial eigenvalue of the network's Laplacian, which, in turn, is a function of the network s connectivity and modularity. The last two characteristics can be controlled and tuned via optimization. We consider design optimization problem formulations. We have developed a flexible simulation of network topology coupled with flows on the network for use as a platform for computational experiments.

Alexandrov, Natalia↗

DOE OSTI2022

A Comparison of Linear Solvers for Resolving Flow in Three-Dimensional Discrete Fracture Networks

We compare various methods for resolving steady flow within three-dimensional discrete fracture networks, including direct methods, Krylov subspace methods with and without preconditioning, and multi-grid methods. We compared the performance of the methods based on compute times and scaling of the solution as a function of the number of grid nodes and log-variance of the hydraulic aperture. The methods are applied to three test cases: (a) variable density of networks with a truncated power-law distribution of fracture lengths, (b) a fixed network composed of monodisperse fracture sizes but varied permeability/aperture heterogeneity, (c) and a network based on field site in Nevada, US. We chose these cases to allow us to study the impact of the mesh size and flow properties, as well as to demonstrate our conclusions on a large-scale, realistic problem (more than 40 million mesh nodes). A direct solution using Cholesky factorization outperformed other methods for every example but was closely followed in performance by some algebraic multigrid (AMG) preconditioned Krylov subspace methods. Among the Krylov methods, conjugate gradients (CG) with an AMG preconditioner performs the best. Generally, Cholesky factorization is recommended, but CG with an AMG preconditioner may be suitable for very large problems beyond 40 million nodes where the entire linear system cannot reside in memory.

58 GEOSCIENCES↗

DOE OSTI2025

Graph-Based Attention Mechanisms for Solving the AC Optimal Power Flow Problem in Electrical Power Networks

With the increasing complexity and data availability in modern power systems, learning-based approaches to AC Optimal Power Flow (AC OPF) have garnered significant attention. In particular, the structure of smart grids lends itself naturally to graph-based representations, where Graph Neural Networks (GNNs) can capture spatial and relational dependencies. This paper investigates attention-based GNN architectures tailored to heterogeneous graph representations of electric grids. We evaluate two major paradigms: relational attention, which distinguishes between edge types during message passing, and meta-path attention, which captures high-level semantics through multi-hop, typed paths. Using a large corpus of public AC OPF scenarios, we benchmark representative models of each type of attention. Our results demonstrate the benefits of heterogeneous attention-based models in accurately capturing grid dynamics; heterogeneous attention models achieve superior performance in both standard and perturbed settings. The findings highlight the importance of semantic-aware architectures for improving prediction robustness and interpretability in power system applications.

Trigui, Ali [Qubit Engineering Inc.]↗

DOE OSTI2021

Numerical and Analytical Modeling of Flow Partitioning in Partially Saturated Fracture Networks

Infiltration processes in fractured-porous media remain a crucial, yet not very well understood component of recharge and vulnerability assessment. Under partially-saturated conditions flows in fractures, percolating fracture networks, and fault zones contribute to the fastest spectrum of infiltration velocities via preferential pathways. Specifically, the partitioning dynamics at fracture intersections determine the magnitude of flow fragmentation into vertical and horizontal components and hence the bulk flow velocity and dispersion of fracture networks. In this work, we derive an approximate analytical solution for the partitioning process and validate it using smoothed particle hydrodynamics simulations. The developed transfer function is conceptually based on simulation results and laboratory experiments carried out in previous works. It allows to efficiently simulate flow through fracture networks with simple cubic structure and arbitrary number of fractures and aperture sizes via linear response theory and convolution of a given input signal. We derive a non-dimensional bulk flow velocity ($\widetilde{v}$) and dispersion coefficient ($\widetilde{D}$) to characterize fracture networks in terms of dimensionless horizontal and vertical time scales $\tau_m$ and $\tau_0$. The dispersion coefficient is shown to strongly depend on the horizontal time scale and converges towards a constant value of $0.08$ within reasonable fluid and geometrical parameter ranges, while the non-dimensional velocity exhibits a characteristic $\widetilde{v} \sim \tau_m^{-1/2}$ scaling. Given that hydraulic information is often only available at limited places within (fractured-porous) aquifer system, such as boreholes or springs, our study intends to provide a rudimentary analytical concept to potentially reconstruct internal fracture network geometries from external boundary information, e.g., the dispersive properties of discharge (groundwater level fluctuations).

42 ENGINEERING↗

DOE OSTI2012

Effect of Network Structure on Characterization and Flow Modeling Using X-ray Micro-Tomography Images of Granular and Fibrous Porous Media

Image-based network modeling has become a powerful tool for modeling transport in real materials that have been imaged using X-ray computed micro-tomography (XCT) or other three-dimensional imaging techniques. Network generation is an essential part of image-based network modeling, but little quantitative work has been done to understand the influence of different network structures on modeling. We use XCT images of three different porous materials (disordered packings of spheres, sand, and cylinders) to create a series of four networks for each material. Despite originating from the same data, the networks can be made to vary over two orders of magnitude in pore density, which in turn affects network properties such as pore-size distribution and pore connectivity. Despite the orders-of-magnitude difference in pore density, single-phase permeability predictions remain remarkably consistent for a given material, even for the simplest throat conductance formulas. Detailed explanations for this beneficial attribute are given in the article; in general, it is a consequence of using physically representative network models. The capillary pressure curve generated from quasi-static drainage is more sensitive to network structure than permeability. However, using the capillary pressure curve to extract pore-size distributions gives reasonably consistent results even though the networks vary significantly. These results provide encouraging evidence that robust network modeling algorithms are not overly sensitive to the specific structure of the underlying physically representative network, which is important given the variety image-based network-generation strategies that have been developed in recent years.

42 ENGINEERING↗

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 OSTI2012

Permeability and Dispersion Coefficients in Rocks with Fracture Network - 12140

Fluid flow and solute transport are considered for a rock medium with a fracture network with regard to the effective permeability and the dispersion coefficients. To investigate the effects of individual fractures a three-fracture system is chosen in which two are parallel and the third one connects the two at different angles. Specifically the micro-cell boundary-value problems(defined through multiple scale analysis) are solved numerically by using finite elements to calculate the permeability and dispersion coefficients. It is shown that the permeability depends significantly on the pattern of the fracture distribution and the dispersion coefficient is influenced by both the externally imposed pressure gradient (which also reflects the flow field) and the direction of the gradient of solute concentration on the macro-scale. From the calculations of the permeability and dispersion coefficients for solute in a rock medium with a fracture network the following conclusions are drawn. 1. The permeability of fractured medium depends on the primary orientation of the fracture network and is influenced by the connecting fractures in the medium. 2. The cross permeability, e.g., permeability in the direction normal to the direction of the external pressure gradient is rather insensitive to the orientation of the fracture network. 3. Calculation of permeability is most efficiently achieved with optimal discretization across individual fractures and is rather insensitive to the discretization along the fracture.. 4. The longitudinal dispersion coefficient Dxx of a fractured medium depends on both the macro-scale concentration gradient and the direction of the flow (pressure gradient). Hence both features must be considered when investigating solute transport in a fractured medium. (authors)

42 ENGINEERING↗

DOE OSTI2021

Physics-informed neural networks for solving forward and inverse flow problems via the Boltzmann-BGK formulation

We report the Boltzmann equation with the Bhatnagar-Gross-Krook collision model (Boltzmann-BGK equation) has been employed to describe multiscale flows, i.e., from the hydrodynamic limit to free molecular flow. In this study we employ physics-informed neural networks (PINNs) to solve forward and inverse problems via the Boltzmann-BGK formulation (PINN-BGK), enabling PINNs to model flows in both the continuum and rarefied regimes. In particular, the PINN-BGK is composed of three sub-networks, i.e., the first for approximating the equilibrium distribution function, the second for approximating the non-equilibrium distribution function, and the third one for encoding the Boltzmann-BGK equation as well as the corresponding boundary/initial conditions. By minimizing the residuals of the governing equations and the mismatch between the predicted and provided boundary/initial conditions, we can approximate the Boltzmann-BGK equation for both continuous and rarefied flows. For forward problems, the PINN-BGK is utilized to solve various benchmark flows given boundary/initial conditions, e.g. Kovasznay flow, Taylor-Green flow, cavity flow, and micro Couette flow for Knudsen number up to 5. For inverse problems, we focus on rarefied flows in which accurate boundary conditions are difficult to obtain. We employ the PINN-BGK to infer the flow field in the entire computational domain given a limited number of interior scattered measurements on the velocity without using the (unknown) boundary conditions. Results for the two-dimensional micro Couette and micro cavity flows with Knudsen numbers ranging from 0.1 to 10 indicate that the PINN-BGK can infer the velocity field in the entire domain with good accuracy. Finally, we also present some results on using transfer learning to accelerate the training process. Specifically, we can obtain a three-fold speedup comparted to the standard training process (e.g., Adam plus L-BFG-B) for the two-dimensional flow problems considered in our work.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2019

Characterizing the Influence of Fracture Density on Network Scale Transport

The topology of natural fracture networks is inherently linked to the structure of the fluid velocity field and transport therein. Here we study the impact of network density on flow and transport behaviors. We stochastically generate fracture networks of varying density and simulate flow and transport with a discrete fracture network model, which fully resolves network topology at the fracture scale. We study conservative solute trajectories with Lagrangian particle tracking and find that as fracture density decreases, solute channelization to large local fractures increases, thereby reducing plume spreading. Furthermore, in sparse networks mean particle travel distance increases and local network features, such as velocity zones where flow is counter to the primary pressure gradient, become increasingly important for transport. As the network density increases, network statistics homogenize and such local features have a reduced impact. We quantify local topological influence on transport behavior with an effective tortuosity parameter, which measures the ratio of total advective distance to linear distance at the fracture scale; large tortuosity values are correlated to slow-velocity regions. Additionally, these large tortuosity, slow-velocity regions delay downstream transport and enhance tailing on particle breakthrough curves. Finally, we predict transport with an upscaled, Bernoulli spatial Markov random walk model and parameterize local topological influences with a novel tortuosity parameter. Furthermore, Bernoulli model predictions improve when sampling from a tortuosity distribution, as opposed to a fixed value as has previously been done, suggesting that local network topological features must be carefully considered in upscaled modeling efforts of fracture network systems.

58 GEOSCIENCES↗

DOE OSTI2023

Topological Relationship–Based Flow Direction Modeling: Mesh–Independent River Networks Representation

River networks are important features in surface hydrology. However, accurately representing river networks in spatially distributed hydrologic and Earth system models is often sensitive to the model's spatial resolution. Specifically, river networks are often misrepresented because of the mismatch between the model's spatial resolution and river network details, resulting in significant uncertainty in the projected flow direction. In this study, we developed a topological relationship-based river network representation method for spatially distributed hydrologic models. This novel method uses (a) graph theory algorithms to simplify real-world vector-based river networks and assist in mesh generation; and (b) a topological relationship-based method to reconstruct conceptual river networks. The main advantages of our method are that (a) it combines the strengths of vector-based and DEM raster-based river network extraction methods; and (b) it is mesh-independent and can be applied to both structured and unstructured meshes. This method paves a path for advanced terrain analysis and hydrologic modeling across different scales.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2021

An Analysis Framework for Distribution Network DER Integration Analysis in India: Distributed Solar in Tamil Nadu

This report is part of a two-part series that represents a year-long collaboration with the Tamil Nadu Generation and Distribution Corporation Limited (TANGEDCO) on power sector planning. The first report in this series, the Pathways for Tamil Nadu’s Electric Power Sector 2017-2030 report outlines NREL’s work with TANGEDCO's electricity sector planning department to develop a model of the State’s power system and evaluate multiple scenarios of system growth given resource constraints, costs of technologies, and power sector policies. This second report in this series focuses on the rapidly transforming distribution network in the State. The report outlines a framework developed by NREL with TANGEDCO's distribution utility to quickly and accurately analyze the impacts of integrating renewable energy, specifically rooftop solar PV onto Tamil Nadu's distribution system. Together these studies help to prepare Tamil Nadu for a rapidly transforming power system.

14 SOLAR ENERGY↗

DOE OSTI2024

Numerical Investigation of Butterfly Valve Performance in Variable Valve Sizes, Positions and Flow Regimes

Reliability and efficiency of valves are necessary for precise control and sufficient heat-flow to heat application plants for the integrated energy systems of nuclear power plants (NPPs). Strategic Management Analysis Requirement and Technology (SMART) valves’ ability to control flow and assess environmental parameters stands out for these requirements. Their ability to sustain the downstream flow rate, prevent reverse flow, and maintain pressure in the heat transport loop is much more efficient with the integration of sensors and intelligent algorithms. For assessing valve performance and monitoring, mechanical design and operating conditions are two important parameters. In this study, the butterfly valves of three different sizes are simulated with water and steam using STAR-CCM+ in various flow regimes and positions to analyze performance parameters to strategize an automated control system for efficiently balancing the heat–transport network. Also, flow behavior is studied using velocity and pressure fields for valve–body geometry optimization. It can be observed, through performance parameters, that the valves are suitable for operation between 30° and 90° positions with significantly low loss coefficients and high flow coefficients, and the performance parameters follow a certain pattern in both water and steam flow in each scenario.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

DOE OSTI2025

Mesh-based super-resolution of fluid flows with multiscale graph neural networks

A graph neural network (GNN) approach is introduced in this work which enables mesh-based three-dimensional super-resolution of fluid flows. In this framework, the GNN is designed to operate not on the full mesh-based field at once, but on localized meshes of elements (or cells) directly. To facilitate mesh-based GNN representations in a manner similar to spectral (or finite) element discretizations, a baseline GNN layer (termed a message passing layer, which updates local node properties) is modified to account for synchronization of coincident graph nodes, rendering compatibility with commonly used element-based mesh connectivities. Furthermore, the architecture is multiscale in nature, and is comprised of a combination of coarse-scale and fine-scale message passing layer sequences (termed processors) separated by a graph unpooling layer. The coarse-scale processor embeds a query element (alongside a set number of neighboring coarse elements) into a single latent graph representation using coarse-scale synchronized message passing over the element neighborhood, and the fine-scale processor leverages additional message passing operations on this latent graph to correct for interpolation errors. Demonstration studies are performed using hexahedral mesh-based data from Taylor–Green Vortex and backward-facing step flow simulations at Reynolds numbers of 1600 and 3200. Through analysis of both global and local errors, the results ultimately show how the GNN is able to produce accurate super-resolved fields compared to targets in both coarse-scale and multiscale model configurations. Reconstruction errors for fixed architectures were found to increase in proportion to the Reynolds number. Geometry extrapolation studies on a separate cavity flow configuration show promising cross-mesh capabilities of the super-resolution strategy.

Backward-facing step↗

DOE OSTI2022

A gradient-based deep neural network model for simulating multiphase flow in porous media

We report simulation of multiphase flow in porous media is crucial for the effective management of subsurface energy and environment-related activities. The numerical simulators used for modeling such processes rely on spatial and temporal discretization of the governing mass and energy balance partial-differential equations (PDEs) into algebraic systems via finite-difference/volume/element methods. These simulators usually require dedicated software development and maintenance, and suffer low efficiency from a runtime and memory standpoint for problems with multi-scale heterogeneity, coupled-physics processes or fluids with complex phase behavior. Therefore, developing cost-effective, data-driven models can become a practical choice, and in this work, we choose deep learning approaches as they can handle high dimensional data and accurately predict state variables with strong nonlinearity. In this paper, we describe a gradient-based deep neural network (GDNN) constrained by the physics related to multiphase flow in porous media. We tackle the nonlinearity of flow in porous media induced by rock heterogeneity, fluid properties, and fluid-rock interactions by decomposing the nonlinear PDEs into a dictionary of elementary differential operators. We use a combination of operators to handle rock spatial heterogeneity and fluid flow by advection. Since the augmented differential operators are inherently related to the physics of fluid flow, we treat them as first principles prior knowledge to regularize the GDNN training. We use the example of pressure management at geologic CO 2 storage sites, where CO 2 is injected in saline aquifers and brine is produced, and apply GDNN to construct a predictive model that is trained with physics-based simulation data and emulates the physics process. We demonstrate that GDNN can effectively predict the nonlinear patterns of subsurface responses, including the temporal and spatial evolution of the pressure and saturation plumes. We also successfully extend the GDNN to convolutional neural network (CNN), namely gradient-based CNN (GCNN), and validate its capability to improve the prediction accuracy. GDNN has great potential to tackle challenging problems that are governed by highly nonlinear physics and enable the development of data-driven models with higher fidelity.

42 ENGINEERING↗

NASA NTRS2012

Flow Analysis Tool White Paper

Faster networks are continually being built to accommodate larger data transfers. While it is intuitive to think that implementing faster networks will result in higher throughput rates, this is often not the case. There are many elements involved in data transfer, many of which are beyond the scope of the network itself. Although networks may get bigger and support faster technologies, the presence of other legacy components, such as older application software or kernel parameters, can often cause bottlenecks. Engineers must be able to identify when data flows are reaching a bottleneck that is not imposed by the network and then troubleshoot it using the tools available to them. The current best practice is to collect as much information as possible on the network traffic flows so that analysis is quick and easy. Unfortunately, no single method of collecting this information can sufficiently capture the whole endto- end picture. This becomes even more of a hurdle when large, multi-user systems are involved. In order to capture all the necessary information, multiple data sources are required. This paper presents a method for developing a flow analysis tool to effectively collect network flow data from multiple sources and provide that information to engineers in a clear, concise way for analysis. The purpose of this method is to collect enough information to quickly (and automatically) identify poorly performing flows along with the cause of the problem. The method involves the development of a set of database tables that can be populated with flow data from multiple sources, along with an easyto- use, web-based front-end interface to help network engineers access, organize, analyze, and manage all the information.

Boscia, Nichole K.↗

DOE OSTI2020

Wave function analysis with a maximum flow algorithm

An efficient algorithm for computing the maximum-flow path in a network is applied to the identification of the dominant configuration state functions (CSFs) in a graphically contracted function (GCF), configuration interaction, wave function. The flow network is a space of spin-adapted CSFs represented by a Shavitt graph, wherein the nodes correspond to orbital occupations and spin quantum numbers. The graph nodes are connected by arcs, and an arc density is defined as sums of the associated squared CSF coefficients. A max-min approach determines an upper bound to the maximum possible incoming flow for each graph node. A backtracking step generates a candidate walk and is followed by a limited search of alternative branching paths for the dominant CSF. The arc density contributions are removed from the graph, and the algorithm is reapplied to the updated graph. This list of generated walks can be partitioned in order to guarantee that the dominant CSFs have been identified. All of the steps in this algorithm are computationally efficient and do not depend on the potentially large dimension of the underlying linear CSF expansion space. An analysis of low-lying valence states of C-2 illustrates the method.

74 ATOMIC AND MOLECULAR PHYSICS↗

DOE OSTI2026

Stochastic fracture generation and thermo-hydro-mechanical modeling in an equivalent continuum framework for enhanced geothermal systems

Enhanced geothermal systems (EGS) involve fracturing low permeability material to establish well connectivity and then injecting and circulating fluid into the fractured subsurface for geothermal power production. Changes in fracture aperture from contraction of the cooling matrix rock may alter network connectivity and risk thermal short-circuiting. Thermo-hydro-mechanical (THM) models are a useful tool to study these processes. However, as fracture networks are complex, and data may be limited, fracture networks in THM models are often stochastically generated. Given reliance on stochastic fracture networks and THM modeling to represent the subsurface and assess productivity of EGS, increased understanding of the influence of such statistically derived fracture networks on flow and heat transport in THM models is needed. Here, a new fracture process model is developed in the reactive transport code PFLOTRAN to stochastically generate fracture families and simulate changes in fracture aperture over time due to temperature changes of the rock matrix. Sixty-four different fracture networks ranging from well to poorly-connected, are modeled in PFLOTRAN with and without mechanical processes (THM vs TH). Results indicate that for well-connected fracture networks, thermal short-circuiting is less of a concern due to the abundance of available alternative flowpaths. For poorly-connected fracture networks, inclusion of mechanical processes showed steep thermal drawdown coincident with increase in fracture aperture along developing colder flowpaths, demonstrating the risk of thermal short-circuiting. Simulations with additional, larger fractures engineered to establish connectivity in a poorly-fractured subsurface, indicate that while stochastic variation of fracture orientation of the background network had limited influence, such variation in the engineered fractures significantly affected flow and heat transport.

Discrete fracture networks (DFN)↗