Engineering Papers⌕ Search

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.

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

At least 1,459 records · Page 81
All sourcesNASA NTRSDOE OSTI
NASA NTRS1973

Competitive evaluation of failure detection algorithms for strapdown redundant inertial instruments.

Seven algorithms for failure detection, isolation, and correction of strapdown inertial instruments in the dodecahedron configuration are competitively evaluated by means of a digital computer simulation that provides them with identical inputs. Their performance is compared in terms of orientation errors and computer burden. The analytical foundations of the algorithms are presented. The features that are found to contribute to superior performance are use of a definite logical structure, elimination of interaction between failures, different thresholds for first and second failures, use of the 'parity' test signals, and avoidance of iteration loops.

Wilcox, J. C.↗
NASA NTRS1973

A Runge-Kutta Nystrom algorithm.

A Runge-Kutta algorithm of order five is presented for the solution of the initial value problem where the system of ordinary differential equations is of second order and does not contain the first derivative. The algorithm includes the Fehlberg step control procedure.

Bettis, D. G.↗
NASA NTRS1974

A finite element solution algorithm for the Navier-Stokes equations

A finite element solution algorithm is established for the two-dimensional Navier-Stokes equations governing the steady-state kinematics and thermodynamics of a variable viscosity, compressible multiple-species fluid. For an incompressible fluid, the motion may be transient as well. The primitive dependent variables are replaced by a vorticity-streamfunction description valid in domains spanned by rectangular, cylindrical and spherical coordinate systems. Use of derived variables provides a uniformly elliptic partial differential equation description for the Navier-Stokes system, and for which the finite element algorithm is established. Explicit non-linearity is accepted by the theory, since no psuedo-variational principles are employed, and there is no requirement for either computational mesh or solution domain closure regularity. Boundary condition constraints on the normal flux and tangential distribution of all computational variables, as well as velocity, are routinely piecewise enforceable on domain closure segments arbitrarily oriented with respect to a global reference frame.

Baker, A. J.↗
NASA NTRS1974

Computer algorithm for coding gain

Development of a computer algorithm for coding gain for use in an automated communications link design system. Using an empirical formula which defines coding gain as used in space communications engineering, an algorithm is constructed on the basis of available performance data for nonsystematic convolutional encoding with soft-decision (eight-level) Viterbi decoding.

Dodd, E. E.↗
NASA NTRS1974

Square-root algorithm for evaluating mismodeled process noise

As the application of sequential filters has grown, the need has arisen to evaluate the sensitivity of these filters to mismodeling of the random process. A numerically reliable square-root algorithm is developed for calculating the covariances of estimates from a sequential filter which incorrectly models process noise. Mismodeling is restricted to the correlation time and standard deviation of a random process represented as a first-order Gauss-Markov sequence. Using a computer program which employs this algorithm, a sensitivity analysis was performed for several types of earth-based tracking data from an interplanetary spacecraft.

Thornton, C. L.↗
NASA NTRS1974

Sizing of complex structure by the integration of several different optimal design algorithms

Practical design of large-scale structures can be accomplished with the aid of the digital computer by bringing together in one computer program algorithms of nonlinear mathematical programing and optimality criteria with weight-strength and other so-called engineering methods. Applications of this approach to aviation structures are discussed with a detailed description of how the total problem of structural sizing can be broken down into subproblems for best utilization of each algorithm and for efficient organization of the program into iterative loops. Typical results are examined for a number of examples.

Sobieszczanski, J.↗
NASA NTRS1975

A general algorithm for relating ground trajectory distance, elapsed flight time, and aircraft airspeed and its application to 4-D guidance

A general solution using an elliptic integral approximation which relates flight time, aircraft airspeed, and ground distance on straight-line and circular-arc trajectory segments is developed. The solution procedure is applicable to both constant and accelerating aircraft flight. In addition, wind shear including both magnitude and heading change is incorporated in the solution. The solution equations are used in a four-dimensional (4-D) control algorithm where both flight time and final airspeed are specified. The results show that the algorithm converges rapidly and accurately.

Foudriat, E. C.↗
NASA NTRS1975

An algorithm and computer program to locate real zeros of real polynomials

A method for reliably extracting real zeros of real polynomials using an expanded two-point secant and bisection method is formed into an algorithm for a digital computer, and a computer program based on this algorithm is presented. The results obtained with the program show that the proposed method compares favorably with the Laguerre, Newton-Raphson, and Jenkins-Traub methods when the polynomial has all real zeros, and is more efficient when the polynomial has complex zeros.

Hedgley, D. R., Jr.↗
NASA NTRS1976

COMOC: a finite-element algorithm for the Navier-Stokes equations

Finite-element algorithm devised to facilitate solution of two-dimensional Navier-Stokes equations governing kinematics and thermodynamics of variable-viscosity, compressible, multiple-species fluid. Algorithm has been implemented into existing computer program system.

Baker, A. J.↗
NASA NTRS1975

A general algorithm using finite element method for aerodynamic configurations at low speeds

A finite element algorithm for numerical simulation of two-dimensional, incompressible, viscous flows was developed. The Navier-Stokes equations are suitably modelled to facilitate direct solution for the essential flow parameters. A leap-frog time differencing and Galerkin minimization of these model equations yields the finite element algorithm. The finite elements are triangular with bicubic shape functions approximating the solution space. The finite element matrices are unsymmetrically banded to facilitate savings in storage. An unsymmetric L-U decomposition is performed on the finite element matrices to obtain the solution for the boundary value problem.

Balasubramanian, R.↗
NASA NTRS1976

An algorithm for selecting a radiation transport subgrid for ablation and radiation coupled hypersonic viscous shock-layer problems

An algorithm is described for selecting a grid subset for calculating radiative transport. The subset spacing is determined by using the variation in aerothermal properties across the full grid of the shock layer. Results show that a radiation grid subset of 15 to 20 points can be used for viscous-shock layer calculations where approximately 50 grid points are required to define the aerothermal profiles. Results are presented for various planetary entry conditions with and without mass injection to demonstrate both the validity and utility of the algorithm.

Bolz, C. W., Jr.↗
NASA NTRS1976

Computer program for fast Karhunen Loeve transform algorithm

The fast KL transform algorithm was applied for data compression of a set of four ERTS multispectral images and its performance was compared with other techniques previously studied on the same image data. The performance criteria used here are mean square error and signal to noise ratio. The results obtained show a superior performance of the fast KL transform coding algorithm on the data set used with respect to the above stated perfomance criteria. A summary of the results is given in Chapter I and details of comparisons and discussion on conclusions are given in Chapter IV.

Jain, A. K.↗
NASA NTRS1975

An algorithm for optimal single linear feature extraction from several Gaussian pattern classes

A computational algorithm is presented for the extraction of an optimal single linear feature from several Gaussian pattern classes. The algorithm minimizes the increase in the probability of misclassification in the transformed (feature) space. Numerical results on the application of this procedure to the remotely sensed data from the Purdue Cl flight line as well as LANDSAT data are presented. It was found that classification using the optimal single linear feature yielded a value for the probability of misclassification on the order of 30% less than that obtained by using the best single untransformed feature. Also, the optimal single linear feature gave performance results comparable to those obtained by using the two features which maximized the average divergence.

Starks, S. A.↗
NASA NTRS1976

The use of the Winograd matrix multiplication algorithm in digital multispectral processing

The Winograd procedure for matrix multiplication provides a method whereby general matrix products may be computed more efficiently than the normal method. The algorithm and the time savings that can be effected are described. A FORTRAN program is provided which performs a general matrix multiply according to this algorithm. A variation of this procedure that may be used to calculate Gaussian probability density functions is also described. It is shown how a time savings can be effected in this calculation. The extension of this method to other similar calculations should yield similar savings.

Vanrooy, D. L.↗
NASA NTRS1975

A variable-metric algorithm employing linear and quadratic penalties

A variable-metric algorithm is described that uses both linear and quadratic penalty terms for handling nonlinear constraints. Quadratic penalty coefficients are adjusted in a process which maintains a positive-definite matrix of second partial derivatives of the function without generating the large positive eigenvalues which cause zigzagging and slow convergence. The schemes suggested use inferred second-order properties not only in terms of the variable metric of the Davidson-Fletcher-Powell algorithm (or its relatives) but by estimating of second directional derivatives by fitting cubics to various functions along search directions.

Kelley, H. J.↗
NASA NTRS1975

An algorithm for a single machine scheduling problem with sequence dependent setup times and scheduling windows

An enumeration algorithm is presented for solving a scheduling problem similar to the single machine job shop problem with sequence dependent setup times. The scheduling problem differs from the job shop problem in two ways. First, its objective is to select an optimum subset of the available tasks to be performed during a fixed period of time. Secondly, each task scheduled is constrained to occur within its particular scheduling window. The algorithm is currently being used to develop typical observational timelines for a telescope that will be operated in earth orbit. Computational times associated with timeline development are presented.

Moore, J. E.↗
NASA NTRS1975

An algorithm for the space shuttle scheduling problem

The problem of determining launch times for a set of missions is considered. Launch times must satisfy early start time and resource constraints. The investigation reported is concerned with the minimization of the number of missions which are launched after specified late start times. An algorithm is presented which, under certain restrictive assumptions, provides an optimal solution. If the restrictive assumptions are not satisfied, the algorithm may be used to obtain a lower bound on the number of missions flown late.

Fisher, M. L.↗