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 1,117 records · Page 62

Learning Optimal Solutions for Extremely Fast AC Optimal Power Flow: Preprint

We develop, in this paper, a machine learning approach to optimize the real-time operation of electric power grids. In particular, we learn feasible solutions to the AC optimal power flow (OPF) problem with negligible optimality gaps. The AC OPF problem aims at identifying optimal operational conditions of the power grids that minimize power losses and/or generation costs. Due to the computational challenges with solving this nonconvex problem, many efforts have focused on linearizing or approximating the problem in order to solve the AC OPF on faster timescales. However, many of these approximations can be fairly poor representations of the actual system state and still require solving an optimization problem, which can be time consuming for large networks. In this work, we learn a mapping between the system loading and optimal generation values, enabling us to find near-optimal and feasible AC OPF solutions. This allows us to bypass solving the traditionally nonconvex AC OPF problem, resulting in a significant decrease in computational burden for grid operators.

machine learning↗

CSR in the Probabilistic Resource Adequacy Suite (PRAS): Fast Interregional Transmission Models for Renewable Integration Studies

NREL's Probabilistic Resource Adequacy Suite (PRAS) was developed for use in renewable integration studies, to assess the resource adequacy of large interconnected power systems with potentially significant interregional transfers of power. This presentation provides an overview of the tool and the methods it uses to solve multi-regional transmission and storage dispatch problems in a computationally-efficient manner.

composite system reliability↗

A Brief Overview of Radiochemistry: Californium-252: Unique and Versatile Man-made Radioisotope

This chapter summarizes radiochemistry and its applications with a focus on areas where computational science can be beneficial. This is presented for a target audience of computational scientists and chemists, and the general public who are interested in radiochemistry topics that may benefit from the use of computational methods. Past, present, and future applications of radiochemistry are presented along with a brief examination of the field’s workforce. Discussions of the current state of several radiochemistry specialty areas are also included. These discussions generally exemplify topics that are readily amenable to computational tools. Topics discussed include medical uses for radioactive materials and related computational needs; the current and future trends in the separations of the f-block elements; production and uses of Californium-252; and the need for exascale computing to solve current problems in the chemistry of Americium and Plutonium.

Ezold, Julie↗

A Brief Overview of Radiochemistry: f-Element Separations: The State of the Art and Future Directions

This chapter summarizes radiochemistry and its applications with a focus on areas where computational science can be beneficial. This is presented for a target audience of computational scientists and chemists, and the general public who are interested in radiochemistry topics that may benefit from the use of computational methods. Past, present, and future applications of radiochemistry are presented along with a brief examination of the field’s workforce. Discussions of the current state of several radiochemistry specialty areas are also included. These discussions generally exemplify topics that are readily amenable to computational tools. Topics discussed include medical uses for radioactive materials and related computational needs; the current and future trends in the separations of the f-block elements; production and uses of Californium-252; and the need for exascale computing to solve current problems in the chemistry of Americium and Plutonium.

Kimberlin, Ashleigh↗

Machine Learning in Nuclear Thermal Hydraulics, Part 2: Opportunities and Perspectives

This paper summarizes the issues in nuclear thermal hydraulics (NTH), mainly from the three named aspects, and illustrates potential opportunities of machine learning (ML) applications in dealing with these issues. These issues are problems in simultaneously realizing computational efficiency and accuracy of system thermal hydraulic (STH) modeling and simulation, uncertainty in the scaling analysis for the best-estimate calculations of transient and accident analysis, and difficulties in optimal data production and usage for the development and assessment of evaluation models. Due to ML uncertainty, data insufficiency, and lack of cognition about how to efficiently incorporate knowledge and data, challenges of adapting ML techniques still exist. Accordingly, several perspectives are proposed to provide insights for ML applications in solving these issues.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Noise-Directed Adaptive Remapping for Integer Optimization: from qubits to (encoded) qudits

We extend Noise-Directed Adaptive Remapping (NDAR), a recently proposed heuristic meta-algorithm that leverages device noise as a computational resource, to optimization problems over discrete (integer) domains. While originally introduced for unconstrained binary optimization, the proposed generalization introduces additional gauge degrees of freedom at the logical level, such that the gauge transformation applied at each iteration is no longer unique, allowing tailoring to particular encodings or quantum hardware. We identify encoding-dependent requirements for NDAR beyond binary domains: feasibility of the noise attractor, existence of compatible gauge transformations that preserve an efficiently implementable circuit family, and a systematic way to select the transform to apply at each step. We analyze these criteria for qudit-native and for binary, one-hot, and domain-wall qubit encodings, using the Max-k-colorable subgraph problem as a running example. We demonstrate that these encodings can exhibit distinct advantages and tradeoffs when integrated within the NDAR framework, particularly in how noise-induced dynamics interact with the solution landscape and choice of encoding. Our results indicate that NDAR-guided noise considerations provide a new criterion for comparing device-level encoding choices for quantum optimization. Finally, we outline directions toward experimental realization in superconducting qudit devices and further algorithmic improvements.

Hadfield, Stuart [RIACS, Mtn. View] (ORCID:0000000↗

Counting independent sets using the Bethe approximation

The authors consider the problem of counting the number of independent sets or the partition function of a hard-core model in a graph. The problem in general is computationally hard (P hard). They study the quality of the approximation provided by the Bethe free energy. Belief propagation (BP) is a message-passing algorithm can be used to compute fixed points of the Bethe approximation; however, BP is not always guarantee to converge. As the first result, they propose a simple message-passing algorithm that converges to a BP fixed pont for any grapy. They find that their algorithm converges within a multiplicative error 1 + {var_epsilon} of a fixed point in {Omicron}(n{sup 2}E{sup -4} log{sup 3}(nE{sup -1})) iterations for any bounded degree graph of n nodes. In a nutshell, the algorithm can be thought of as a modification of BP with 'time-varying' message-passing. Next, they analyze the resulting error to the number of independent sets provided by such a fixed point of the Bethe approximation. Using the recently developed loop calculus approach by Vhertkov and Chernyak, they establish that for any bounded graph with large enough girth, the error is {Omicron}(n{sup -{gamma}}) for some {gamma} > 0. As an application, they find that for random 3-regular graph, Bethe approximation of log-partition function (log of the number of independent sets) is within o(1) of corret log-partition - this is quite surprising as previous physics-based predictions were expecting an error of o(n). In sum, their results provide a systematic way to find Bethe fixed points for any graph quickly and allow for estimating error in Bethe approximation using novel combinatorial techniques.

97 MATHEMATICS AND COMPUTING↗

Fast Combinatorial Algorithm for the Solution of Linearly Constrained Least Squares Problems

A fast combinatorial algorithm can significantly reduce the computational burden when solving general equality and inequality constrained least squares problems with large numbers of observation vectors. The combinatorial algorithm provides a mathematically rigorous solution and operates at great speed by reorganizing the calculations to take advantage of the combinatorial nature of the problems to be solved. The combinatorial algorithm exploits the structure that exists in large-scale problems in order to minimize the number of arithmetic operations required to obtain a solution.

Van Benthem, Mark H↗

An Efficient Numerical Algorithm for Solving Data Driven Feedback Control Problems

The goal of this paper is to solve a class of stochastic optimal control problems numerically, in which the state process is governed by an Itô type stochastic differential equation with control process entering both in the drift and the diffusion, and is observed partially. The optimal control of feedback form is determined based on the available observational data. In this work, we call this type of control problems the data driven feedback control. The computational framework that we introduce to solve such type of problems aims to find the best estimate for the optimal control as a conditional expectation given the observational information. To make our method feasible in providing timely feedback to the controlled system from data, we develop an efficient stochastic optimization algorithm to implement our computational framework.

97 MATHEMATICS AND COMPUTING↗

ExaTN

A challenging scientific problem that will benefit from exascale computing is predictive simulation of two- and three-dimensional quantum many-body Hamiltonians in condensed matter physics, together with the related strong entanglement problems in quantum chemistry and quantum computing. Efficient numerical simulations will require new insights into wavefunction compression algorithms that scale on extremely heterogeneous HPC architectures. To address this need, we propose to develop a scalable math library of parallel multi-linear algebraic numerical primitives for hierarchical tensor compression. Our library will subsequently be used for building an efficient, performance-portable HPC framework for simulating strongly correlated quantum systems. In particular, our will will be the first to deliver a massively parallel implementation of the multiscale entanglement renormalization ansatz (MERA), a hierarchical tensor decomposition quantum scheme capable of expressing local expectation values of strongly entangled higher-dimensional quantum systems efficiently. To address the extreme complexity and high computational cost of such schemes, we will automate their parallel implementation by delivering an integrated software framework, ExaTN (Exascale Tensor Networks), that will process hierarchical tensor representations on exascale HPC systems via an asymchronous task-based programming model. As a specific application, our framework will provide scientists with a capability of simulating strongly entangled quantum systems, thus positioning ORNL as a strategic leader in modeling of strongly correlated materials.

McCaskey, AlexanderJ↗

WE-D-303-00: Computational Phantoms

Modern medical physics deals with complex problems such as 4D radiation therapy and imaging quality optimization. Such problems involve a large number of radiological parameters, and anatomical and physiological breathing patterns. A major challenge is how to develop, test, evaluate and compare various new imaging and treatment techniques, which often involves testing over a large range of radiological parameters as well as varying patient anatomies and motions. It would be extremely challenging, if not impossible, both ethically and practically, to test every combination of parameters and every task on every type of patient under clinical conditions. Computer-based simulation using computational phantoms offers a practical technique with which to evaluate, optimize, and compare imaging technologies and methods. Within simulation, the computerized phantom provides a virtual model of the patient’s anatomy and physiology. Imaging data can be generated from it as if it was a live patient using accurate models of the physics of the imaging and treatment process. With sophisticated simulation algorithms, it is possible to perform virtual experiments entirely on the computer. By serving as virtual patients, computational phantoms hold great promise in solving some of the most complex problems in modern medical physics. In this proposed symposium, we will present the history and recent developments of computational phantom models, share experiences in their application to advanced imaging and radiation applications, and discuss their promises and limitations. Learning Objectives: Understand the need and requirements of computational phantoms in medical physics research Discuss the developments and applications of computational phantoms Know the promises and limitations of computational phantoms in solving complex problems.

60 APPLIED LIFE SCIENCES↗

Multi-fidelity Fourier neural operator for fast modeling of large-scale geological carbon storage

Deep learning-based surrogate models have been widely applied in geological carbon storage (GCS) problems to accelerate the prediction of reservoir pressure and CO2 plume migration. Large amounts of data from physics-based numerical simulators are required to train a model to accurately predict the complex physical behaviors associated with this process. In practice, the available training data are always limited in large-scale 3D problems due to the high computational cost. Therefore, we propose to use a multi-fidelity Fourier neural operator (FNO) to solve large-scale GCS problems with more affordable multi-fidelity training datasets. FNO has a desirable grid-invariant property, which simplifies the transfer learning procedure between datasets with different discretization. Here, we first test the model efficacy on a GCS reservoir model being discretized into 110 k grid cells. The multi-fidelity model can predict with accuracy comparable to a high-fidelity model trained with the same amount of high-fidelity data with 81% less data generation costs. We further test the generalizability of the multi-fidelity model on a same reservoir model with a finer discretization of 1 million grid cells. This case was made more challenging by employing high-fidelity and low-fidelity datasets generated by different geostatistical models and reservoir simulators. We observe that the multi-fidelity FNO model can predict pressure fields with reasonable accuracy even when the high-fidelity data are extremely limited. The findings of this study can help for better understanding of the transferability of multi-fidelity deep learning surrogate models.

58 GEOSCIENCES↗

Computational Fluid Dynamic Analysis for the Proposed VHTR Lower Plenum Standard Problem

One of the reference designs for the Next Generation Nuclear Plant (NGNP) is a prismatic reactor configuration. A major concern in the operation of this design is the nature of the flow of hot gas as it exits the core into the lower plenum and then out the vessel exit duct. The two primary areas of concern are the impingement of hot jets onto the walls of the lower plenum and the degree of thermal mixing of the helium coolant as it flows out of the reactor vessel. Computational fluid dynamic (CFD) simulations have been proposed by general consensus to estimate the desired local fluid dynamic and temperature information. Successful CFD simulations require careful planning and extensive calculations to help ensure that they accurately represent the flow physics. An important aspect of the application of CFD is to validate the results against detailed validation data, for scaled problems that involve similar physics. A section of the lower plenum of the reference prismatic NGNP was employed to create a scaled model to use to obtain experimental data for use as validation data to compare with a CFD analysis. Extensive flow data were obtained from the scaled model while installed in the INL’s Matched Index of Refraction (MIR) test facility.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Distributed-Memory Fast Maximal Independent Set

The Maximal Independent Set (MIS) graph problem arises in many applications such as computer vision, information theory, molecular biology, and process scheduling. The growing scale of MIS problems suggests the use of distributed-memory hardware as a cost-effective approach to providing necessary compute and memory resources. Luby proposed four randomized algorithms to solve the MIS problem. All those algorithms are designed focusing on shared-memory machines and are analyzed using the PRAM model. These algorithms do not have direct efficient distributed-memory implementations. In this paper, we extend two of Luby’s seminal MIS algorithms, “Luby(A)” and “Luby(B),” to distributed-memory execution, and we evaluate their performance. We compare our results with the “Filtered MIS” implementation in the Combinatorial BLAS library for two types of synthetic graph inputs.

distributed memory parallel↗

Spectral finite-element methods for parametric constrained optimization problems.

We present a method to approximate the solution mapping of parametric constrained optimization problems. The approximation, which is of the spectral finite element type, is represented as a linear combination of orthogonal polynomials. Its coefficients are determined by solving an appropriate finite-dimensional constrained optimization problem. We show that, under certain conditions, the latter problem is solvable because it is feasible for a sufficiently large degree of the polynomial approximation and has an objective function with bounded level sets. In addition, the solutions of the finite-dimensional problems converge for an increasing degree of the polynomials considered, provided that the solutions exhibit a sufficiently large and uniform degree of smoothness. Our approach solves, in the case of optimization problems with uncertain parameters, the most computationally intensive part of stochastic finite-element approaches. We demonstrate that our framework is applicable to parametric eigenvalue problems.

97 MATHEMATICS AND COMPUTING↗

Noisy intermediate-scale quantum algorithms

A universal fault-tolerant quantum computer that can efficiently solve problems such as integer factorization and unstructured database search requires millions of qubits with low error rates and long coherence times. While the experimental advancement toward realizing such devices will potentially take decades of research, noisy intermediate-scale quantum (NISQ) computers already exist. These computers are composed of hundreds of noisy qubits, i.e., qubits that are not error corrected, and therefore perform imperfect operations within a limited coherence time. In the search for achieving quantum advantage with these devices, algorithms have been proposed for applications in various disciplines spanning physics, machine learning, quantum chemistry, and combinatorial optimization. The overarching goal of such algorithms is to leverage the limited available resources to perform classically challenging tasks. In this review, a thorough summary of NISQ computational paradigms and algorithms is provided. The key structure of these algorithms and their limitations and advantages are discussed. Finally, a comprehensive overview of various benchmarking and software tools useful for programming and testing NISQ devices is additionally provided.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scattering Amplitudes, the AdS/CFT Correspondence, Minimal Surfaces, and Integrability

We focus on the computation of scattering amplitudes of planar maximally supersymmetric Yang‐Mill in four dimensions at strong coupling by means of the AdS/CFT correspondence and explain how the problem boils down to the computation of minimal surfaces in AdS in the first part of this paper. In the second part of this review we explain how integrability allows to give a solution to the problem in terms of a set of integral equations. The intention of the review is to give a pedagogical, rather than very detailed, exposition.

Alday, Luis F.↗