SEARCH · Engineering Papers

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.

SourceResearch connectionFrom yearThrough year

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

At least 1,549 records · Page 86

All sources NASA NTRS DOE OSTI

NASA NTRS1982

A conservative finite difference algorithm for the unsteady transonic potential equation in generalized coordinates

An implicit, approximate-factorization, finite-difference algorithm has been developed for the computation of unsteady, inviscid transonic flows in two and three dimensions. The computer program solves the full-potential equation in generalized coordinates in conservation-law form in order to properly capture shock-wave position and speed. A body-fitted coordinate system is employed for the simple and accurate treatment of boundary conditions on the body surface. The time-accurate algorithm is modified to a conventional ADI relaxation scheme for steady-state computations. Results from two- and three-dimensional steady and two-dimensional unsteady calculations are compared with existing methods.

Bridgeman, J. O.↗

NASA NTRS1982

An identification algorithm for linear stochastic systems with time delays

Linear discrete stochastic control systems containing unknown multiple time delays, plant parameters and noise variances are considered. An algorithm is established which uses the maximum-likelihood technique to identify the unknown parameters. An estimated likelihood function is evaluated based on the previous parameter estimates, which in turn generates a new descent direction vector to update the unknown parameters. The delays and plant parameters are identified in their respective parameter spaces. An example of a second-order stochastic system has been implemented by digital simulation to demonstrate the applicability of the algorithm.

Leondes, C. T.↗

NASA NTRS1982

On the linearity of the SWP camera of the international ultraviolet explorer /IUE/ - A correction algorithm

An algorithm is presented for correcting IUE low resolution spectral images obtained with the SWP camera for some of the non-linearity effects reported by Bohlin et al. (1980). The non-linearity problem, which affects SWP images processed at Goddard Space Flight Center in the period May 22, 1978 to July 7, 1979 and at VILSPA in the period June 14, 1978 to August 6, 1979, was essentially due to the use of an Intensity Transfer Function (ITF) that erroneously included a blank image in the 20 percent exposure level. The correction algorithm described here was adopted by the three IUE Agencies in November 1979 as being suitable for most IUE users. It has the advantages to be applicable to any kind of low resolution SWP spectra, to introduce errors which are usually less than the intrinsic photometric errors, and to be of simple application. The results obtained by applying the method to a representative set of spectra of both point and extended sources are reported. In addition, a new evaluation of linearity and reproducibility of the SWP spectral data is provided, based on the improved ITF.

Holm, A.↗

NASA NTRS1982

A fast hidden line algorithm for plotting finite element models

Effective plotting of finite element models requires the use of fast hidden line plot techniques that provide interactive response. A high speed hidden line technique was developed to facilitate the plotting of NASTRAN finite element models. Based on testing using 14 different models, the new hidden line algorithm (JONES-D) appears to be very fast: its speed equals that for normal (all lines visible) plotting and when compared to other existing methods it appears to be substantially faster. It also appears to be very reliable: no plot errors were observed using the new method to plot NASTRAN models. The new algorithm was made part of the NPLOT NASTRAN plot package and was used by structural analysts for normal production tasks.

Jones, G. K.↗

NASA NTRS1982

Automated segment matching algorithm-theory, test, and evaluation

Results to automate the U.S. Department of Agriculture's process of segment shifting and obtain results within one-half pixel accuracy are presented. Given an initial registration, the digitized segment is shifted until a more precise fit to the LANDSAT data is found. The algorithm automates the shifting process and performs certain tests for matching and accepting the computed shift numbers. Results indicate the algorithm can obtain results within one-half pixel accuracy.

Kalcic, M. T.↗

NASA NTRS1982

An improved algorithm for evaluating trellis phase codes

A method is described for evaluating the minimum distance parameters of trellis phase codes, including CPFSK, partial response FM, and more importantly, coded CPM (continuous phase modulation) schemes. The algorithm provides dramatically faster execution times and lesser memory requirements than previous algorithms. Results of sample calculations and timing comparisons are included.

Mulligan, M. G.↗

NASA NTRS1983

Efficient Algorithms for Computing Trim and Small-Disturbance Equations of Motion of Aircraft Coordinated and Uncoordinated, Steady, Steep Turns

The development of computational algorithms that permit efficient calculation of aircraft trim states and of the associated small disturbance equations of motion for a systematic investigation of the statics and dynamics of aircraft in coordinated and uncoordinated, steady, steep turning flight is reported. The efficiency in the trim computation is realized by decoupling the governing equations. The small disturbance equations of motion, which are given in a general body axis system, include aerodynamic acceleration derivatives; they are cast in a familiar first order, vector matrix format of modern system theory. These algorithms were applied to a variety of rotorcraft simulation models. Results pertaining to a simulated hingeless rotor helicopter are also presented

Chen, Robert T. N.↗

NASA NTRS1983

Large space structures control algorithm characterization

Feedback control algorithms are developed for sensor/actuator pairs on large space systems. These algorithms have been sized in terms of (1) floating point operation (FLOP) demands; (2) storage for variables; and (3) input/output data flow. FLOP sizing (per control cycle) was done as a function of the number of control states and the number of sensor/actuator pairs. Storage for variables and I/O sizing was done for specific structure examples.

Fogel, E.↗

NASA NTRS1983

Ocean color algorithm for remote sensing of chlorophyll

An algorithm for the remote detection of chlorophyll a in the ocean was tested during a Nantucket Shoals experiment conducted by NASA. A set of Multichannel Ocean Color Sensor (MOCS) data selected from one flight for each of the two altitudes flown was used to calibrate the algorithm for chlorophyll a concentration. The equations were then applied to all unsaturated MOCS data collected during the 8-day experiment to generate contour maps of chlorophyll a concentration over the shoals. One additional flight was conducted away from the shoals both on and off the Continental Shelf. Although no solar elevation or environmental corrections were made to the original conversions, the equations in these tests determined chlorophyll a concentrations to an accuracy better than 1.0 micron g/L despite the fact that the solar elevation varied between 20 deg and 56 deg during the data collection periods of the experiments.

Grew, G. W.↗

NASA NTRS1983

An efficient algorithm for generating random number pairs drawn from a bivariate normal distribution

An efficient algorithm for generating random number pairs from a bivariate normal distribution was developed. Any desired value of the two means, two standard deviations, and correlation coefficient can be selected. Theoretically the technique is exact and in practice its accuracy is limited only by the quality of the uniform distribution random number generator, inaccuracies in computer function evaluation, and arithmetic. A FORTRAN routine was written to check the algorithm and good accuracy was obtained. Some small errors in the correlation coefficient were observed to vary in a surprisingly regular manner. A simple model was developed which explained the qualities aspects of the errors.

Campbell, C. W.↗

NASA NTRS1983

Root Locus Algorithms for Programmable Pocket Calculators

Two algorithms are described which allow the plotting of individual points on a root locus diagram with or without time delay. The development was performed during the design of a continuous phase shifter used in the Baseband Antenna Combiner for the Deep Space Network (DSN). The algorithms, which are expected to be useful in similar DSN efforts, are simple enough to be implemented on a programmable pocket calculator. The coordinates of the open-loop zeros and poles, the gain constant K, and the time delay T are the data inputs.

Wechsler, E. R.↗

NASA NTRS1983

Convergence and stability properties of minimal polynomial and reduced rank extrapolation algorithms

The minimal polynomial and reduced rank extrapolation algorithms are two acceleration of convergence methods for sequences of vectors. In a recent survey these methods were tested and compared with the scalar, vector, topological epsilon algorithms, and were observed to be more efficient than the latter. It was also observed that the two methods have similar convergence properties. The convergence and stability properties of these methods are analyzed and the performance of the acceleration methods when applied to a class of vector sequences that includes those sequences obtained from systems of linear equations by using matrix iterative methods is discussed.

Sidi, A.↗

NASA NTRS1982

Formal convergence characteristics of elliptically constrained incremental Newton-Raphson algorithms

Various aspects of the convergence, uniqueness, and existence properties associated with solutions generated via the elliptically constrained incremental Newton-Raphson (ECINR) algorithm are analyzed. Several theorems are developed, and the formal behavior of the elliptically constrained scheme developed by Padovan (1981) is discussed in detail. Consideration is given to global and local rates of convergence, to the determination of the occurrence of safety zones wherein the algorithm yields inherently convergent results, to formal limitations on the class of functions which the scheme can be applied to solve, and to single and multidimensional formalisms on existence uniqueness and convergence. Special attention is given to functions whose Jacobian matrix exhibit positive, negative, semi and indefinite properties. Several significant advantages of ECINR over the classical INR are mentioned.

Padovan, J.↗

NASA NTRS1982

Modeling and a correlation algorithm for spaceborne SAR signals

A mathematical model of a spaceborne synthetic aperture radar (SAR) response is presented. Thhe associated SAR system performance, in terms of the resolution capability, is also discussed. The analysis of spaceborne SAR target response indicates that the SAR correlation problem is a two-dimensional one with a linear shift-variant response function. A new digital processing algorithm is proposed here in order to realize an economical digital SAR correlation system. The proposed algorithm treats the two-dimensional correlation by a combination of frequency domain fast correlation in the azimuth dimension and a time-domain convolver type of operation in the range dimension. Finally, digitally correlated SEASAT satellite SAR imagery is used in an exemplary sense to validate the SAR response model and the new digital processing technique developed.

Wu, C.↗

NASA NTRS1982

A penalty finite element algorithm for parabolic flow problems

The thin-layer simplification of the two-dimensional Navier-Stokes equations for steady viscous flow are developed using an order of magnitude analysis. A space marching finite element solution algorithm is developed, wherein the first order continuity effects are enforced as a penalty function differential constraint. Numerical results are presented to document accuracy and convergence features of the numerical solution algorithm.

Baker, A. J.↗

NASA NTRS1983

Three-dimensional transonic nacelle/inlet flowfield computations using an efficient approximate factorization algorithm

A highly efficient computer analysis has been developed for predicting transonic nacelle/inlet flowfields. This algorithm can compute the three-dimensional transonic flowfield about axisymmetric or asymmetric nacelle/inlet configurations at zero or nonzero incidence. The flowfield is determined by solving the full-potential equation in conservative form on a body-fitted curvilinear computational mesh. The difference equations are solved using the AF2 approximate factorization scheme. The effects of boundary layer viscous entrainment are approximated in the inviscid algorithm by applying a surface transpiration velocity which is determined from the calculated boundary layer growth. Computed results and correlations with existing methods and experiment are presented to illustrate application of the analysis.

Vadyak, J.↗

NASA NTRS1982

Some critical questions about deterministic and stochastic adaptive control algorithms

The purpose of this informal paper is to discuss certain robustness issues associated with existing adaptive control algorithms. A modeling framework for incorporating high-frequency unknown dynamics in the adaptive control framework is suggested. Possible fundamental limitations of existing adaptive control framework is suggested. Possible fundamental limitations of existing adaptive control algorithms are also discussed, with emphasis upon their closed-loop stability properties in the presence of unmodeled high-frequency dynamics.

Athans, M.↗

NASA NTRS1983

Time controlled descent guidance algorithm for simulation of advanced ATC systems

Concepts and computer algorithms for generating time controlled four dimensional descent trajectories are described. The algorithms were implemented in the air traffic control simulator and used by experienced controllers in studies of advanced air traffic flow management procedures. A time controlled descent trajectory comprises a vector function of time, including position, altitude, and heading, that starts at the initial position of the aircraft and ends at touchdown. The trajectory provides a four dimensional reference path which will cause an aircraft tracking it to touchdown at a predetermined time with a minimum of fuel consumption. The problem of constructing such trajectories is divided into three subproblems involving synthesis of horizontal, vertical, and speed profiles. The horizontal profile is constructed as a sequence of turns and straight lines passing through a specified set of waypoints. The vertical profile consists of a sequence of level flight and constant descent angle segments defined by altitude waypoints. The speed profile is synthesized as a sequence of constant Mach number, constant indicated airspeed, and acceleration/deceleration legs. It is generated by integrating point mass differential equations of motion, which include the thrust and drag models of the aircraft.

Lee, H. Q.↗