Search NASA⌕ Search

SEARCH · Search NASA

Results for “Types Of 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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

User’s Manual for RESRAD-RDD&IND Code Version 2: Vol. 2—User’s Guide for RESRAD-RDD&IND Code

Version 2.0 of the RESRAD-RDD&IND computer code is designed to support the implementation of protective action guides (PAGs) after a nuclear emergency incident including a radiological dispersal device (RDD) and/or an improvised nuclear device (IND) incident (EPA 2017). Eight different group types, addressing various decisions, are available for selection. The RESRAD-RDD&IND code calculates radiological doses, stay times, etc., for the selected group that the user wishes to focus on. (That is, the results for all the groups are not calculated simultaneously, and the input for those other groups do not matter, although some parameter values are shared between groups.) Version 2.0 has a user-friendly interface so that the RESRAD-RDD&IND code can be used with minimal training. For example, the user can select the major characteristics of the problem-event type, source term, and decision type from the left side of the interface and then calculate the results with the default assumptions for the exposure scenarios. More in-depth analysis would include specifying site-specific exposure scenario characteristics in the right side of the interface. The procedures for data entry and results viewing are self-explanatory. This is because common window maneuvering features and text instructions were incorporated in the interface design. General and context-specific help are available to aid users entering parameter values, as well. The RESRAD-RDD&IND computer code gives the user the option to select either an RDD or IND incident for analysis. For an RDD event analysis, 11 radionuclides (Am-241, Cf-252, Cm-244, Co-60, Cs-137, Ir-192, Po-210, Pu-238, Pu-239, Ra-226, and Sr-90) are included. These 11 radionuclides are the radionuclides most likely used for an RDD. More than 90 radionuclides can be selected for an IND event analysis. Initial default concentrations are provided for 44 radionuclides for a uranium-fueled IND event. These 44 radionuclides are those that would contribute significantly to the radiation dose associated with a uranium-fueled bomb detonation. The radionuclides generated from ingrowth of these 44 initial radionuclides are also automatically included in the analysis. Pu-239, Cs-134m, Ru-105, and Rb-89 and their progeny can be selected for analysis if they are detected and their concentrations are determined. This user’s guide, which is Volume 2 of the User’s Manual for RESRAD-RDD&IND Code Version 2, provides instructions to users on how to install the RESRAD-RDD&IND code, navigate the interface, and use the various features, including those discussed above, to set up an analysis and view/print the results in text outputs. Volume 1 of the User’s Manual for RESRAD-RDD&IND Code Version 2 (Yu et al. 2026), which contains descriptions of the methodology and theoretical basis for dose modeling and the mathematical equations implemented in the code, can be accessed and viewed through the Help menu in the code or can be downloaded from the RESRAD website (https://resrad.evs.anl.gov).

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2020

Simulation of mineral dissolution at the pore scale with evolving fluid-solid interfaces: review of approaches and benchmark problem set

This manuscript presents a benchmark problem for the simulation of single-phase flow, reactive transport, and solid geometry evolution at the pore scale. The problem is organized in three parts that focus on specific aspects: flow and reactive transport (part I), dissolution-driven geometry evolution in two dimensions (part II), and an experimental validation of three-dimensional dissolution-driven geometry evolution (part III). Five codes are used to obtain the solution to this benchmark problem, including Chombo-Crunch, OpenFOAM-DBS, a lattice Boltzman code, Vortex, and dissolFoam. These codes cover a good portion of the wide range of approaches typically employed for solving pore-scale problems in the literature, including discretization methods, characterization of the fluid-solid interfaces, and methods to move these interfaces as a result of fluid-solid reactions. A short review of these approaches is given in relation to selected published studies. Results from the simulations performed by the five codes show remarkable agreement both quantitatively--based on upscaled parameters such as surface area, solid volume, and effective reaction rate--and qualitatively--based on comparisons of shape evolution. This outcome is especially notable given the disparity of approaches used by the codes. Therefore, these results establish a strong benchmark for the validation and testing of pore-scale codes developed for the simulation of flow and reactive transport with evolving geometries. They also underscore the significant advances seen in the last decade in tools and approaches for simulating this type of problem.

58 GEOSCIENCES↗
DOE OSTI2022

Inverse Analysis with Variational Autoencoders: A Comparison of Shallow and Deep Networks

Inverse problems are applied to determine unknown properties by matching observational data with a physical model that often takes many parameters as input. To overcome the underconstrained nature of inverse problems and achieve good performance, an approach is presented involving regularization with a technique known as a variational autoencoder (VAE), which is trained to map a high-dimensional parameter space with a complex structure to a low-dimensional latent space with a simple structure. We apply this approach to unconditioned realizations of the parameters (heterogeneous hydraulic fields) for a hydrogeological inverse problem. Two types of hydraulic conductivity fields are used to evaluate the characterization for the different levels of heterogeneity complexity of the physical inputs. This approach keeps the computational cost of generating the training data low. The reason is unconditioned realizations neither rely on the observational data used to perform the inverse analysis nor require any groundwater flow model forward runs. In addition, this approach applies regularization on a low-dimensional latent space from the VAE and increases optimization efficiency through automatic differentiation. Furthermore, two different neural network (NN) structures are tested for their utility in using the VAE for inverse analysis. The performance of a deep, convolutional neural network strongly depends on the dimensionality of the latent space, which requires tuning. In contrast, a shallow, dense neural network provides consistently accurate characterization without tuning. Furthermore, our approach evaluates the advantages of the shallow, dense neural network over the deep, convolutional one and enables future application to a wide range of inverse problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Multi-scale Coupled Processes Modeling of Fractures as Porous, Interfacial and Granular Systems from Rock Images with the Numerical Manifold Method

Abstract The greatest challenges of rigorously modeling coupled hydro-mechanical processes in fractured rocks at different scales are associated with computational geometry. In addition, selections of continuous or discontinuous models, physical laws, and coupling priorities at different scales based on different geometric features determine the applicability of a numerical model for a certain type of problem. In this study, we present our multi-scale modeling capabilities that have been developed based on the numerical manifold method for analyzing coupled hydro-mechanical processes in fractured rocks. Based on their geometric features, the fractures are modeled as continua—finite-thickness porous zones, and discontinua—discontinuous interfaces and microscale asperities and granular systems. Different governing equations, physical laws, coupling priorities, and approaches for addressing fracture intersections and shearing are then applied to describe these. We applied these models to simulate coupled processes in fractured rocks using realistic geometry obtained from rock images at different scales. We first calculated shearing of a single fracture with different models and demonstrated the impacts of asperities on shearing. We then applied the continuous and discontinuous models to simulate a network of rough fractures, demonstrating that contact dynamics contribute significantly to the geometric, multi-physical evolution of systems where rough fractures are not mineral filled. For a discrete fracture network, our coupled processes modeling demonstrates that shearing of the discrete fractures can have a major impact on stress and pore pressure distribution. Lastly, we applied the discontinuous granular model to simulate evolution of a complex granular system with a deformation band, demonstrating that the deformation band can dominate contact dynamics, the structural and the stress evolution of the granular system.

58 GEOSCIENCES↗
DOE OSTI2024

Deep Generative Models in Energy System Applications: Review, Challenges, and Future Directions

In recent years, with the advent of mature machine learning products like ChatGPT, Stable Diffusion, and Sora, the world has witnessed tremendous changes driven by the rapid development of generative artificial intelligence (GAI). Beyond applications in text, speech, image, and video creation, deep generative models (DGMs) underpinning these cutting-edge technologies have also been employed by domain researchers to address scientific and engineering challenges. This paper aims to fill a gap in the research community by providing a systematic review of how DGMs have been utilized in energy system applications. After introducing four most popular DGMs, we review and categorize 196 research articles into five focus areas: data generation, forecasting, situational awareness, modeling, and optimal decision-making. Through this classification, we uncover trends in how DGMs are employed for each type of problem, highlighting GAI techniques that contribute to breakthroughs over traditional methods. We discuss limitations in existing literature, engineering challenges, and propose future directions, all tailored to the unique nature of problems in energy system engineering. Our goal is to offer insights for energy system domain researchers, providing a comprehensive view of existing studies and potential future opportunities.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2020

Cloud based tool for analysis of chemical kinetic mechanisms

The size and complexity of chemical kinetic models used to simulate combustion of hydrocarbon fuels continue to increase with our improved understanding of the underlying physical mechanisms, along with the improved ability to utilize such models as the result of increased computational power and efficiency. As mechanisms grow beyond thousands of species and tens of thousands of reactions, it becomes increasingly difficult to manually check for errors and physical inconsistencies. In this work, we present several automated methods to check for such issues in the specification of chemical reaction models. First, we demonstrate how discontinuities in thermodynamic data can cause simulation difficulties manifested as long wall-clock times and convergence failures. To correct this type of problem, we describe an automated method for refitting thermodynamic parameters. We also outline several methods to check the timescales of reaction rate coefficients to ensure physical consistency. All the methods are made available through a web-based tool (https://combustiontools.llnl.gov) intended to aid mechanism developers and users to improve the accuracy and performance of fuel models used by the combustion community.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2021

Co-simulation of transactive energy markets: A framework for market testing and evaluation

The proliferation of distributed energy resources (DER)—and the ability to intelligently control these assets—is re-defining the electrical distribution system. As the number of controllable devices rapidly expands, grid operators must determine how to incorporate these assets while delivering reliable, equitable, and affordable electricity. One possible approach is to establish distribution-level electricity markets and allow devices/aggregations of devices to participate in price establishment. While this approach purports some of the same benefits as the highly successful wholesale electricity markets (i.e., open competition, efficient price discovery, reduced communication overhead), this needs to be researched and quantified via an analysis platform that models distribution-level markets at the appropriate fidelity. Specifically, the simultaneous evaluation of market performance, DER performance, DER bidding approaches, and distribution feeder power quality requires modeling that spans multiple technical areas. Co-simulation has emerged as a powerful tool in addressing this type of problem, where outputs depend on a range of underlying areas of expertise and associated models. In this paper we describe a solution, as implemented in the HELICS co-simulation platform, where we include (1) high fidelity house models, (2) intelligent bidding agents, (3) a modular market integration/design, and (4) a distribution feeder model. We then present a case study where we test two different market designs: (1) a pseudo-wholesale double-blind auction, and (2) an asynchronous matching market. In this work, the markets are run under two DER penetration levels and economic results are compared to full retail net energy metering and avoided cost net metering scenarios that bookend current approaches to remuneration of DER participation. We show the potential for transactive markets to provide increased value for most customers relative to net metering (and all customers relative to avoided cost scenarios) while decreasing costs for the utility.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Interpolating between small- and large-$\mathscr{g}$ expansions using Bayesian model mixing

Bayesian model mixing (BMM) is a statistical technique that can be used to combine models that are predictive in different input domains into a composite distribution that has improved predictive power over the entire input space. We explore the application of BMM to the mixing of two expansions of a function of a coupling constant $\mathscr{g}$ that are valid at small and large values of $\mathscr{g}$ respectively. This type of problem is quite common in nuclear physics, where physical properties are straightforwardly calculable in strong and weak interaction limits or at low and high densities or momentum transfers, but difficult to calculate in between. Interpolation between these limits is often accomplished by a suitable interpolating function, e.g., Padé approximants, but it is then unclear how to quantify the uncertainty of the interpolant. We address this problem in the simple context of the partition function of zero-dimensional Φ 4 theory, for which the (asymptotic) expansion at small $\mathscr{g}$ and the (convergent) expansion at large $\mathscr{g}$ are both known. We consider three mixing methods: linear mixture BMM, localized bivariate BMM, and localized multivariate BMM with Gaussian processes. Here, we find that employing a Gaussian process in the intermediate region between the two predictive models leads to the best results of the three methods. The methods and validation strategies we present here should be generalizable to other nuclear physics settings.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2026

Accelerating Bilevel Optimization With Hierarchical Many-Threaded Parallel Differential Evolution

Bilevel optimization is encountered in many relevant real-world applications. The main feature of this type of problem is that an upper-level optimization problem is constrained by a nested lower-level optimization problem. Because of this nested structure, bilevel problems (BLPs) are usually computationally expensive to solve. Differential evolution (DE) has demonstrated promising results in solving BLPs of relatively small scales. As the problem scale increases, the decision space becomes intrinsically larger, requiring a growing number of function evaluations for the method to work properly. In this context, heavy parallelization and high-performance computing techniques are indispensable to enable the resolution of more complex and challenging optimization problems. Hence, we propose a hierarchical many-threaded parallel DE approach for BLPs, where both levels are parallelized. The computational experiments demonstrate that the parallel implementation achieved runtime speeds ranging from 44 to 2559 times faster than the sequential version on a well-known scalable SMD benchmark test problem when executed on an NVIDIA A100 GPU. The findings indicate that the algorithm’s convergence is strongly influenced by the number of both upper- and lower-level generations. Moreover, the success of experiments with large-scale problems is closely linked to the choice of small population sizes.

Dufek, Amanda S↗
DOE OSTI2022

Enhancing scalability of a matrix-free eigensolver for studying many-body localization

We propose several techniques to enhance the parallel scalability of a matrix-free eigensolver designed for studying many-body localization (MBL) of quantum spin chain models with nearest-neighbor interactions and on-site disorder. This type of problem is computationally challenging because the dimension of the associated Hamiltonian matrix grows exponentially with respect to the number of spins L, and we need to average over different realizations of the random disorder to obtain relevant statistical behavior. For each disorder realization, we need to compute eigenvalues from different regions of the spectrum and their corresponding eigenvectors. In previous work, the interior eigenstates for a single eigenvalue problem are computed via the shift-and-invert Lanczos algorithm. Due to the extremely high memory footprint of the LU factorizations, this technique is not well suited for large L’s. For example, we need thousands of compute nodes on modern high performance computing infrastructures to go beyond L = 24. The matrix-free approach does not suffer from this memory bottleneck, however, its scalability is limited by a computation and communication load imbalance. To reduce this imbalance and to significantly enhance the scalability of the matrix-free eigensolver, we reorder the matrix and leverage the consistent space runtime, CSPACER. We also show its efficiency in managing irregular communication patterns at scale compared to optimized MPI non-blocking two-sided and one-sided RMA implementation variants. This effort enables us to study MBL for spin chains with a larger number of spins. The efficiency and effectiveness of the proposed algorithm is demonstrated by computing eigenstates on a massively parallel many-core high performance computer.

METIS↗
DOE OSTI2024

Taweret: a Python package for Bayesian model mixing

Uncertainty quantification using Bayesian methods is a growing area of research. Bayesian model mixing (BMM) is a recent development which combines the predictions from multiple models such that the fidelity of each model is preserved in the final result. Practical tools and analysis suites that facilitate such methods are therefore needed. Taweret introduces BMM to existing Bayesian uncertainty quantification efforts. Currently, Taweret contains three individual Bayesian model mixing techniques, each pertaining to a different type of problem structure; we encourage the future inclusion of user-developed mixing methods. Taweret’s first use case is in nuclear physics, but the package has been structured such that it should be adaptable to any research engaged in model comparison or model mixing.

Ingles, Kevin↗
DOE OSTI2020

Technology Summary L-21044 Tunnel Sensor Hydrogeology Evaluations

Illicit tunneling along the U.S. Mexican border is a persistent national security problem. Several types of sensors could be to used to detect tunnels, but the hydrogeology of the subsurface makes some technologies ineffective. This effort used available borehole and surface geology data to develop 3D hydrogeologic models, which could then provide the input for optimizing subsurface sensor technologies to detect tunnels. Depending on the specific type of sensor, the following physical properties of the subsurface are important: longitudinal speed (velocity-p), shear speed (velocity-s), acoustic attenuation, electrical permittivity, electrical conductivity, density and elastic properties. LLNL developed a procedure which uses hydrogeological datasets to determine 3D hydrogeology cross sections. The physical properties of the rocks are generally not known precisely, thus ranges of properties would need to be considered. This cross-section data can then be utilized to enhance modeling studies to optimize sensor types/systems.

58 GEOSCIENCES↗
DOE OSTI2025

Comparing three generations of D-Wave quantum annealers for minor embedded combinatorial optimization problems

Abstract Quantum annealing (QA) is a novel type of analog computation that aims to use quantum mechanical fluctuations to search for optimal solutions of Ising problems. QA in the transverse Ising model, implemented on D-Wave quantum processing units, are available as cloud computing resources. In this study we report concise benchmarks across three generations of D-Wave quantum annealers, consisting of four different devices, for the NP-hard discrete combinatorial optimization problems unweighted maximum clique and unweighted maximum cut on random graphs. The Ising, or equivalently quadratic unconstrained binary optimization, formulation of these problems do not require auxiliary variables for order reduction, and their overall structure and weights are not highly variable, which makes these problems simple test cases to understand the sampling capability of current D-Wave quantum annealers. All-to-all minor embeddings of size 52, with relatively uniform chain lengths, are used for a direct comparison across the Chimera, Pegasus, and Zephyr device topologies. A grid-search over annealing times and the minor embedding chain strengths is performed in order to determine the level of reasonable performance for each device and problem type. Experiment metrics that are reported are approximation ratios for non-broken chain samples, chain break proportions, and time-to-solution for the maximum clique problem instances. How fairly the quantum annealers sample optimal maximum cliques, for instances which contain multiple maximum cliques, is quantified using entropy of the measured ground state distributions. The newest generation of quantum annealing hardware, which has a Zephyr hardware connectivity, performed the best overall with respect to approximation ratios and chain break frequencies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Accelerated Sparse Recovery via Gradient Descent with Nonlinear Conjugate Gradient Momentum

This paper applies an idea of adaptive momentum for the nonlinear conjugate gradient to accelerate optimization problems in sparse recovery. Specifically, we consider two types of minimization problems: a (single) differentiable function and the sum of a non-smooth function and a differentiable function. In the first case, we adopt a fixed step size to avoid the traditional line search and establish the convergence analysis of the proposed algorithm for a quadratic problem. This acceleration is further incorporated with an operator splitting technique to deal with the non-smooth function in the second case. As a result, we use the convex ι 1 and the nonconvex ι 1 – ι 2 functionals as two case studies to demonstrate the efficiency of the proposed approaches over traditional methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Entanglement perspective on the quantum approximate optimization algorithm

Many quantum algorithms seek to output a specific bitstring solving the problem of interest—or a few if the solution is degenerate. It is the case for the quantum approximate optimization algorithm (QAOA) in the limit of large circuit depth, which aims to solve quadratic unconstrained binary optimization problems. Hence, the expected final state for these algorithms is either a product state or a low-entangled superposition involving a few bitstrings. What happens in between the initial N -qubit product state | 0 〉 ⊗ N and the final one regarding entanglement? Here, we consider the QAOA algorithm for solving the paradigmatic MaxCut problem on different types of graphs. We study the entanglement growth and spread resulting from randomized and optimized QAOA circuits and find that there is a volume-law entanglement barrier between the initial and final states. We also investigate the entanglement spectrum in connection with random matrix theory. In addition, we compare the entanglement production with a quantum annealing protocol aiming to solve the same MaxCut problems. Finally, we discuss the implications of our results for the simulation of QAOA circuits with tensor network-based methods relying on low-entanglement for efficiency, such as matrix product states.

Dupont, Maxime↗
DOE OSTI2020

Nonoverlapping Localized Exponential Time Differencing Methods for Diffusion Problems

In this paper, we propose nonoverlapping localized exponential time differencing (ETD) methods for diffusion problems. The model time-dependent diffusion equation is first reformulated on subdomains based on the nonoverlapping domain decomposition, in which Neumann boundary conditions are imposed on the interfaces for the subdomain problems and Dirichlet type conditions are enforced to form a space-time interface problem. After spatial discretization by standard central finite differences and temporal integration with the first or second order ETD methods, the fully discrete interface problem is obtained. Such an interface problem is then solved iteratively either at each time step or over the whole time interval: the former involves the solution of stationary problems in each subdomain at each iteration while the latter involves the solution of time-dependent subdomain problems at each iteration. For both approaches, we prove that localized ETD solutions conserve mass exactly and converge in time to the exact space semidiscrete solution. Numerical experiments in two dimensions are also presented to illustrate the performance of the proposed methods.

Mass conservation↗
DOE OSTI2022

Validation of NEAMS Tools Using MSRE Data

This report documents the benchmarks developed and performed for the tools and codes developed under the Nuclear Energy Advanced Modeling and Simulation (NEAMS) program utilizing the MSRE experiment data. There are three focus areas explored in this work: fuel evolution, CFD, and system transient analyses. Fuel depletion is important for MSR reactor physics and fuel cycle analysis. Fuel depletion capability is currently being developed in the Griffin reactor physics code. To support this, a benchmark problem is developed using the MSRE data and an existing depletion code with flowing fuel analysis functionality (ADDER) to validate this new capability in Griffin. The ADDER calculation is compared with the TRITON-MSR results as well as the MSRE experimental data. This benchmark can be directly used to verify and validate the Griffin fuel depletion capability in future years. For CFD simulation, the MSRE CAD model is obtained from the Copenhagen Atomics and a mesh is generated for the MSRE inlet plenum. The Nek5000 code will be employed to find the flow distribution in the MSRE inlet plenum based on the mesh generated. For system analysis, a simple benchmark problem for three types of MSR system transients is developed. The SAM and SPECTRA codes are used to solve the simple problem, and the results from the two codes agree well. The SAM code is also employed to obtain the frequency response of the MSRE system at the 5 and 8 MWt power levels. The results agree well with the experiment measurements. These verification and validation efforts gives SAM users more confidence in MSR system transient simulations using SAM. Lastly, the SAM-Griffin Multiphysics coupling work is initiated. A simple one-way coupling of evaluating the precursor drift effect on the MSRE k-eff is demonstrated. This preliminary coupling work serves as the basis for future more complex Multiphysics simulation and modelling.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2020

Deep learning of free boundary and Stefan problems

Free boundary problems appear naturally in numerous areas of mathematics, science and engineering. These problems present a great computational challenge because they necessitate numerical methods that can yield an accurate approximation of free boundaries and complex dynamic interfaces. In this work, we propose a multi-network model based on physics-informed neural networks to tackle a general class of forward and inverse free boundary problems called Stefan problems. Specifically, we approximate the unknown solution as well as any moving boundaries by two deep neural networks. Besides, we formulate a new type of inverse Stefan problems that aim to reconstruct the solution and free boundaries directly from sparse and noisy measurements. We demonstrate the effectiveness of our approach in a series of benchmarks spanning different types of Stefan problems, and illustrate how the proposed framework can accurately recover solutions of partial differential equations with moving boundaries and dynamic interfaces. All code and data accompanying this manuscript are publicly available at https://github.com/PredictiveIntelligenceLab/DeepStefan.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗