Search NASA⌕ Search

SEARCH · Search NASA

Results for “randomized 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 289 records · Page 16
All sourcesNASA NTRSDOE OSTI
NASA NTRS1984

Coastal bathymetry and currents from LANDSAT data

LANDSAT scenes of coastal areas should be useful for bathymetry and for mapping sediment flow if scatter from bottom and suspended matter can be separated by multi-date analysis. Several filter algorithms have been developed to reduce both artifacts and random noise while retaining meaningful structures such as breakwaters and underwater reefs. Results of application of these filters to LANDSAT scenes of the Israeli coast are presented.

Rosenberg, N.↗
NASA NTRS1991

A satellite-based radar wind sensor

The objective is to investigate the application of Doppler radar systems for global wind measurement. A model of the satellite-based radar wind sounder (RAWS) is discussed, and many critical problems in the designing process, such as the antenna scan pattern, tracking the Doppler shift caused by satellite motion, and backscattering of radar signals from different types of clouds, are discussed along with their computer simulations. In addition, algorithms for measuring mean frequency of radar echoes, such as the Fast Fourier Transform (FFT) estimator, the covariance estimator, and the estimators based on autoregressive models, are discussed. Monte Carlo computer simulations were used to compare the performance of these algorithms. Anti-alias methods are discussed for the FFT and the autoregressive methods. Several algorithms for reducing radar ambiguity were studied, such as random phase coding methods and staggered pulse repitition frequncy (PRF) methods. Computer simulations showed that these methods are not applicable to the RAWS because of the broad spectral widths of the radar echoes from clouds. A waveform modulation method using the concept of spread spectrum and correlation detection was developed to solve the radar ambiguity. Radar ambiguity functions were used to analyze the effective signal-to-noise ratios for the waveform modulation method. The results showed that, with suitable bandwidth product and modulation of the waveform, this method can achieve the desired maximum range and maximum frequency of the radar system.

Xin, Weizhuang↗
NASA NTRS2004

Robust local search for spacecraft operations using adaptive noise

Randomization is a standard technique for improving the performance of local search algorithms for constraint satisfaction. However, it is well-known that local search algorithms are constraints satisfaction. However, it is well-known that local search algorithms are to the noise values selected. We investigate the use of an adaptive noise mechanism in an iterative repair-based planner/scheduler for spacecraft operations. Preliminary results indicate that adaptive noise makes the use of randomized repair moves safe and robust; that is, using adaptive noise makes it possible to consistently achieve, performance comparable with the best tuned noise setting without the need for manually tuning the noise parameter.

planning↗
NASA NTRSDate not supplied

OceanWATERS Lander Robotic Arm Operation

Ocean Worlds Autonomy Testbed for Exploration Research and Simulation (OceanWATERS) is an open-source simulator for developing onboard autonomy software for robotic exploration of ocean worlds, such as Europa, Enceladus, and Titan, built on the Robot Operating System (ROS) and Gazebo simulation environment. Inevitable ground communication delays increase demand for a high degree of autonomy during excavation, collection and transfer of samples to scientific instruments for in-situ analysis. This paper offers a detailed discussion of the robotic arm design and operation for such autonomous surface exploration, taking as reference the Europa Lander mission. The lander arm, which is designed primarily to acquire icy surface and subsurface samples within the arm’s workspace, is a 6-degree-of-freedom manipulator with two end effectors: a sample excavation tool and a trenching end-effector. The robotic arm’s modes and operations can be summarized as follows: stowed arm, intended as the lander arm default configuration characterized by zero-power consumption; un-stowed arm, target arm configuration after its first deployment; selection and deployment of the end-effector to use next; guarded move, to detect ground level at the desired trenching location; drill ice using the grinder; dig trench at a particular location using the scoop; deliver sample to the sample transfer dock; discard redundant samples. The motion planning tool used for the lander arm is MoveIt, a ROS package. MoveIt uses sampling-based planning and collision checking libraries to determine safe paths. The Rapidly Exploring Random Trees* (RRT*) has been chosen as default planning algorithm as it provides optimal plans with an exponential speed and is guaranteed to find a solution, if feasible solutions exist. Furthermore, this work quantifies and discusses the energy requirements for excavating and collecting samples. In OceanWATERS, force feedback from the terrain, which influences the arm dynamics, is modelled using a discrete element method (DEM) simulation. The DEM and Gazebo software run in parallel and communicate through a co-simulation plugin. This paper presents an analysis and comparison of three DEM open source software (YADE, ESyS-Particle, Project Chrono) for implementation in OceanWATERS and motivates the choice of YADE as most suitable candidate.

Damiana Catanoso↗
NASA NTRS2003

Mining Distance Based Outliers in Near Linear Time with Randomization and a Simple Pruning Rule

Defining outliers by their distance to neighboring examples is a popular approach to finding unusual examples in a data set. Recently, much work has been conducted with the goal of finding fast algorithms for this task. We show that a simple nested loop algorithm that in the worst case is quadratic can give near linear time performance when the data is in random order and a simple pruning rule is used. We test our algorithm on real high-dimensional data sets with millions of examples and show that the near linear scaling holds over several orders of magnitude. Our average case analysis suggests that much of the efficiency is because the time to process non-outliers, which are the majority of examples, does not depend on the size of the data set.

Bay, Stephen D.↗
NASA NTRS2006

Measuring Constraint-Set Utility for Partitional Clustering Algorithms

Clustering with constraints is an active area of machine learning and data mining research. Previous empirical work has convincingly shown that adding constraints to clustering improves the performance of a variety of algorithms. However, in most of these experiments, results are averaged over different randomly chosen constraint sets from a given set of labels, thereby masking interesting properties of individual sets. We demonstrate that constraint sets vary significantly in how useful they are for constrained clustering; some constraint sets can actually decrease algorithm performance. We create two quantitative measures, informativeness and coherence, that can be used to identify useful constraint sets. We show that these measures can also help explain differences in performance for four particular constrained clustering algorithms.

constraints↗
DOE OSTI2025

A Class of Sparse Johnson–Lindenstrauss Transforms and Analysis of their Extreme Singular Values

The Johnson–Lindenstrauss (JL) lemma is a powerful tool for dimensionality reduction in modern algorithm design. The lemma states that any set of high-dimensional points in a Euclidean space can be projected into lower dimensions while approximately preserving pairwise Euclidean distances. Random matrices satisfying this lemma are called JL transforms (JLTs). Inspired by existing $s$-hashing JLTs with exactly $s$ nonzero elements on each column, the present work introduces an ensemble of sparse matrices encompassing so-called $s$-hashing-like matrices whose expected number of nonzero elements on each column is $s$. The independence of the sub-Gaussian entries of these matrices and the knowledge of their exact distribution play an important role in their analyses. Using properties of independent sub-Gaussian random variables, these matrices are demonstrated to be JLTs, and their smallest nontrivial singular values and largest singular values are estimated nonasymptotically using a technique from geometric functional analysis. As the dimensions of the matrix grow to infinity, these singular values are proved to converge almost surely to fixed quantities (by using the universal Bai–Yin law) and in distribution to the Gaussian orthogonal ensemble Tracy–Widom law after proper rescalings. Understanding the behaviors of extreme singular values is important in general because they are often used to define a measure of stability of matrix algorithms. For example, JLTs were recently used in derivative-free optimization algorithmic frameworks to select random subspaces in which are constructed random models or poll directions to achieve scalability, and hence estimating their smallest singular value in particular helps determine the dimension of these subspaces.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Stochastic relativistic viscous hydrodynamics from the Metropolis algorithm

We propose an algorithm for simulating stochastic relativistic fluid dynamics based on Metropolis updates. Each step of the algorithm begins with an update based on ideal hydrodynamics. This is followed by proposing random (spatial) momentum transfers between fluid cells, keeping the total energy fixed. These proposals are then accepted or rejected using the change in entropy as a statistical weight. The algorithm reproduces relativistic viscous hydrodynamics in the “density frame,” which is a formulation of viscous hydrodynamics we review and clarify here. This formulation is first order in time and requires no auxiliary dynamical fields such as Π 𝜇⁢𝜈 . The only parameters are the shear and bulk viscosities and the equation of state. Here, by adopting the 3+1 split of general relativity, we extend the Metropolis algorithm to general space-time coordinates, such as Bjorken coordinates, which are commonly used to simulate heavy-ion collisions.

Hydrodynamic noise↗
NASA NTRS2023

A Hyperspectral Inversion Framework for Estimating Absorbing Inherent Optical Properties and Biogeochemical Parameters in Inland and Coastal Waters

The simultaneous remote estimation of biogeochemical parameters (BPs) and inherent optical properties (IOPs) from hyperspectral satellite imagery of globally distributed optically distinct inland and coastal waters is a complex, unsolved, non-unique inverse problem. To tackle this problem, we leverage a machine-learning model termed Mixture Density Networks (MDNs). MDNs outperform operational algorithms by calculating the covariance between the simultaneously estimated products. We train the MDNs on a large ( N = 8237) dataset of co-aligned, in situ measured, hyperspectral remote sensing reflectance (R rs ), BPs, and absorbing IOPs from globally representative optically distinct inland and coastal waters. The estimated IOPs include absorption due to phytoplankton (a ph ), chromophoric dissolved organic matter (a cdom ), and non-algal particles (a nap ). The estimated BPs include chlorophyll-a, total suspended solids, and phycocyanin (PC). MDNs dramatically reduce uncertainty in the retrievals, relative to operational algorithms, when using a 50/50 dataset split, where the MDNs are trained on a randomly selected half of the in situ dataset and validated on the other half. Our model is shown to have higher, or equivalent, generalization performance than the calculated operational algorithms available for all BPs and IOPs (except PC) via a leave-one-out cross-validation assessment. The MDNs are sensitive to uncertainties in the hyperspectral satellite R rs , resulting from instrument noise and atmospheric correction; there is a difference of ~37.4–62.8% (using median symmetric accuracy) between the MDNs’ estimates derived from co-located satellite-derived R rs and in situ R rs . Of the IOPs, a cdom and a nap are less sensitive to uncertainties in hyperspectral satellite imagery relative to a ph , with remote estimates of a ph exhibiting incorrect spectral shape and magnitude relative to in situ measured IOPs. Despite the uncertainties in satellite derived R rs , the spatial distributions of BPs and IOPs in MDN-derived product maps of Lake Erie and the Curonian Lagoon, based on imagery taken with the Hyperspectral Imager for the Coastal Ocean (HICO) and PRecursore Iper-Spettrale della Missione Applicativa (PRISMA), are confirmed via co-aligned in situ measurements and agree with the literature’s understanding of these well-studied regions. The consistency and accuracy of the model on HICO and PRISMA imagery, despite radiometric uncertainties, demonstrate its applicability to future hyperspectral missions, such as the Plankton, Aerosol, Cloud, ocean Ecosystem (PACE) mission, where the simultaneous estimation model will serve as a key part of phytoplankton community composition analysis.

Ryan E. O'Shea↗
DOE OSTI2025

Efficient online quantum circuit learning with no upfront training

Optimization is a promising candidate for studying the utility of variational quantum algorithms (VQAs). However, evaluating cost functions using quantum hardware introduces runtime overheads that limit exploration. Surrogate-based methods can reduce calls to a quantum computer, yet existing approaches require hyperparameter pre-training and have been tested only on small problems. Here, we show that surrogate-based methods can enable successful optimization at scale, without pre-training, by using radial basis function interpolation (RBF) to construct an adaptive, hyperparameter-free surrogate. Using the surrogate as an acquisition function drives hardware queries to the vicinity of the true optima. For 16-qubit random 3-regular Max-Cut instances with the Quantum Approximate Optimization Algorithm (QAOA), our method outperforms state-of-the-art approaches, without considering their upfront training costs. Furthermore, we successfully optimize QAOA circuits for 127-qubit random Ising models on an IBM processor using 10 4 −10 5 measurements. Strong empirical performance demonstrates the promise of automated surrogate-based learning for large-scale VQA applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Quantum graph learning and algorithms applied in quantum computer sciences and image classification

Graph and network theory play a fundamental role in quantum computer sciences, including quantum information and computation. Random graphs and complex network theory are pivotal in predicting novel quantum phenomena, where entangled links are represented by edges. Quantum algorithms have been developed to enhance solutions for various network problems, giving rise to quantum graph computing and quantum graph learning (QGL). Here, in this review, we explore graph theory and graph learning methods as powerful tools for quantum computers to generate efficient solutions to problems beyond the reach of classical systems. We delve into the development of quantum complex network theory and its applications in quantum computation, materials discovery, and research. We also discuss quantum machine learning (QML) methodologies for effective image classification using qubits, quantum gates, and quantum circuits. Additionally, the paper addresses the challenges of QGL and algorithms, emphasizing the steps needed to develop flexible QGL solvers. This review presents a comprehensive overview of the fields of QGL and QML, highlights recent advancements, and identifies opportunities for future research.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS2019

Multi-Band Atmospheric Correction Algorithm for Ocean Color Retrievals

NASA's current Atmospheric Correction (AC) algorithm for ocean color utilizes two bands and their ratio in the Near Infrared (NIR) to estimate aerosol reflectance and aerosol type. The algorithm then extrapolates the spectral dependence of aerosol reflectance to the visible wavelengths based on modeled spectral dependence of the identified aerosol type. Future advanced ocean color sensors, such as the Ocean Color Instrument (OCI) that will be carried on the Plankton, Aerosol, Cloud, and ocean Ecosystem (PACE) satellite, will be capable of measuring the hyperspectral radiance from 340 to 890 nm at 5-nm spectral resolution and at 7 discrete Short-wave Infrared (SWIR) channels: 940, 1038,1250, 1378, 1615, 2130, and 2260 nm. To optimally employ this unprecedented instrument capability, we propose an improved AC algorithm that utilizes all atmospheric-window channels in the NIR to SWIR spectral range to reduce the uncertainty in the AC process. A theoretical uncertainty analysis of this, namely Multi-Band AC (MBAC), indicates that the algorithm can reduce the uncertainty in remote sensing reflectance (Rrs) retrievals of the ocean caused by sensor random noise. Furthermore, in optically complex waters, where the NIR signal is affected by contributions from highly-reflective turbid waters, the MBAC algorithm can be adaptively weighted to the strongly-absorbing SWIR channels to enable improved ocean color retrievals in coastal waters. We provide here a description of the algorithm and demonstrate the improved performance in ocean color retrievals, relative to the current NASA standard AC algorithm, through comparison with field measurements and assessment of propagated uncertainties in applying the MBAC algorithm to MODIS and simulated PACE OCI data.

PACE↗
DOE OSTI2025

A randomized sketching trust-region secant method for low-memory dynamic optimization

The numerical solution of dynamic optimization problems is often limited by the memory required to store the state trajectory, which is used to evaluate the objective function and its derivatives. Recently, [R. Muthukumar et al., SIAM Journal on Optimization 31(2), pp. 1242–1275 (2021)] introduced a trust-region method for dynamic optimization that employs randomized sketching to compress the state trajectory, resulting in inexact derivative computations. By adaptively learning the sketch rank, the trust-region algorithm achieves rigorous convergence guarantees. Here, we extend this approach to use secant Hessian approximations. Due to the randomness introduced by the sketch, the traditional secant update formulae can produce poor Hessian approximations. In particular, the difference of two gradients, computed from two different sketches, may be inconsistent. To overcome this, we employ a sketched approximation of the Hessian application, in lieu of computing the gradient difference. We numerically demonstrate the improved stability of this approach on an example from PDE-constrained optimization.

dynamic optimization↗
DOE OSTI2026

Speedup of UEDGE Parameter Scans Using Machine-Learning Optimized OpenMP Parallelization and a Continuation Solver

This article presents the OpenMP parallelization of the preconditioning Jacobian assembly and right‐hand side residual evaluation in UEDGE. A continuation algorithm, utilizing the internal NKSOL implicit Jacobian‐Free Newton‐Krylov solver to efficiently scan physical parameters, is also presented. The implemented parallelization reduces the computational time for a benchmark scan run on 32 threads by compared to the serial version when using trained random forest regression models to identify the optimal decomposition of the system of equations. Random forest regression models applied to the UEDGE time‐dependent and continuation solver algorithms did not yield meaningful improvement in computational performance. A benchmark DIII‐D gas injection rate scan in the 0.35–0.75 kA interval, performed on a test cluster using the parallelized code and continuation solver, produced 1066 steady‐state solutions with a 22 s average wall‐clock computational time per steady‐state solution.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Graph Analytics on Jellyfish topology

Because large unstructured datasets is important for many science domains, distributed graph analytics is critical to many scientists. Unfortunately, obtaining scaling and performance for irregular communication is challenging because contemporary network interconnects are primarily designed to maximize bandwidths of fixed-neighborhoods large-message exchanges (e.g., stencils). Although there is no consensus on the “best” network topologies for irregular communication, unstructured graph-based interconnects can be more suitable. We analyze three popular graph workloads – clustering, pattern enumeration, and traversal — on comparable networks (in terms of resources and costs) constructed from Jellyfish Random Regular, Dragonfly and Fat tree topologies, varying the routing algorithms. Using packet-level simulations, we demonstrate up to 60% improvement in communication time with Jellyfish due to diversity of the short paths between arbitrary endpoints, which can reduce overall network stalls and congestion.

Graph Analytics, network topology, interconnect, H↗
NASA NTRS1968

Study of optimum discrete estimators in measurement analysis

Study of statistical techniques for obtaining estimates of true data parameters uses discrete measured quantities containing random error. These techniques develop estimation procedures as an iterative algorithm for digital computation in real time.

Hung, J. C.↗
NASA NTRS1975

Terminal guidance and navigation for comet and asteroid rendezvous

A terminal guidance and navigation scheme developed in earlier work was modified and evaluated for a solar electric propulsion rendezvous mission to comet Encke. The scheme is intended for autonomous, on-board use. The guidance algorithm is based on optimal control theory and minimizes the time integrated square of thrust acceleration. The navigation algorithm employs a modified Kalman filter set in measurement variables. Random sequences were generated to simulate measurement errors, and the evaluation was conducted with detailed numerical computations which include actual motions of spacecraft and comet. The evaluations showed that the scheme attains rendezvous and maintains station after rendezvous within less than 10 km for estimated best measurements and within less than 100 km for estimated worst measurements. The measurements required are angles, range, and range rate. Angles and range appear to be absolutely necessary; range rate is not as strong a measurement type, and further modifications of the filter will allow a scheme that does not require the rate measurements.

Bennett, A. G.↗