Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithm”

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 955 records · Page 53
All sourcesNASA NTRSDOE OSTI
NASA NTRSDate not supplied

A 3-Channel Algorithm for Retrieving Spatially and Temporally Continuous Cloud Properties Across Different Geostationary Satellite Imagers

Cloud property retrieval algorithms for passive satellite imagers are generally designed to take advantage of all the useful spectral information available for a particular satellite. This strategy optimizes accuracy and reduces misidentification and retrieval biases, particularly for modern satellites with many spectral channels. However, the application of dissimilar algorithms tailored for different satellite sensor scan present a problem within the climate data record (CDR). Algorithm inconsistencies can introduce artificial trends in the CDR that are tied to instrument changes rather than physical changes, especially when older satellites with limited spectral information are included. The NASA CERES (Clouds and the Earth’s Radiant Energy System) data record provides global cloud property retrievals across 23 years and more than 25 satellites. With the goal of producing a spatially and temporally continuous record of cloud properties, the CERES cloud working group has developed algorithms that use only 3 channels that are common to most geostationary satellite imagers: 0.65, 3.9, and 10.8 μm.

Sarah Bedka↗
NASA NTRS2024

Machine Learning Based Aerosol and Ocean Color Joint Retrieval Algorithm for Multiangle Polarimeters over Coastal Waters

NASA’s Plankton, Aerosol, Cloud, ocean Ecosystem (PACE) mission, recently launched in February 2024, carries two multiangle polarimeters (MAPs): the UMBC Hyper-Angular Rainbow Polarimeter (HARP2) and SRON Spectropolarimeter for Planetary Exploration One (SPEXone). Measurements from these MAPs will greatly advance ocean ecosystem and aerosol studies as their measurements contain rich information on microphysical properties of aerosols and hydrosols. The Multi-Angular Polarimetric Ocean coLor (MAPOL) joint retrieval algorithm has been developed to retrieve aerosol and ocean color information, which uses a vector radiative transfer (RT) model as the forward model. The RT model is computationally expensive, which makes processing a large amount of data challenging. FastMAPOL was developed to expedite retrieval using neural networks to replace the RT forward models. As a prototype study, FastMAPOL was initially limited to open ocean applications where the ocean Inherent Optical Properties (IOPs) were parameterized in terms of one parameter: chlorophyll-a concentration (Chla). In this study we further expand the FastMAPOL joint retrieval algorithm to incorporate NN based forward models for coastal waters, which use multi-parameter bio-optical models. In addition, aerosols are represented by six components, i.e., fine mode non absorbing insoluble (FNAI), brown carbon (BrC), black carbon (BC), fine mode non absorbing soluble (FNAS), sea salt (SS) and non-spherical dust (Dust). Sea salt and dust are coarse mode aerosols, while the other components are in the fine mode. The sizes and spectral refractive indices are fixed for each aerosol component, while their abundances are retrievable. The multi-parameter bio-optical model and aerosol components are chosen to represent the coastal marine environment. The retrieval algorithm is applied to synthetic measurements in three different configurations ofMAPs in the PACE mission: HARP2 observations only, SPEXone observations only and combined HARP2 and SPEXone observations. The retrieval results from synthetic measurements show that for aerosol retrieval the SPEXone-only configuration works equally well with the HAPR2-only configuration. On the other hand, for ocean color retrieval the SPEXone instrument provides better information due to its larger spectral coverage. For the surface parameters (wind speed), HARP2 measurements provide better information due to its wide field of view. Combined measurement configuration HARP2+SPEXone performed the best to retrieve all aerosol, ocean color and surface parameters. We also studied the impact of sun glint to aerosol and ocean color retrievals. The retrieval test revealed that wind speed and absorbing aerosol retrieval improves significantly when including measurements at glint geometries. Furthermore, the retrieval algorithm is equipped with modules for atmospheric correction and bidirectional reflectance distribution (BRDF) correction to obtain the remote sensing reflectance, which enables ocean biogeochemistry studies using the PACE polarimeter data.

PACE↗
NASA NTRSDate not supplied

Performance Evaluation of a Cartesian Move Algorithm for the LSMS Family of Cable-Driven Cranes

The Lightweight Surface Manipulation System, or LSMS, is a family of cable-actuated cranes, designed for surface operations on the Moon and Mars. Its structural design focuses on three fundamental traits for space environments: a high payload-to-mass ratio to reduce launch costs, compactness for space travel in reduced cargo bays, and self-erecting capabilities for operations before astronauts arrive. The resulting design confers nonlinear and switched dynamics to the LSMS, making these cranes an interesting challenge for autonomous and teleoperated applications. One of the protocols required for these applications is a Cartesian move algorithm. This algorithm is responsible for placing the end effector of the crane at a desired location, specified in Cartesian coordinates. This paper evaluates the performance of a Cartesian move algorithm developed for the LSMS at the NASA Langley Research Center. To this end, several payload manipulation tasks were performed with LSMS-L35, the smallest version within the LSMS family. The evaluated algorithm can place the end effector with accuracy, as shown in the hardware and simulation tests.

cable-actuated↗
NASA NTRS1983

Efficient solution of the Euler and Navier-Stokes equations with a vectorized multiple-grid algorithm

A multiple-grid algorithm for use in efficiently obtaining steady solutions to the Euler and Navier-Stokes equations is presented. The convergence of the explicit MacCormack algorithm on a fine grid is accelerated by propagating transients from the domain using a sequence of successively coarser grids. Both the fine and coarse grid schemes are readily vectorizable. The combination of multiple-gridding and vectorization results in substantially reduced computational times for the numerical solution of a wide range of flow problems. Results are presented for subsonic, transonic, and supersonic inviscid flows and for subsonic attached and separated laminar viscous flows. Work reduction factors over a scalar, single-grid algorithm range as high as 76.8.

Navier Stokes simulation↗
NASA NTRS1999

Quantum Algorithms

This thesis describes several new quantum algorithms. These include a polynomial time algorithm that uses a quantum fast Fourier transform to find eigenvalues and eigenvectors of a Hamiltonian operator, and that can be applied in cases for which all know classical algorithms require exponential time.

Quantum Algorithms polynomial time algorithm Hamil↗
DOE OSTI2024

Pairing a Global Optimization Algorithm with EXAFS to Characterize Lanthanide Structure in Solution

Ensemble-average sampling of structures from ab initio molecular dynamics (AIMD) simulations can be used to predict theoretical extended X-ray absorption fine structure (EXAFS) signals that closely match experimental spectra. However, AIMD simulations are time-consuming and resource-intensive, particularly for solvated lanthanide ions, which often form multiple nonrigid geometries with high coordination numbers. Here, to accelerate the characterization of lanthanide structures in solution, we employed the Northwest Potential Energy Surface Search Engine (NWPEsSe), an adaptive-learning global optimization algorithm, to efficiently screen first-shell structures. As case studies, we examine two systems: Eu(NO 3 ) 3 dissolved in acetonitrile with a terpyridine ligand (terpyNO 2 ), and Nd(NO 3 ) 3 dissolved in acetonitrile. The theoretical spectra for structures identified by NWPEsSe were compared to both experimental and AIMD-derived EXAFS spectra. The NWPEsSe algorithm successfully identified the proper solvation structure for both Eu(NO 3 ) 3 (terpyNO 2 ) and Nd(NO 3 )(acetonitrile) 3 , with the calculated EXAFS signals closely matching the experimental spectra for the Eu-ligand complex and showing good similarity for the Nd salt; the better agreement with the ligand-containing structure is attributed to a less dynamic coordination environment due to the rigid ligand. The key advantage of the global optimization algorithm lies in its ability to sample the coordination environment across the potential energy surface and reduce the time required to identify structures from generally a month to within a week. Additionally, this approach is versatile and can be adapted to characterize main-group metal complexes.

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

Chemical applications of variational quantum eigenvalue-based quantum algorithms: Perspective and survey

Exploring many-body chemical systems on classical computers often involves solving the Schrödinger equation. However, this approach is frequently limited by the exponential increase in the dimensionality of the Hamiltonian as the number of degrees of freedom increases. In contrast, quantum computing, specifically through the variational quantum eigensolver (VQE) framework, shows promise in overcoming this exponential cost. VQE can utilize the collective properties of quantum states to model the wavefunction in polynomial time. Despite the current limitations of quantum hardware, significant advances have been made in the development of VQE-based algorithms. Here, in this review, we provide an overview of emerging protocols, focusing on their applications in simulating the ground state, excited state, and vibrational properties of chemical systems. By examining notable algorithmic advancements and applications, this review aims to shed light on the challenges and potential of VQE-based algorithms in addressing relevant chemical problems.

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

A modular GUI-based program for genetic algorithm-based feedback-assisted wavefront shaping

Abstract We have developed a modular graphical user interface (GUI)-based program for use in genetic algorithm-based feedback-assisted wavefront shaping. The program uses a class-based structure to separate out the universal modules (e.g. GUI, multithreading, optimization algorithms) and hardware-specific modules (e.g. code for different SLMs and cameras). This modular design makes the program easily adaptable to a wide range of lab equipment, while providing easy access to a GUI, multithreading, and three optimization algorithms (phase-stepping, simple genetic, and microgenetic).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Variational quantum and neural quantum states algorithms for the linear complementarity problem

Variational quantum algorithms (VQAs) are promising hybrid quantum-classical methods designed to leverage the computational advantages of quantum computing while mitigating the limitations of current noisy intermediate-scale quantum (NISQ) hardware. Although VQAs have been demonstrated as proofs of concept, their practical utility in solving real-world problems—and whether quantum-inspired classical algorithms can match their performance—remains an open question. We present a novel application of the variational quantum linear solver (VQLS) and its classical neural quantum states-based counterpart, the variational neural linear solver (VNLS), as key components within a minimum map Newton solver for a complementarity-based rigid-body contact model. We demonstrate using the VNLS that our solver accurately simulates the dynamics of rigid spherical bodies during collision events. These results suggest that quantum and quantum-inspired linear algebra algorithms can serve as viable alternatives to standard linear algebra solvers for modelling certain physical systems.

neural quantum states↗
DOE OSTI2025

Quantifying the impact of precision errors on quantum approximate optimization algorithms

The quantum approximate optimization algorithm (QAOA) is a hybrid quantum-classical algorithm that seeks to achieve approximate solutions to optimization problems by iteratively alternating between intervals of controlled quantum evolution. Here, we examine the effect of analog precision errors on QAOA performance from the perspective of both algorithmic training and performance guarantees. Leveraging cumulant expansions, we recast the faulty QAOA as a control problem in which precision errors are expressed as multiplicative control noise and derive bounds on the performance of QAOA. We show using both analytical techniques and numerical simulations that fixed precision implementations of QAOA circuits are subject to an exponential degradation in performance dependent upon the number of optimal QAOA layers and magnitude of the precision error. Despite this significant reduction, we show that it is possible to mitigate precision errors in QAOA via digitization of the variational parameters at the cost of increasing circuit depth.

quantum algorithms↗
DOE OSTI2026

Leveraging Qubit Loss Detection in Fault-Tolerant Quantum Algorithms

Qubit loss errors constitute a dominant source of noise in many quantum hardware systems, particularly in neutral-atom quantum computers. We develop a theoretical framework to effectively detect and correct loss errors in logical algorithms and leverage such loss information in decoding. Considering general quantum error correction codes and logical circuits, we introduce a delayed-erasure decoder for experimentally motivated error models which leverages information from delayed loss detection to accurately correct loss errors, even when the precise moment of the error is unknown. Using this decoder, we identify strategies for detecting and correcting loss errors based on the logical circuit structure. For deep circuits prior to logical measurement, we explore methods to integrate loss detection into syndrome extraction with minimal overhead, identifying optimal strategies depending on the qubit loss fraction in the noise and hardware capabilities. In contrast, we find that many key algorithmic subroutines involve frequent gate teleportation, shortening the circuit depth before logical measurement and naturally replacing qubits with no additional experimental overhead. We simulate this setting using a toy model algorithm for small-angle synthesis and find a significant performance improvement as the loss fraction increases. These results provide a path forward for advancing large-scale fault-tolerant quantum computation in systems with loss error detection.

atoms↗
DOE OSTI2025

Analog In-Memory Computing for the Synthetic Aperture Radar Polar Format Algorithm

As the utility of synthetic aperture radar (SAR) systems increases in autonomous vehicles, satellites, and other power- and space-constrained edge applications, there is a growing need for processors that can form SAR images at low power. In recent years, analog in-memory compute (AIMC) has shown immense promise for accelerating neural networks and other matrix-vector multiplication (MVM) heavy workloads at the edge. Here, in this work, we examine how the polar format algorithm (PFA), a popular SAR image formation algorithm, can be mapped to these AIMC systems. The PFA maps readily onto analog MVMs because it primarily consists of two linear operations: interpolation of frequency-domain data to a Cartesian grid, followed by a 2-D Fourier transform. This work presents two approaches to map the interpolation operation onto MVMs in analog hardware: a chirp transform and a modified form of sinc interpolation. These mappings introduce algorithmic errors, and their effect on the quality of SAR image formation is examined, both quantitatively and qualitatively. In addition, the impact of errors introduced by the analog hardware is explored to determine which approach is optimal under varying assumptions about the underlying analog memory devices and circuits.

Analog computing↗
DOE OSTI2024

A Novel Noise-Aware Classical Optimizer for Variational Quantum Algorithms

A key component of variational quantum algorithms (VQAs) is the choice of classical optimizer employed to update the parameterization of an ansatz. It is well recognized that quantum algorithms will, for the foreseeable future, necessarily be run on noisy devices with limited fidelities. Thus, the evaluation of an objective function (e.g., the guiding function in the quantum approximate optimization algorithm (QAOA) or the expectation of the electronic Hamiltonian in variational quantum eigensolver (VQE)) required by a classical optimizer is subject not only to stochastic error from estimating an expected value but also to error resulting from intermittent hardware noise. Model-based derivative-free optimization methods have emerged as popular choices of a classical optimizer in the noisy VQA setting, based on empirical studies. However, these optimization methods were not explicitly designed with the consideration of noise. In this work we adapt recent developments from the “noise-aware numerical optimization” literature to these commonly used derivative-free model-based methods. We introduce the key defining characteristics of these novel noise-aware derivative-free model-based methods that separate them from standard model-based methods. In conclusion, we study an implementation of such noise-aware derivative-free model-based methods and compare its performance on demonstrative VQA simulations to classical solvers packaged in scikit-quant.

classical optimizers↗
DOE OSTI2026

Unitary Qubit Lattice Algorithms for Plasma Physics

This final technical report summarizes research conducted under DOE Award DE-SC0021653 to develop unitary Quantum Lattice Algorithms for modeling electromagnetic wave propagation and scattering in complex media, including plasmas. The project developed and validated quantum-inspired formulations of Maxwell's equations that preserve unitary evolution and can be evaluated on classical high-performance computing systems while providing a foundation for future quantum-computing implementations. Major accomplishments include the development of two- and three-dimensional algorithms for electromagnetic scattering; scalable, distributed-memory implementations demonstrated on the Perlmutter supercomputer; formulations for nonlinear lossless fluid dynamics and cold, lossless, inhomogeneous magnetized plasmas; and an explicit quantum algorithm for a time-discretized Lorenz model. Simulations reproduced a range of characteristic wave phenomena, including transient effects that are not readily apparent in conventional frequency-domain studies, demonstrating the effectiveness of the proposed approach for modeling complex electromagnetic and plasma systems. The work establishes a unified theoretical and computational framework for quantum and quantum-inspired simulation and provides a foundation for future implementation on fault-tolerant quantum systems.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
NASA NTRS2001

Use of a genetic algorithm for the analysis of eye movements from the linear vestibulo-ocular reflex

It is common in vestibular and oculomotor testing to use a single-frequency (sine) or combination of frequencies [sum-of-sines (SOS)] stimulus for head or target motion. The resulting eye movements typically contain a smooth tracking component, which follows the stimulus, in which are interspersed rapid eye movements (saccades or fast phases). The parameters of the smooth tracking--the amplitude and phase of each component frequency--are of interest; many methods have been devised that attempt to identify and remove the fast eye movements from the smooth. We describe a new approach to this problem, tailored to both single-frequency and sum-of-sines stimulation of the human linear vestibulo-ocular reflex. An approximate derivative is used to identify fast movements, which are then omitted from further analysis. The remaining points form a series of smooth tracking segments. A genetic algorithm is used to fit these segments together to form a smooth (but disconnected) wave form, by iteratively removing biases due to the missing fast phases. A genetic algorithm is an iterative optimization procedure; it provides a basis for extending this approach to more complex stimulus-response situations. In the SOS case, the genetic algorithm estimates the amplitude and phase values of the component frequencies as well as removing biases.

Non-NASA Center↗
NASA NTRS1995

Cascade Error Projection: A New Learning Algorithm

A new neural network architecture and a hardware implementable learning algorithm is proposed. The algorithm, called cascade error projection (CEP), handles lack of precision and circuit noise better than existing algorithms.

neural network learning algorithm cascade error pr↗
NASA NTRS1998

New Results in Astrodynamics Using Genetic Algorithms

Generic algorithms have gained popularity as an effective procedure for obtaining solutions to traditionally difficult space mission optimization problems. In this paper, a brief survey of the use of genetic algorithms to solve astrodynamics problems is presented and is followed by new results obtained from applying a Pareto genetic algorithm to the optimization of low-thrust interplanetary spacecraft missions.

generic algorithms optimization problems astrodyna↗
NASA NTRS2005

Design and Optimization of Low-thrust Orbit Transfers Using Q-law and Evolutionary Algorithms

Future space missions will depend more on low-thrust propulsion (such as ion engines) thanks to its high specific impulse. Yet, the design of low-thrust trajectories is complex and challenging. Third-body perturbations often dominate the thrust, and a significant change to the orbit requires a long duration of thrust. In order to guide the early design phases, we have developed an efficient and efficacious method to obtain approximate propellant and flight-time requirements (i.e., the Pareto front) for orbit transfers. A search for the Pareto-optimal trajectories is done in two levels: optimal thrust angles and locations are determined by Q-law, while the Q-law is optimized with two evolutionary algorithms: a genetic algorithm and a simulated-annealing-related algorithm. The examples considered are several types of orbit transfers around the Earth and the asteroid Vesta.

low-thrust orbit transfer↗