Characterizing 3-D flow velocity in evolving pore networks driven by CaC03 precipitation and dissolution.
Abstract not provided.
SEARCH · Search NASA
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.
Abstract not provided.
Abstract not provided.
The objective of this work is to develop algorithms associated with a comprehensive computational simulation system for turbomachinery flow fields. This development is accomplished in a modular fashion. These modules includes grid generation, visualization, network, simulation, toolbox, and flow modules. An interactive grid generation module is customized to facilitate the grid generation process associated with complicated turbomachinery configurations. With its user-friendly graphical user interface, the user may interactively manipulate the default settings to obtain a quality grid within a fraction of time that is usually required for building a grid about the same geometry with a general-purpose grid generation code. Non-Uniform Rational B-Spline formulations are utilized in the algorithm to maintain geometry fidelity while redistributing grid points on the solid surfaces. Bezier curve formulation is used to allow interactive construction of inner boundaries. It is also utilized to allow interactive point distribution. Cascade surfaces are transformed from three-dimensional surfaces of revolution into two-dimensional parametric planes for easy manipulation. Such a transformation allows these manipulated plane grids to be mapped to surfaces of revolution by any generatrix definition. A sophisticated visualization module is developed to al-low visualization for both grid and flow solution, steady or unsteady. A network module is built to allow data transferring in the heterogeneous environment. A flow module is integrated into this system, using an existing turbomachinery flow code. A simulation module is developed to combine the network, flow, and visualization module to achieve near real-time flow simulation about turbomachinery geometries. A toolbox module is developed to support the overall task. A batch version of the grid generation module is developed to allow portability and has been extended to allow dynamic grid generation for pitch changing turbomachinery configurations. Various applications with different characteristics are presented to demonstrate the success of this system.
Advances in computational science offer a principled pipeline for predictive modeling of cardiovascular flows and aspire to provide a valuable tool for monitoring, diagnostics and surgical planning. Such models can be nowadays deployed on large patient-specific topologies of systemic arterial networks and return detailed predictions on flow patterns, wall shear stresses, and pulse wave propagation. However, their success heavily relies on tedious pre-processing and calibration procedures that typically induce a significant computational cost, thus hampering their clinical applicability. Here, we put forth a machine learning framework that enables the seamless synthesis of non-invasive in-vivo measurement techniques and computational flow dynamics models derived from first physical principles. We illustrate this new paradigm by showing how one-dimensional models of pulsatile flow can be used to constrain the output of deep neural networks such that their predictions satisfy the conservation of mass and momentum principles. Once trained on noisy and scattered clinical data of flow and wall displacement, these networks can return physically consistent predictions for velocity, pressure and wall displacement pulse wave propagation, all without the need to employ conventional simulators. A simple post-processing of these outputs can also provide a relatively cheap and effective way for estimating Windkessel model parameters that are required for the calibration of traditional computational models. Finally, the effectiveness of the proposed techniques is demonstrated through a series of prototype benchmarks, as well as a realistic clinical case involving in-vivo measurements near the aorta/carotid bifurcation of a healthy human subject.
Energy extraction from subsurface reservoirs is important for addressing the increasing energy demand and environmental concerns such as global warming. However, the characterization of subsurface reservoirs, particularly reservoirs dominated by fracture networks remains a challenge due to the lack of means to directly observe subsurface processes. This study explores the feasibility and efficacy of characterizing fracture flow and transport processes in an enhanced geothermal system (EGS) testbed through stochastic tracer modeling. There are two enabling factors that allow application of stochastic modeling to characterize a subsurface reservoir. First, an abundance of geological and geophysical measurements enables the development of a high-fidelity and well-constrained fracture network model. Second, high-performance computing (HPC) allows running massive realizations efficiently. Six conservative tracer tests were stochastically modeled and produced satisfactory realizations that successfully reproduce field tracer recovery data from each tracer test. The evolution of flow and transport processes in the fracture network was then analyzed from these satisfactory realizations. This work demonstrates that stochastic tracer modeling on a high-fidelity fracture network model is feasible and can provide important insights regarding flow and transport characteristics in subsurface fractured reservoirs.
This article deals with approximating steady-state particle-resolved fluid flow around a fixed particle of interest under the influence of randomly distributed stationary particles in a dispersed multiphase setup using convolutional neural network (CNN). The considered problem involves rotational symmetry about the mean velocity (streamwise) direction. Thus, this work enforces this symmetry using SE(3)-equivariant, special Euclidean group of dimension 3, CNN architecture, which is translation and three-dimensional rotation equivariant. This study mainly explores the generalization capabilities and benefits of a SE(3)-equivariant network. Accurate synthetic flow fields for Reynolds number and particle volume fraction combinations spanning over a range of [86.22, 172.96] and [0.11, 0.45], respectively, are produced with careful application of symmetry-aware data-driven approach.
This paper proposes a methodology to produce random flow breakdown endogenously in a mesoscopic operational model, by capturing breakdown probability and duration. Based on previous research findings that probability of flow breakdown can be represented as a function of flow rate and the duration can be characterized by a hazard model. By generating random flow breakdown at various levels and capturing the traffic characteristics at the onset of the breakdown, the stochastic network simulation model provides a tool for evaluating travel time variability. The proposed model can be used for (1) providing reliability related traveler information; (2) designing ITS (intelligent transportation systems) strategies to improve reliability; and (3) evaluating reliability-related performance measures of the system.
Reacting astrophysical flows can be challenging to model, because of the difficulty in accurately coupling hydrodynamics and reactions. This can be particularly acute during explosive burning or at high temperatures where nuclear statistical equilibrium is established. We develop a new approach, based on the ideas of spectral deferred corrections (SDC) coupling of explicit hydrodynamics and stiff reaction sources as an alternative to operator splitting, that is simpler than the more comprehensive SDC approach we demonstrated previously. We apply the new method to a double-detonation problem with a moderately sized astrophysical nuclear reaction network and explore the time step size and reaction network tolerances, to show that the simplified-SDC approach provides improved coupling with decreased computational expense compared to traditional Strang operator splitting. This is all done in the framework of the Castro hydrodynamics code, and all algorithm implementations are freely available.
A number of Department of Energy (DOE) science applications, involving exascale computing systems and large experimental facilities, are expected to generate large volumes of data, in the range of petabytes to exabytes, which will be transported over wide-area networks for the purpose of storage, visualization, and analysis. The objectives of this proposal are to (1) develop and test the component technologies and their synthesis methods to achieve source-to-sink high-performance flows, and (2) develop tools that provide these capabilities through simple interfaces to users and applications. In terms of the former, we propose to develop (1) optimization methods that align and transition multiple storage flows to multiple network flows on multicore, multibus hosts; and (2) edge and long-haul network path realization and maintenance using advanced provisioning methods including OSCARS and OpenFlow. We also propose synthesis methods that combine these individual technologies to compose high-performance flows using a collection of constituent storage-network flows, and realize them across the storage and local network connections as well as long-haul connections. We propose to develop automated user tools that profile the hosts, storage systems, and network connections; compose the source-to-sink complex flows; and set up and maintain the needed network connections.
A finite volume scheme for the numerical solution of a non-isothermal non-adiabatic compressible flow model for gas transportation networks on non-flat topography is introduced. Unlike standard Euler equations, the model takes into account wall friction, variable height and heat transfer between the pipe and the environment which are source terms. The case of one single pipe was considered in a previous reference by the authors, , where a finite volume method with upwind discretization of the flux and source terms has been proposed in order to get a well-balanced scheme. The main goal of the present paper is to go a step further by considering a network of pipes. The main issue is the treatment of junctions for which container-like 2D finite volumes are introduced. The couplings between pipes (1D) and containers (2D) are carefully described and the conservation properties are analyzed. Numerical tests including real gas networks are solved showing the performance of the proposed methodology.
In the last 50 years there has been a tremendous progress in solving numerically the Navier-Stokes equations using finite differences, finite elements, spectral, and even meshless methods. Yet, in many real cases, we still cannot incorporate seamlessly (multi-fidelity) data into existing algorithms, and for industrial-complexity applications the mesh generation is time consuming and still an art. Moreover, solving ill-posed problems (e.g., lacking boundary conditions) or inverse problems is often prohibitively expensive and requires different formulations and new computer codes. Here, we employ physics-informed neural networks (PINNs), encoding the governing equations directly into the deep neural network via automatic differentiation, to overcome some of the aforementioned limitations for simulating incompressible laminar and turbulent flows. We develop the Navier-Stokes flow nets (NSFnets) by considering two different mathematical formulations of the Navier-Stokes equations: the velocity-pressure (VP) formulation and the vorticity-velocity (VV) formulation. Since this is a new approach, we first select some standard benchmark problems to assess the accuracy, convergence rate, computational cost and flexibility of NSFnets; analytical solutions and direct numerical simulation (DNS) databases provide proper initial and boundary conditions for the NSFnet simulations. The spatial and temporal coordinates are the inputs of the NSFnets, while the instantaneous velocity and pressure fields are the outputs for the VP-NSFnet, and the instantaneous velocity and vorticity fields are the outputs for the VV-NSFnet. This is unsupervised learning and, hence, no labeled data are required beyond boundary and initial conditions and the fluid properties. The residuals of the VP or VV governing equations, together with the initial and boundary conditions, are embedded into the loss function of the NSFnets. No data is provided for the pressure to the VP-NSFnet, which is a hidden state and is obtained via the incompressibility constraint without extra computational cost. Unlike the traditional numerical methods, NSFnets inherit the properties of neural networks (NNs), hence the total error is composed of the approximation, the optimization, and the generalization errors. Here, we empirically attempt to quantify these errors by varying the sampling (“residual”) points, the iterative solvers, and the size of the NN architecture. For the laminar flow solutions, we show that both the VP and the VV formulations are comparable in accuracy but their best performance corresponds to different NN architectures. The initial convergence rate is fast but the error eventually saturates to a plateau due to the dominance of the optimization error. For the turbulent channel flow, we show that NSFnets can sustain turbulence at , but due to expensive training we only consider part of the channel domain and enforce velocity boundary conditions on the subdomain boundaries provided by the DNS data base. We also perform a systematic study on the weights used in the loss function for balancing the data and physics components, and investigate a new way of computing the weights dynamically to accelerate training and enhance accuracy. In the last part, we demonstrate how NSFnets should be used in practice, namely for ill-posed problems with incomplete or noisy boundary conditions as well as for inverse problems. We obtain reasonably accurate solutions for such cases as well without the need to change the NSFnets and at the same computational cost as in the forward well-posed problems. As a result, we also present a simple example of transfer learning that will aid in accelerating the training of NSFnets for different parameter settings.
Here, in this paper, we present a physics-constrained deep neural network (PCDNN) method for parameter estimation in the zero-dimensional (0D) model of the vanadium redox flow battery (VRFB). In this approach, we use deep neural networks to approximate the model parameters as functions of the operating conditions. This method allows the integration of VRFB computational models as the physical constraints in the parameter learning process, leading to enhanced accuracy of parameter estimation and cell voltage prediction. Using an experimental dataset, we demonstrate that the PCDNN method can estimate model parameters for a range of operating conditions and improve the 0D model prediction of voltage compared to the 0D model prediction with constant operation-condition-independent parameters estimated with traditional inverse methods. We also demonstrate that the PCDNN approach has an improved generalization ability for estimating parameter values for operating conditions not used in the training process.
In this work, we used a price-taker model to investigate the trade-offs between net revenue and downstream flow impacts for a network of small, cascading hydro facilities. The network consisted of 36 facilities, each with a small amount of local storage (between 2 and 45 minutes). Generator sizes ranged between 0.5 and 1 MW, nominal, and the total capacity of the network was 33.5 MW. We used a multi-integer linear programing model to maximize the net revenue of the combined network subject to operating and environmental constraints. Net revenue optimizations relied on historic price data, and dry, typical, and wet years were studied to help ensure robustness. Energy and ancillary service sales were included in the net revenue calculations, and both unit commitment and dispatch simulations were performed. We found that limiting the downstream flows to ±50% of the river’s natural flows had a negligible impact on net revenues (<1% reduction), irrespective of hydrologic conditions, and even when downstream flows were limited to ±5%, net revenues were only impacted by 4%. These outcomes are significant because they demonstrate how an array of small-scale hydropower facilities can be operated to have minimal impact on natural stream flows—addressing a critical environmental concern.
PAN AIR is a computer program that calculates linear potential flow about arbitrary configurations at both subsonic and supersonic Mach numbers. This paper is a follow-on of another paper entitled 'PAN AIR Modeling Studies', in which several studies were presented that exhibited PAN AIR's versatility for modeling diverse configurations. Results from four modeling studies of interest in modeling realistic aircraft shapes are presented. The topics addressed are (1) half-geometry option in sideslip, (2) network gaps, (3) three-dimensional forebody flows, and (4) trailing-edge representation.
Scientific workflows in high-performance networks spawn hundreds of interdependent flows that must be managed collectively—yet existing network classifiers treat each flow in isolation, leading to fragmented QoS decisions and missed interflow patterns. We present a novel traffic classification solution that operates at the workflow level, distinguishing entire filetransfer operations from streaming analytics by capturing how concurrent flows interact and burst together. We introduce a workflow identification window (WIW) that ingests raw packet headers from parallel flows into unified tensors, preserving the spatial-temporal patterns that differentiate scientific workflows. This approach achieves 98.7% accuracy using CNN, LSTM, and hybrid architectures, while maintaining 84% accuracy on production traffic collected a week later—demonstrating robustness to temporal drift. By integrating SHAP and GradCAM explainability, we reveal that early-packet timing patterns and cross-flow correlations drive classification decisions, providing operators with interpretable insights. Our system enables coherent workflow-level QoS enforcement and dynamic bandwidth allocation in scientific networks, eliminating manual per-flow configuration while maintaining classification latency at millisecond level.
We investigate how mineral dissolution reshapes flow pathways and solute transport in three‐dimensional discrete fracture networks using a computationally efficient graph‐based reactive transport model. The DFNs are inspired by field‐site observations of fractured carbonate and represent realistic connectivity and structural heterogeneity. Flow is simulated with the Reynolds equation, and dissolution follows first‐order kinetics with diffusive limitations captured through an effective mass‐transfer coefficient. By systematically varying two key dimensionless parameters, the effective Damköhler number (Da), governing reaction versus advection rates, and a transport parameter (Da), analogous to the Thiele modulus, distinct flow channelization regimes emerge: mildly channelized at low G, highly channelized at intermediate Da, and extreme wormhole formation at high Da and low G. Eulerian and Lagrangian analyses, including breakthrough curves, particle tortuosity, dispersivity, and flow channeling indicators quantitatively characterize the progression of dissolution‐driven network restructuring. Across all regimes, initial fracture heterogeneity persists. The results underscore how the interplay between this initial structure, advection, reaction, and diffusion critically shapes subsurface flow pathways, with implications for applications ranging from groundwater remediation to enhanced geothermal systems.
It has been demonstrated that network topology optimization (NTO) may change the topology of power system networks, and consequently, provide additional flexibility to reduce network congestion and violations. Most NTO problems are formulated based on the bus-branch model in which it is challenging to represent a realistic picture of all substation configurations. In this paper, we explore advantages of substation reconfiguration modeling based on node-breaker representations for NTO problem with full nonlinear alternating current power flow. It also proposes a tailored solution algorithm to solve this nonconvex mixed-integer nonlinear programming through the outer approximation method. The proposed solution approach iterates between a mixed-integer linear programming and a nonlinear subproblem. Additional enhancements to further accelerate the iteration process are illustrated. Numerical case studies demonstrate the relative economic and operational impact of optimal network topology with node-breaker representations.
Here, we extend the canonical problems of simulation and optimization of steady-state gas flows in pipeline networks with compressors to the transport of mixtures of highly heterogeneous gases injected throughout a network. Our study is motivated by proposed projects to blend hydrogen generated using clean energy into existing natural gas pipeline systems as part of efforts to reduce the reliance of energy systems on fossil fuels. Flow in a pipe is related to endpoint pressures by a basic Weymouth equation model, with an ideal gas equation of state, where the wave speed depends on the hydrogen concentration. At vertices, in addition to mass balance, we also consider mixing of incoming flows of varying hydrogen concentrations. The problems of interest are the heterogeneous gas flow simulation (HGFS), which determines system pressures and flows given fixed boundary conditions and compressor settings, as well as the heterogeneous gas flow optimization (HGFO), which extremizes an objective by determining optimal boundary conditions and compressor settings. We examine conditions for uniqueness of solutions to the HGFS, as well as compare and contrast mixed-integer and continuous nonlinear programming formulations for the HGFO. We develop computational methods to solve both problems, and examine their performance using four test networks of increasing complexity.