Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithm timings”

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 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Ride Pingo to Transit

In this project, we developed an on-demand microtransit first- and last-mile service. To integrate the service with fixed-route transit, we developed a feature called Transit Connect that prioritized riders’ on-time arrival at the transit station over other service requirements. We first prototyped service and related algorithms in a simulated environment, and then piloted the service in the city of Kent, Washington. Our algorithm incorporates request-specific hard drop-off deadlines to ensure timely arrivals for transit transfers. In the pilot, these constraints were obtained from GTFS Realtime data to accurately determine the schedule of the transit and the location of the stations. This approach introduced the ability to accept or decline new requests based on the timing of transit connections for these new requests and connection status of onboarding customers. The pilot (called “Ride Pingo to Transit”) deployed a fleet of three 14-person vans, ran from September 2021 to March 2023, and served a total of 21,329 trips. Transit Connect was offered for drop-offs at both Kent Station and the Kent Valley hub. In total, 2,844 such trips were completed. This dataset was collected from our pilot, which includes the following: - Requests: List of all trip requests, including those that were actually served and those not materialized. - Fleet: Daily vehicle service logs. - Service details: Daily vehicle stop logs (boarding and alighting). - Trip types: First mile, last mile, or point-to-point. ![pingo to transit](pingo-to-transit.jpg)

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2025

Integration of a real-time orientation measurement system for a real-time evaluator (RTE) to measure the position and orientation of crane-lifted components

Prefabrication of building components holds the potential to revolutionize the construction industry. Prefabrication consists of manufacturing building components, modules, and other elements in a factory to be shipped and installed on a construction site. Prefabricated components have been produced for various applications including precast concrete panels for new construction and exterior wall retrofits. The manufacturing process has seen much innovation in recent years; however, the installation process has seen minimal advancements. A real-time evaluator (RTE) was developed to reduce the installation cost of prefabricated components by reducing installation time, decreasing rework, and improving accuracy. The RTE uses off-the-shelf hardware and novel algorithms to assist erectors with component installation by measuring the real-time positions of connections and prefabricated components, providing installation guidance through a graphical user interface, and monitoring the accumulated installation errors. An overview of the RTE and the proposed workflow is presented. Previous on-site demonstrations provided valuable feedback from users on the potential areas for improvement of the system. One common request was real-time measurement of component orientation during lifting, a process that previously required that the component remain stationary while the laser tracker cycled through target prisms. This paper will present the incorporation and testing of a real-time orientation measurement system as it was implemented into the RTE, allowing for measurement of component orientation during movement.

Selvakumar, Balaji [ORNL]↗
DOE OSTI2024

Feedback-based quantum algorithm inspired by counterdiabatic driving

In recent quantum algorithmic developments, a feedback-based approach has shown promise for preparing quantum many-body system ground states and solving combinatorial optimization problems. This method utilizes quantum Lyapunov control to iteratively construct quantum circuits. Here, we propose a substantial enhancement by implementing a protocol that uses ideas from quantum Lyapunov control and the counterdiabatic driving protocol, a key concept from quantum adiabaticity. Our approach introduces an additional control field inspired by counterdiabatic driving. We apply our algorithm to prepare ground states in one-dimensional quantum Ising spin chains. Comprehensive simulations demonstrate a remarkable acceleration in population transfer to low-energy states within a significantly reduced time frame compared to conventional feedback-based quantum algorithms. This acceleration translates to a reduced quantum circuit depth, a critical metric for potential quantum computer implementation. We validate our algorithm on the IBM cloud computer, highlighting its efficacy in expediting quantum computations for many-body systems and combinatorial optimization problems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2025

Generative AI models for learning flow maps of stochastic dynamical systems in bounded domains

Simulating stochastic differential equations (SDEs) in bounded domains, presents significant computational challenges due to particle exit phenomena, which requires accurate modeling of interior stochastic dynamics and boundary interactions. Despite the success of machine learning-based methods in learning SDEs, existing learning methods are not applicable to SDEs in bounded domains because they cannot accurately capture the particle exit dynamics. We present a unified hybrid data-driven approach that combines a conditional diffusion model with an exit prediction neural network to capture both interior stochastic dynamics and boundary exit phenomena. Our ML model consists of two major components: a neural network that learns exit probabilities using binary cross-entropy loss with rigorous convergence guarantees, and a training-free diffusion model that generates state transitions for non-exiting particles using closed-form score functions. The two components are integrated through a probabilistic sampling algorithm that determines particle exit at each time step and generates appropriate state transitions. Here, the performance of the proposed approach is demonstrated via three test cases: a one-dimensional simplified problem for theoretical verification, a two-dimensional advection-diffusion problem in a bounded domain, and a three-dimensional problem of interest to magnetically confined fusion plasmas.

Bounded domains↗
DOE OSTI2024

Accelerating data acquisition with FPGA-based edge machine learning: a case study with LCLS-II

New scientific experiments and instruments generate vast amounts of data that need to be transferred for storage or further processing, often overwhelming traditional systems. Edge machine learning (EdgeML) addresses this challenge by integrating machine learning (ML) algorithms with edge computing, enabling real-time data processing directly at the point of data generation. EdgeML is particularly beneficial for environments where immediate decisions are required, or where bandwidth and storage are limited. In this paper, we demonstrate a high-speed configurable ML model in a fully customizable EdgeML system using a field programmable gate array (FPGA). Our demonstration focuses on an angular array of electron spectrometers, referred to as the ‘CookieBox,’ developed for the Linac Coherent Light Source II project. The EdgeML system captures 51.2 Gbps from a 6.4 GS s −1 analog to digital converter and is designed to integrate data pre-processing and ML inside an FPGA. Our implementation achieves an inference latency of 0.2 µs for the ML model, and a total latency of 0.4 µs for the complete EdgeML system, which includes pre-processing, data transmission, digitization, and ML inference. The modular design of the system allows it to be adapted for other instrumentation applications requiring low-latency data processing.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

An Entropy-Based Test and Development Framework for Uncertainty Modeling in Level-Set Visualizations

We present a simple comparative framework for testing and developing uncertainty modeling in uncertain marching cubes implementations. The selection of a model to represent the probability distribution of uncertain values directly influences the memory use, run time, and accuracy of an uncertainty visualization algorithm. We use an entropy calculation directly on ensemble data to establish an expected result and then compare the entropy from various probability models, including uniform, Gaussian, histogram, and quantile models. Our results verify that models matching the distribution of the ensemble indeed match the entropy. We further show that fewer bins in nonparametric histogram models are more effective whereas large numbers of bins in quantile models approach data accuracy.

Sisneros, Robert↗
DOE OSTI2025

Scaling the memory wall using mixed-precision - HPG-MxP on an exascale-class machine

Mixed-precision algorithms have been proposed as a way for scientific computing to benefit from some of the gains seen for AI on recent high performance computing (HPC) platforms. A few applications dominated by dense matrix operations have seen substantial speedups by utilizing low precision formats such as FP16. However, a majority of scientific simulation applications are memory bandwidth limited. Beyond preliminary studies, the practical gain from using mixed-precision algorithms on a given high-performance computing (HPC) system is largely unclear. The High Performance GMRES Mixed Precision (HPG-MxP) benchmark has been proposed to measure the useful performance of a HPC system on sparse matrix-based mixed-precision applications. In this work, we present an implementation of the HPG-MxP benchmark for an exascale system and describe our algorithm enhancements. We show for the first time a speedup of 1.6x using a combination of double- and single-precision keeping the same residual level on modern GPU-based supercomputers.

Kashi, Aditya [ORNL] (ORCID:0000000325893792)↗
DOE OSTI2026

Semi-Analytical Hierarchical Bayesian Inference of Nonlinear Model Structure in Stochastic Dynamics: Applied to Compartmental Models of Infectious Diseases

A Bayesian computational framework for parsimonious inference in stochastic nonlinear dynamical systems is presented. This framework enables the concurrent estimation of system states, time-varying parameters, time-invariant parameters, and the optimal sparsity structure of the model parameters. Because differential equation-based models are often simplified mechanistic or phenomenological representations, robust inference from noisy measurement data requires explicit treatment of model error and uncertainty. Model error and time-varying parameters can be represented as random processes, enabling inference while making minimal assumptions about the underlying sources of discrepancy and variability. Adopting stochastic differential equation representations affords the model significant flexibility, but can also render it susceptible to overfitting during statistical inversion, where the inferred model may track noise rather than the underlying signal. To alleviate the effects of overfitting and to enable the discovery of the optimal sparse representation of the time-invariant parameters, a Bayesian sparse learning algorithm is embedded within the framework. This sparse learning framework adopts an approximate hierarchical Bayesian setting defined by a series of semi-analytical expressions. The model structure inference framework is validated using a stochastic compartmental model for tracking and forecasting active cases of an infectious disease. Compartmental models describe population-level infectious disease dynamics through interactions among population fractions grouped by disease state. Mathematically, such models consist of a system of coupled ordinary differential equations. This example adopts an expressive compartmental model that includes multiple possible interactions between disease states, motivated by early uncertainty surrounding COVID-19 reinfection dynamics and their implications for long-term epidemic forecasting. The sparse learning exercise permits the inference of a priori unknown epidemiological dynamics from simulated public health data, discovering the nested compartmental model that optimizes the trade-off between average data-fit and model complexity. It is shown that inducing sparsity among the model parameters eliminates redundant interactions between compartments, equivalently revealing the optimal coupling structure between differential equations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

High-Fidelity Analysis of EV Integration on Real Utility Feeders in Colorado

Residential electric vehicle (EV) charging has the potential to alter long-held assumptions on load characteristics impacting distribution grid planning, operations, and design standards. This study identifies analysis and control methods to increase the affordability of residential EV charging both for Xcel Energy and their customers. The project also provides solutions for more reliable grid interconnection that can support a reliable utility business model prepared for increasing EV charging load in the coming years. For this project, we referenced Level 2 alternating current (AC) onboard charging profiles for various vehicle models and high-fidelity charging data collected at the experimental setup established at the EV Research Infrastructure Laboratory at the National Renewable Energy Laboratory (NREL). Next, we developed EV adoption models for 2030 and 2040 for the Boulder and Aurora regions in Colorado. Moreover, we evaluated different smart charging control algorithms and compared their performance. We developed time-of-use (TOU)-based and grid-aware active EV charging control methods and integrated them within the study region to understand field impacts. Diving deeper, we selected 10 feeders in Boulder and Aurora for high-fidelity grid modeling down to the house level. We executed detailed grid analysis comparing the smart charge management (SCM) algorithms we developed. Finally, we created a novel tool, Electric Vehicle Infrastructure--Distribution System Integration Tool (EVI-DiST), to integrate all the approaches in a single software environment to provide easy integration, fast simulation, and detailed evaluation capability for utility engineers and other stakeholders.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2025

Optimizing Grain Boundary Structures with LAMMPS Using Evolutionary Algorithms

Grain boundary structure optimization is an important part of materials modeling. Current methods for grain boundary structure optimization involve inefficient, time-consuming processes that do not fully explore the interface parameter space. Evolutionary algorithms have recently been demonstrated to be effective at determining both stable and metastable grain boundary interface structures. In this work, we demonstrate the use of GBOpt, a grain boundary structure optimization software designed to use the Large-scale Atomic/Molecular Massively Parallel Simulation (LAMMPS) software to efficiently determine grain boundary structures. We demonstrate that a only a few manipulations, namely atom insertion, atom removal, and relative grain displacement, are sufficient to explore much of the grain boundary structure parameter space. The efficacy of this approach is demonstrated on an FCC Ni system, and a BCC Fe system. The computational cost is compared against the gamma-surface sampling approach to demonstrate performance improvement.

Evolutionary algorithms↗
DOE OSTI2024

Bayes_Opt-SWMM: A Gaussian process-based Bayesian optimization tool for real-time flood modeling with SWMM

Real-time flood model plays a pivotal role in averting urban flood damage, particularly when there is minimal lead time for preparatory measures. However, urban flood modeling in real-time often contends with inherent uncertainties arising from input data uncertainty and parameter ambiguities. Here this study introduces a real-time calibration (RTC) tool called Bayes_Opt-SWMM, specifically tailored for real-time urban flood modeling and uncertainty optimization. This tool leverages the Gaussian process-based Bayesian optimization algorithm and interfaces seamlessly with the Stormwater Management Model (SWMM). It integrates real-time model forcing data and flood monitoring collected through sensors and gauges which are strategically placed within critical locations of urban drainage systems. Our approach hinges on the Surrogate Model based Uncertainty Optimization (SMUO) concept, providing an avenue for enhancing real-time flood modeling. Bayes_Opt-SWMM runs the optimization process using a surrogate model called Gaussian Process emulator with two inference methods: (1) the Gaussian Process (GP) model and (2) Markov Chain Monte Carlo (MCMC) algorithm in GP model (GP_MCMC). Furthermore, three acquisition functions, namely Expected Improvement (EI), Maximum Probability of Improvement (MPI), and Lower Confidence Bound (LCB), facilitate optimal parameter fitting within the surrogate models. The efficiency of GP-based surrogate models in learning SWMM model parameters, leads to an improved uncertainty quantification and accelerated real-time flood modeling in urban areas. Overall, Bayes_Opt-SWMM emerges as a cost-effective and valuable tool for real-time flood modeling and monitoring, with significant potential for managing intelligent storm water systems in urban environments.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2025

AutoFocus: AI/ML-driven real-time wavefront diagnostics to autonomously align and optimize X-ray optics

We present an integrated system that combines advanced wavefront diagnostics with artificial intelligence (AI) to automate and optimize X-ray optics at synchrotron beamlines. This system couples real-time wavefront sensing with AI-driven control algorithms to achieve precise beam alignment, stabilization, and performance optimization. A key feature is the use of multi-fidelity transfer learning, which enables knowledge gained from both real-world beamline optimizations and ultra-realistic digital twin simulations to be effectively applied to in situ optimization. By leveraging multi-objective bayesian optimization, the system continuously refines its performance, reducing optimization time and minimizing the need for manual adjustments. Designed for seamless deployment, it operates with existing beamline hardware and provides an intuitive graphical interface. Initial deployments at the advanced photon source beamlines have demonstrated its ability to enhance beam stability, improve reproducibility, and significantly streamline alignment procedures. This AI-enhanced control framework represents a significant step toward fully autonomous beamline operation in next-generation synchrotron facilities.

Rebuffi, Luca [Argonne National Laboratory (ANL), ↗
DOE OSTI2025

Asymptotic-preserving dynamical low-rank method for the stiff nonlinear Boltzmann equation

In kinetic theory, numerically solving the full Boltzmann equation is extremely expensive. This is because the Boltzmann collision operator involves a high-dimensional, nonlinear integral that must be evaluated at each spatial grid point and every time step. The challenge becomes even more pronounced in the fluid (strong collisionality) regime, where the collision operator exhibits strong stiffness, causing explicit time integrators to impose severe stability restrictions. In this paper, we propose addressing this problem through a dynamical low-rank (DLR) approximation. The resulting algorithm requires evaluating the Boltzmann collision operator only r 2 times, where r, the rank of the approximation, is much smaller than the number of spatial grid points. We propose a novel DLR integrator, called the XL integrator, which reduces the number of steps compared to the available alternatives (such as the projector splitting or basis update & Galerkin (BUG) integrator). For a class of problems including the Boltzmann collision operator which enjoys a separation property between physical and velocity space, we further propose a specialized version of the XL integrator, called the sXL integrator. This version requires solving only one differential equation to update the low-rank factors. Furthermore, the proposed low-rank schemes are asymptotic-preserving, meaning they can capture the asymptotic fluid limit in the case of strong collisionality. Our numerical experiments demonstrate the efficiency and accuracy of the proposed methods across a wide range of regimes, from non-stiff (kinetic) to stiff (fluid).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Data Analytics Methods to Measure Plant Outage Resilience

Every 18 or 24 months nuclear power plants (depending on plant configuration, pressurized or boiling water reactor respectively) undergo a period of outage where the plant is taken offline and a large number of maintenance and surveillance activities (that cannot be performed while plant is running) are performed in typically 2–3 weeks. Planning of a plant outage is very challenging since all the activities are required to be performed in the shortest amount of time given available resources (typically contractor crews hired for the duration of the outage). Consequently, plant outages can be costly due the actual loss of power generation and crew costs and, because of it, there is a need to maximize resource usage in the outage planning phase and reduce the risk of outage delays. This paper is addressing these needs by providing a set of analytical methods designed to analyze plant outage schedule and identify critical elements based on available resources (time and crews). These methods are based on natural language processing and optimization algorithms. In this respect, two classes of methods have been developed: one that focuses on the time resource and how variability in the time to complete outage tasks may impact outage delays, and one that minimizes the risk of outage delays by integrating available resources to assess when daily activities should be performed.

97 - MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A bi-level spatiotemporal clustering approach and its application to drought extraction

We present a novel flexible bi-level spatiotemporal clustering algorithm to extract events based on their intensity and spatiotemporal structures. Our algorithm consists of using (i) a novel space-time k-means clustering to obtain spatiotemporally coherent intensity clusters, and (ii) a density-based spatial clustering of applications with noise (DBSCAN) to spatiotemporally section the intensity clusters into individual events. We discuss the development of the algorithm, the selection, tuning and meaning of the parameters within each step, as well as its validation. Finally, we apply the algorithm to a spatiotemporal drought index, standardized vapor pressure deficit drought index (SVDI), over the continental United States (US) from 1980–2021 and show that it captures historical drought events over the continental United States and their spatiotemporal extents.

17 WIND ENERGY↗
DOE OSTI2025

Solving the Bernstein-Vazirani problem using Majorana-based topological quantum algorithms

Executing quantum algorithms using Majorana zero modes—a major milestone for the field of topological quantum computing—requires a platform that can be scaled to large quantum registers, can be controlled in real time and space, and a braiding protocol that uses the unique properties of these exotic particles. Here, we demonstrate the first successful simulation of a Majorana-based, fault-tolerant quantum algorithm to solve the Bernstein-Vazirani problem in two-dimensional magnet-superconductor hybrid structures from initialization to read-out of the final many-body state. Utilizing the Majorana zero modes’ topological properties, we introduce an optimized braiding protocol for the algorithm and a scalable architecture for its implementation with an arbitrary number of qubits. We visualize the algorithm protocol in real time and space by computing the non-equilibrium density of states, which is proportional to the time-dependent differential conductance, and the non-equilibrium charge density, which assigns a unique signature to each final state of the algorithm.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2024

An Accelerated Clip Algorithm for Unstructured Meshes: A Batch-Driven Approach

The clip technique is a popular method for visualizing complex structures and phenomena within 3D unstructured meshes. Meshes can be clipped by specifying a scalar isovalue to produce an output unstructured mesh with its external surface as the isovalue. Similar to isocontouring, the clipping process relies on scalar data associated with the mesh points, including scalar data generated by implicit functions such as planes, boxes, and spheres, which facilitates the visualization of results interior to the grid. In this paper, we introduce a novel batch-driven parallel algorithm based on a sequential clip algorithm designed for high-quality results in partial volume extraction. Our algorithm comprises five passes, each progressively processing data to generate the resulting clipped unstructured mesh. The novelty lies in the use of fixed-size batches of points and cells, which enable rapid workload trimming and parallel processing, leading to a significantly improved memory footprint and run-time performance compared to the original version. On a 32-core CPU, the proposed batch-driven parallel algorithm demonstrates a run-time speed-up of up to 32.6x and a memory footprint reduction of up to 4.37x compared to the existing sequential algorithm. The software is currently available under an open-source license in the VTK visualization system.

Tsalikis, Spiros↗
DOE OSTI2024

(Doublon) Benchmarking of Different Inverse Point Kinetics Implementations for an Autocorrected Reactimeter Algorithm

In November 2017, the Transient Reactor Test Facility returned to operation. Since that time, many transient test series have been completed, such as the Transient Heatsink Overpower Response capsule (THOR), the Transient Water Irradiation System for TREAT (TWIST), and Sirius. Each has provided valuable data for materials performance and reactor safety that can be applied in future designs. During each experimental series, detector count rates provided important information on the core behavior during transients. However, a limitation of these data is that variations in the neutron distribution during experiments can cause errors when attempting to infer reactivity evolution from detector signals. Neutron physics codes can be used to compute the flux shape variations. However, this is a poor solution when the experimental data is used for code verification, validation and uncertainty quantification. Indeed, if the output of the code is used both as a reference and to correct what the reference is compared to, the circular dependency limits the quality of the verification, validation and uncertainty quantification approach. To overcome this problem, the autocorrected reactimeter algorithm (ACRA) has been developed. This approach infers a time-dependent reactivity evolution by testing different spatial corrections and selecting the one that minimizes reactivity variations when the core is in a frozen configuration (i.e., when there is no variation in parameters affecting reactivity). However, the scope of this method was limited to transients where there were negligible thermal feedback. Indeed, the core is never in a frozen configuration when the fuel temperature varies during the whole transient. This is our motivation for developing an improved version of the ACRA that does not require frozen configurations. To develop this new algorithm, we need a precise and unbiased implementation of the inverse point kinetic equations (IPKEs) as any error in the reactivity evaluation will be propagated into the choice of the optimal spatial correction. Indeed, the previous reactimeter algorithm would use approximations, such as a negligible flux amplitude derivative, to focus on rapidity. For the numerical validation of ACRA, we aim at absolute error under for reactivity derived from signals similar to the one of this study. In this summary, we test eight different IPKE implementations. Each will process a mockup signal built for this study, similar to those that the future ACRA will process. Each reactivity output will be compared to the reference reactivity that has been used to generate the mockup signal. The implementation minimizing the difference with the reference reactivity will be used in the development of a new ACRA formulation.

73 - NUCLEAR PHYSICS AND RADIATION PHYSICS↗