Search NASA⌕ Search

SEARCH · Search NASA

Results for “Iterative 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 NTRS1996

Research in Computational Aeroscience Applications Implemented on Advanced Parallel Computing Systems

Improving the numerical linear algebra routines for use in new Navier-Stokes codes, specifically Tim Barth's unstructured grid code, with spin-offs to TRANAIR is reported. A fast distance calculation routine for Navier-Stokes codes using the new one-equation turbulence models is written. The primary focus of this work was devoted to improving matrix-iterative methods. New algorithms have been developed which activate the full potential of classical Cray-class computers as well as distributed-memory parallel computers.

Wigton, Larry↗
NASA NTRS2002

Cerebral blood flow velocity declines before arterial pressure in patients with orthostatic vasovagal presyncope

OBJECTIVES: We studied hemodynamic changes leading to orthostatic vasovagal presyncope to determine whether changes of cerebral artery blood flow velocity precede or follow reductions of arterial pressure. BACKGROUND: Some evidence suggests that disordered cerebral autoregulation contributes to the occurrence of orthostatic vasovagal syncope. We studied cerebral hemodynamics with transcranial Doppler recordings, and we closely examined the temporal sequence of changes of cerebral artery blood flow velocity and systemic arterial pressure in 15 patients who did or did not faint during passive 70 degrees head-up tilt. METHODS: We recorded photoplethysmographic arterial pressure, RR intervals (electrocardiogram) and middle cerebral artery blood flow velocities (mean, total, mean/RR interval; Gosling's pulsatility index; and cerebrovascular resistance [mean cerebral velocity/mean arterial pressure, MAP]). RESULTS: Eight men developed presyncope, and six men and one woman did not. Presyncopal patients reported light-headedness, diaphoresis, or a sensation of fatigue 155 s (range: 25 to 414 s) before any cerebral or systemic hemodynamic change. Average cerebral blood flow velocity (CBFV) changes (defined by an iterative linear regression algorithm) began 67 s (range: 9 to 198 s) before reductions of MAP. Cerebral and systemic hemodynamic measurements remained constant in nonsyncopal patients. CONCLUSIONS: Presyncopal symptoms and CBFV changes precede arterial pressure reductions in patients with orthostatic vasovagal syncope. Therefore, changes of cerebrovascular regulation may contribute to the occurrence of vasovagal reactions.

Non-NASA Center↗
NASA NTRS2006

Development of Comprehensive Reduced Kinetic Models for Supersonic Reacting Shear Layer Simulations

Large-scale simulations of multi-dimensional unsteady turbulent reacting flows with detailed chemistry and transport can be computationally extremely intensive even on distributed computing architectures. With the development of suitable reduced chemical kinetic models, the number of scalar variables to be integrated can be decreased, leading to a significant reduction in the computational time required for the simulation with limited loss of accuracy in the results. A general MATLAB-based automated mechanism reduction procedure is presented to reduce any complex starting mechanism (detailed or skeletal) with minimal human intervention. Based on the application of the quasi steady-state (QSS) approximation for certain chemical species and on the elimination of the fast reaction rates in the mechanism, several comprehensive reduced models, capable of handling different fuels such as C2H4, CH4 and H2, have been developed and thoroughly tested for several combustion problems (ignition, propagation and extinction) and physical conditions (reactant compositions, temperatures, and pressures). A key feature of the present reduction procedure is the explicit solution of the concentrations of the QSS species, needed for the evaluation of the elementary reaction rates. In contrast, previous approaches relied on an implicit solution due to the strong coupling between QSS species, requiring computationally expensive inner iterations. A novel algorithm, based on the definition of a QSS species coupling matrix, is presented to (i) introduce appropriate truncations to the QSS algebraic relations and (ii) identify the optimal sequence for the explicit solution of the concentration of the QSS species. With the automatic generation of the relevant source code, the resulting reduced models can be readily implemented into numerical codes.

Zambon, A. C.↗
NASA NTRS2011

Efficient Kriging Algorithms

More efficient versions of an interpolation method, called kriging, have been introduced in order to reduce its traditionally high computational cost. Written in C++, these approaches were tested on both synthetic and real data. Kriging is a best unbiased linear estimator and suitable for interpolation of scattered data points. Kriging has long been used in the geostatistic and mining communities, but is now being researched for use in the image fusion of remotely sensed data. This allows a combination of data from various locations to be used to fill in any missing data from any single location. To arrive at the faster algorithms, sparse SYMMLQ iterative solver, covariance tapering, Fast Multipole Methods (FMM), and nearest neighbor searching techniques were used. These implementations were used when the coefficient matrix in the linear system is symmetric, but not necessarily positive-definite.

Memarsadeghi, Nargess↗
NASA NTRS2005

Algorithm for Identifying Erroneous Rain-Gauge Readings

An algorithm analyzes rain-gauge data to identify statistical outliers that could be deemed to be erroneous readings. Heretofore, analyses of this type have been performed in burdensome manual procedures that have involved subjective judgements. Sometimes, the analyses have included computational assistance for detecting values falling outside of arbitrary limits. The analyses have been performed without statistically valid knowledge of the spatial and temporal variations of precipitation within rain events. In contrast, the present algorithm makes it possible to automate such an analysis, makes the analysis objective, takes account of the spatial distribution of rain gauges in conjunction with the statistical nature of spatial variations in rainfall readings, and minimizes the use of arbitrary criteria. The algorithm implements an iterative process that involves nonparametric statistics.

Rickman, Doug↗
NASA NTRS2018

An Innovative Control Allocation Scheme to Address Reaction Thruster Interactions on a 3U CubeSat

A wealth of literature exists on control allocation algorithms for over-actuated air vehicles, launch vehicles, and spacecraft's. Most of these algorithms focus primarily on minimizing some objective function such as command tracking error and/or control effector usage. Linear allocators (pseudo inverses) are usually the conventional choice due to their simplicity and the ability to achieve a significant portion of the theoretical moment/impulse space. Generally, it is assumed that there exists minimal interaction effects between control effectors. In fact, very few studies address the problem of control effector interactions in the context of control allocation, especially for small spacecraft's with a reaction control system (RCS). This paper presents a CubeSat RCS design with a four thruster tetrahedral layout such that when two or more thrusters re, the resultant impulse differs noticeably compared to the sum of the contributions from individual thruster rings. This undesirable effect is caused by the design of the propellant tank and regulator. To mitigate this issue, an innovative modified pseudo inverse (MPI) control allocation algorithm was developed that adjusts the pseudo inverse solution based on test data. The algorithm is iteration-free and superior to the standard pseudo inverse in minimizing the command tracking error.

Pei, Jing↗
NASA NTRS2019

Terrestrial Single-Station Analog for Constraining the Martian Core and Deep Interior: Implications for InSight

We used a terrestrial single-station seismometer to quantify the uncertainty of InSight (INterior explorations using Seismic Investigations, Geodesy and Heat Transport) data for determining Martian core size. To mimic Martian seismicity, we formed a catalog using 917 terrestrial earthquakes, from which we randomly selected events. We stacked ScS amplitudes on modeled arrival times and searched for where ScS produced coherent seismic amplitudes. A core detection was defined by a coherent peak with small offset between predicted and user-selected arrival times. Iterating the detection algorithm with varying signal-to-noise (SNR) ranges and quantity of events determined the selection frequency of each model and quantified core depth uncertainty. Increasing the quantity of events reduced core depth uncertainty while increasing the recovery rate, while increasing event SNR had little effect. Including ScS2 multiples increased the recovery rate and reduced core depth uncertainty when we used low quantities of events. The most-frequent core depths varied by back azimuth, suggesting our method is sensitive to the presence of mantle heterogeneities. When we added 1° in source distance errors, core depth uncertainty increased by up to 11 km and recovery rates decreased by <5%. Altering epicentral distances by 25% added ~35 km of uncertainty and reduced recovery rates to <50% in some cases. From these experiments, we estimate that if InSight can detect five events with high location precision (<10% epicentral distance errors), that there is at least an 88% chance of core depth recovery using ScS alone with uncertainty in core depth approaching 18 km and decreasing as more events are located.

Marusiak, Angela G.↗
NASA NTRS2019

Terrestrial Single-Station Analog for Constraining the Martian Core and Deep Interior: Implications for InSight

We used a terrestrial single-station seismometer to quantify the uncertainty of InSight (INterior explorations using Seismic Investigations, Geodesy and Heat Transport) data for determining Martian core size. To mimic Martian seismicity, we formed a catalog using 917 terrestrial earthquakes, from which we randomly selected events. We stacked ScS amplitudes on modeled arrival times and searched for where ScS produced coherent seismic amplitudes. A core detection was defined by a coherent peak with small offset between predicted and user-selected arrival times. Iterating the detection algorithm with varying signal-to-noise (SNR) ranges and quantity of events determined the selection frequency of each model and quantified core depth uncertainty. Increasing the quantity of events reduced core depth uncertainty while increasing the recovery rate, while increasing event SNR had little effect. Including ScS2 multiples increased the recovery rate and reduced core depth uncertainty when we used low quantities of events. The most-frequent core depths varied by back azimuth, suggesting our method is sensitive to the presence of mantle heterogeneities. When we added 1° in source distance errors, core depth uncertainty increased by up to 11 km and recovery rates decreased by <5%. Altering epicentral distances by 25% added ~35 km of uncertainty and reduced recovery rates to <50% in some cases. From these experiments, we estimate that if InSight can detect five events with high location precision (< 10% epicentral distance errors), that there is at least an 88% chance of core depth recovery using ScS alone with uncertainty in core depth approaching 18 km and decreasing as more events are located.

Angela G Marusiak↗
NASA NTRSDate not supplied

Machine Learning for Dynamic Test Sensor Placement

There are multiple different algorithms to perform modal test sensor placement optimization: effective independence, residual kinetic energy, iterative Guyan reduction, genetic algorithms, or a brute-force methodology. However, any of these methods may be computationally expensive, especially for structural models with a large number of degrees of freedom. Given the high-cost and the need to optimize the solution, modal sensor placement is a great application for machine learning (ML) algorithms. In this paper, we will apply ML algorithms to determine the optimal sensor locations for simple and complex structures. We will also discuss the benefits and drawbacks of using machine learning over other sensor placement algorithms.

Kelsey Buckles↗
NASA NTRS2009

Fully Automated Detection of Cloud and Aerosol Layers in the CALIPSO Lidar Measurements

Accurate knowledge of the vertical and horizontal extent of clouds and aerosols in the earth s atmosphere is critical in assessing the planet s radiation budget and for advancing human understanding of climate change issues. To retrieve this fundamental information from the elastic backscatter lidar data acquired during the Cloud-Aerosol Lidar and Infrared Pathfinder Satellite Observations (CALIPSO) mission, a selective, iterated boundary location (SIBYL) algorithm has been developed and deployed. SIBYL accomplishes its goals by integrating an adaptive context-sensitive profile scanner into an iterated multiresolution spatial averaging scheme. This paper provides an in-depth overview of the architecture and performance of the SIBYL algorithm. It begins with a brief review of the theory of target detection in noise-contaminated signals, and an enumeration of the practical constraints levied on the retrieval scheme by the design of the lidar hardware, the geometry of a space-based remote sensing platform, and the spatial variability of the measurement targets. Detailed descriptions are then provided for both the adaptive threshold algorithm used to detect features of interest within individual lidar profiles and the fully automated multiresolution averaging engine within which this profile scanner functions. The resulting fusion of profile scanner and averaging engine is specifically designed to optimize the trade-offs between the widely varying signal-to-noise ratio of the measurements and the disparate spatial resolutions of the detection targets. Throughout the paper, specific algorithm performance details are illustrated using examples drawn from the existing CALIPSO dataset. Overall performance is established by comparisons to existing layer height distributions obtained by other airborne and space-based lidars.

Vaughan, Mark A.↗
NASA NTRS1993

A possibilistic approach to clustering

Fuzzy clustering has been shown to be advantageous over crisp (or traditional) clustering methods in that total commitment of a vector to a given class is not required at each image pattern recognition iteration. Recently fuzzy clustering methods have shown spectacular ability to detect not only hypervolume clusters, but also clusters which are actually 'thin shells', i.e., curves and surfaces. Most analytic fuzzy clustering approaches are derived from the 'Fuzzy C-Means' (FCM) algorithm. The FCM uses the probabilistic constraint that the memberships of a data point across classes sum to one. This constraint was used to generate the membership update equations for an iterative algorithm. Recently, we cast the clustering problem into the framework of possibility theory using an approach in which the resulting partition of the data can be interpreted as a possibilistic partition, and the membership values may be interpreted as degrees of possibility of the points belonging to the classes. We show the ability of this approach to detect linear and quartic curves in the presence of considerable noise.

Krishnapuram, Raghu↗
NASA NTRS1992

Possibilistic clustering for shape recognition

Clustering methods have been used extensively in computer vision and pattern recognition. Fuzzy clustering has been shown to be advantageous over crisp (or traditional) clustering in that total commitment of a vector to a given class is not required at each iteration. Recently fuzzy clustering methods have shown spectacular ability to detect not only hypervolume clusters, but also clusters which are actually 'thin shells', i.e., curves and surfaces. Most analytic fuzzy clustering approaches are derived from Bezdek's Fuzzy C-Means (FCM) algorithm. The FCM uses the probabilistic constraint that the memberships of a data point across classes sum to one. This constraint was used to generate the membership update equations for an iterative algorithm. Unfortunately, the memberships resulting from FCM and its derivatives do not correspond to the intuitive concept of degree of belonging, and moreover, the algorithms have considerable trouble in noisy environments. Recently, we cast the clustering problem into the framework of possibility theory. Our approach was radically different from the existing clustering methods in that the resulting partition of the data can be interpreted as a possibilistic partition, and the membership values may be interpreted as degrees of possibility of the points belonging to the classes. We constructed an appropriate objective function whose minimum will characterize a good possibilistic partition of the data, and we derived the membership and prototype update equations from necessary conditions for minimization of our criterion function. In this paper, we show the ability of this approach to detect linear and quartic curves in the presence of considerable noise.

Keller, James M.↗
NASA NTRS1993

Possibilistic clustering for shape recognition

Clustering methods have been used extensively in computer vision and pattern recognition. Fuzzy clustering has been shown to be advantageous over crisp (or traditional) clustering in that total commitment of a vector to a given class is not required at each iteration. Recently fuzzy clustering methods have shown spectacular ability to detect not only hypervolume clusters, but also clusters which are actually 'thin shells', i.e., curves and surfaces. Most analytic fuzzy clustering approaches are derived from Bezdek's Fuzzy C-Means (FCM) algorithm. The FCM uses the probabilistic constraint that the memberships of a data point across classes sum to one. This constraint was used to generate the membership update equations for an iterative algorithm. Unfortunately, the memberships resulting from FCM and its derivatives do not correspond to the intuitive concept of degree of belonging, and moreover, the algorithms have considerable trouble in noisy environments. Recently, the clustering problem was cast into the framework of possibility theory. Our approach was radically different from the existing clustering methods in that the resulting partition of the data can be interpreted as a possibilistic partition, and the membership values may be interpreted as degrees of possibility of the points belonging to the classes. An appropriate objective function whose minimum will characterize a good possibilistic partition of the data was constructed, and the membership and prototype update equations from necessary conditions for minimization of our criterion function were derived. The ability of this approach to detect linear and quartic curves in the presence of considerable noise is shown.

Keller, James M.↗
NASA NTRS1998

Using Approximations to Accelerate Engineering Design Optimization

Optimization problems that arise in engineering design are often characterized by several features that hinder the use of standard nonlinear optimization techniques. Foremost among these features is that the functions used to define the engineering optimization problem often are computationally intensive. Within a standard nonlinear optimization algorithm, the computational expense of evaluating the functions that define the problem would necessarily be incurred for each iteration of the optimization algorithm. Faced with such prohibitive computational costs, an attractive alternative is to make use of surrogates within an optimization context since surrogates can be chosen or constructed so that they are typically much less expensive to compute. For the purposes of this paper, we will focus on the use of algebraic approximations as surrogates for the objective. In this paper we introduce the use of so-called merit functions that explicitly recognize the desirability of improving the current approximation to the objective during the course of the optimization. We define and experiment with the use of merit functions chosen to simultaneously improve both the solution to the optimization problem (the objective) and the quality of the approximation. Our goal is to further improve the effectiveness of our general approach without sacrificing any of its rigor.

Torczon, Virginia↗
NASA NTRS2024

Comparison of Multisine Peak Factor Minimization Algorithms for Aircraft System Identification

Two phase-optimized multisine peak factor minimization algorithms are presented and evaluated. The first algorithm minimizes peak factor by iteratively clipping the peaks of generated multisine signals. The second algorithm optimizes peak factor indirectly through minimization of an approximation of the infinity norm of the multisine. Algorithm performance was evaluated as a function of different signal properties, including the number of harmonics, harmonic spacing, and number of snow harmonics (extra harmonics included for further reduction of the peak factor). The two algorithms are compared against results obtained by minimizing peak factor directly using a simplex algorithm, which has been a common approach when designing phase-optimized multisines for system identification flight tests. Sample results show that the clipping and infinity norm algorithms produced multisine signals with comparable peak factors that were lower than that of the simplex algorithm. However, the clipping algorithm runs an order of magnitude faster than the other two algorithms, which also makes it practical to repeat the algorithm multiple times to achieve even lower peak factors.

system identification↗
NASA NTRSDate not supplied

Comparison of Multisine Peak Factor Minimization Algorithms for Aircraft System Identification(Presentation)

Two phase-optimized multisine peak factor minimization algorithms are presented and evaluated. The first algorithm minimizes peak factor by iteratively clipping the peaks of generated multisine signals. The second algorithm optimizes peak factor indirectly through minimization of an approximation of the infinity norm of the multisine. Algorithm performance was evaluated as a function of different signal properties, including the number of harmonics, harmonic spacing, and number of snow harmonics (extra harmonics included for further reduction of the peak factor). The two algorithms are compared against results obtained by minimizing peak factor directly using a simplex algorithm, which has been a common approach when designing phase-optimized multisines for system identification flight tests. Sample results show that the clipping and infinity norm algorithms produced multisine signals with comparable peak factors that were lower than that of the simplex algorithm. However, the clipping algorithm runs an order of magnitude faster than the other two algorithms, which also makes it practical to repeat the algorithm multiple times to achieve even lower peak factors.

flight test↗
NASA NTRS1985

Variation in efficiency of parallel algorithms

The present study has the objective to investigate some iterative parallel-processor linear equation solving algorithms with respect to efficiency for analyses of typical linear engineering systems. Attention is given to a set of n linear equations, Ku = p, where K = an n x n positive definite, sparsely populated, symmetric matrix, u = an n x 1 vector of unknown responses, and p = an n x 1 vector of prescribed constants. This study is concerned with a hybrid method in which iteration is used to solve the problem, while a direct method is used on the local processor level. Variations in the efficiency of parallel algorithms are explored. Measures of the efficiency are based on computer experiments regarding the algorithms. For all the algorithms, the wall clock time is found to decrease as the number of processors increases.

Hayashi, A.↗
NASA NTRS1970

Rapid method for interconversion of binary and decimal numbers

Decoding tree consisting of 40-bit semiconductor read-only memories interconverts binary and decimal numbers 50 to 100 times faster than current methods. Decimal-to-binary conversion algorithm is based on a divided-by-2 iterative equation, binary-to-decimal conversion algorithm utilizes multiplied-by-2 iterative equation.

Lim, R. S.↗