Search NASA⌕ Search

SEARCH · Search NASA

Results for “problem solving complexity”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

A New Semistructured Algebraic Multigrid Method

Multigrid methods are well suited to large massively parallel computer architectures because they are mathematically optimal and display good parallelization properties. Since current architecture trends are favoring regular compute patterns to achieve high performance, the ability to express structure has become much more important. The hypre software library provides high-performance multigrid preconditioners and solvers through conceptual interfaces, including a semistructured interface that describes matrices primarily in terms of stencils and logically structured grids. This paper presents a new semistructured algebraic multigrid (SSAMG) method built on this interface. The numerical convergence and performance of a CPU implementation of this method are evaluated for a set of semistructured problems. In conclusion, SSAMG achieves significantly better setup times than hypre’s unstructured AMG solvers and comparable convergence. In addition, the new method is capable of solving more complex problems than hypre’s structured solvers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Red-QAOA: Efficient Variational Optimization through Circuit Reduction

The Quantum Approximate Optimization Algorithm (QAOA) provides a quantum solution for combinatorial optimization problems. However, the optimal parameter searching process of QAOA is greatly affected by noise, leading to non-optimal solutions. This paper introduces a novel approach to optimize QAOA by exploiting the energy landscape concentration of similar instances via graph reduction, thus addressing the effect of noise. We formalize the notion of similar instances in QAOA and develop a Simulated Annealing-based graph reduction algorithm, called Red-QAOA, to identify the most similar subgraph for efficient parameter optimization. Red-QAOA outperforms state-of-the-art Graph Neural Network (GNN) based graph pooling techniques in performance and demonstrates effectiveness on a diverse set of real-world optimization problems encompassing 3200 graphs. Red-QAOA reduced the node counts and edge counts by 28% and 37%, respectively, while maintaining a low mean square error of 2%. These enable the identification of an optimal parameter set that is closer to the ideal true optimal solution in the presence of noise. By substantially streamlining the search for QAOA parameters, our approach sets the stage for the practical application of quantum algorithms in solving complex optimization problems.

Wang, Meng↗
DOE OSTI2021

From NWChem to NWChemEx: Evolving with the Computational Chemistry Landscape

Since the advent of the first computers, chemists have been at the forefront of using computers to understand and solve complex chemical problems. As the hardware and software have evolved, so have the theoretical and computational chemistry methods and algorithms. Parallel computers clearly changed the common computing paradigm in the late 1970s and 80s, and the field has again seen a paradigm shift with the advent of graphical processing units. This review explores the challenges and some of the solutions in transforming software from the terascale to the petascale and now to the upcoming exascale computers. While discussing the field in general, NWChem and its redesign, NWChemEx, will be highlighted as one of the early codesign projects to take advantage of massively parallel computers and emerging software standards to enable large scientific challenges to be tackled.

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

Freely scalable and reconfigurable optical hardware for deep learning

Abstract As deep neural network (DNN) models grow ever-larger, they can achieve higher accuracy and solve more complex problems. This trend has been enabled by an increase in available compute power; however, efforts to continue to scale electronic processors are impeded by the costs of communication, thermal management, power delivery and clocking. To improve scalability, we propose a digital optical neural network (DONN) with intralayer optical interconnects and reconfigurable input values. The path-length-independence of optical energy consumption enables information locality between a transmitter and a large number of arbitrarily arranged receivers, which allows greater flexibility in architecture design to circumvent scaling limitations. In a proof-of-concept experiment, we demonstrate optical multicast in the classification of 500 MNIST images with a 3-layer, fully-connected network. We also analyze the energy consumption of the DONN and find that digital optical data transfer is beneficial over electronics when the spacing of computational units is on the order of $$>10\,\upmu $$ > 10 μ m.

42 ENGINEERING↗
DOE OSTI2026

A mathematical framework for thermodynamic computing with applications to chemical reaction networks

The widespread adoption of energy-intensive computing applications has led to a growing need for energy-efficient computing approaches. Thermodynamic computing offers a promising approach for low-energy computation by leveraging the intrinsic computational capabilities of physical, chemical, or biological systems. However, the mathematical foundations of thermodynamic computing require further development to fully realize the potential energy efficiencies, as well as to assess factors like noise and operational speed. In this paper, we establish a mathematical framework for utilizing thermodynamic processes to perform fundamental operations, including addition, subtraction, multiplication, and division. We highlight the use of chemical reactions as potential computational units and explore synthetic chemical and biochemical systems as practical implementations. Additionally, we demonstrate how these principles can be applied to solving complex mathematical problems, such as ordinary differential equations (ODEs) and suggest the necessary components to implement the thermodynamic computing framework using chemical reactions based in a microfluidic device. This work enhances our understanding of thermodynamic processes for natural computing as a basis for scalable, energy-efficient computation in paradigm disruptive next-generation systems.

Cannon, William R. [Pacific Northwest National Lab↗
DOE OSTI2025

Automated Hybrid Variance Reduction on Advanced Architectures in the Shift Monte Carlo Code

Monte Carlo transport methods are the most accurate schemes for solving problems with complex energy and spatial features, but they come with a high computational cost. Although hybrid methods have enabled the use of Monte Carlo transport for a large class of problems, they still require significant computing resources. Modern multicore CPUs with large numbers of compute cores and graphical processing units (GPUs) provide opportunities to optimize the memory and run-time costs of hybrid Monte Carlo methods. This paper documents the development and analysis of three Monte Carlo transport algorithms that support hybrid transport using the consistent adjoint-driven importance sampling (CADIS) and forward-weighted CADIS methods in the Shift Monte Carlo code: history-based transport using static and dynamic threading on multicore CPUs and event-based transport enabling weight window tracking on GPUs. The results are shown for two challenging hybrid problems on the Frontier supercomputer at the Oak Ridge Leadership Computing Facility. The results show that all three methods yield good performance and enable solutions of difficult fixed-source transport problems in less than 2 min on 20 nodes of Frontier. Dynamic threading was observed to give up to 20% better scaling behavior than static threading. Moreover, the AMD Instinct 250X GPU was found to give 9 to 11 times greater throughput per graphics compute die than the best CPU performance. In conclusion, additional opportunities for optimization of hybrid transport on GPUs are discussed.

Denovo↗
DOE OSTI2022

Design of detectors at the electron ion collider with artificial intelligence

Abstract Artificial Intelligence (AI) for design is a relatively new but active area of research across many disciplines. Surprisingly when it comes to designing detectors with AI this is an area at its infancy. The electron ion collider is the ultimate machine to study the strong force. The EIC is a large-scale experiment with an integrated detector that extends for about ±35 meters to include the central, far-forward, and far-backward regions. The design of the central detector is made by multiple sub-detectors, each in principle characterized by a multidimensional design space and multiple design criteria also called objectives. Simulations with Geant4 are typically compute intensive, and the optimization of the detector design may include non-differentiable terms as well as noisy objectives. In this context, AI can offer state of the art solutions to solve complex combinatorial problems in an efficient way. In particular, one of the proto-collaborations, ECCE, has explored during the detector proposal the possibility of using multi-objective optimization to design the tracking system of the EIC detector. This document provides an overview of these techniques and recent progress made during the EIC detector proposal. Future high energy nuclear physics experiments can leverage AI-based strategies to design more efficient detectors by optimizing their performance driven by physics criteria and minimizing costs for their realization.

Instruments & Instrumentation↗
DOE OSTI2020

MARBLE: A Multi-GPU Aware Job Scheduler for Deep Learning on HPC Systems

Deep learning (DL) has become a key tool for solving complex scientific problems. However, managing the multi-dimensional large-scale data associated with DL, especially atop extant multiple graphics processing units (GPUs) in modern supercomputers poses significant challenges. Moreover, the latest high-performance computing (HPC) architectures bring different performance trends in training throughput compared to the existing studies. Existing DL optimizations such as larger batch size and GPU locality-aware scheduling have little effect on improving DL training throughput performance due to fast CPU-to-GPU connections. Additionally, DL training on multiple GPUs scales sublinearly. Thus, simply adding more GPUs to a system is ineffective. To this end, we design MARBLE, a first-of-its-kind job scheduler, which considers the non-linear scalability of GPUs at the intra-node level to schedule an appropriate number of GPUs per node for a job. By sharing the GPU resources on a node with multiple DL jobs, MARBLE avoids low GPU utilization in current multi-GPU DL training on HPC systems. Our comprehensive evaluation in the Summit supercomputer shows that MARBLE is able to improve DL training performance by up to 48.3% compared to the popular Platform Load Sharing Facility (LSF) scheduler. Compared to the state-of-the-art of DL scheduler, Optimus, MARBLE reduces the job completion time by up to 47%.

Han, Jingoo↗
DOE OSTI2025

AdditiveFOAM: A Continuum Multiphysics Code for Additive Manufacturing

AdditiveFOAM is a computational framework that simulates transport phenomena in Additive Manufacturing (AM) processes. It is built on OpenFOAM (Weller et al., 1998), the leading free, open-source software package for computational fluid dynamics (CFD). OpenFOAM offers an extensible platform for solving complex multiphysics problems using state-of-the-art finite volume methods. AdditiveFOAM leverages these capabilities to develop specialized tools aimed at addressing challenges in AM processing. Metal additive manufacturing, also known as metal 3D printing, is an advanced manufacturing technique that creates physical parts from a three-dimensional (3D) digital model by melting metal powder or wire feedstock. A significant area of research in metal AM focuses on process planning to mitigate anomalous features during printing that are deleterious to part performance (e.g., porosity and cracking), as well as controlling localized microstructure and material properties. Given the high costs and substantial time requirements associated with experimental methods for qualifying new materials and processes, there is a compelling incentive for researchers to utilize advanced computational simulations. In this context, AdditiveFOAM offers a simulation framework to better understand undesirable features in printing, thereby enhancing process planning and reducing the reliance on labor-intensive experimental campaigns.

Coleman, John [Oak Ridge National Laboratory (ORNL↗
DOE OSTI2023

Development of a Web-Based Graphical User Interface for Fermilab Robots

This project provides the students/faculty team with the unique opportunity to work with several robots. Additionally, the student team will be able to learn from the experience of the Robotics Initiative members who have a wide variety of technical backgrounds outside of software development. Working with an interdisciplinary group to solve a complex problem that is unique to our facility, is a valuable experience that the lab can provide. This project aligns with the ACORN projects R&D efforts regarding the integration of robotics status/control with the accelerator control system.

43 PARTICLE ACCELERATORS↗
DOE OSTI2023

New Tables for Infrasound Event Catalogs with a Focus on Machine Learning

Natural and anthropogenic sources such as volcanoes, earthquakes, auroral processes, chemical and nuclear explosions, rocket launches, and aircraft can generate infrasound, sound with frequencies less than 20 Hz. Both the availability of infrasound data and interest in machine learning (ML) applications have grown in recent years. Large, open-source datasets are essential to solving complex ML problems, but the field of infrasound is lacking in this arena. To increase the utility of ML for infrasound, here we present new tables for infrasound event catalogs. It is the aim that these tables be incorporated into both existing and future infrasound processing pipelines to generate large datasets ripe for use with ML/DL methods.

47 OTHER INSTRUMENTATION↗
DOE OSTI2025

Multiphysics Modeling of Microreactors with NEAMS codes, and Validation Based on KRUSTY Reactivity Insertion

The NEAMS Multiphysics Applications team continues to assess code usability and functionality for microreactor design and safety analyses, while demonstrating that NEAMS tools capture both steady-state and transient behavior across distinct microreactor concepts. In FY2025, the team advanced full-core, high-fidelity, multiphysics models that solve more complex problems and strengthen verification/validation for several microreactor systems: heat-pipe microreactor (HPMR), gas-cooled microreactor (GCMR), and the KRUSTY experiment. These models employ the MOOSE MultiApp/Transfers architecture with Griffin for neutronics, BISON for heat conduction/thermomechanics, Sockeye for heat pipes, SAM/THM for coolant channels and loops, and SWIFT for hydride behavior, with meshes generated via the MOOSE Reactor Module. The graphite models available in the Grizzly code were also investigated for future analyses. For the HPMR, a Na-HPMR variant was constructed to align with recently validated heat-pipe experiments and Sockeye’s LCVF capability, enabling mechanistic heat-pipe transients and startup modeling. The Na-HPMR will serve as the primary model for HPMR investigations in upcoming tasks. The load-following and single heat-pipe failure scenarios (Griffin/BISON/Sockeye), which were previously modeled for the K-HPMR, were replicated for the Na-HPMR, showing strong negative temperature feedback and highly localized thermal effects, respectively, while the startup case captured vapor-front progression and heat-removal activation. Solid mechanics was added to the previously built K-HPMR full-core model in BISON, showing minimal impact on steady-state reactivity yet enabling stress-field predictions that prepare the path for full-core TRISO performance analyses. For the GCMR, automated steady-state and four transient scenarios were executed using Griffin/BISON/SAM/SWIFT. Results confirm robust inherent safety: power collapses promptly in loss-of-cooling events, the inlet-temperature drop settles to a new equilibrium, and a single-channel blockage yields only a ~30 K local fuel-temperature rise with <0.4% power decrease. SWIFT-predicted hydrogen redistribution affects reactivity during both steady-state and transient conditions, underscoring its importance. A Brayton-cycle balance of plant (BOP) model in SAM/THM demonstrated stable startup behavior, and xenon-driven reactivity during load following was analyzed. To improve TRISO-compact temperature fidelity, a fast multiscale Heat Source Decomposition (HSD) treatment was implemented. Against heterogeneous benchmarks, HSD reduces underprediction of kernel temperatures and lowers predicted peak powers in reactivity-insertion transients compared to previous homogenized models. KRUSTY warm-critical validation progressed from FY2024 baselines: the 15Ȼ insertion shows excellent agreement in peak power (~2% high) and temperature trends, and the 30Ȼ case was automated via a feedback controller that maintained power near 3 kW for ~150 s with close agreement to data. The successful modeling of the warm critical tests has laid a strong foundation for simulating more complex nuclear system tests in the years ahead. Throughout FY2025, developer feedback was provided (e.g., MOOSE batch mesh generation, distributed pre-split meshes, Griffin sweeper on displaced meshes), several new models were contributed to the Virtual Test Bed, and an OECD-NEA WPRS multiphysics benchmark based on the HPMR was initiated to enable broader cross-comparison and best-practice development with the nuclear community at large.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2025

Building a quantum computing architecture using 3D superconducting cavities

Quantum computers promise advantages over classical machines for solving certain complex problems, but building processors that truly deliver this advantage remains a central challenge, particularly due to limited coherence times. Three-dimensional superconducting radio-frequency (SRF) cavities offer an attractive platform due to their exceptionally long lifetimes. However, since these harmonic systems require nonlinear elements, such as transmons, for control, additional losses are often introduced. In this talk, I will present a multimode quantum system based on an elliptical SRF cavity hosting two cavity modes weakly coupled to an ancillary transmon circuit. This architecture is carefully engineered to preserve coherence while enabling efficient control. By optimizing the design to mitigate transmon-induced decoherence, we realize single-photon lifetimes of 20.6 ms and 15.6 ms in the two modes, with pure dephasing times exceeding 40 ms. Using sideband interactions and error-resilient protocols, such as measurement-based correction and post-selection, we demonstrate high-fidelity state control, including preparation of Fock states up to N=20 with fidelities above 95% (to our knowledge, the highest reported to date), as well as high-fidelity two-mode entanglement. These results highlight 3D SRF cavities as a robust foundation for qudit-based quantum information processing, harnessing the large Hilbert space of cavity modes. I will conclude by outlining strategies to further enhance coherence in both cavities and ancilla qubits, and discuss pathways toward scaling this architecture into a larger quantum computing platform.

Roy, Tanay [Fermilab]↗
DOE OSTI2025

Graph decomposition techniques for solving combinatorial optimization problems with variational quantum algorithms

The quantum approximate optimization algorithm (QAOA) has the potential to approximately solve complex combinatorial optimization problems in polynomial time. However, current noisy quantum devices cannot solve large problems due to hardware constraints. In this work, we develop an algorithm that decomposes the QAOA input problem graph into a smaller problem and solves MaxCut using QAOA on the reduced graph. The algorithm requires a subroutine that can be classical or quantum—in this work, we implement the algorithm twice on each graph. One implementation uses the classical solver Gurobi in the subroutine and the other uses QAOA. We solve these reduced problems with QAOA. On average, the reduced problems require only approximately 1/10 of the number of vertices than the original MaxCut instances. Furthermore, the average approximation ratio of the original MaxCut problems is 0.75, while the approximation ratios of the decomposed graphs are on average of 0.96 for both Gurobi and QAOA. With this decomposition, we are able to measure optimal solutions for ten 100-vertex graphs by running single-layer QAOA circuits on the Quantinuum trapped-ion quantum computer H1-1, sampling each circuit only 500 times. This approach is best suited for sparse, particularly k-regular graphs, as k-regular graphs on n vertices can be decomposed into a graph with at most $\frac{nk}{k+1}$ vertices in polynomial time. Further reductions can be obtained with a potential trade-off in computational time. In conclusion, while this paper applies the decomposition method to the MaxCut problem, it can be applied to more general classes of combinatorial optimization problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Efficient numerical methods to solve sparse linear equations with application to PageRank

Over the last two decades, the PageRank problem has received increased interest from the academic community as an efficient tool to estimate web-page importance in information retrieval. Despite numerous developments, the design of efficient optimization algorithms for the PageRank problem is still a challenge. Here, we propose three new algorithms with a linear time complexity for solving the problem over a bounded-degree graph. The idea behind them is to set up the PageRank as a convex minimization problem over a unit simplex, and then solve it using iterative methods with small iteration complexity. Our theoretical results are supported by an extensive empirical justification using real-world and simulated data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Quantum Distributed Unit Commitment: An Application in Microgrids

The dawn of quantum computing brings on a revolution in the way combinatorially complex power system problems such as Unit Commitment are solved. The Unit Commitment problem complexity is expected to increase in the future because of the trend toward the increase of penetration of intermittent renewables. Even though quantum computing has proven effective for solving a host of problems, its applications for power systems’ problems have been rather limited. Here, in this paper, a quantum unit commitment is innovatively formulated and the quantum version of the decomposition and coordination alternate direction method of multipliers (ADMM) is established. The above is achieved by devising quantum algorithms and by exploiting the superposition and entanglement of quantum bits (qubits) for solving subproblems, which are then coordinated through ADMM to obtain feasible solutions. The main contributions of this paper include: 1) the innovative development of a quantum model for Unit Commitment; 2) development of decomposition and coordination-supported framework which paves the way for the utilization of limited quantum resources to potentially solve the large-scale discrete optimization problems; 3) devising the novel quantum distributed unit commitment (QDUC) to solve the problem in a larger scale than currently available quantum computers are capable of solving. The QDUC results are compared with those from its classical counterpart, which validate the efficacy of quantum computing.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Using machine learning to jointly harness the strength of microscopic, fundamental-science driven and macroscopic, application-driven experiments

The PARADIGM project aims at accelerating progress in science by quantitatively answering the following question: What is the optimal combination of fundamental-science and application driven experiments to maximally reduce pertinent data uncertainties? Hence, we are bridging between microscopic experiments and data, and macroscopic simulations and experiments. Answering this question entails solving a high-dimensional and complex optimization problem which we solve with machine learning techniques.

LANSCE↗
DOE OSTI2020

Restoring Distribution System Under Renewable Uncertainty Using Reinforcement Learning

Distributed energy resources (DERs) in distribution systems, including renewable generation, micro-turbine, and energy storage, can be used to restore critical loads following extreme events to increase grid resiliency. However, properly coordinating multiple DERs in the system for multi-step restoration process under renewable uncertainty and fuel availability is a complicated sequential optimal control problem. Due to its capability to handle system non-linearity and uncertainty, reinforcement learning (RL) stands out as a potentially powerful candidate in solving complex sequential control problems. Moreover, the offline training of RL provides excellent action readiness during online operation, making it suitable to problems such as load restoration, where in-time, correct and coordinated actions are needed. In this study, a distribution system prioritized load restoration based on a simplified single-bus system is studied: with imperfect renewable generation forecast, the performance of an RL controller is compared with that of a deterministic model predictive control (MPC). Our experiment results show that the RL controller is able to learn from experience, adapt to the imperfect forecast information and provide a more reliable restoration process when compared with the baseline controller.

61 RADIATION PROTECTION AND DOSIMETRY↗