Search NASA⌕ Search

SEARCH · Search NASA

Results for “Randomized 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 667 records · Page 37
All sourcesNASA NTRSDOE OSTI
NASA NTRS1994

State-space self-tuner for on-line adaptive control

Dynamic systems, such as flight vehicles, satellites and space stations, operating in real environments, constantly face parameter and/or structural variations owing to nonlinear behavior of actuators, failure of sensors, changes in operating conditions, disturbances acting on the system, etc. In the past three decades, adaptive control has been shown to be effective in dealing with dynamic systems in the presence of parameter uncertainties, structural perturbations, random disturbances and environmental variations. Among the existing adaptive control methodologies, the state-space self-tuning control methods, initially proposed by us, are shown to be effective in designing advanced adaptive controllers for multivariable systems. In our approaches, we have embedded the standard Kalman state-estimation algorithm into an online parameter estimation algorithm. Thus, the advanced state-feedback controllers can be easily established for digital adaptive control of continuous-time stochastic multivariable systems. A state-space self-tuner for a general multivariable stochastic system has been developed and successfully applied to the space station for on-line adaptive control. Also, a technique for multistage design of an optimal momentum management controller for the space station has been developed and reported in. Moreover, we have successfully developed various digital redesign techniques which can convert a continuous-time controller to an equivalent digital controller. As a result, the expensive and unreliable continuous-time controller can be implemented using low-cost and high performance microprocessors. Recently, we have developed a new hybrid state-space self tuner using a new dual-rate sampling scheme for on-line adaptive control of continuous-time uncertain systems.

Shieh, L. S.↗
NASA NTRS2000

[Measurement of Speed and Direction of Ocean Surface Winds Using Quik Scat Scatterometer]

The SeaWinds on QuikSCAT scatterometer was developed by NASA JPL to measure the speed and direction of ocean surface winds. Simulations performed to estimate the performance of the instrument prior to its launch have indicated that the mid-swath accuracy is worse than that of the rest of the swath. This behavior is a general characteristic of scanning pencil beam scatterometers. For SeaWinds, the accuracy of the rest of the swath, and the size of the swath are such that the instrument meets its science requirements despite mid-swath shortcomings. However, by understanding the problem at mid-swath, we can improve the performance there as well. We discuss the underlying causes of the problem in detail and propose a new wind retrieval algorithm which improves mid-swath performance. The directional discrimination ability of the instrument varies with cross track distance wind speed, and direction. By estimating the range of likely wind directions for each measurement cell, one can optimally apply information from neighboring cells where necessary in order to reduce random wind direction errors without significantly degrading the resolution of the resultant wind field. In this manner we are able to achieve mid-swath RMS wind direction errors as low as 15 degrees for low winds and 10 degrees for moderate to high winds, while at the same time preserving high resolution structures such as cyclones and fronts.

Stiles, Bryan↗
DOE OSTI2024

Finite elements for Matérn-type random fields: Uncertainty in computational mechanics and design optimization

This work highlights an approach for incorporating realistic uncertainties into scientific computing workflows based on finite elements, focusing on prevalent applications in computational mechanics and design optimization. We leverage Matérn-type Gaussian random fields (GRFs) generated using the SPDE method to model aleatoric uncertainties, including environmental influences, variating material properties, and geometric ambiguities. Our focus lies on delivering practical GRF realizations that accurately capture imperfections and variations and understanding how they impact the predictions of computational models as well as the shape and topology of optimized designs. Here we describe a numerical algorithm based on solving a generalized SPDE to sample GRFs on arbitrary meshed domains. The algorithm leverages established techniques and integrates seamlessly with the open-source finite element library MFEM and associated scientific computing workflows, like those found in industrial and national laboratory settings. Our solver scales efficiently for large-scale problems and supports various domain types, including surfaces and embedded manifolds. We showcase its versatility through biomechanics and topology optimization applications, emphasizing the potential to influence these domains. The flexibility and efficiency of SPDE-based GRF generation empowers us to run large-scale optimization problems on 2D and 3D domains, including finding optimized designs on embedded surfaces, and to generate design features and topologies beyond the reach of conventional techniques. Moreover, these capabilities allow us to model and quantify geometric uncertainties on reconstructed submanifolds, such as the interpolated surfaces of cerebral aneurysms provided by postprocessing CT scans. In addition to offering benefits in these specific domains, the proposed techniques transcend specific applications and generalize to arbitrary forward and backward problems in uncertainty quantification involving finite elements.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Efficient Measurement-Driven Eigenenergy Estimation with Classical Shadows

Quantum algorithms exploiting real-time evolution under a target Hamiltonian have demonstrated remarkable efficiency in extracting key spectral information. However, the broader potential of these methods, particularly beyond ground-state calculations, is underexplored. In this work, we introduce the framework of multiobservable dynamic mode decomposition (MODMD), which combines the observable dynamic mode decomposition (DMD), a measurement-driven eigensolver tailored for near-term implementation, with classical shadow tomography. MODMD leverages random scrambling in the classical shadow technique to construct, with exponentially reduced resource requirements, a signal subspace that encodes rich spectral information. Notably, we replace typical Hadamard-test circuits with a protocol designed to predict low-rank observables, thereby broadening the use of classical shadow tomography for predicting many low-rank observables. We establish theoretical guarantees on the spectral approximation from MODMD, taking into account distinct sources of error. In the ideal case, we prove that the spectral error scales as exp (−Δ⁢𝐸⁢𝑡 max ), where Δ⁢𝐸 is the Hamiltonian spectral gap and 𝑡 max is the maximal simulation time. This analysis provides a rigorous justification of the rapid convergence observed across simulations. To demonstrate the utility of our framework, we consider its application to fundamental tasks, such as determining the low-lying, i.e., ground or excited, energies of representative many-body systems. Our work paves the path for efficient designs of measurement-driven algorithms on near-term and early fault-tolerant quantum devices.

quantum algorithms & computation↗
NASA NTRS1976

An algorithm to compute the sequency ordered Walsh transform

A fast sequency-ordered Walsh transform algorithm is presented; this sequency-ordered fast transform is complementary to the sequency-ordered fast Walsh transform introduced by Manz (1972) and eliminating gray code reordering through a modification of the basic fast Hadamard transform structure. The new algorithm retains the advantages of its complement (it is in place and is its own inverse), while differing in having a decimation-in time structure, accepting data in normal order, and returning the coefficients in bit-reversed sequency order. Applications include estimation of Walsh power spectra for a random process, sequency filtering and computing logical autocorrelations, and selective bit reversing.

Larsen, H.↗
NASA NTRS1980

Charge distribution in lightning flashes

Four VHF receivers about 10 km apart were used to detect three-dimensional lightning VHF sources during active thunderstorms. A computer implemented algorithm was used to determine the difference in the time of arrival (DTOA) between the VHF pulses. The three-dimensional source locations determined from the DTOA were correlated with ground electric field measurements (0.1 Hz to 1.5 MHz). Four cloud to ground (CG) and three intracloud (IC) flashes, selected randomly, were studied. A point charge model was used to determine the charge being removed during the different phases of CG and IC flashes. It was determined that return strokes lowered between 24.1 and 3.6 coulombs of negative charge to ground from heights between 10.5 and 5.8 km above MSL. The interstroke process after the first return stroke in a CG flash lowered between 3.4 and 0.9 coulombs of negative charge between the heights of 14.2 (near the cloud tops) to heights of 5.8 km (near the beginning of the leader-return stroke process).

Rustan, P. L.↗
NASA NTRS2002

Sensorimotor aspects of high-speed artificial gravity: I. Sensory conflict in vestibular adaptation

Short-radius centrifugation offers a promising and affordable countermeasure to the adverse effects of prolonged weightlessness. However, head movements made in a fast rotating environment elicit Coriolis effects, which seriously compromise sensory and motor processes. We found that participants can adapt to these Coriolis effects when exposed intermittently to high rotation rates and, at the same time, can maintain their perceptual-motor coordination in stationary environments. In this paper, we explore the role of inter-sensory conflict in this adaptation process. Different measures (vertical nystagmus, illusory body tilt, motion sickness) react differently to visual-vestibular conflict and adapt differently. In particular, proprioceptive-vestibular conflict sufficed to adapt subjective parameters and the time constant of nystagmus decay, while retinal slip was required for VOR gain adaptation. A simple correlation between the strength of intersensory conflict and the efficacy of adaptation fails to explain the data. Implications of these findings, which differ from existing data for low rotation rates, are discussed.

Non-NASA Center↗
DOE OSTI2025

Computing material volume fractions on a superimposed mesh as applied to Monte Carlo particle transport simulations

Here, we present a newly implemented ray tracing algorithm in OpenMC for efficiently computing material volume fractions on superimposed meshes in complex geometries. By firing rays along each coordinate direction through the geometry, the approach accumulates track-length data in each mesh element, thereby determining the fractional composition of each material. Scaling studies on three different models—a random tetrahedra configuration, the Frascati Neutron Generator ITER dose rate benchmark, and a stellarator design—show excellent parallel performance, with nearly linear speedup on modern multi-threaded and distributed-memory systems. An analysis of the residual error relative to high-resolution reference solutions demonstrated that under optimal conditions it decreases as 1/R, where R is the number of rays fired, making it straightforward to achieve user-prescribed accuracy. This new functionality enables practical, mesh-based approaches for detailed nuclear analyses in production Monte Carlo workflows without resorting to expensive, fully conformal or unstructured meshing.

Monte Carlo↗
NASA NTRS1981

Studies in astronomical time series analysis. I - Modeling random processes in the time domain

Several random process models in the time domain are defined and discussed. Attention is given to the moving average model, the autoregressive model, and relationships between and combinations of these models. Consideration is then given to methods for investigating pulse structure, procedures of model construction, computational methods, and numerical experiments. A FORTRAN algorithm of time series analysis has been developed which is relatively stable numerically. Results of test cases are given to study the effect of adding noise and of different distributions for the pulse amplitudes. A preliminary analysis of the light curve of the quasar 3C 272 is considered as an example.

Scargle, J. D.↗
NASA NTRS1992

Phase noise in pulsed Doppler lidar and limitations on achievable single-shot velocity accuracy

The smaller sampling volumes afforded by Doppler lidars compared to radars allows for spatial resolutions at and below some sheer and turbulence wind structure scale sizes. This has brought new emphasis on achieving the optimum product of wind velocity and range resolutions. Several recent studies have considered the effects of amplitude noise, reduction algorithms, and possible hardware related signal artifacts on obtainable velocity accuracy. We discuss here the limitation on this accuracy resulting from the incoherent nature and finite temporal extent of backscatter from aerosols. For a lidar return from a hard (or slab) target, the phase of the intermediate frequency (IF) signal is random and the total return energy fluctuates from shot to shot due to speckle; however, the offset from the transmitted frequency is determinable with an accuracy subject only to instrumental effects and the signal to noise ratio (SNR), the noise being determined by the LO power in the shot noise limited regime. This is not the case for a return from a media extending over a range on the order of or greater than the spatial extent of the transmitted pulse, such as from atmospheric aerosols. In this case, the phase of the IF signal will exhibit a temporal random walk like behavior. It will be uncorrelated over times greater than the pulse duration as the transmitted pulse samples non-overlapping volumes of scattering centers. Frequency analysis of the IF signal in a window similar to the transmitted pulse envelope will therefore show shot-to-shot frequency deviations on the order of the inverse pulse duration reflecting the random phase rate variations. Like speckle, these deviations arise from the incoherent nature of the scattering process and diminish if the IF signal is averaged over times greater than a single range resolution cell (here the pulse duration). Apart from limiting the high SNR performance of a Doppler lidar, this shot-to-shot variance in velocity estimates has a practical impact on lidar design parameters. In high SNR operation, for example, a lidar's efficiency in obtaining mean wind measurements is determined by its repetition rate and not pulse energy or average power. In addition, this variance puts a practical limit on the shot-to-shot hard target performance required of a lidar.

Mcnicholl, P.↗
NASA NTRS1999

Current Trend Towards Using Soft Computing Approaches to Phase Synchronization in Communication Systems

This paper surveys recent advances in communications that utilize soft computing approaches to phase synchronization. Soft computing, as opposed to hard computing, is a collection of complementary methodologies that act in producing the most desirable control, decision, or estimation strategies. Recently, the communications area has explored the use of the principal constituents of soft computing, namely, fuzzy logic, neural networks, and genetic algorithms, for modeling, control, and most recently for the estimation of phase in phase-coherent communications. If the receiver in a digital communications system is phase-coherent, as is often the case, phase synchronization is required. Synchronization thus requires estimation and/or control at the receiver of an unknown or random phase offset.

Drake, Jeffrey T.↗
NASA NTRS1988

Structural dynamics analysis using an unsymmetric block Lanczos algorithm

A method for reducing the order of a dynamical model of a large structure with arbitrary damping is developed analytically and demonstrated. A Lanczos algorithm is described which can reduce square unsymmetric system matrices to block-tridiagonal form, and a procedure for defining the reduced-order model from the right and left Lanczos vectors is outlined. Results for sample problems involving the 8-DOF FEM model of a beam-rotor assembly subjected to random and stepped external forces are presented in extensive graphs and briefly characterized.

Craig, Roy R., Jr.↗
NASA NTRS1996

Global Load Balancing with Parallel Mesh Adaption on Distributed-Memory Systems

Dynamic mesh adaption on unstructured grids is a powerful tool for efficiently computing unsteady problems to resolve solution features of interest. Unfortunately, this causes load imbalance among processors on a parallel machine. This paper describes the parallel implementation of a tetrahedral mesh adaption scheme and a new global load balancing method. A heuristic remapping algorithm is presented that assigns partitions to processors such that the redistribution cost is minimized. Results indicate that the parallel performance of the mesh adaption code depends on the nature of the adaption region and show a 35.5X speedup on 64 processors of an SP2 when 35% of the mesh is randomly adapted. For large-scale scientific computations, our load balancing strategy gives almost a sixfold reduction in solver execution times over non-balanced loads. Furthermore, our heuristic remapper yields processor assignments that are less than 3% off the optimal solutions but requires only 1% of the computational time.

Biswas, Rupak↗
NASA NTRSDate not supplied

Statistical Classification of Biosignature Information using Multiple Instrument Observations

The accurate identification of biosignatures (indications of life) from data taken from remote or in situ planetary exploration is one of the most important challenges in astrobiology, the interdisciplinary field examining habitability and the potential for extraterrestrial life. This study employs machine learning algorithms to optimize the identification of biosignatures, with an emphasis on those which are agnostic to a specific biochemical basis. We exploit the wealth of terrestrial data available from biogenic and abiogenic systems to enhance efficient feature prioritization. Our dataset, pulled from public databases and laboratory recorded measurements, includes elemental abundance, isotopic fractionation, and VNIR/Raman spectra The data curation process included standardization for detection limits and ranges. Subsequent feature extraction yielded detailed inputs for machine learning, including combinations of elemental content, isotopic ratios, and parameters of spectral peaks and troughs. Feature significance was evaluated across diverse machine learning methodologies, such as k-nearest neighbors, logistic regression, Random Forest, support vector machines, and Gaussian Naïve Bayes, along with a combined voting classifier. We utilized Receiver Operating Characteristic Area Under the Curve (ROC AUC) across 2,000 50% test-train splits as a robust metric of model performance. Results revealed a promising ROC AUC of 0.853 for the combined voting classifier. Removing elemental abundance data notably reduced model accuracy (13% decrease in AUC), highlighting its critical role in biosignature detection. Several other individual data features exhibited significance within their respective data types, offering additional granularity. This research fortifies the relevance of machine learning to astrobiology, potentially enhancing life detection missions by allowing algorithmic prioritization of high-interest samples for further investigation. Future work will refine data standardization, expand the dataset to include more terrestrial systems, and incorporate convolutional neural networks for spectral feature extraction. The potential for public data sharing is also under exploration, reinforcing our commitment to collective scientific advancement.

Statistical↗
NASA NTRS1992

Atmospheric disturbance model for aircraft and space capable vehicles

An atmospheric disturbance model (ADM) is developed that considers the requirements of advanced aerospace vehicles and balances algorithmic assumptions with computational constraints. The requirements for an ADM include a realistic power spectrum, inhomogeneity, and the cross-correlation of atmospheric effects. The baseline models examined include the Global Reference Atmospheric Model Perturbation-Modeling Technique, the Dryden Small-Scale Turbulence Description, and the Patchiness Model. The Program to Enhance Random Turbulence (PERT) is developed based on the previous models but includes a revised formulation of large-scale atmospheric disturbance, an inhomogeneous Dryden filter, turbulence statistics, and the cross-correlation between Dryden Turbulence Filters and small-scale thermodynamics. Verification with the Monte Carlo approach demonstrates that the PERT software provides effective simulations of inhomogeneous atmospheric parameters.

Chimene, Beau C.↗
NASA NTRS1994

An analysis of gamma ray burst time histories

Gamma ray burst time histories, ranging in durations from milliseconds to thousands of seconds, are as varied as the number of bursts. They show a wide array of structures from those that are very smooth to those that contain a seemingly uncountable number of spikes riding on top of other spikes. These profiles have tantalized researchers for years - they obviously hold important information on the nature of GRB's, but to date no one has been successful in analyzing them. For the past year the author has been working on algorithms to analyze these data. Two approaches have been followed in this investigation. The first is an attempt to quantify the amount of structure, or spikiness, in a profile. The second involves applying the latest theorems on chaos and fractals with the aim of extracting useful information from what seems to be a random collection of shot noise.

Lestrade, John Patrick↗
NASA NTRS1996

Global Load Balancing with Parallel Mesh Adaption on Distributed-Memory Systems

Dynamic mesh adaptation on unstructured grids is a powerful tool for efficiently computing unsteady problems to resolve solution features of interest. Unfortunately, this causes load inbalances among processors on a parallel machine. This paper described the parallel implementation of a tetrahedral mesh adaption scheme and a new global load balancing method. A heuristic remapping algorithm is presented that assigns partitions to processors such that the redistribution coast is minimized. Results indicate that the parallel performance of the mesh adaption code depends on the nature of the adaption region and show a 35.5X speedup on 64 processors of an SP2 when 35 percent of the mesh is randomly adapted. For large scale scientific computations, our load balancing strategy gives an almost sixfold reduction in solver execution times over non-balanced loads. Furthermore, our heuristic remappier yields processor assignments that are less than 3 percent of the optimal solutions, but requires only 1 percent of the computational time.

Biswas, Rupak↗
NASA NTRSDate not supplied

How Can We Harness the Power of Machine Learning With TEMPO Data?

There are many potential applications of machine learning for TEMPO data that include - Improve retrievals by reducing the effect of random instrument noise - Expand coverage by producing data in moderately cloudy conditions (see also Fasnacht et al. poster) - Help diagnose impacts of instrumental artifacts - Produce value-added products quickly by training on existing products from other sensors (land and ocean) - Speed up processing by training on products produced with full-physics algorithms (e.g., NO 2 slant column fitting may take ~1 hour/orbit but with a neural net it may take only minutes)

NO2↗