Search NASA⌕ Search

SEARCH · Search NASA

Results for “Algorithm”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,171 records · Page 65

Analysis of adaptive algorithms for an integrated communication network

Techniques were examined that trade communication bandwidth for decreased transmission delays. When the network is lightly used, these schemes attempt to use additional network resources to decrease communication delays. As the network utilization rises, the schemes degrade gracefully, still providing service but with minimal use of the network. Because the schemes use a combination of circuit and packet switching, they should respond to variations in the types and amounts of network traffic. Also, a combination of circuit and packet switching to support the widely varying traffic demands imposed on an integrated network was investigated. The packet switched component is best suited to bursty traffic where some delays in delivery are acceptable. The circuit switched component is reserved for traffic that must meet real time constraints. Selected packet routing algorithms that might be used in an integrated network were simulated. An integrated traffic places widely varying workload demands on a network. Adaptive algorithms were identified, ones that respond to both the transient and evolutionary changes that arise in integrated networks. A new algorithm was developed, hybrid weighted routing, that adapts to workload changes.

Reed, Daniel A.↗

Formulation and implementation of a practical algorithm for non-stationary adaptive state estimation

Background information on the Kalman filter is given first. A discussion of the filter parameters and their a priori determination follows. The discussion points out the need for adaptive determination of the process noise statistics. The filter innovations are presented as a means for developing the adaptive criteria. The criteria center around the estimation of the true mean and covariance of the filter innovations. A method for the numerical approximation of the mean and covariance of a locally stationary random process is presented. The definition of a local stationarity is presented. Local stationarity allows for the separation of the process statistics into a stationary component and a time-varying component. The separation method is discussed. A method for estimating the stationary and time-varying components is presented. As an example of its application to real problems, the algorithm is applied to the problem to the problem of reentry trajectory estimation for the Space Shuttle. Both the adaptive algorithm and the steady-state Kalman filter are applied to the problem. The results of the reconstructions are presented. The adaptive algorithm exhibits superior performance.

Whitemore, S. A.↗

A real-time simulation evaluation of an advanced detection, isolation and accommodation algorithm for sensor failures in turbine engines

An advanced sensor failure detection, isolation, and accommodation (ADIA) algorithm has been developed for use with an aircraft turbofan engine control system. In a previous paper the authors described the ADIA algorithm and its real-time implementation. Subsequent improvements made to the algorithm and implementation are discussed, and the results of an evaluation presented. The evaluation used a real-time, hybrid computer simulation of an F100 turbofan engine.

Merrill, W. C.↗

Primal and dual formulations of sequential gradient-restoration algorithms for trajectory optimization problems

One of the most effective first-order algorithms for solving trajectory optimization problems is the sequential gradient-restoration algorithm (SGRA). Originally developed in the primal formulation, this algorithm is extended to incorporate a dual formulation. Both the primal formulation and the dual formulation involve a sequence of two-phase cycles, each cycle including a gradient phase and a restoration phase. In turn, each iteration of the gradient phase and the restoration phase requires the solution of an auxiliary minimization problem (AMP). In the primal formulation, the AMP is solved with respect to the variations of the state, the control, and the parameter. In the dual formulation, the AMP is solved with respect to the Lagrange multipliers. A characteristic of the dual formulation is that the AMPs associated with the gradient phase and the restoration phase of SGRA can be reduced to mathematical programming problems involving a finite number of parameters as unknowns. A comparison of the primal formulation and the dual formulation is presented. The comparison is done in terms of several trajectory optimization problems having current aerospace interest.

Miele, A.↗

Optical implementation of an iterative algorithm for matrix inversion

The incorporation of a photorefractive gain element into a confocal Fabry-Perot processor, with a photorefractive BaTiO3 crystal in the feedback path providing the coherent image amplification, is discussed. The implementation of an iterative algorithm for matrix inversion is described, and its experimental implementation is demonstrated. It is shown that the BaTiO3 amplifier provides loss compensation and coherence restoration of the feedback signal, thereby increasing the effective number of iterations in the algorithm. Thus, the technique makes it possible to implement slowly converging (as well as rapidly converging) algorithms.

Rajbenbach, Henri↗

Numerical advection algorithms and their role in atmospheric transport and chemistry models

During the last 35 years, well over 100 algorithms for modeling advection processes have been described and tested. This review summarizes the development and improvements that have taken place. The nature of the errors caused by numerical approximation to the advection equation are highlighted. Then the particular devices that have been proposed to remedy these errors are discussed. The extensive literature comparing transport algorithms is reviewed. Although there is no clear cut 'best' algorithm, several conclusions can be made. Spectral and pseudospectral techniques consistently provide the highest degree of accuracy, but expense and difficulties assuring positive mixing ratios are serious drawbacks. Schemes which consider fluid slabs bounded by grid points (volume schemes), rather than the simple specification of constituent values at the grid points, provide accurate positive definite results.

Rood, Richard B.↗

Fast algorithm for calculating chemical kinetics in turbulent reacting flow

This paper addresses the need for a fast batch chemistry solver to perform the kinetics part of a split operator formulation of turbulent reacting flows, with special attention focused on the solution of the ordinary differential equations governing a homogeneous gas-phase chemical reaction. For this purpose, a two-part predictor-corrector algorithm which incorporates an exponentially fitted trapezoidal method was developed. The algorithm performs filtering of ill-posed initial conditions, automatic step-size selection, and automatic selection of Jacobi-Newton or Newton-Raphson iteration for convergence to achieve maximum computational efficiency while observing a prescribed error tolerance. The new algorithm, termed CREK1D (combustion reaction kinetics, one-dimensional), compared favorably with the code LSODE when tested on two representative problems drawn from combustion kinetics, and is faster than LSODE.

Radhakrishnan, K.↗

A new algorithm for the Navier-Stokes equations applied to transonic flows over wings

A new algorithm has been developed for the Navier-Stokes equations. For the convective terms, this algorithm employs flux vector splitting together with a locally rotated coordinate system that is aligned with the streamwise direction. The algorithm has been implemented into a Navier-Stokes code, the NASA Ames Research Center's TNS code, and several cases of steady flow have been calculated. The results show improvements over the original method in the code. First, in a case of separated flow, there is better agreement with the experimental results and also there is an absence of numerical oscillations that occur with the original method. Second, in a case with a strong supersonic to subsonic shock wave, comparisons show an improvement in the resolution of the shock wave and the reexpansion singularity.

Goorjian, Peter M.↗

An algorithm for obtaining bang-bang control laws

A new computational method for solving control problems, when it is desired that the control action be bang-bang is presented. A gradient-based algorithm is developed where the switching times are updated to minimize the final state missed distance. The algorithm explains how a change in a switching time propagates through the other switching times and affects the final state. The algorithm is applicable to linear and nonlinear problems, including multiinput systems.

Wen, J.↗

An implicit flux-split algorithm to calculate hypersonic flowfields in chemical equilibrium

An implicit, finite-difference, shock-capturing algorithm that calculates inviscid, hypersonic flows in chemical equilibrium is presented. The flux vectors and flux Jacobians are differenced using a first-order, flux-split technique. The equilibrium composition of the gas is determined by minimizing the Gibbs free energy at every node point. The code is validated by comparing results over an axisymmetric hemisphere against previously published results. The algorithm is also applied to more practical configurations. The accuracy, stability, and versatility of the algorithm have been promising.

Palmer, Grant↗

Coastal Zone Color Scanner atmospheric correction algorithm - Multiple scattering effects

Errors due to multiple scattering which are expected to be encountered in application of the current Coastal Zone Color Scanner (CZCS) atmospheric correction algorithm are analyzed. The analysis is based on radiative transfer computations in model atmospheres, in which the aerosols and molecules are distributed vertically in an exponential manner, with most of the aerosol scattering located below the molecular scattering. A unique feature of the analysis is that it is carried out in scan coordinates rather than typical earth-sun coordinates, making it possible to determine the errors along typical CZCS scan lines. Information provided by the analysis makes it possible to judge the efficacy of the current algorithm with the current sensor and to estimate the impact of the algorithm-induced errors on a variety of applications.

Gordon, Howard R.↗

Full-scale engine demonstration of an advanced sensor failure detection isolation, and accommodation algorithm - Preliminary results

The objective of the advanced detection, isolation, and accommodation (ADIA) program is to improve the overall demonstrated reliability of digital electronic control systems for turbine engines. For this purpose, algorithms were developed which detect, isolate, and accommodate sensor failures using analytical redundancy. Preliminary results of a full scale engine demonstration of the ADIA algorithm are presented. Minimum detectable levels of sensor failures for an F100 turbofan engine control system are determined and compared to those obtained during a previous evaluation of this algorithm using a real-time hybrid computer simulation of the engine.

Merrill, Walter C.↗

A piloted simulator evaluation of a ground-based 4D descent advisor algorithm

A ground-based, four-dimensional (4D) descent-advisor algorithm is under development at NASA Ames Research Center. The algorithm combines detailed aerodynamic, propulsive, and atmospheric models with an efficient numerical integration scheme to generate 4D descent advisories. This paper investigates the ability of the 4D descent advisor algorithm to provide adequate control of arrival time for aircraft not equipped with on-board 4D guidance systems. A piloted simulation was conducted to determine the precision with which the descent advisor could predict the 4D trajectories of typical straight-in descents flown by airline pilots under different wind conditions. The effects of errors in the estimation of wind and initial aircraft weight were also studied. A description of the descent advisor as well as the results of the simulation studies are presented.

Green, Steven M.↗

A covariance analysis algorithm for interconnected systems

A covariance analysis algorithm for propagation of signal statistics in arbitrarily interconnected nonlinear systems is presented which is applied to six-degree-of-freedom systems. The algorithm uses statistical linearization theory to linearize the nonlinear subsystems, and the resulting linearized subsystems are considered in the original interconnection framework for propagation of the signal statistics. Some nonlinearities commonly encountered in six-degree-of-freedom space-vehicle models are referred to in order to illustrate the limitations of this method, along with problems not encountered in standard deterministic simulation analysis. Moreover, the performance of the algorithm shall be numerically exhibited by comparing results using such techniques to Monte Carlo analysis results, both applied to a simple two-dimensional space-intercept problem.

Cheng, Victor H. L.↗

Conceptual Spacecraft-Guidance Algorithm

Required weight of spacecraft minimized. Report describes conceptual algorithm for guidance of spacecraft launched from surface of Mars. Spacecraft to carry canister of specimens from surface to another spacecraft in orbit about Mars; second spacecraft then to carry canister back to Earth. Algorithm sufficiently general to be adaptable to prediction/correction algorithms for other spacecraft configurations.

Mccormick, Bernell R.↗

Concurrent algorithms for transient nonlinear FE analysis

A two-parameter class of time-stepping algorithms for nonlinear structural dynamics is investigated. What sets the present method apart from other concurrent algorithms is the fact that it can be used to some advantage in sequential machines as well. Thus, substantial speed-ups are obtained on a single processor as the number of subdomains is increased. An additional O(p) speed-up is obtained when p processors are utilized. The test case discussed is being repeated for a mesh comprising four times as many elements, in an effort to understand how the large scale asymptotic speed-ups are attained. A three dimensional example involving finite deformations and free body motions is also being pursued. A code optimized for concurrency in the Alliant FX8 computer is being finalized. This will provide the means for testing the performance of the algorithm in a multiprocessor environment.

Ortiz, M.↗