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,513 records · Page 84

An algorithm for obtaining the minimal realization of a linear time-invariant system and determining if a system is stabilizable-detectable

A definition of centralized fixed modes of a system, which is an adoption of the definition of fixed modes for a decentralized system is made. It is shown that the centralized fixed modes of a system can be easily and efficiently calculated in terms of the eigenvalues of the system, and that the calculation of such fixed modes enables one to determine, in a numerically efficient way, whether a system is controllable, observable, stabilizable, or detectable. An efficient algorithm for reducing a system to minimal realization form is then given. The algorithms have been effectively used on systems of order up to 100.

Davison, E. J.↗

A numerical solution algorithm for prediction of turbulent aerodynamic corner flows

A numerical solution algorithm is established for prediction of subsonic turbulent three-dimensional flows in aerodynamic configuration juncture regions. In concert with a complete three-dimensional exterior potential flow solution, the developed parabolic algorithm yields prediction of the details of the corner region flowfield. Turbulence closure is established using the complete Reynolds stress. Pressure coupling is accomplished using the concepts of complementary and particular solutions to a Poisson equation. Numerical results for three-dimensional turbulent flow in the juncture of two intersecting parabolic arc airfoils are presented.

Baker, A. J.↗

Evaluation of improved algorithms for nonlinear transient structural heat transfer

The paper presents the evaluation of algorithms having potential for reducing computer time to integrate large systems of equations governing nonlinear transient heat transfer in complex structures. A series of test problems is being developed to test two algorithms. The Shuttle Orbiter frame model having 190 nodes was the subject of an analytical/experimental study. Plans are to perform calculations for the complete wing model having about 4000 nodes as well as a regional (plug) model having about 200 nodes.

Adelman, H. M.↗

Utility of a finite element solution algorithm for initial-value problems

The Galerkin criterion within a finite element Weighted Residuals formulation is employed to establish an implicit solution algorithm for an initial-value partial differential equation. Numerical solutions of a transient parabolic and a hyperbolic equation, obtained using linear, quadratic and two cubic finite element basis functions, are employed to quantize accuracy and confirm and refine theoretical convergence rate estimates. The linear basis algorithm for the hyperbolic equation displays excellent accuracy on a coarse computational grid and a high-order convergence rate with discretization refinement. Good accuracy and a strong convergence rate in surface flux are determined for a nonhomogeneous Neumann boundary constraint applied to a parabolic equation. The results amply demonstrate the impact of the nondiagonal finite element initial-value matrix structure on solution accuracy and/or convergence rate.

Baker, A. J.↗

Algorithm for constructing the programmed motion of a bounding vehicle for the flight phase

The construction of the programmed motion of a multileg bounding vehicle in the flight was studied. An algorithm is given for solving the boundary value problem for constructing this programmed motion. If the motion is shown to be symmetrical, a simplified use of the algorithm can be applied. A method is proposed for nonimpact of the legs during lift-off of the vehicle, and for softness at touchdown. Tables are utilized to construct this programmed motion over a broad set of standard motion conditions.

Lapshin, V. V.↗

Clustering algorithm evaluation and the development of a replacement for procedure 1

An efficient procedure which clusters data using a completely unsupervised clustering algorithm and then uses labeled pixels to label the resulting clusters or perform a stratified estimate using the clusters as strata is developed. Three clustering algorithms, CLASSY, AMOEBA, and ISOCLS, are compared for efficiency. Three stratified estimation schemes and three labeling schemes are also considered and compared.

Lennington, R. K.↗

CLASSY: An adaptive maximum likelihood clustering algorithm

The CLASSY clustering method alternates maximum likelihood iterative techniques for estimating the parameters of a mixture distribution with an adaptive procedure for splitting, combining, and eliminating the resultant components of the mixture. The adaptive procedure is based on maximizing the fit of a mixture of multivariate normal distributions to the observed data using its first through fourth central moments. It generates estimates of the number of multivariate normal components in the mixture as well as the proportion, mean vector, and covariance matrix for each component. The basic mathematical model for CLASSY and the actual operation of the algorithm as currently implemented are described. Results of applying CLASSY to real and simulated LANDSAT data are presented and compared with those generated by the iterative self-organizing clustering system algorithm on the same data sets.

Lennington, R. K.↗

IUS guidance algorithm gamma guide assessment

The Gamma Guidance Algorithm which controls the inertial upper stage is described. The results of an independent assessment of the algorithm's performance in satisfying the NASA missions' targeting objectives are presented. The results of a launch window analysis for a Galileo mission, and suggested improvements are included.

Bray, R. E.↗

A fast, space-efficient average-case algorithm for the 'Greedy' Triangulation of a point set, and a proof that the Greedy Triangulation is not approximately optimal

The paper addresses the problem of how to find the Greedy Triangulation (GT) efficiently in the average case. It is noted that the problem is open whether there exists an efficient approximation algorithm to the Optimum Triangulation. It is first shown how in the worst case, the GT may be obtained in time O(n to the 3) and space O(n). Attention is then given to how the algorithm may be slightly modified to produce a time O(n to the 2), space O(n) solution in the average case. Finally, it is mentioned that Gilbert has found a worst case solution using totally different techniques that require space O(n to the 2) and time O(n to the 2 log n).

Manacher, G. K.↗

A fast semi-implicit algorithm for problems of mixed type

Certain physical processes are modeled by partial differential equations which are parabolic over part of the domain and elliptic over the remainder. A family of semi-implicit algorithms which are well suited to initial-boundary value problems of this mixed type is discussed. One important feature of these algorithms is the use of an approximate inverse for the solution of the implicit linear system. A strong error analysis results in an estimate of the total error as a function of approximate inverse error e and time step h.

Frederickson, P. O.↗

Seasat altimeter sensor file algorithms

The Seasat altimeter is designed to measure three parameters important to oceanography: height of the spacecraft above the ocean surface, significant wave height, and ocean backscatter coefficient from which surface winds may be inferred. Since the measurement process is indirect, and the measurement environment is complicated by many factors affecting the instrument readings, corrections to the raw data are needed before they are used to compute geophysical parameters. These corrections are accomplished by the Seasat altimeter sensor file algorithms. The purpose of this paper is to describe these algorithms, why they are needed, how they are implemented, and the evaluation using in-flight data.

Hancock, D. W.↗

The Seasat scanning multichannel microwave radiometer /SMMR/ - Radiometric calibration algorithm development and performance

Radiometric calibration algorithms for processing Seasat scanning multichannel microwave radiometer (SMMR) flight data are presented. An equation is derived which accounts for losses and reradiation in the microwave components and nonlinearities in the radiometer. The application of pre-launch calibration data to this derivation is described. A performance evaluation of the post-launch operation of the algorithm is presented, indicating temperature resolution of 0.63 K at 6.6 GHz and 1.39 K at 37 GHz.

Swanson, P. N.↗

Accuracies of three computationally efficient algorithms for computing atmospheric transmittances

Three algorithms for calculating polychromatic atmospheric transmittance functions have been tested using a set of eleven distinct temperature profiles in order to compare transmittance accuracies achievable by the three methods. The comparison of rms errors demonstrates that the iterative method of McMillin and Fleming (1976) is the most accurate of the efficient algorithms currently available for gases with constant mixing ratios; its accuracy approaches that of the spectroscopic parameters and the computational approximations used in the ground-truth line-by-line calculations. The method of Arking et al. (1974), while less accurate, has the advantage of being perfectly general and easily adapted to cases where spectral bandwidths are varied

Mcmillin, L. M.↗

Experience with an adaptive stick-gain algorithm to reduce pilot-induced-oscillation tendencies

As part of a program to improve the approach and landing characteristics of the Space Shuttle, the NASA Dryden Flight Research Center has developed an adaptive algorithm that varies the longitudinal stick gearing to reduce the Shuttle's tendency for pilot-induced oscillation (PIO). This paper describes the algorithm, which is known as the PIO suppressor, and discusses some of the tradeoffs involved in optimizing the system. The results of fixed-base, moving-base, and in-flight simulations of the PIO suppressor are presented.

Powers, B. G.↗

A conservative implicit finite difference algorithm for the unsteady transonic full potential equation

An implicit finite difference procedure is developed to solve the unsteady full potential equation in conservation law form. Computational efficiency is maintained by use of approximate factorization techniques. The numerical algorithm is first order in time and second order in space. A circulation model and difference equations are developed for lifting airfoils in unsteady flow; however, thin airfoil body boundary conditions have been used with stretching functions to simplify the development of the numerical algorithm.

Steger, J. L.↗

A two dimensional mesh verification algorithm

A two dimensional mesh verification algorithm is discussed which assumes that a finite element mesh is represented in a program by lists of data, i.e., vertex coordinates, element incidences, boundary data, which describe a collection of triangles. A set of conditions are placed on the triangles (i.e., on the list data) which ensure that the triangles tile a region and which also can be verified by the algorithm.

Simpson, R. B.↗

A general algorithm for the construction of contour plots

An algorithm is described that performs the task of drawing equal level contours on a plane, which requires interpolation in two dimensions based on data prescribed at points distributed irregularly over the plane. The approach is described in detail. The computer program that implements the algorithm is documented and listed.

Johnson, W.↗

Solar collector parameter identification from unsteady data by a discrete-gradient optimization algorithm

A discrete-gradient optimization algorithm is used to identify the parameters in a one-node and a two-node capacitance model of a flat-plate collector. Collector parameters are first obtained by a linear-least-squares fit to steady state data. These parameters, together with the collector heat capacitances, are then determined from unsteady data by use of the discrete-gradient optimization algorithm with less than 10 percent deviation from the steady state determination. All data were obtained in the indoor solar simulator at the NASA Lewis Research Center.

Hotchkiss, G. B.↗