Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algorithms”

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 991 records · Page 55

Progress Towards an Investigation of the MiniBooNE Low Energy Excess Using Neutral-Current Delta-Like Single Photons in MicroBooNE with Wire-Cell 3D Reconstruction Algorithms

This note presents progress towards a Neutral-Current (NC) Delta-like single photon search in MicroBooNE using Wire-Cell 3D reconstruction and pattern recognition algorithms. This analysis will help address the question of the MiniBooNE Low Energy Excess (LEE) [1]. The selections are similar to the previously published Pandora-based single photon selections [2] in many ways, but here we use independent reconstruction and selection tools and examine a larger phase space (including charged pions and multiple protons). In the future, we will significantly reduce systematic uncertainties via the use of constraining sideband observations in order to statistically test specific models of the MiniBooNE LEE.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Progress towards an investigation of the MiniBooNE Low Energy Excess using neutral-current Delta-like single photons in MicroBooNE with Wire-Cell 3D reconstruction algorithms

This note presents progress towards a Neutral-Current (NC) Delta-like single photon search in MicroBooNE using Wire-Cell 3D reconstruction and pattern recognition algorithms. This analysis will help address the question of the MiniBooNE Low Energy Excess (LEE). The selections are similar to the previously published Pandora-based single photon selections in many ways, but here we use independent reconstruction and selection tools and examine a larger phase space (including charged pions and multiple protons). In the future, we will significantly reduce systematic uncertainties via the use of constraining sideband observations in order to statistically test specific models of the MiniBooNE LEE.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Decomposition and Algorithmic Approaches for Solving Large-Scale Process Family Design Problems

Our most recent work expands the water desalination case study from 76 variants to 10,897 variants using the equation-oriented model built in Pyomo as part of the PARETO project. Using the discretization formulation presented in Stinchfield (2024a), rather than solving for all 10,897 variants simultaneously, we decompose the formulation into subproblems containing subsets of variants from the process family. We solve the overall problem with Progressive Hedging (PH) deployed in parallel on a distributed HPC cluster using the open-source Python package mpi-sppy (Knueven et al., 2023). This approach allowed us to solve this process family design problem to ~1.5% relative optimality gap in about 5 hours; in comparison, Gurobi reached ~50% relative optimality gap in about 6 hours (Stinchfield et al., 2024b). However, this approach still requires discretization of the common unit module design ranges; additionally, PH acts as a heuristic for MILP’s with gap-closing capabilities. Ideally, we would not have to use ML surrogates or discretization to solve this problem, instead solving the process family design problem with the equation-oriented model directly to achieve the most accurate results. However, recall that we did not consider solving the MINLP directly due to complexity and size. In this work, we aim to decompose and solve this large-scale MINLP using a Structured Nonlinear Global Optimization algorithm presented by Cao and Zavala (2019).

Stinchfield, Georgia↗

Physics-Reinforced Machine Learning Algorithms for Multiscale Closure Model Discovery

The central objective of this project was to address the challenge of modeling and simulating complex multiscale turbulence phenomena by leveraging physics-guided machine learning (PGML) and hybrid modeling approaches. By integrating physics-based methods with data-driven models, the research focused on achieving robust and scalable solutions for geophysical turbulence, enhancing numerical weather prediction and climate research tools. The project resulted in significant advancements in computational modeling paradigms, predictive tools for reduced-order modeling, and innovative algorithms for fluid dynamics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

New Results on Communication- and Memory-Aware Load Balancing Model and Algorithms

While load balancing in distributed-memory computing has been well-studied, we present an innovative approach to this problem: a unified, reduced-order model that combines three key components to describe “work” in a distributed system: computation, communication, and memory. Our model enables an optimizer to explore complex tradeoffs in task placement, such as augmented parallelism, at the expense of data replication increasing memory usage. We propose a fully distributed, heuristic-based load balancing optimization algorithm, and demonstrate that it quickly finds close-to-optimal solutions. We formalize the complex optimization problem as a mixed-integer linear program, and compare it to our strategy. Finally, we show that when applied to an electromagnetics code, our approach obtains up to 2.3x speedups for the imbalanced execution.

97 MATHEMATICS AND COMPUTING↗

Computational Algorithms for Unit Commitment with AC Power Flows (Final Report)

Security-constrained unit commitment (SCUC) is a key component in power system operations. When AC power flow constraints are considered in the SCUC model (AC-SCUC), the problem becomes extremely difficult due to its discrete and non-convex nature, as described in “Grid Optimization Competition Challenge 3 Problem Formulation (GOCC)”. There are four main challenges: (i) Discrete decisions regarding unit online/offline status and start-up/shut-down procedures for every single unit. The number of discrete decision variables increases considerably when a system integrates multiple generators; (ii) Configuration-based combined-cycle formulations, and multi-commodity models that include ramping products, spin/non-spin products, and regulation up/down products. The combined-cycle units introduce additional discrete decision variables and auxiliary service products further complicate the model by connecting multi-commodity products’ continuous and discrete variables; (iii) SCUC models with AC power flow constraints are far more complex due to massive bilinear terms in the large-scale nonlinear power balance equations. The nonlinear power balance equations are further complicated by the discrete step control variables of shunts; (iv) N − 1 contingency analysis. The size of the model increases linearly with the number of contingencies considered, greatly increasing the size of the optimization model. Accordingly, there is an emergent need to develop a robust algorithm capable of deriving a high-quality solution in a short time and passing through contingency tests simultaneously. In this project, we explore innovative techniques to address this challenging problem by integrating advanced polyhedral theory, approximation methods, relaxation strategies, decomposition techniques, and parallel computing. Each technique approaches the problem from a different perspective, leveraging its specific strengths to tackle distinct challenges. Each individual method has demonstrated its effectiveness in the PI’s previous research. Their integration is expected to significantly reduce the computational time required to solve the proposed complex problem. Successful completion of this project has the potential to transform the industry by enhancing optimization solvers capable of handling large-scale day-ahead energy market clearing models within strict time constraints, while incorporating AC power flow constraints. This advancement will lead to reduced overall generation costs and, consequently, increased social welfare.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Energy-Efficient Adaptive Cruise Control Using Eco-Driving Algorithm

SwRI Eco-Driving Algorithm – Objectives and Method – Required Information Streams and Velocity Profile Realization ▪ Impact on Energy Consumption – Study 1 – NEXTCAR II • Individual (ego/eco) vehicle on Blanco Road, San Antonio, TX – Study 2 – DOE EEMS • Entire Urban Corridor – N High Street, Columbus, OH

Bhagdikar, Piyush↗

Automated Algorithms for Screening Electronic Parts for Aging using Power Spectra Analysis (PSA) Data

Understanding the age of semiconductor parts being built into devices and systems is of interest for manufacturing quality control. Power spectrum analysis (PSA) is a fast, non-destructive, sensitive method for examining semiconductor parts. This talk will cover the use of multivariate analysis on both PSA data and conventional current-voltage data generated prior to PSA analysis to create algorithms that can be automated to screen semiconductor parts for aging.

Multari, Rosalie A↗

Speed Optimizations for Physics Ray Trace Algorithms

Ray tracing is a process used commonly in computer graphics and in physics to track light photons and particles, respectively. Much research was found on improving execution times for the computer graphics applications; however, in the short time frame of this literary review, almost no research was found on improving the execution times for the physics applications that were relevant to this problem. Two ray trace algorithms, a STL raytrace and a conebeam raytrace, were optimized using OpenMP and CUDA.

97 MATHEMATICS AND COMPUTING↗

Fundamental Algorithmic Research for Quantum Computing (FAR-QC) (Final Technical Report)

Anticipation of the noisy intermediate‐scale quantum (NISQ) era has sparked unprecedented interest in quantum computing, yet we still lack a clear understanding of how NISQ‐era applications will perform relative to the best classical algorithms solving the same problems. The goals of this project include: (1) Developing better tools for characterizing the performance of NISQ devices and for assessing whether such devices can achieve a quantum advantage. (2) Conceiving and analyzing potential applications of quantum computing technology in the NISQ era and beyond.

97 MATHEMATICS AND COMPUTING↗

Quantum Computing Algorithms and Applications for Coherent and Strongly Correlated Chemical Systems

This project advanced quantum algorithms, quantum information theory, strongly correlated electronic structure methods, molecular quantum materials, and exciton transport imaging in coherent condensed phase systems. Across the award period, the team developed new methods for open-quantum-system simulation, Hamiltonian learning, state tomography, reduced-density-matrix and contracted-quantum eigensolver approaches, and quantum diagnostics for device capability and openness.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Reducing Randomized Quantum Algorithm Cost [Slides]

We derive the optimal sampling strategy for minimizing total resource cost in randomized quantum algorithms. Our framework is completely general, allowing for resources as diverse as gate counts circuit depth, runtime, or even dissipated energy.

97 MATHEMATICS AND COMPUTING↗

An Adaptive Optimizer for Measurement-Frugal Variational Algorithms

Variational hybrid quantum-classical algorithms (VHQCAs) have the potential to be useful in the era of near-term quantum computing. However, recently there has been concern regarding the number of measurements needed for convergence of VHQCAs. Here, we address this concern by investigating the classical optimizer in VHQCAs. We introduce a novel optimizer called individual Coupled Adaptive Number of Shots (iCANS). This adaptive optimizer frugally selects the number of measurements (i.e., number of shots) both for a given iteration and for a given partial derivative in a stochastic gradient descent. We numerically simulate the performance of iCANS for the variational quantum eigensolver and for variational quantum compiling, with and without noise. In all cases, and especially in the noisy case, iCANS tends to out-perform state-of-the-art optimizers for VHQCAs. We therefore believe this adaptive optimizer will be useful for realistic VHQCA implementations, where the number of measurements is limited.

97 MATHEMATICS AND COMPUTING↗

Quantum Algorithm for Simulating Hamiltonian Dynamics with an Off-diagonal Series Expansion

We propose an efficient quantum algorithm for simulating the dynamics of general Hamiltonian systems. Our technique is based on a power series expansion of the time-evolution operator in its off-diagonal terms. The expansion decouples the dynamics due to the diagonal component of the Hamiltonian from the dynamics generated by its off-diagonal part, which we encode using the linear combination of unitaries technique. Our method has an optimal dependence on the desired precision and, as we illustrate, generally requires considerably fewer resources than the current state-of-the-art. We provide an analysis of resource costs for several sample models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗