Search NASA⌕ Search

SEARCH · Search NASA

Results for “COMPUTING 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 217 records · Page 12

Approximate Mixed-Integer Programming Solution with Machine Learning Technique and Linear Programming Relaxation

Security constrained unit commitment (SCUC) is solved in the day-ahead electricity market to determine electricity generation schedule for the following date. The associated mixed integer programming (MIP) problem is known computationally hard. Heuristics like rounding can be computationally efficient for solving large MIP problems however often produces lower quality solutions due to discrepancy between MIP solution and linear programming relaxation (LPR) solution, i.e., variables taking different discrete values between MIP and LPR solutions. In this work, we applied the machine learning-based algorithms—Classification and Regression Tree (CART) model and random forest (RF) model—to obtain an LPR-based approximation that close to an MIP solution without actually solving the MIP problem. By computing feature importance derived from the CART and RF models, we assessed the link between coefficients in the MIP model, the LPR solution, and the optimal solution of the MIP problem. We applied the CART and RF approaches to solve SCUC problems using day-ahead energy market cases from Midcontinent Independent System Operator. The results show that our method is computationally efficient and could achieve an approximation sufficiently close to the SCUC solution with <0.15% error and ~78% reduction in the discrepancies between LPR and MIP solutions.

Lin, Xinming↗

CHASM Challenge Problem: Lagrangian Hydrodynamics

Computer simulations of many science and engineering problems require modeling the equations of hydrodynamics which describe the motion of materials relative to each other induced by various forces. Many important DoD simulation problems involve complex multi-material systems that undergo large deformations. Examples include the analysis of armor defense, penetration mechanics, blast effects, structural integrity, and conventional munitions such as shaped charges and explosively formed projectiles. Indeed, the original motivation for developing codes that solve the equations of hydrodynamics, herein referred to as “hydrocodes”, was to solve problems with defense applications. The FY2010 Requirements Analysis Report issued by the DoD High Performance Computing Modernization Program (HPCMP) Office shows that a major portion of DoD HPC activities involves hydrocodes [HPCMP2010]. The report surveyed 496 projects across the Services and various Agencies, representing 4,050 HPCMP users at more than 125 locations, including government, contractors, and academia, and grouped each project into one of ten categories.

42 ENGINEERING↗

Blade Load Unsteadiness and Turbulence Statistics in an Actuator-Line Computed Turbine–Turbine Interaction Problem

The objective of this study is to investigate how different volumetric projection techniques used in actuator-line modeling affect the unsteady blade loads and wake turbulence statistics. The two techniques for the body-force projection radius are based on either (i) the grid spacing or (ii) the combination of grid spacing and an equivalent elliptic blade planform. An array of two National Renewable Energy Laboratory 5-MW turbines separated by seven rotor diameters is simulated for 2000s (about rotor 300 revolutions) within a large-eddy simulation (LES) solver of the neutral and moderately convective atmospheric boundary layer (ABL). The statistics of sectional angle of attack (AOA), blade loads, and turbine power histories are quantified. Moreover, the degree of unsteadiness of sectional blade loads in response to atmospheric and wake turbulence is computed via a reduced frequency based on the rate-of-change in sectional AOA. Finally, the goal of this work is to make the wind energy community aware of the uncertainties associated with actuator-line modeling approaches.

17 WIND ENERGY↗

TQEA: Temporal Quantum Error Analysis

For the last few years quantum computers have captured researchers’ interest in solving complicated problems in finance, chemistry, machine learning, and many other NP problems. Quantum computing benefits from parallel computation, entanglement, and calculation speedup compared to classical computing. Even though the operations and number of qubits in quantum computers are limited, previous research showed that using quantum computers can be beneficial. These benefits gained researchers’ interest to work on the improvement of quantum computers and overcome the limitations by building more advanced quantum computers with fault tolerance capability, more physical qubits, and better operational gates. In practice, Quantum applications would be translated into Quantum Circuits and each circuit can contain one or many entanglements (s), single qubits operations, and readouts. The importance of running Quantum applications with controlled errors or without errors is critical to the desired result from Quantum readout. In this paper, we study the characteristics of superconducting quantum machines along with the previously proposed methods of Quantum error detection/correction and in order to build a better error model we propose a temporal method for analyzing the the behavior of qubits errors (T1 and T2), frequency of operation, entanglement errors, and readout errors. In order to detect and predict the behavior of each machine, we use simple exponential smoothing analysis on heuristic calibration data. Finally, based on observation, we show that based on frequency, qubits, readout and single operation errors we can build a temporal based model to study and predict the outcome of runs on each Quantum machine.

Baheri, Betis↗

Ion Coulomb Crystals in Storage Rings for Quantum Information Science

Quantum information science is a growing field that promises to take computing into a new age of higher performance and larger scale computing as well as being capable of solving problems classical computers are incapable of solving. The outstanding issue in practical quantum computing today is scaling up the system while maintaining interconnectivity of the qubits and low error rates in qubit operations to be able to implement error correction and fault-tolerant operations. Trapped ion qubits offer long coherence times that allow error correction. However, error correction algorithms require large numbers of qubits to work properly. We can potentially create many thousands (or more) of qubits with long coherence states in a storage ring. For example, a circular radio-frequency quadrupole, which acts as a large circular ion trap and could enable larger scale quantum computing. Such a Storage Ring Quantum Computer (SRQC) would be a scalable and fault tolerant quantum information system, composed of qubits with very long coherence lifetimes. With computing demands potentially outpacing the supply of high-performance systems, quantum computing could bring innovation and scientific advances to particle physics and other DOE supported programs. Increased support of R$\&$D in large scale ion trap quantum computers would allow the timely exploration of this exciting new scalable quantum computer. The R$\&$D program could start immediately at existing facilities and would include the design and construction of a prototype SRQC. We invite feedback from and collaboration with the particle physics and quantum information science communities.

43 PARTICLE ACCELERATORS↗

Grid Optimization Competition Challenge 3 Problem Formulation

This report contains the problem formulation for the Grid Optimization (GO) Competition Challenge 3. The Grid Optimization Competition is run by a team of researchers from a number of organizations, including the sponsor Advanced Research Projects Agency - Energy (ARPA-E), lead organization Pacific Northwest National Laboratory (PNNL), and technical contributors from Los Alamos National Laboratory (LANL), National Renewable Energy Laboratory (NREL), Texas A&M University (TAMU), Georgia Institute of Technology (GT), University of Wisconsin (UW), and others. The GO Competition poses challenge problems in the field of power grid management, invites entrants to develop solvers for these problems, invokes the solvers on a set of problem instances using common hardware, ranks the solvers according to their performance, and awards prizes according to the rankings. The overall goal of the GO Competition is to spur innovative research on high impact and computationally challenging problems in power grid management from initial development through commercial deployment. Complete information about the GO Competition can be found online at [2]. The webpage covers previous Challenges, rules, timeline, registration information, data formats, scoring methods, computational platform information, information on supported solvers and languages, sponsor information, frequently asked questions, administrator contact information, publicly available problem instances, computer code for reading and evaluating problem and solution data, a sandbox for testing solvers, and a solver submission interface, results, and publications.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A simple three-component mixing problem for the evaluation of a new reaction rate model

A simple computational mixing problem is presented which can be utilized to assess the behavior of Reynolds-averaged reaction rate models in a problem with temporally varying mixedness. In this problem, three mixing components are homogeneously distributed but initially separated in a triply periodic domain. Further, these components are initialized within a Taylor–Green-like velocity field, which creates a mixing history evolving from the so-called “no-mix limit” to a well-mixed state. Large-eddy simulation results from this problem in configurations involving both premixed and nonpremixed reactants are then compared with zero-dimensional Reynolds-averaged Navier–Stokes results utilizing a new model for multicomponent reacting mixtures. The new model is shown to appropriately respect the no-mix limit and outperforms an earlier model (Morgan, 2022), particularly at early times when components are near the no-mix limit.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Formal Estimation of Errors in Computed Absolute Interaction Energies of Protein-Ligand Complexes

A largely unsolved problem in computational biochemistry is the accurate prediction of binding affinities of small ligands to protein receptors. We present a detailed analysis of the systematic and random errors present in computational methods through the use of error probability density functions, specifically for computed interaction energies between chemical fragments comprising a protein-ligand complex. An HIV-II protease crystal structure with a bound ligand (indinavir) was chosen as a model protein-ligand complex. The complex was decomposed into 21 interacting fragment pairs, which were studied using a number of computational methods. The chemically accurate complete basis set coupled cluster theory (CCSD(T)/CBS) interaction energies were used as reference values to generate our error estimates. In our analysis, we observed significant systematic and random errors in most methods, which was surprising, especially for parametrized classical and semiempirical quantum mechanical calculations. After propagating these fragment-based error estimates over the entire protein-ligand complex, our total error estimates for many methods are large compared to the experimentally determined free energy of binding. Thus, we conclude that statistical error analysis is a necessary addition to any scoring function attempting to produce reliable binding affinity predictions.

Chemistry↗

Cross-Modal Guidance for Fast Diffusion-Based Computed Tomography

Diffusion models have emerged as powerful priors for solving inverse problems in computed tomography (CT). In certain applications, such as neutron CT, it can be expensive to collect large amounts of measurements even for a single scan leading to sparse data sets from which it is challenging to obtain high quality reconstructions even with diffusion models. One strategy to mitigate this challenge is to leverage a complementary, easily available imaging modality; however, such approaches typically require retraining the diffusion model with large datasets. In this work, we propose incorporating an additional modality without retraining the diffusion prior, enabling accelerated imaging of costly modalities. We further examine the impact of imperfect side modalities on cross-modal guidance. Our method is evaluated on sparse-view neutron computed tomography, where reconstruction quality is substantially improved by incorporating X-ray computed tomography of the same samples.

Efimov, Timofey [ORNL] (ORCID:000900090098471X)↗

Surrogate Optimization of Computationally Expensive Black-Box Problems with Hidden Constraints (SHEBO) v1.0

SHEBO (surrogate optimization of problems with hidden constraints and expensive black-box objectives) is an efficient optimization algorithm that employs surrogate models to solve computationally expensive black-box simulation optimization problems that have hidden constraints. Hidden constraints are encountered when the objective function evaluation does not return a value for a parameter vector. These constraints are often encountered in optimization problems in which the objective function is computed by a black-box simulation code. SHEBO uses a combination of local and global search strategies together with an evaluability prediction function and a dynamically adjusted evaluability threshold to iteratively select new sample points.

Mueller, Juliane↗

A performance spectrum for parallel computational frameworks that solve PDEs

Summary Important computational physics problems are often large‐scale in nature, and it is highly desirable to have robust and high performing computational frameworks that can quickly address these problems. However, it is no trivial task to determine whether a computational framework is performing efficiently or is scalable. The aim of this paper is to present various strategies for better understanding the performance of any parallel computational frameworks for solving PDEs. Important performance issues that negatively impact time‐to‐solution are discussed, and we propose a performance spectrum analysis that can enhance one's understanding of critical aforementioned performance issues. As proof of concept, we examine commonly used finite element simulation packages and software and apply the performance spectrum to quickly analyze the performance and scalability across various hardware platforms, software implementations, and numerical discretizations. It is shown that the proposed performance spectrum is a versatile performance model that is not only extendable to more complex PDEs such as hydrostatic ice sheet flow equations but also useful for understanding hardware performance in a massively parallel computing environment. Potential applications and future extensions of this work are also discussed.

Chang, J.↗

Learning neural representations for X-ray ptychography reconstruction with unknown probes

X-ray ptychography provides exceptional nanoscale resolution and is widely applied in materials science, biology, and nanotechnology. However, its full potential is constrained by the critical challenge of accurately reconstructing images when the illuminating probe is unknown. Conventional iterative methods and deep learning approaches are often suboptimal, particularly under the low-signal conditions inherent to low-dose and high-speed experiments. These limitations compromise reconstruction fidelity and restrict the broader adoption of the technique. In this work, we introduce the Ptychographic Implicit Neural Representation (PtyINR), a self-supervised framework that simultaneously addresses the object- and probe-recovery problem. By parameterizing both as continuous neural representations, PtyINR performs end-to-end reconstruction directly from raw diffraction patterns without requiring any pre-characterization of the probe. Extensive evaluations demonstrate that PtyINR achieves superior reconstruction quality on both simulated and experimental data, with remarkable robustness under challenging low-signal conditions. Furthermore, PtyINR offers a generalizable, physics-informed framework for addressing probe-dependent inverse problems, making it applicable to a wide range of computational microscopy problems.

36 MATERIALS SCIENCE↗

MinCostFlows.jl

MinCostFlows.jl is a utility package in the Julia programming language for efficiently solving min-cost network flow problems through an implementation of the relaxation dual ascent method (Bertsekas, 1985, https://link.springer.com/article/10.1007/BF01586087). The use of a dual ascent method allows for warm-starting the solver with a solution from a previously-solved problem that need not be feasible for the new problem, providing computational performance benefits when repeatedly solving similar network flow problems. This approach is particularly useful for Monte Carlo power system resource adequacy models.

Gordon, Stephen↗