Search NASA⌕ Search

SEARCH · Search NASA

Results for “PROBLEM SOLVING”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Modernizing the Nuclear Industry and New Ways of Working

Nuclear energy is recognized as the most feasible energy source towards achieving nation-wide net-zero goals (COP 208, MIT). Additionally, the demand for reliable, consistent energy supply is soaring with the construction of energy hungry data centers and AI tools. This means the construction of new nuclear and the continuation of current nuclear are a high national priority. However, this leaves the nuclear industry with a workforce challenge. The rising demand for nuclear power is threatened by an underpopulated workforce. There exist a few contributors to the decreased workforce such as skewed workforce demographics resulting in large-scale workforce retirement. Also, some plants have observed difficulty hiring and retaining skill sets that typically comprise the nuclear power workforce – specifically skilled craftsman. Those who are graduating with desirable skills are seeking employment in sectors that are more modern and culturally more aligned with younger generational values. Lastly, within the nuclear sector, skilled employees will be a competitive commodity as advanced plants come online offering work environments that incorporate modern technologies, skill sets, and opportunities for career advancement. These factors emphasize the need for legacy plants to modernize with a focus on the workplace environment and culture that meets younger generations’ skills, cultural expectations, and desire for advancement opportunities. Nuclear plants are actively engaged in deploying advancements that improve the management of systems, structures, and components as well as process improvements and technologies that can reduce the costs of operation and maintenance. However, the advancements must also be analyzed, reviewed and deployed in a manner that considers the impact on how people within the organization collaborate, communicate, make decisions, and solve problems. Neglecting to consider the cultural impact of modernization risks poor adoption, unrealized opportunities, or insignificant change toward helping attract new employees. The traditional way of working is not necessarily the way new generations want to engage with their employer. For instance, in a survey performed by North American Young Generation in Nuclear the top three reasons for younger nuclear employees to seek other job opportunities was seeking better work-life balance, a lack of advancement opportunities, and work culture and leadership style differences (Smyth et al. 2022). Integrated Operations for Nuclear (ION) is an approach for the nuclear industry to create long-term strategic modernization plans and analyze each advancement for the impact on people and processes and measure how those impacts flow up to support high-level, long-term plant goals and requirements. One principle of ION is to replace the current labor-centric operation style in legacy nuclear plants with data-centric collaborative operation styles. This paper will explain how transitioning operations to leverage centralized skills and responsibility, multi-skilled teams, and collaborative decision making can flatten the hierarchical structure in plants, enable greater individual efficacy while also offering more experiences and advancement opportunities to staff. Adopting the ION way of working shifts the industry mind-set towards more networked, collaborative, and modern way of working that will attract skilled, next-generation workers to operate the legacy nuclear fleet.

99 - GENERAL AND MISCELLANEOUS↗
DOE OSTI2024

Overview of Large Helical Device experiments of basic plasma physics for solving crucial issues in reaching burning plasma conditions

Recently, experiments on basic plasma physics issues for solving future problems in fusion energy have been performed on a Large Helical Device. There are several problems to be solved in future devices for fusion energy. Emerging issues in burning plasma are: alpha-channeling (ion heating by alpha particles), turbulence and transport in electron dominant heating helium ash exhaust, reduction of the divertor heat load. To solve these problems, understanding the basic plasma physics of (1) wave–particle interaction through (inverse) Landau damping, (2) characteristics of electron-scale (high-k) turbulence, (3) ion mixing and the isotope effect, and (4) turbulence spreading and detachment, is necessary. This overview discusses the experimental studies on these issues and turbulent transport in multi-ion plasma and other issues in the appendix.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

What can solve the strong CP problem?

Three possible strategies have been advocated to solve the strong CP problem. The first is the axion, a dynamical mechanism that relaxes any initial value of the CP violating angle $\overline{θ}$ to zero. The second is the imposition of new symmetries that are believed to set $\overline{θ}$ to zero in the UV. The third is the acceptance of the fine tuning of parameters. We argue that the latter two solutions do not solve the strong CP problem. The θ term of QCD is not a parameter — it does not exist in the Hamiltonian. Rather, it is a property of the quantum state that our universe finds itself in, arising from the fact that there are CP violating states of a CP preserving Hamiltonian. It is not eliminated by imposing parity as a symmetry since the underlying theory is already parity symmetric and that does not preclude the existence of CP violating states. Moreover, since the value of θ realized in our universe is a consequence of measurement, it is inherently random and cannot be fine tuned by choice of parameters. Rather any fine tuning would require a tuning between parameters in the theory and the random outcome of measurement. Our results considerably strengthen the case for the existence of the axion and axion dark matter. The confusion around θ arises from the fact that unlike classical mechanics, the Hamiltonian and Lagrangian are not equivalent in quantum mechanics. The Hamiltonian defines the differential time evolution, whereas the Lagrangian is a solution to this evolution. Consequently, initial conditions could in principle appear in the Lagrangian but not in the Hamiltonian. This results in aspects of the initial condition such as θ misleadingly appearing in the Lagrangian as parameters. We comment on the similarity between the θ vacua and the violations of the constraint equations of classical gauge theories in quantum mechanics.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Simulations of Quantum Approximate Optimization Algorithm on HPC-QC Integrated Systems

The Quantum Approximate Optimization Algorithm (QAOA) has emerged as a promising tool for accelerating optimization processes in the Noisy Intermediate-Scale Quantum (NISQ) era. Compared to classical methods, QAOA efficiently solves optimization problems, often formulated as Quadratic Unconstrained Binary Optimization (QUBO) problems. Classical quantum simulators are crucial for evaluating quantum algorithms due to limited quantum resources. However, QAOA's performance can vary with different simulation methods. This study analyzes QAOA's performance using various quantum simulators (e.g., density _matrix, statevector, and matrix_product_state) and demonstrates the benefits of HPC-QC integrated systems in solving QUBO problems on an active learning workflow. By simulating QAOA on dense, large-matrix QUBO problems, we evaluate accuracy and problem-solving time. We also assess QAOA's performance on local computers and HPC-QC inte-grated systems, using Oak Ridge Leadership Computing Facility (OLCF)'s Frontier supercomputer with local Qiskit Aer and remote IBM Quantum simulators.

Kim, Seongmin [ORNL] (ORCID:0000000159063004)↗
DOE OSTI2024

An Iterative Approach for Solving the SCOPF Problem Applying LP, SOCP, and NLP Subproblems

We propose to develop efficient algorithms and software for the SCOPF problem. We will employ an iterative approach that will: a) use linear subproblems and other active set filtering techniques to identify the most important contingencies and drastically reduce the SCOPF model size; b) solve SOCP relaxations of the reduced SCOPF to converge to the neighborhood of the global optimal solution and establish a lower bound on the solution, and; c) use a non-convex, nonlinear interior-point solver, Artelys Knitro, to converge quickly to the optimal solution. To identify the most effective approach, we will experiment with several techniques to identify the tradeoffs between contingency subproblem complexity and fast solvability.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2025

Adiabatic quantum support vector machines

Adiabatic quantum computers can solve difficult optimization problems (e.g., the quadratic unconstrained binary optimization problem), and they seem well suited to train machine learning models. In this paper, we describe an adiabatic quantum approach for training support vector machines. We show that the time complexity of our quantum approach is an order of magnitude better than the classical approach. Next, we compare the test accuracy of our quantum approach against a classical approach that uses the Scikit-learn library in Python across five benchmark datasets (Iris, Wisconsin Breast Cancer (WBC), Wine, Digits, and Lambeq). We show that our quantum approach obtains accuracies on par with the classical approach. Finally, we perform a scalability study in which we compute the total training times of the quantum approach and the classical approach with an increasing number of features and an increasing number of data points in the training dataset. In conclusion, our scalability results show that the quantum approach obtains a 3.5–4.5x speedup over the classical approach on datasets with many (millions of) features.

Computational Complexity↗
DOE OSTI2025

Solving the “Coloring Problem” in InPd 3– x Ag x ( x = 0–0.7) by Phase Diagrams Modeling and Diffraction Experiments

Here, a series of InPd 3–x Ag x (x = 0–1) compositions were synthesized by conventional high-temperature synthesis, and as-synthesized samples were characterized by powder X-ray diffraction experiments. Up to x = 0.7, InPd 3–x Ag x adopts the ternary substitutional variant of the InPd 3 structure (TiAl 3 -type), when x > 0.7, elemental Ag starts to segregate along with the main phase. Accurate structural characterization in InPd 3–x Ag x faces a critical challenge due to the narrow X-ray scattering contrast among constituents In, Pd, and Ag and nearly identical neutron scattering lengths of Pd and Ag. To overcome this “coloring problem”, a combination of calculation of phase diagrams modeling (CALPHAD) and diffraction techniques (X-ray and neutron) was employed. In the compositional range 0 ≤ x ≤ 0.7, InPd 3–x Ag x presents a ternary variant of the TiAl 3 -type structure, where Ag atoms selectively substitute one (the 2b Wyckoff site) of the two Pd sites in InPd 3 . Notably, in contrast to the isologous InPd 3–x Cu x (x = 0–1) system, Ag substitution does not form an ordered VRh 2 Sn-type structure at the limiting composition. The distinct site preference in InPd 3–x Ag x is elucidated by charge population analysis, electronic structure calculations, and orbital-resolved chemical bonding investigations, and the extent of substitution is supported by formation free energy calculations.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Solving k –SAT problems with generalized quantum measurement

We generalize the projection–based quantum measurement–driven k –SAT algorithm of Benjamin, Zhao, and Fitzsimons to arbitrary strength quantum measurements, including the limit of continuous monitoring. In doing so, we clarify that this algorithm is a particular case of the measurement–driven quantum control strategy elsewhere referred to as “Zeno dragging”. We argue that the algorithm is most efficient with finite time and measurement resources in the continuum limit, where measurements have an infinitesimal strength and duration. Moreover, for solvable k -SAT problems, the dynamics generated by the algorithm converge deterministically towards target dynamics in the long–time (Zeno) limit, implying that the algorithm can successfully operate autonomously via Lindblad dissipation, without detection. We subsequently study both the conditional and unconditional dynamics of the algorithm implemented via generalized measurements, quantifying the advantages of detection for heralding errors. These strategies are investigated first in a computationally–trivial 2-qubit 2-SAT problem to build intuition, and then we consider the scaling of the algorithm on 3-SAT problems encoded with 4–10 qubits. We numerically investigate the scaling of 3-SAT with respect to algorithmic runtime and find that the optimized time to solution scales with qubit number n as λ n , where λ is slightly larger than $\sqrt{2}$ for unconditional dynamics and less than $\sqrt{2}$ for conditional dynamics. We assess the implications for using this analog measurement–driven approach to quantum computing in practice.

quantum information↗
DOE OSTI2024

Unpaired image translation to mitigate domain shift in liquid argon time projection chamber detector responses

Deep learning algorithms often are developed and trained on a training dataset and deployed on test datasets. Any systematic difference between the training and a test dataset may severely degrade the final algorithm performance on the test dataset—what is known as the domain shift problem . This issue is prevalent in many scientific domains where algorithms are trained on simulated data but applied to real-world datasets. Typically, the domain shift problem is solved through various domain adaptation (DA) methods. However, these methods are often tailored for a specific downstream task, such as classification or semantic segmentation, and may not easily generalize to different tasks. This work explores the feasibility of using an alternative way to solve the domain shift problem that is not specific to any downstream algorithm. The proposed approach relies on modern Unpaired Image-to-Image (UI2I) translation techniques, designed to find translations between different image domains in a fully unsupervised fashion. In this study, the approach is applied to a domain shift problem commonly encountered in Liquid Argon Time Projection Chamber (LArTPC) detector research when seeking a way to translate samples between two differently distributed LArTPC detector datasets deterministically. This translation allows for mapping real-world data into the simulated data domain where the downstream algorithms can be run with much less domain-shift-related performance degradation. Conversely, using the translation from the simulated data to a real-world domain can increase the realism of the simulated dataset and reduce the magnitude of any systematic uncertainties. To evaluate the quality of the translations, we use both pixel-wise metrics and a downstream task to measure the effectiveness of UI2I methods for mitigating the domain shift problem. We adapted several popular UI2I translation algorithms to work on scientific data and demonstrated the viability of these techniques for solving the domain shift problem with LArTPC detector data. To facilitate further development of DA techniques for scientific datasets, the ‘Simple Liquid-Argon Track Samples’ dataset used in this study is also published.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

SAGIPS: a physics-inspired scalable asynchronous generative inverse-problem solver

Abstract Solving large-scale inverse problems using deep-learning algorithms have become an essential part of modern research and industrial applications. The complexity of the underlying inverse problem may require the utilization of high performance computing systems which poses a challenge on the algorithmic design of the inverse problem solver. Most deep learning algorithms require, due to their design, custom parallelization techniques in order to be resource efficient while showing a reasonable convergence. In this paper we introduce a S calable A synchronous G enerative I nverse P roblem S olver (SAGIPS) on high-performance computing systems. We present a workflow that utilizes an asynchronous ring-allreduce algorithm to transfer the gradients of the generator network across multiple GPUs. Experiments with a scientific proxy application demonstrate that SAGIPS shows near linear weak scaling, together with a convergence quality that is comparable to traditional methods. The approach presented here allows leveraging Generative Adverserial Network across multiple GPUs, promising advancements in solving complex inverse problems at scale.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

An Optimization-Based Law of Mass Action Precipitation/Dissolution Model

Rare earth elements (REE) and many other critical minerals are necessary for the manufacturing of modern everyday technologies, including microchips, batteries and electric motors. Recovery of these materials typically involves aqueous systems which can be modeled as chemical equilibrium problems. One common method for solving these problems is the law of mass action approach (LMA), where a system of non-linear equations involving the equilibrium constants is solved. However, despite being theoretically simple, these problems are in practice very difficult to solve. Currently, the use of iterative heuristics based on saturation indices to decide on which species and reactions to include in the calculations is the state of the art to arrive at a solution. Here, we present an optimization-based alternative to solve chemical equilibria problems involving precipitation/dissolution reactions without the need for such heuristics. Our approach is first validated against the LMA software MINTEQ and PHREEQC for a number of case studies, and then applied to a novel REE recovery process reported in the literature. Overall, our approach was found to have close agreement with MINTEQ and PHREEQC, and we were able to successfully replicate the reported yield and purity for the published REE process.

42 ENGINEERING↗
DOE OSTI2025

Quantum annealing for combinatorial optimization: a benchmarking study

Quantum annealing (QA) has the potential to significantly improve solution quality and reduce time complexity in solving combinatorial optimization problems compared to classical optimization methods. However, due to the limited number of qubits and their connectivity, the QA hardware did not show such an advantage over classical methods in past benchmarking studies. Recent advancements in QA with more than 5000 qubits, enhanced qubit connectivity, and the hybrid architecture promise to realize the quantum advantage. Here, we use a quantum annealer with state-of-the-art techniques and benchmark its performance against classical solvers. To compare their performance, we solve over 50 optimization problem instances represented by large and dense Hamiltonian matrices using quantum and classical solvers. The results demonstrate that a state-of-the-art quantum solver has higher accuracy (~0.013%) and a significantly faster problem-solving time (~6561×) than the best classical solver. Our results highlight the advantages of leveraging QA over classical counterparts, particularly in hybrid configurations, for achieving high accuracy and substantially reduced problem solving time in large-scale real-world optimization problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Robust Optimal Control of Inverter-Based Resources Under Grid-Forming Operation

In this paper, we propose and solve a robust control problem for inverter-based resources under grid-forming operation to regulate the voltage and frequency. One major challenge is to mitigate the effect of unmeasurable load current disturbance, grid and load parametric uncertainties. Moreover, strong coupling between the state variables on both the AC and DC sides, as well as between the modulating control input and the frequency impose additional challenges. To address these challenges, first, a robust control problem is solved at the high level via transformation into an equivalent, but more tractable, optimal control problem. Then, in the middle layer a voltage control law is designed on the one side, and a frequency control law on the other side. Finally, an inverter filter current controller is designed to complete the controller design. Theoretical results are derived to provide stability guarantees for the resulting closed-loop system. Specifically, we show that the inverter current injection error is dissipative, the frequency error is semi-globally asymptotically stable, and the inverter terminal voltage error is globally asymptotically stable, all with provided sufficient conditions. Here, numerical simulation experiments are used to validate the theoretical claims. Furthermore, the developed controller is compared with existing work in literature to show the efficacy of the proposed approach.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Stochastic minibatch approach to the ptychographic iterative engine

The ptychographic iterative engine (PIE) is a widely used algorithm that enables phase retrieval at nanometer-scale resolution over a wide range of imaging experiment configurations. By analyzing diffraction intensities from multiple scanning locations where a probing wavefield interacts with a sample, the algorithm solves a difficult optimization problem with constraints derived from the experimental geometry as well as sample properties. The effectiveness at which this optimization problem is solved is highly dependent on the ordering in which we use the measured diffraction intensities in the algorithm, and random ordering is widely used due to the limited ability to escape from stagnation in poor-quality local solutions. In this study, we introduce an extension to the PIE algorithm that uses ideas popularized in recent machine learning training methods, in this case minibatch stochastic gradient descent. Our results demonstrate that these new techniques significantly improve the convergence properties of the PIE numerical optimization problem.

47 OTHER INSTRUMENTATION↗
DOE OSTI2024

Computational shock formation & development: An arbitrary Lagrangian-Eulerian characteristics approach [Slides]

We propose a new computational shock formation-development algorithm. We use a “good” geometry adapted to the evolving solution, along with a good set of variables defined in this geometry. We are able to: (1) Accurately capture the pre-shock; (2) Track distinguished characteristics and capture weak discontinuities; (3) Approximate solutions to classical Riemann problems; and (4) Accurately solve challenging problems for which standard methods fail.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

QFw: A Quantum Framework for Large-scale HPC Ecosystems

This work extends Quantum Framework (QFw) by integrating it with Northwest Quantum Simulator (NWQ-Sim) and by introducing a lightweight python library that allows multiple frontends (e.g., Qiskit) to interact with QFw. This extension enables QFw to flexibly decouple frontends from backends (e.g., NWQ-Sim). We demonstrate this capability by executing a Greenberger-Horne-Zeilinger (GHZ) circuit using Qiskit and Pennylane with NWQ-Sim and Tensor-Network Quantum Virtual-Machine (TN-QVM). QFw enables easy scaling to multiple nodes. We showcase this with scaling tests using GHZ with up to 32 qubits for different number of nodes on the Frontier supercomputer. And, to demonstrate the use of QFw for real world problems, we solve a metamaterial optimization problem, using a Quantum Approximate Optimization Algorithm (QAOA). We observe that QFw over NWQ-Sim marginally improves Qiskit-aer’s accuracy in reaching the lowest energy state. These additions to QFw prepare it to run hybrid applications in a hybrid resource environment since it treats actual quantum hardware and simulators alike.

Chundury, Srikar↗
DOE OSTI2025

Designing a Framework for Solving Multiobjective Simulation Optimization Problems

Multiobjective simulation optimization (MOSO) problems are optimization problems with multiple conflicting objectives, where evaluation of at least one of the objectives depends on a black-box numerical code or real-world experiment, which we refer to as a simulation. Whereas an extensive body of research is dedicated to developing new algorithms and methods for solving these and related problems, it is challenging and time-consuming to integrate these techniques into real-world production-ready solvers. This is partly because of the diversity and complexity of modern state-of-the-art MOSO algorithms and methods and partly because of the complexity and specificity of many real-world problems and their corresponding computing environments. The complexity of this problem is only compounded when introducing potentially complex and/or domain-specific surrogate-modeling techniques, problem formulations, design spaces, and data acquisition functions. Here, this paper carefully surveys the current state of the art in MOSO algorithms, techniques, and solvers, as well as problem types and computational environments where MOSO is commonly applied. We then present several key challenges in the design of a parallel multiobjective simulation optimization framework (ParMOO) and how they have been addressed. Finally, we provide two case studies demonstrating how customized ParMOO solvers can be quickly built and deployed to solve real-world MOSO problems.

engineering design optimization↗