Search NASA⌕ Search

SEARCH · Search NASA

Results for “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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
NASA NTRS1987

An algorithmic approach to crustal deformation analysis

In recent years the analysis of crustal deformation measurements has become important as a result of current improvements in geodetic methods and an increasing amount of theoretical and observational data provided by several earth sciences. A first-generation data analysis algorithm which combines a priori information with current geodetic measurements was proposed. Relevant methods which can be used in the algorithm were discussed. Prior information is the unifying feature of this algorithm. Some of the problems which may arise through the use of a priori information in the analysis were indicated and preventive measures were demonstrated. The first step in the algorithm is the optimal design of deformation networks. The second step in the algorithm identifies the descriptive model of the deformation field. The final step in the algorithm is the improved estimation of deformation parameters. Although deformation parameters are estimated in the process of model discrimination, they can further be improved by the use of a priori information about them. According to the proposed algorithm this information must first be tested against the estimates calculated using the sample data only. Null-hypothesis testing procedures were developed for this purpose. Six different estimators which employ a priori information were examined. Emphasis was put on the case when the prior information is wrong and analytical expressions for possible improvements under incompatible prior information were derived.

Iz, Huseyin Baki↗
NASA NTRS1988

Mathematical algorithms for approximate reasoning

Most state of the art expert system environments contain a single and often ad hoc strategy for approximate reasoning. Some environments provide facilities to program the approximate reasoning algorithms. However, the next generation of expert systems should have an environment which contain a choice of several mathematical algorithms for approximate reasoning. To meet the need for validatable and verifiable coding, the expert system environment must no longer depend upon ad hoc reasoning techniques but instead must include mathematically rigorous techniques for approximate reasoning. Popular approximate reasoning techniques are reviewed, including: certainty factors, belief measures, Bayesian probabilities, fuzzy logic, and Shafer-Dempster techniques for reasoning. A group of mathematically rigorous algorithms for approximate reasoning are focused on that could form the basis of a next generation expert system environment. These algorithms are based upon the axioms of set theory and probability theory. To separate these algorithms for approximate reasoning various conditions of mutual exclusivity and independence are imposed upon the assertions. Approximate reasoning algorithms presented include: reasoning with statistically independent assertions, reasoning with mutually exclusive assertions, reasoning with assertions that exhibit minimum overlay within the state space, reasoning with assertions that exhibit maximum overlay within the state space (i.e. fuzzy logic), pessimistic reasoning (i.e. worst case analysis), optimistic reasoning (i.e. best case analysis), and reasoning with assertions with absolutely no knowledge of the possible dependency among the assertions. A robust environment for expert system construction should include the two modes of inference: modus ponens and modus tollens. Modus ponens inference is based upon reasoning towards the conclusion in a statement of logical implication, whereas modus tollens inference is based upon reasoning away from the conclusion. These algorithms allow one to reason accurately with uncertain data. The above environment can replicate state-f-the-art expert system environments which provides a continuity between the current expert systems which cannot be validated or verified and future expert systems which should be both validated and verified

Murphy, John H.↗
NASA NTRS1988

A stiffly-stable implicit Runge-Kutta algorithm for CFD applications

A stiffly-stable implicit Runge-Kutta integration algorithm is derived for CFD applications spanning the range of semidiscrete theories. The algorithm family contains the one-step 'theta' algorithms, including backwards Euler and the trapezoidal rule, and provides a versatile framework to identify expressions governing algorithm stability characteristics. Parameters of a Runge-Kutta optimal implicit algorithm, second-order accurate in time and stiffly-stable, are established. This algorithm is implemented within a weak statement finite element semidiscrete formulation for one- and two-dimensional conservation law systems. Numerical results are compared to theta-algorithm solutions, for unsteady quasi-one-dimensional Euler predictions with shocks, and for a specially derived two-dimensional conservation law system modeling the Euler equations.

Baker, A. J.↗
NASA NTRS1989

Investigations into a new algorithm for calculating H infinity optimal controllers

A new algorithm for calculating H (sup infinity) optimal controllers is investigated. The algorithm is significantly simpler than existing approaches and yields much simpler controllers. The design equations are first presented. Special system transformations required to apply the algorithm are then presented. The use of the algorithm with sampled-data systems is outlined in detail. Several constraints on the characteristics of the problem formulation are required for the application of the design equations. The consequences of these constraints are investigated by applying the algorithm to a simplified design for a subsystem of a large space structure ground test facility. The investigation of these constraints is continued by application of the design equations and constraints to an extremely simple tracking problem. The result of these investigations is the development of a frequency dependent weighting strategy that allows realistic control problems to be cast in a form compatible with the new algorithm. Further work is indicated in the area of developing strategies for choosing frequency-dependent weights to achieve specific design goals. The use of the freedom in problem formulation to achieve robustness/performance tradeoffs should also be investigated. It is not clear that the algorithm always leads to simpler controllers. The more restrictive formulation may dictate that frequency-dependent weighting adds to the controller order disproportionately. This effect must also be investigated.

Irwin, R. Dennis↗
NASA NTRS1989

Parallel conjugate gradient algorithms for manipulator dynamic simulation

Parallel conjugate gradient algorithms for the computation of multibody dynamics are developed for the specialized case of a robot manipulator. For an n-dimensional positive-definite linear system, the Classical Conjugate Gradient (CCG) algorithms are guaranteed to converge in n iterations, each with a computation cost of O(n); this leads to a total computational cost of O(n sq) on a serial processor. A conjugate gradient algorithms is presented that provide greater efficiency using a preconditioner, which reduces the number of iterations required, and by exploiting parallelism, which reduces the cost of each iteration. Two Preconditioned Conjugate Gradient (PCG) algorithms are proposed which respectively use a diagonal and a tridiagonal matrix, composed of the diagonal and tridiagonal elements of the mass matrix, as preconditioners. Parallel algorithms are developed to compute the preconditioners and their inversions in O(log sub 2 n) steps using n processors. A parallel algorithm is also presented which, on the same architecture, achieves the computational time of O(log sub 2 n) for each iteration. Simulation results for a seven degree-of-freedom manipulator are presented. Variants of the proposed algorithms are also developed which can be efficiently implemented on the Robot Mathematics Processor (RMP).

Fijany, Amir↗
NASA NTRS1991

A compensatory algorithm for the slow-down effect on constant-time-separation approaches

In seeking methods to improve airport capacity, the question arose as to whether an electronic display could provide information which would enable the pilot to be responsible for self-separation under instrument conditions to allow for the practical implementation of reduced separation, multiple glide path approaches. A time based, closed loop algorithm was developed and simulator validated for in-trail (one aircraft behind the other) approach and landing. The algorithm was designed to reduce the effects of approach speed reduction prior to landing for the trailing aircraft as well as the dispersion of the interarrival times. The operational task for the validation was an instrument approach to landing while following a single lead aircraft on the same approach path. The desired landing separation was 60 seconds for these approaches. An open loop algorithm, previously developed, was used as a basis for comparison. The results showed that relative to the open loop algorithm, the closed loop one could theoretically provide for a 6 pct. increase in runway throughput. Also, the use of the closed loop algorithm did not affect the path tracking performance and pilot comments indicated that the guidance from the closed loop algorithm would be acceptable from an operational standpoint. From these results, it is concluded that by using a time based, closed loop spacing algorithm, precise interarrival time intervals may be achievable with operationally acceptable pilot workload.

Abbott, Terence S.↗
NASA NTRS1989

A parallel algorithm for the eigenvalues and eigenvectors for a general complex matrix

A new parallel Jacobi-like algorithm is developed for computing the eigenvalues of a general complex matrix. Most parallel methods for this parallel typically display only linear convergence. Sequential norm-reducing algorithms also exit and they display quadratic convergence in most cases. The new algorithm is a parallel form of the norm-reducing algorithm due to Eberlein. It is proven that the asymptotic convergence rate of this algorithm is quadratic. Numerical experiments are presented which demonstrate the quadratic convergence of the algorithm and certain situations where the convergence is slow are also identified. The algorithm promises to be very competitive on a variety of parallel architectures.

Shroff, Gautam↗
NASA NTRS1992

A comparison of force control algorithms for robots in contact with flexible environments

In order to perform useful tasks, the robot end-effector must come into contact with its environment. For such tasks, force feedback is frequently used to control the interaction forces. Control of these forces is complicated by the fact that the flexibility of the environment affects the stability of the force control algorithm. Because of the wide variety of different materials present in everyday environments, it is necessary to gain an understanding of how environmental flexibility affects the stability of force control algorithms. This report presents the theory and experimental results of two force control algorithms: Position Accommodation Control and Direct Force Servoing. The implementation of each of these algorithms on a two-arm robotic test bed located in the Center for Intelligent Robotic Systems for Space Exploration (CIRSSE) is discussed in detail. The behavior of each algorithm when contacting materials of different flexibility is experimentally determined. In addition, several robustness improvements to the Direct Force Servoing algorithm are suggested and experimentally verified. Finally, a qualitative comparison of the force control algorithms is provided, along with a description of a general tuning process for each control method.

Wilfinger, Lee S.↗
NASA NTRS1993

On the estimation algorithm for adaptive performance optimization of turbofan engines

The performance seeking control (PSC) algorithm is designed to continuously optimize the performance of propulsion systems. The PSC algorithm uses a nominal propulsion system model and estimates, in flight, the engine deviation parameters (EDPs) characterizing the engine deviations with respect to nominal conditions. In practice, because of measurement biases and/or model uncertainties, the estimated EDPs may not reflect the engine's actual off-nominal condition. This factor has a direct impact on the PSC scheme exacerbated by the open-loop character of the algorithm. In this paper, the effects produced by unknown measurement biases over the estimation algorithm are evaluated. This evaluation allows for identification of the most critical measurements for application of the PSC algorithm to an F100 engine. An equivalence relation between the biases and EDPs stems from the analysis; therefore, it is undecided whether the estimated EDPs represent the actual engine deviation or whether they simply reflect the measurement biases. A new algorithm, based on the engine's (steady-state) optimization model, is proposed and tested with flight data. When compared with previous Kalman filter schemes, based on local engine dynamic models, the new algorithm is easier to design and tune and it reduces the computational burden of the onboard computer.

Espana, Martin D.↗
NASA NTRS1993

Adaptively resizing populations: Algorithm, analysis, and first results

Deciding on an appropriate population size for a given Genetic Algorithm (GA) application can often be critical to the algorithm's success. Too small, and the GA can fall victim to sampling error, affecting the efficacy of its search. Too large, and the GA wastes computational resources. Although advice exists for sizing GA populations, much of this advice involves theoretical aspects that are not accessible to the novice user. An algorithm for adaptively resizing GA populations is suggested. This algorithm is based on recent theoretical developments that relate population size to schema fitness variance. The suggested algorithm is developed theoretically, and simulated with expected value equations. The algorithm is then tested on a problem where population sizing can mislead the GA. The work presented suggests that the population sizing algorithm may be a viable way to eliminate the population sizing decision from the application of GA's.

Smith, Robert E.↗
NASA NTRS1993

Time-domain analysis of planar microstrip devices using a generalized Yee-algorithm based on unstructured grids

The generalized Yee-algorithm is presented for the temporal full-wave analysis of planar microstrip devices. This algorithm has the significant advantage over the traditional Yee-algorithm in that it is based on unstructured and irregular grids. The robustness of the generalized Yee-algorithm is that structures that contain curved conductors or complex three-dimensional geometries can be more accurately, and much more conveniently modeled using standard automatic grid generation techniques. This generalized Yee-algorithm is based on the the time-marching solution of the discrete form of Maxwell's equations in their integral form. To this end, the electric and magnetic fields are discretized over a dual, irregular, and unstructured grid. The primary grid is assumed to be composed of general fitted polyhedra distributed throughout the volume. The secondary grid (or dual grid) is built up of the closed polyhedra whose edges connect the centroid's of adjacent primary cells, penetrating shared faces. Faraday's law and Ampere's law are used to update the fields normal to the primary and secondary grid faces, respectively. Subsequently, a correction scheme is introduced to project the normal fields onto the grid edges. It is shown that this scheme is stable, maintains second-order accuracy, and preserves the divergenceless nature of the flux densities. Finally, for computational efficiency the algorithm is structured as a series of sparse matrix-vector multiplications. Based on this scheme, the generalized Yee-algorithm has been implemented on vector and parallel high performance computers in a highly efficient manner.

Gedney, Stephen D.↗
NASA NTRS1993

On the estimation algorithm used in adaptive performance optimization of turbofan engines

The performance seeking control algorithm is designed to continuously optimize the performance of propulsion systems. The performance seeking control algorithm uses a nominal model of the propulsion system and estimates, in flight, the engine deviation parameters characterizing the engine deviations with respect to nominal conditions. In practice, because of measurement biases and/or model uncertainties, the estimated engine deviation parameters may not reflect the engine's actual off-nominal condition. This factor has a necessary impact on the overall performance seeking control scheme exacerbated by the open-loop character of the algorithm. The effects produced by unknown measurement biases over the estimation algorithm are evaluated. This evaluation allows for identification of the most critical measurements for application of the performance seeking control algorithm to an F100 engine. An equivalence relation between the biases and engine deviation parameters stems from an observability study; therefore, it is undecided whether the estimated engine deviation parameters represent the actual engine deviation or whether they simply reflect the measurement biases. A new algorithm, based on the engine's (steady-state) optimization model, is proposed and tested with flight data. When compared with previous Kalman filter schemes, based on local engine dynamic models, the new algorithm is easier to design and tune and it reduces the computational burden of the onboard computer.

Espana, Martin D.↗
NASA NTRS1993

Parallel algorithm for dominant points correspondences in robot binocular stereo vision

This paper presents an algorithm to find the correspondences of points representing dominant feature in robot stereo vision. The algorithm consists of two main steps: dominant point extraction and dominant point matching. In the feature extraction phase, the algorithm utilizes the widely used Moravec Interest Operator and two other operators: the Prewitt Operator and a new operator called Gradient Angle Variance Operator. The Interest Operator in the Moravec algorithm was used to exclude featureless areas and simple edges which are oriented in the vertical, horizontal, and two diagonals. It was incorrectly detecting points on edges which are not on the four main directions (vertical, horizontal, and two diagonals). The new algorithm uses the Prewitt operator to exclude featureless areas, so that the Interest Operator is applied only on the edges to exclude simple edges and to leave interesting points. This modification speeds-up the extraction process by approximately 5 times. The Gradient Angle Variance (GAV), an operator which calculates the variance of the gradient angle in a window around the point under concern, is then applied on the interesting points to exclude the redundant ones and leave the actual dominant ones. The matching phase is performed after the extraction of the dominant points in both stereo images. The matching starts with dominant points in the left image and does a local search, looking for corresponding dominant points in the right image. The search is geometrically constrained the epipolar line of the parallel-axes stereo geometry and the maximum disparity of the application environment. If one dominant point in the right image lies in the search areas, then it is the corresponding point of the reference dominant point in the left image. A parameter provided by the GAV is thresholded and used as a rough similarity measure to select the corresponding dominant point if there is more than one point the search area. The correlation is used as a final decision tool when there is still more than one point in the search area. If there is no dominant point in the search area of if the points in the search area are below a correlation threshold, then the dominant point in the reference image is occluded and can not be corresponded. The algorithm has been modeled, implemented and shown to be fast, robust and parallel. The parallelism is created from three main features: locality of the operators; a memory optimization scheme; and the ability to fully parallelize the extraction phase which is the most computational intensive task in the algorithm. The last feature is achieved by performing the extraction phase on the two images simultaneously.

Al-Tammami, A.↗
NASA NTRS1994

A real-time algorithm for integrating differential satellite and inertial navigation information during helicopter approach

A real-time, high-rate precision navigation Kalman filter algorithm is developed and analyzed. This Navigation algorithm blends various navigation data collected during terminal area approach of an instrumented helicopter. Navigation data collected include helicopter position and velocity from a global position system in differential mode (DGPS) as well as helicopter velocity and attitude from an inertial navigation system (INS). The goal of the Navigation algorithm is to increase the DGPS accuracy while producing navigational data at the 64 Hertz INS update rate. It is important to note that while the data was post flight processed, the Navigation algorithm was designed for real-time analysis. The design of the Navigation algorithm resulted in a nine-state Kalman filter. The Kalman filter's state matrix contains position, velocity, and velocity bias components. The filter updates positional readings with DGPS position, INS velocity, and velocity bias information. In addition, the filter incorporates a sporadic data rejection scheme. This relatively simple model met and exceeded the ten meter absolute positional requirement. The Navigation algorithm results were compared with truth data derived from a laser tracker. The helicopter flight profile included terminal glideslope angles of 3, 6, and 9 degrees. Two flight segments extracted during each terminal approach were used to evaluate the Navigation algorithm. The first segment recorded small dynamic maneuver in the lateral plane while motion in the vertical plane was recorded by the second segment. The longitudinal, lateral, and vertical averaged positional accuracies for all three glideslope approaches are as follows (mean plus or minus two standard deviations in meters): longitudinal (-0.03 plus or minus 1.41), lateral (-1.29 plus or minus 2.36), and vertical (-0.76 plus or minus 2.05).

Hoang, TY↗
NASA NTRS1995

SeaWiFS Technical Report Series. Volume 29: SeaWiFS CZCS-type pigment algorithm

The Sea-viewing Wide Field-of-view Sensor (SeaWiFS) mission will provide operational ocean color that will be superior to the previous Coastal Zone Color Sensor (CZCS) proof-of-concept mission. an algorithm is needed that exploits the full functionality of SeaWiFS whilst remaining compatible in concept with algorithms used for the CZCS. This document describes the theoretical rationale of radiance band-radio methods for determining chlorophyll alpha and other important biogeochemical parameters, and their implementation for the SeaWiFS mission. Pigment interrelationships are examined to explain the success of the CZCS algorithms. In the context where chlorophyll alpha absorbs only weakly at 520 nm, the success of the 520 nm to 550 nm CZCS band ratio needs to be explained. This is explained by showing that in pigment data from a range of oceanic provinces chlorophyll alpha (absorbing at less than 490 nm), carotenoids (absorbing at greater than 460 nm), and total pigment are highly correlated. Correlations within pigment groups particularly photoprotectant and photosynthetic carotenoids are less robust. The sources of variability in optical data re examined using the NIMBUS Experiment Team (NET) bio-optical data set and bio-optical model. In both the model and NET data, the majority of the variance in the optical data is attributed to variability in pigment (chlorophyll alpha, and total particulates, with less than 5% of the variability resulting from pigment assemblage. The relationships between band ratios and chlorophyll is examined analytically, and a new formulation based on a dual hyperbolic model is suggested which gives a better calibration curve than the conventional log-log linear regression fit. The new calibration curve shows that 490:555 ratio is the best single-band ratio and is the recommended CZCS-type pigment algorithm. Using both the model and NET data, a number of multiband algorithms are developed; the best of which is an algorithm based on the 443:555 and 490:555 ratios. From model data, the form of potential algorithms for other products, such as total particulates and dissolved organic matter (DOM), are suggested.

Hooker, Stanford B.↗
NASA NTRS1995

Evaluation of passive microwave precipitation algorithms in wintertime midlatitude situations

The second intercomparison project of the Global Precipitation Climatology Project (GPCP) examined the estimation of midlatitude, cool-season precipitation. As part of that effort, the authors report here on the results of two microwave techniques, the Goddard scattering algorithm and the physical retrieval algorithm of Kummerow. Results from the estimation of instantaneous rain rate for five overpasses of the Special Sensor Microwave/Imager (SSM/I) are presented in a case study mode to illustrate both the strong and weak points of each technique. These five cases represent a sampling of the various types of precipitating systems observed. Results for the complete set of 20 swaths chosen by the United Kingdom Meteorological Office (UKMO) are then categorized by scatterplots and statistics of instantaneous radar versus microwave-estimated rain rate, rain no-rain contingency tables, and scatterplots of areal coverage of rainfall. Neither algorithm produced a good statistical correlation with the radar data, yet in general, both did well at determining rainy areas. Two reasons are suggested for the low correlation coefficients between both algorithms and the radar data. Time differences between the SSM/I overpass and the radar observations can occasionally account for some of the differences. The primary reason for the low correlations, however, appears to be the predominance of very light rain in the area of interest during the winter. Both algorithms are in good spatial agreement with the radar when the radar data are restricted to rates above 1 mm/h. When all radar rain rates are included, the radar areal coverage increases by as much as a factor of 10 in some cases. Because the Kummerow algorithm does not handle such low rain rates over land very well, and because the Goddard scattering algorithm uses 1 mm/h as the minimum reliably detectable rain rate, regimes that contain large areas of very light rain present inherent difficulties for these retrieval methods. Therefore, the proliferation of low rain rates observed during the experiment is the main contributor to low correlation coefficients and high root-mean-square differences. Mididentification of cold surface (e.g., snow cover) as precipitation was also a problem in several instances.

Negri, Andrew J.↗
NASA NTRS1994

Comparison of trend analyses for Umkehr data using new and previous inversion algorithms

Ozone vertical profile Umkehr data for layers 3-9 obtained from 12 stations, using both previous and new inversion algorithms, were analyzed for trends. The trends estimated for the Umkehr data from the two algorithms were compared using two data periods, 1968-1991 and 1977-1991. Both nonseasonal and seasonal trend models were fitted. The overall annual trends are found to be significantly negative, of the order of -5% per decade, for layers 7 and 8 using both inversion algorithms. The largest negative trends occur in these layers under the new algorithm, whereas in the previous algorithm the most negative trend occurs in layer 9. The trend estimates, both annual and seasonal, are substantially different between the two algorithms mainly for layers 3, 4, and 9, where trends from the new algorithm data are about 2% per decade less negative, with less appreciable differences in layers 7 and 8. The trend results from the two data periods are similar, except for layer 3 where trends become more negative, by about -2% per decade, for 1977-1991.

Reinsel, Gregory C.↗
NASA NTRS1984

Phase 2 development of Great Lakes algorithms for Nimbus-7 coastal zone color scanner

A series of experiments have been conducted in the Great Lakes designed to evaluate the application of the NIMBUS-7 Coastal Zone Color Scanner (CZCS). Atmospheric and water optical models were used to relate surface and subsurface measurements to satellite measured radiances. Absorption and scattering measurements were reduced to obtain a preliminary optical model for the Great Lakes. Algorithms were developed for geometric correction, correction for Rayleigh and aerosol path radiance, and prediction of chlorophyll-a pigment and suspended mineral concentrations. The atmospheric algorithm developed compared favorably with existing algorithms and was the only algorithm found to adequately predict the radiance variations in the 670 nm band. The atmospheric correction algorithm developed was designed to extract needed algorithm parameters from the CZCS radiance values. The Gordon/NOAA ocean algorithms could not be demonstrated to work for Great Lakes waters. Predicted values of chlorophyll-a concentration compared favorably with expected and measured data for several areas of the Great Lakes.

Tanis, Fred J.↗