Search NASA⌕ Search

SEARCH · Search NASA

Results for “Algorithm Development”

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 235 records · Page 13

Randomized Federated Learning Methods for Nonsmooth, Nonconvex, and Hierarchical Optimization (Final Technical Report)

This final technical report summarizes the outcomes of a DOE-funded project on federated scientific machine learning (FL) under nonsmooth, nonconvex, and hierarchical optimization settings. The project develops new mathematical models, algorithms, and theoretical guarantees for decentralized stochastic, bilevel, and minimax optimization problems arising in DOE mission-relevant applications. A unified framework of randomized and zeroth-order federated optimization methods is introduced, providing provable convergence, communication efficiency, and sample-complexity guarantees. The report documents algorithmic design, theoretical analysis, and empirical validation of the proposed federated learning methods. The project also contributes to workforce development through graduate training and dissemination of results via publications and seminars.

97 MATHEMATICS AND COMPUTING↗

Generalized Cycle Benchmarking Algorithm for Characterizing Midcircuit Measurements

Midcircuit measurements (MCMs) are crucial ingredients in the development of fault-tolerant quantum computation. While there have been rapid experimental progresses in realizing MCMs, a systematic method for characterizing noisy MCMs is still under exploration. In this work, we develop a cycle benchmarking (CB)-type algorithm to characterize noisy MCMs. The key idea is to use a joint Fourier transform on the classical and quantum registers and then estimate parameters in the Fourier space, analogous to Pauli fidelities used in CB-type algorithms for characterizing the Pauli-noise channel of Clifford gates. Furthermore, we develop a theory of the noise learnability of MCMs, which determines what information can be learned about the noise model (in the presence of state preparation and terminating measurement noise) and what cannot, which shows that all learnable information can be learned using our algorithm. As an application, we show how to use the learned information to test the independence between measurement noise and state-preparation noise in an MCM. Finally, we conduct numerical simulations to illustrate the practical applicability of the algorithm. Similar to other CB-type algorithms, we expect the algorithm to provide a useful toolkit that is of experimental interest. Published by the American Physical Society 2025

Zhang, Zhihan (ORCID:0009000862907691)↗

Field-based AFDD for refrigerant undercharge in residential HVAC systems: enhancing reliability through false alarm mitigation

This study evaluated rule-based and machine learning (ML) based automated fault detection and diagnostics (AFDD) algorithms for detecting refrigerant undercharge faults in residential heating, ventilation, and air conditioning (HVAC) systems, using actual building data and a minimal set of features. The ML-based algorithms included Decision Tree (DT) and K-Nearest Neighbors (KNN). Both the rule-based and ML-based algorithms demonstrated the capability to detect refrigerant undercharge faults of -30% or more. Both types of algorithms exhibited false alarms before the implementation of a false alarm mitigation algorithm, which motivated the development of such a mitigation strategy. After applying the mitigation, false alarms were substantially reduced, with the rule-based algorithm decreasing to 0.6% and the ML-based algorithms reaching 0%, while maintaining strong detection performance. Although the rule-based algorithm initially showed lower performance compared to the ML-based algorithms, its detection accuracy improved after mitigation to a level comparable to the ML-based algorithms. These results confirm that combining false alarm mitigation with both rule-based and ML-based AFDD algorithms significantly enhances practical reliability while preserving robust fault detection capabilities. Furthermore, the findings demonstrate the potential for field deployment of these algorithms in residential HVAC systems and highlight the importance of minimizing false alarms.

False Alarm↗

Randomized Adiabatic Quantum Linear Solver Algorithm with Optimal Complexity Scaling and Detailed Running Costs

Solving linear systems of equations is a fundamental problem with a wide variety of applications across many fields of science, and there is increasing effort to develop quantum linear solver algorithms. Subaşı et al. [Phys. Rev. Lett. 122, 060504 (2019)] proposed a randomized algorithm inspired by adiabatic quantum computing, based on a sequence of random Hamiltonian simulation steps, with suboptimal scaling in the condition number 𝜅 of the linear system and the target error 𝜖. Here we go beyond these results in several ways. Firstly, using filtering [Lin and Tong, Quantum 4, 361 (2020)] and Poissonization techniques [Cunningham and Roland, ArXiv:2406.03972 (2024)], the algorithm complexity is improved to the optimal scaling 𝑂⁡(𝜅⁢log (1/𝜖))—an exponential improvement in 𝜖, and a shaving of a log 𝜅 scaling factor in 𝜅. Secondly, the algorithm is further modified to achieve constant factor improvements, which are vital as we progress towards hardware implementations on fault-tolerant devices. We introduce a cheaper randomized walk operator method replacing Hamiltonian simulation—which also removes the need for potentially challenging classical precomputations; randomized routines are sampled over optimized random variables; circuit constructions are improved. We obtain a closed formula rigorously upper bounding the expected number of times one needs to apply a block-encoding of the linear system matrix to output a quantum state encoding the solution to the linear system. The upper bound is 837⁢𝜅 at 𝜖 = 10 −10 for Hermitian matrices.

97 MATHEMATICS AND COMPUTING↗

Developing ML/AI Methods for High-Throughput Characterization of Multiple-Sensor Streams of Tokamak Dynamics for High-Speed Control (Final Report)

This project evaluated and developed new mathematical and algorithmic techniques capable of handling (in real-time) the growing amounts of data generated by modern fusion research. While existing numerical linear algebra (NLA) methods provide the backbone to classical data analysis and algorithms, these methods fundamentally do not port to distributed architectures nor do they allow low-latency data reduction for control. Motivated by the needs for modern fusion reactors, this project explored and implemented new numerical methods to characterize plasma dynamics, respond in real-time to discharge evolution, and to process massive-scale data accurately and rapidly more fully. This project links expertise in multiple-sensor diagnostics of tokamak plasma dynamics from Columbia University’s Plasma Physics Laboratory with expertise in massive-scale data reduction and extreme data control algorithms at Columbia University’s Data Science Institute. This interdisciplinary project (i) applied machine learning methods, (ii) implemented a properly-trained neural-network for very fast processing of high-speed plasma videography, and (ii) developed the applied mathematical methods, based on randomized-NLA (rNLA) routines, for data analysis, reduction, and real-time control. The Columbia University High Beta Tokamak-Extended Pulse (HBT-EP) facility provided data to test new algorithms and partnership with Columbia University's Data Sciences Institute evaluated the broader use of new algorithms for many challenging control applications.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Standard Library Plant Controller Model Specification for a Grid-Forming Hybrid Control Inverter-Based Resource (REPCGFM_C1)

This document describes a standard library plant controller model to interface with the grid-forming hybrid control inverter-based resource (IBR) model. The initial version of model specification was jointly developed by Pacific Northwest National Laboratory (PNNL), Tesla Energy, and EPRI, and it was revised multiple times later to incorporate suggestions from WECC MVS members. Tesla Energy provided main control algorithms to support the development of this model specification. This standard library model is developed to help the utility industry better understand the GFM technology. The model could be used to represent equipment for long-term planning studies where vendor-specific models are not available. As equipment matures and improves, standard library models will be updated to capture the new functionalities of GFMs. It is not intended that these models will always remain representative of all future GFM technologies.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Complete development of LAROMance-type surrogate models for Zircaloy, as well as initial integration and testing in MOOSE, which addresses industry needs for licensing advanced LWR fuels

This milestone report details the progress in the constitutive surrogate modeling framework for Zircaloy’s mechanical behavior under extreme conditions, within the NEAMS program throughout the U.S. fiscal year 2024 (FY24). The presented work expands on the spectral based mechanical solver and the mechanistic material model for Zircaloy, which were introduced in the NEAMS program during FY22 and detailed in the previous fiscal year (FY23). As part of the NEAMS program, the current effort described in this report focused on the development of a novel viscplastic (creep) surrogate for the mechanistic, polycrystal-based model. To this end, the work was subdivided into two interdependent components related to the necessary improvements to the LApx constitutive model and algorithm and, to the development and use of a surrogate model.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

The Blending ToolKit: A simulation framework for evaluation of galaxy detection and deblending

We present an open source Python library for simulating overlapping (i.e., blended) images of galaxies and performing self-consistent comparisons of detection and deblending algorithms based on a suite of metrics. The package, named Blending Toolkit (BTK), serves as a modular, flexible, easy-to-install, and simple-to-use interface for exploring and analyzing systematic effects related to blended galaxies in cosmological surveys such as the Vera Rubin Observatory Legacy Survey of Space and Time (LSST). BTK has three main components: (1) a set of modules that perform fast image simulations of blended galaxies, using the open source image simulation package GalSim; (2) a module that standardizes the inputs and outputs of existing deblending algorithms; (3) a library of deblending metrics commonly defined in the galaxy deblending literature. In combination, these modules allow researchers to explore the impacts of galaxy blending in cosmological surveys. Additionally, BTK provides researchers who are developing a new deblending algorithm a framework to evaluate algorithm performance and make principled comparisons with existing deblenders. BTK includes a suite of tutorials and comprehensive documentation. The source code is publicly available on GitHub at https://github.com/LSSTDESC/BlendingToolKit.

79 ASTRONOMY AND ASTROPHYSICS↗

Active Learning for Metamaterial Optimization on HPC and QC Integrated Systems

Active learning algorithms, integrating machine learning, quantum computing and optics simulation in an iterative loop, offer a promising approach to optimizing metamaterials. However, these algorithms can face difficulties in optimizing highly complex structures due to computational limitations. High-performance computing (HPC) and quantum computing (QC) integrated systems can address these issues by enabling parallel computing. In this study, we develop an active learning algorithm working on HPC-QC integrated systems. We evaluate the performance of optimization processes within active learning (i.e., training a machine learning model, problem-solving with quantum computing, and evaluating optical properties through wave-optics simulation) for highly complex metamaterial cases. Our results showcase that utilizing multiple cores on the integrated system can significantly reduce computational time, thereby enhancing the efficiency of optimization processes. Therefore, we expect that leveraging HPC-QC integrated systems helps effectively tackle large-scale optimization challenges in general.

Kim, Seongmin↗

Gains in operational flexibility, safety margins, and cost efficiencies via integrated Plant Reload Optimization platform

The U.S. Department of Energy Light Water Reactor Sustainability Program Risk-Informed Systems Analysis Pathway Plant Reload Optimization Project aims to develop an integrated, comprehensive framework offering an all-in-one solution for reload evaluations with a special focus on optimizing core design. Optimizing the fuel loading pattern is one of the most important considerations in reducing the amount of new fuel used in the core. Due to thousands of possible core configuration options, finding optimal solutions is an unachievable task for a human. The Plant ReLoad Optimization platform, which supports artificial-intelligence-based reactor core designing, is now fully capable of handling realistic problems. The Plant ReLoad Optimization platform development project aims to build a reactor core design tool that includes reactor safety and fuel performance analyses and uses artificial intelligence to support the optimization of core design solutions. The NSGA-II (Non-dominated Sorting Genetic Algorithm II) optimizer was developed and tested within RAVEN (Risk Analysis and Virtual ENvironment) to handle many constraints by using an augmented objectives methodology. The demonstration was performed with constrained multiobjective optimization of a 17 × 17 pressurized-water reactor core loading patterns to minimize fuel cost and maximize fuel cycle length.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Glass Design Using Machine Learning Property Models with Prediction Uncertainties: Nuclear Waste Glass Formulation

The United States Department of Energy is responsible for managing the legacy nuclear waste stored in underground tanks at the Hanford Site. The waste will be separately vitrified as low-activity waste and high-level waste fractions. Waste glass formulation algorithms have been traditionally developed using partial quadratic mixture property-composition models. Recently, machine learning (ML) techniques have been used to predict glass properties and discover new glass materials for nuclear waste vitrification, and these advancements can be utilized to improve waste glass composition design. In this proof-of-principle study, ML algorithms such as Gaussian process regression (GPR) were used to interpolate glass properties (e.g., viscosity, electrical conductivity, chemical durability). After selecting appropriate sets of GPR hyper-parameters for each property, an optimization program was developed to formulate glass compositions to maximize waste loading while simultaneously satisfying property within constraints. The results of the ML-based waste loadings and glass compositions were compared to those obtained using the traditional methods. Comparing to the previous glass design framework, the ML-based optimization methods offer improved glass designs and a streamlined approach to generation of optimally designed data and near real-time updates.

glass formulation, machine learning, constraints, ↗

Bringing randomized algorithms to mainstream numerical linear algebra

Numerical linear algebra (NLA) underpins huge swaths of computational science and engineering. For scientists and engineers to make the most of the DOE’s computing resources, it is essential that they have access to high-performance implementations of algorithms with best-in-class scalability and reliability. Despite this, prevailing NLA libraries have little to no support for breakthrough algorithms from the field of randomized numerical linear algebra (RandNLA) that have been developed over the past twenty years. The goal of this LDRD was to break a log-jam that had prevented broad adoption of RandNLA. Our work had two thrusts. The first was to develop RandBLAS: a trustworthy and high-performance C++ library for randomized dimension reduction (an operation widely known as sketching). The second was the development of a novel randomized algorithm for computing a challenging type of matrix decomposition known as Householder QR with column pivoting (Householder QRCP). In this one-year late-start LDRD we successfully delivered RandBLAS 1.0 and new CPU and GPU codes for Householder QRCP. RandBLAS has extensive documentation at https://randblas.readthedocs.io/en/stable/. Papers on RandBLAS and and our high-performance QRCP codes are forthcoming.

97 MATHEMATICS AND COMPUTING↗

From Data to Insights: A Covariate Analysis of the IARPA BRIAR Dataset for Multimodal Biometric Recognition Algorithms at Altitude and Range

This paper examines covariate effects on fused whole body biometrics performance in the IARPA BRIAR dataset, specifically focusing on UAV platforms, elevated positions, and distances up to 1000 meters. The dataset includes outdoor videos compared with indoor images and controlled gait recordings. Normalized raw fusion scores relate directly to predicted false accept rates (FAR), offering an intuitive means for interpreting model results. A linear model is developed to predict biometric algorithm scores, analyzing their performance to identify the most influential covariates on accuracy at altitude and range. Weather factors like temperature, wind speed, solar loading, and turbulence are also investigated in this analysis. The study found that resolution and camera distance best predicted accuracy and findings can guide future research and development efforts in long-range/elevated/UAV biometrics and support the creation of more reliable and robust systems for national security and other critical domains.

Bolme, David↗

Rapid, antibiotic incubation-free determination of tuberculosis drug resistance using machine learning and Raman spectroscopy

Tuberculosis (TB) is the world’s deadliest infectious disease, with over 1.5 million deaths and 10 million new cases reported anually. The causative organism Mycobacterium tuberculosis (Mtb) can take nearly 40 d to culture, a required step to determine the pathogen’s antibiotic susceptibility. Both rapid identification and rapid antibiotic susceptibility testing of Mtb are essential for effective patient treatment and combating antimicrobial resistance. Here, we demonstrate a rapid, culture-free, and antibiotic incubation-free drug susceptibility test for TB using Raman spectroscopy and machine learning. We collect few-to-single-cell Raman spectra from over 25,000 cells of the Mtb complex strain Bacillus Calmette-Guérin (BCG) resistant to one of the four mainstay anti-TB drugs, isoniazid, rifampicin, moxifloxacin, and amikacin, as well as a pan-susceptible wildtype strain. By training a neural network on this data, we classify the antibiotic resistance profile of each strain, both on dried samples and on patient sputum samples. On dried samples, we achieve >98% resistant versus susceptible classification accuracy across all five BCG strains. In patient sputum samples, we achieve ~79% average classification accuracy. We develop a feature recognition algorithm in order to verify that our machine learning model is using biologically relevant spectral features to assess the resistance profiles of our mycobacterial strains. Finally, we demonstrate how this approach can be deployed in resource-limited settings by developing a low-cost, portable Raman microscope that costs <$5,000. We show how this instrument and our machine learning model enable combined microscopy and spectroscopy for accurate few-to-single-cell drug susceptibility testing of BCG.

60 APPLIED LIFE SCIENCES↗

Multi-track reconstruction algorithms in the Mu2e experiment

The Mu2e experiment, under construction at Fermilab, will search for the neutrino-less coherent µ−N → e−N conversion in the field of a 27 Al nucleus, a CLFV process. While the main goal of the experiment is to reconstruct the conversion electron, i.e., an event with a single track, there are motivations to develop an efficient tracking algorithm for reconstructing more simultaneous tracks. This could better constrain the background generated by p¯-annihilation in the Al target and search for Beyond the Standard Model processes. In this paper, we present the algorithms designed to reconstruct multi-particle events.

Ricci, Alessandro Maria [Pisa U.; INFN, Pisa] (ORC↗

Cyber‐Resilient Distributed Energy Resource Control Algorithms for Smart Distribution Grids

ABSTRACT This paper focuses on the development of cyber‐resilient gradient‐based optimisation algorithms and theoretical proof for grid‐interactive distributed energy resource (DER) control to enable two grid services of virtual power plants (VPPs) dispatch and grid voltage regulation, considering the communication and security impacts. Firstly, the combined DER dispatch and voltage regulation as a real‐time gradient‐based optimisation problem is recapped. Thereafter, we consider a probabilistic traffic model to characterise packet delays and loss in a communication network, and study how the delays enter the process of information exchange among the grid measurement units, local DER controllers and the grid control centre that execute this control algorithm in a coordinated manner. Then, a strategy combining delay thresholds and message update rules is proposed to immunity the asynchrony resulting from the communications traffic and it avoids possible numerical instabilities and sensitivities of the power tracking and voltage regulation capabilities, resulting as cyber‐resilient DER control algorithms. Additionally, their convergence is theoretically proved. Effectiveness of proposed cyber‐resilient algorithms has been validated on the IEEE 37‐bus system in terms of convergence, VPP tracking and voltage regulation performance for smart distribution systems with high penetration of DERs.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Towards Sustainable Post-Exascale Leadership Computing

As computing systems approach the limits of traditional silicon technology, the diminishing returns in performance per watt present a significant barrier to sustaining growth in HPC. From a large-scale scientific supercomputing facility point of view, we propose a multifaceted strategy toward specialized hardware and architectures that are optimized for energy efficiency in specific applications. We also emphasize the need for integrating energy-aware practices across all levels of HPC, from system design and software development to operational policies. We discuss strategic opportunities such as the adoption of application-specific accelerators, the development of energy-efficient algorithms, and the implementation of data-driven operational analytics. Our goal is to develop a comprehensive roadmap ensuring that future leadership systems at OLCF can meet scientific demands while operating within stringent energy budgets, thereby supporting sustainable computing growth.

Shin, Woong↗

A multi-algorithm approach for modeling coastal wetland eco-geomorphology

Coastal wetlands play an important role in the global water and biogeochemical cycles. Climate change makes it more difficult for these ecosystems to adapt to the fluctuation in sea levels and other environmental changes. Given the importance of eco-geomorphological processes for coastal wetland resilience, many eco-geomorphology models differing in complexity and numerical schemes have been developed in recent decades. However, their divergent estimates of the response of coastal wetlands to climate change indicate that substantial structural uncertainties exist in these models. To investigate the structural uncertainty of coastal wetland eco-geomorphology models, we developed a multi-algorithm model framework of eco-geomorphological processes, such as mineral accretion and organic matter accretion, within a single hydrodynamics model. The framework is designed to explore possible ways to represent coastal wetland eco-geomorphology in Earth system models and reduce the related uncertainties in global applications. We tested this model framework at three representative coastal wetland sites: two saltmarsh wetlands (Venice Lagoon and Plum Island Estuary) and a mangrove wetland (Hunter Estuary). Through the model–data comparison, we showed the importance of using a multi-algorithm ensemble approach for more robust predictions of the evolution of coastal wetlands. We also found that more observations of mineral and organic matter accretion at different elevations of coastal wetlands and evaluation of the coastal wetland models at different sites in diverse environments can help reduce the model uncertainty.

58 GEOSCIENCES↗