Search NASA⌕ Search

SEARCH · Search NASA

Results for “transport problems”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

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

At least 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

A dynamic variational multiscale method on unstructured meshes for stationary transport problems

Here, this paper presents a variational multiscale (VMS) based finite element method where the stabilization parameter is computed dynamically. The current dynamic procedure takes in a general structure/form of the stabilization parameter with unknown coefficients and computes them dynamically in a local fashion resulting in a dynamic VMS-based finite element method. Thus, a static stabilization parameter with pre-defined coefficients is not needed. A variational Germano identity (VGI) based local procedure suitable for unstructured meshes is developed to perform the dynamic computation in a local fashion. The local VGI based procedure is applied for each interior vertex in the mesh and unknown coefficients are first determined locally at each vertex, and subsequently, for each element a maximum value is taken over the vertices of the element. To make the current procedure practical, a coarser secondary solution is constructed from the primary coarse-scale solution, which is done locally over a patch of elements around each interior vertex. Further, averaging steps are employed to make the local dynamic procedure robust. Currently, the new dynamic VMS formulation is applied to steady problems governed by the advection-diffusion and incompressible Navier-Stokes equations in both 1D and 2D to demonstrate its efficacy and effectiveness.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

The Physics Imposed on a Streaming Operator by Spherical Transport Problems

The streaming operator, which generates a displacement of a particle on a straight line at a constant speed in transport theory, is derived algebraically from a spherical coordinate formulation of Newton’s second law. This derivation leads to an operator that has more partial derivatives than a Cartesian coordinate formulation of the operator. The additional partial derivatives, which are with respect to the normalized velocity variables of a particle, take into account the intrinsic curvature of a ball. Moreover, these partial derivatives mitigate ray effects, which arise when a finite number of normalized velocities (also called directions or discrete ordinates) are used to simulate a continuous S 2 sphere of directions, by rotating the polar axis of the S 2 sphere into the radial direction of the coordinate system. As a consequence of this rotation, the number of actual discrete ordinates is greatly amplified to an enormous number of effective discrete ordinates by a multiplier that is equal to the number of patches that partitions a spherical surface. In addition to the derivation of the streaming operator, we provide in closed form a solution to the system of characteristic equations that is equivalent to the streaming operator. Furthermore, the solution to the system of characteristic equations enables the construction of an integral operator that is the inverse to the streaming operator. Examples in which ray effects are immensely mitigated by spherical coordinates are presented.

integral operator↗
DOE OSTI2022

Reduced order modeling for flow and transport problems with Barlow Twins self-supervised learning

Abstract We propose a unified data-driven reduced order model (ROM) that bridges the performance gap between linear and nonlinear manifold approaches. Deep learning ROM (DL-ROM) using deep-convolutional autoencoders (DC–AE) has been shown to capture nonlinear solution manifolds but fails to perform adequately when linear subspace approaches such as proper orthogonal decomposition (POD) would be optimal. Besides, most DL-ROM models rely on convolutional layers, which might limit its application to only a structured mesh. The proposed framework in this study relies on the combination of an autoencoder (AE) and Barlow Twins (BT) self-supervised learning, where BT maximizes the information content of the embedding with the latent space through a joint embedding architecture. Through a series of benchmark problems of natural convection in porous media, BT–AE performs better than the previous DL-ROM framework by providing comparable results to POD-based approaches for problems where the solution lies within a linear subspace as well as DL-ROM autoencoder-based techniques where the solution lies on a nonlinear manifold; consequently, bridges the gap between linear and nonlinear reduced manifolds. We illustrate that a proficient construction of the latent space is key to achieving these results, enabling us to map these latent spaces using regression models. The proposed framework achieves a relative error of 2% on average and 12% in the worst-case scenario (i.e., the training data is small, but the parameter space is large.). We also show that our framework provides a speed-up of $$7 \times 10^{6}$$ 7 × 10 6 times, in the best case, and $$7 \times 10^{3}$$ 7 × 10 3 times on average compared to a finite element solver. Furthermore, this BT–AE framework can operate on unstructured meshes, which provides flexibility in its application to standard numerical solvers, on-site measurements, experimental data, or a combination of these sources.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Convolutional Neural Networks for Problems in Transport Phenomena: A Theoretical Minimum

Convolutional neural network (CNN), a deep learning algorithm, has gained popularity in technological applications that rely on interpreting images (typically, an image is a 2D field of pixels). Transport phenomena is the science of studying different fields representing mass, momentum, or heat transfer. Some of the common fields are species concentration, fluid velocity, pressure, and temperature. Each of these fields can be expressed as an image(s). Consequently, CNNs can be leveraged to solve specific scientific problems in transport phenomena. Herein, we show that such problems can be grouped into three basic categories: (a) mapping a field to a descriptor (b) mapping a field to another field, and (c) mapping a descriptor to a field. After reviewing the representative transport phenomena literature for each of these categories, we illustrate the necessary steps for constructing appropriate CNN solutions using sessile liquid drops as an exemplar problem. If sufficient training data is available, CNNs can considerably speed up the solution of the corresponding problems. Finally, the present discussion is meant to be minimalistic such that readers can easily identify the transport phenomena problems where CNNs can be useful as well as construct and/or assess such solutions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Multilevel well modeling in aggregation-based nonlinear multigrid for multiphase flow in porous media

A full approximation scheme (FAS) nonlinear multigrid solver for two-phase flow and transport problems driven by wells with multiple perforations is developed here. It is an extension to our previous work on FAS solvers for diffusion and transport problems. The solver is applicable to discrete problems defined on unstructured grids as the coarsening algorithm is aggregation-based and algebraic. To construct coarse basis that can better capture the radial flow near wells, coarse grids in which perforated well cells are not near the coarse-element interface are desired. This is achieved by an aggregation algorithm proposed in this paper that makes use of the location of well cells in the cell-connectivity graph. Numerical examples in which the FAS solver is compared against Newton's method on benchmark problems are given. In particular, for a refined version of the SAIGUP model, the FAS solver is at least 35% faster than Newton's method for time steps with a CFL number greater than 10.

58 GEOSCIENCES↗
DOE OSTI2023

ITS Version 6.7: The Integrated TIGER Series of Coupled Electron/Photon Monte Carlo Transport Codes User's Manual

ITS is a powerful software package permitting state-of-the-art Monte Carlo solution of linear time-independent coupled electron/photon radiation transport problems, with or without the presence of macroscopic electric and magnetic fields of arbitrary spatial dependence. Our goal has been to simultaneously maximize operational simplicity and physical accuracy. Through a set of preprocessor directives, the user selects one of the many ITS codes. The ease with which the make system is applied combines with an input scheme based on order-independent descriptive keywords that makes maximum use of defaults and internal error checking to provide experimentalists and theorists alike with a method for the routine but rigorous solution of sophisticated radiation transport problems. Physical rigor is provided by employing accurate cross sections, sampling distributions, and physical models for describing the production and transport of the electron/photon cascade from 1.0 GeV down to 1.0 keV. The availability of source code permits the more sophisticated user to tailor the codes to specific applications and to extend the capabilities of the codes to more complex applications. Version 6, the latest version of ITS, contains (1) improvements to the ITS 5.0 codes, and (2) conversion to Fortran 95. The general user friendliness of the software has been enhanced through memory allocation to reduce the need for users to modify and recompile the code.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2023

Automated Symbolic Upscaling: 2. Model Generation for Extended Applicability Regimes

Abstract In this second part of the two paper series, we detail an algorithmic procedure for systematically implementing the generalized closure form strategy presented in Part 1. This strategy extends the applicability of homogenized models with respect to classical homogenization theory, as demonstrated in Part 1 where upscaled models are rigorously derived in moderately reactive physical regimes. After encoding the algorithm into Symbolica, an automated upscaling framework, we upscale two reactive mass transport problems and numerically validate the resulting nonlinear homogenized models by showing the absolute error estimates predicted by homogenization theory are satisfied. In both problems, nontrivial closure forms and closure problems are automatically formulated using the encoded strategy with no human interaction, nor prior knowledge regarding the closure required for the systems. We hope these demonstrations spark further interest in automated analytical frameworks for multiscale modeling, as such capabilities are invaluable for generating rigorous multiscale models of complex phenomena in porous media.

Pietrzyk, Kyle↗
DOE OSTI2023

Quantifying model prediction sensitivity to model-form uncertainty

Computational and mathematical models are essential to understanding complex systems and phenomena. However, when developing such models, limited knowledge and/or resources necessitates the use of simplifying assumptions. It is therefore crucial to quantify the impact of such simplifying assumptions on the reliability and accuracy of resulting model predictions. This work develops a first-of-its-kind approach to quantify the impact of physics modeling assumptions on predictions. Here, we leverage the emerging field of model-form uncertainty (MFU) representations, which are parameterized modifications to modeling assumptions, in combination with grouped Sobol’ indices to quantitatively measure an assumption’s importance. Specifically, we compute the grouped Sobol’ index for the MFU representation’s parameters as a single importance measure of the assumption for which the MFU representation characterizes uncertainty. To ensure this approach is robust to the subjective choice of how to parameterize a MFU representation, we establish bounds for the difference between sensitivity results for two different MFU representations based on differences in model prediction statistics. The capabilities associated with this approach are demonstrated on three exemplar problems: an upscaled subsurface contaminant transport problem, ablation modeling for hypersonic flight, and nuclear waste repository modeling. We found that our grouped approach is able to assess the impact of modeling assumptions on predictions and offers computational advantages over classical Sobol’ index computation while providing more interpretable results.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Automated Symbolic Upscaling: 1. Model Generation for Extended Applicability Regimes

Abstract In porous media theory, upscaling techniques are fundamental to deriving rigorous Darcy‐scale models for flow and reactive transport in subsurface systems. Due to limitations in classical techniques, a number of ad hoc approaches have been proposed to address physical regimes in which reactive time scales are similar to, or faster than, diffusive time scales. In Part 1 of this two part series, we present a strategy for expanding the applicability of classical homogenization theory by generalizing the assumed closure form. We detail the implementation of this strategy on two reactive mass transport problems with moderately reactive physics. The strategy produces nontrivial homogenized models with emergent terms and effective parameters that couple reactive, diffusive, and advective transport. The differences in equation forms between the macroscopic and pore‐scale descriptions advise caution to further studies where the forms of macroscopic equations are assumed, as opposed to rigorously derived. Numerical validation is provided for each problem to show that the error estimates of homogenization theory are satisfied, and to justify the implemented strategy. In Part 2, the presented strategy is automated using symbolic computing to expedite its implementation.

Pietrzyk, Kyle↗
DOE OSTI2023

A novel statistical methodology for quantifying the spatial arrangements of axons in peripheral nerves

A thorough understanding of the neuroanatomy of peripheral nerves is required for a better insight into their function and the development of neuromodulation tools and strategies. In biophysical modeling, it is commonly assumed that the complex spatial arrangement of myelinated and unmyelinated axons in peripheral nerves is random, however, in reality the axonal organization is inhomogeneous and anisotropic. Present quantitative neuroanatomy methods analyze peripheral nerves in terms of the number of axons and the morphometric characteristics of the axons, such as area and diameter. In this study, we employed spatial statistics and point process models to describe the spatial arrangement of axons and Sinkhorn distances to compute the similarities between these arrangements (in terms of first- and second-order statistics) in various vagus and pelvic nerve cross-sections. We utilized high-resolution transmission electron microscopy (TEM) images that have been segmented using a custom-built high-throughput deep learning system based on a highly modified U-Net architecture. Our findings show a novel and innovative approach to quantifying similarities between spatial point patterns using metrics derived from the solution to the optimal transport problem. We also present a generalizable pipeline for quantitative analysis of peripheral nerve architecture. Our data demonstrate differences between male- and female-originating samples and similarities between the pelvic and abdominal vagus nerves.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2025

Joint state-parameter estimation for the reduced fracture model via the united filter

Here, in this paper, we introduce an effective United Filter method for jointly estimating the solution state and physical parameters in flow and transport problems within fractured porous media. Fluid flow and transport in fractured porous media are critical in subsurface hydrology, geophysics, and reservoir geomechanics. Reduced fracture models, which represent fractures as lower-dimensional interfaces, enable efficient multi-scale simulations. However, reduced fracture models also face accuracy challenges due to modeling errors and uncertainties in physical parameters such as permeability and fracture geometry. To address these challenges, we propose a United Filter method, which integrates the Ensemble Score Filter (EnSF) for state estimation with the Direct Filter for parameter estimation. EnSF, based on a score-based diffusion model framework, produces ensemble representations of the state distribution without deep learning. Meanwhile, the Direct Filter, a recursive Bayesian inference method, estimates parameters directly from state observations. The United Filter combines these methods iteratively: EnSF estimates are used to refine parameter values, which are then fed back to improve state estimation. Numerical experiments demonstrate that the United Filter method surpasses the state-of-the-art Augmented Ensemble Kalman Filter, delivering more accurate state and parameter estimation for reduced fracture models. This framework also provides a robust and efficient solution for PDE-constrained inverse problems with uncertainties and sparse observations.

Bayesian inference↗
DOE OSTI2024

RadSim: Particle Transport Wrapper

RadSim is being developed to provide the capability to simulate radiation source emissions, interpolate results from radiation transport tools into a common format to prepare incident flux, and model radiation detector response. This software package includes wrapper API code which is utilized in the development of the second (transport) task of the RadSim project. This software package only contains tools to interface RadSim with radiation transport tools (GEANT4 and MCNP) and does not include any part of the transport source code itself. The users will need prior access to the transport tools (GEANT4 and MCNP), and can use this software package to interface with the transport tool of their choice. This software package takes the geometry file for a radiation transport problem and converts it into an input deck for the transport tools (GEANT4 and MCNP). Additionally, it also contains filters that convert the output of the transport tools to a common flux format.

Cheung, Hoi Sing↗
DOE OSTI2025

New charged-particle transport computational capability: the SIT code An L-4 milestone

We have developed a new high-fidelity code for direct transport of charged particles using the simple integral transport method. The code can be coupled to the outputs of any hydrodynamical simulation code in 1-D, 2-D or 3-D. In this report we summarize the formalism involved in treating complex transport problems. We present physical examples wherein we have used the code to calculate the transport of alpha particles. Future work is planned to study the sensitivity of hydrodynamical mix to charged-particle radiochemistry and reaction-in-flight neutrons for the complex inertial confinement fusion problems encountered at NIF and at the Z-machine.

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗
DOE OSTI2023

1-D coupled surface flow and transport equations revisited via the physics-informed neural network approach

The de Saint-Venant equation (SVE) and advection–diffusion equation (ADE) are commonly employed to solve solute transport problems in surface water. In this work, we propose a mesh-free method based on the physics-informed neural network (PINN) to solve the one dimensional (1-D) SVE, ADE, and the coupled SVE and ADE (SVE-ADE) under various initial and boundary conditions. The PINN model extends the architecture of deep neural networks (DNNs) with implementation of loss function, which are additionally subject to constraints imposed by the physical laws of SVE and ADE, along with their initial and boundary conditions. In such a manner, PINNs can be quickly steered to the true solution while obeying the physical laws. The results of PINN model are compared with the analytical and/or numerical solutions under various conditions to investigate its accuracy and efficiency in solving the SVE, ADE, and SVE-ADE. Our results indicate PINN can accurately simulate the shock wave morphology and avoid numerical dissipation in unsteady flow condition. The PINN method outweighed traditional numerical methods in several aspects, including its ability to function with small amounts of data, no grid discretization, and random selection of sampling points, etc. Additionally, the PINN method is also suitable for solving inverse problems with sparse and noisy data. With 1% noise and 2000 initial and boundary condition points (N u ), the errors of the estimated flow rate (v) and diffusion coefficient (D) are 0.003% and 0.105%, respectively, which indicate the accuracy and robustness of the proposed method. Finally, our results indicate the capability and robustness of the proposed PINN methodology for solving multi-physics problems, irrespective of the presence of sparse and noisy data in the training dataset.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

A level-set immersed boundary method for reactive transport in complex topologies with moving interfaces

A simulation framework based on the level-set and the immersed boundary methods (LS-IBM) has been developed for reactive transport problems in porous media involving a moving solid-fluid interface. The interface movement due to surface reactions is tracked by the level-set method, while the immersed boundary method captures the momentum and mass transport at the interface. The proposed method is capable of accurately modeling transport near evolving boundaries in Cartesian grids. The framework formulation guarantees second order accuracy in space. Since the interface velocity is only defined at the moving boundary, an interface velocity propagation method is also proposed. The method can be applied to other moving interface problems of the “Stefan” type. Here, we validate the proposed LS-IBM both for flow and transport close to an immersed object with reactive boundaries as well as for crystal growth. Lastly, the proposed method provides a powerful tool to model more realistic problems involving moving reactive interfaces in complex domains.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Data Summarization and Inference at Scale

This is the final report for the DOE ASCR grant SC-0022260, Data Summarization and Inference at Scale, PI: Alex Pothen, Purdue University. The goal of the project was to solve data-intensive and compute-intensive problems in the physical sciences, engineering, information science, data science, etc. by designing and implementing new algorithms that could work with a subset of the data. The four subgoals were: (a) The solution of problems where the data is too large to be stored in the memory of a computer. In this streaming model of computation, the data arrives as a stream of elements to the computer, each element is processed as it arrives, and a decision is made to discard the data or to store it; only a small subset of the data proportional to the size of the output solution is stored, and when all the data has been streamed, a solution to the problem is computed from the stored subset. (b) The use of machine learning methods to compute solutions to data-intensive problems. The use of GPUs is critical to obtain high performance on machine learning tasks, but their memory sizes are smaller relative to that of CPUs. For large-scale problems, the data is sampled many times, and small samples are used with repetition, for robustness, to compute solutions to inference tasks. This sampling reduces the memory required to solve the problem, but attention is needed to avoid slow convergence to the solutions, and reduced accuracy of inference. We propose submodular optimization, Large Language Models, and physics-informed neural networks to enable GPU computations here. (c) Modeling and visualization of high-dimensional data using interpretable features. Clinical proteomic data sets from immunology for the detection of cancer and other diseases are temporal and high-dimensional, and algorithms for visualizing these data sets using clinically interpretable features are lacking. We propose methods that compute distances based on the optimal transportation problem and graph edit distances to address this problem. We also propose the use of optimal transport-based distances, spatial statistics, and network structure to classify image data sets, We apply these algorithms to electron micrographs of the peripheral nervous system in the digestive tract. (d) The design of data-intensive algorithms on emerging architectures, specifically, noisy, intermediate-scale quantum (NISQ) devices. Quantum computers offer the possibility of exploring large solution spaces due to the principle of superposition, but current quantum computers are limited by few qubits, short coherence times due to noise, poor interconections among the qubits, etc. We propose the use of the divide and conquer paradigm to solve large-scale problems, wherein collections of small subproblems are solved on the quantum devices, and the solutions to the subproblems are integrated into a solution for the original problem on a classical computer.

97 MATHEMATICS AND COMPUTING↗