Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 1,423 records · Page 79
All sourcesNASA NTRSDOE OSTI
NASA NTRS1978

On a new algorithm for time step integration of nonlinear systems

A new implicit algorithm for time step integration of finite element structural dynamic equations is presented. Convergence, stability and numerical damping properties are discussed. Due to the way nonlinear structural behavior is taken into account, the algorithm is expected to compare favorably with existing ones. Some simple numerical results are presented. A related explicit algorithm is also derived and shortly discussed.

Anderheggen, E.↗
NASA NTRS1978

The Lanczos algorithm with selective orthogonalization

A new stable and efficient implementation of the Lanczos algorithm is presented. The algorithm is a powerful method for finding a few eigenvalues and eigenvectors at one or both ends of the spectrum of a symmetric matrix A. The algorithm is particularly effective if A is large and sparse in that the only way in which A enters the calculation is through a subroutine which computes Av for any vector v. Thus the user is free to take advantage of any sparsity structure in A and A need not even be represented as a matrix et al.

Parlett, B. N.↗
NASA NTRS1978

An algorithm for optimal structural design with frequency constraints

The paper presents a finite element method for minimum weight design of structures with lower-bound constraints on the natural frequencies, and upper and lower bounds on the design variables. The design algorithm is essentially an iterative solution of the Kuhn-Tucker optimality criterion. The three most important features of the algorithm are: (1) a small number of design iterations are needed to reach optimal or near-optimal design, (2) structural elements with a wide variety of size-stiffness may be used, the only significant restriction being the exclusion of curved beam and shell elements, and (3) the algorithm will work for multiple as well as single frequency constraints. The design procedure is illustrated with three simple problems.

Kiusalaas, J.↗
NASA NTRS1978

Analysis of dissection algorithms for vector computers

Recently two dissection algorithms (one-way and incomplete nested dissection) have been developed for solving the sparse positive definite linear systems arising from n by n grid problems. Concurrently, vector computers (such as the CDC STAR-100 and TI ASC) have been developed for large scientific applications. An analysis of the use of dissection algorithms on vector computers dictates that vectors of maximum length be utilized thereby implying little or no dissection; on the other hand, minimizing operation counts suggest that considerable dissection be performed. In this paper we discuss the resolution of this conflict by minimizing the total time required by vectorized versions of the two algorithms.

George, A.↗
NASA NTRS1979

Satellite altimeter measurements of sea state - An algorithm comparison

Six algorithms for extracting significant wave height from Geos 3 altimeter data have been compared using simulated Geos 3 data for a single long pass including a variety of sea states and for short segments in the vicinity of NOAA data buoys. The study included algorithms reported by Walsh (1979), Rufenach and Alpers (1978), Gower (1979), Godbey (1965), Fedor (1978) and a real-time model (Miller and Hayne, 1972). Individual differences in results obtained by the algorithms were small, and calculations were found to be in good agreement with surface truth data.

Fedor, L. S.↗
NASA NTRS1979

A new hybrid algorithm for computing a fast discrete Fourier transform

In this paper for certain long transform lengths, Winograd's algorithm for computing the discrete Fourier transform (DFT) is extended considerably. This is accomplished by performing the cyclic convolution, required by Winograd's method, with the Mersenne prime number-theoretic transform developed originally by Rader. This new algorithm requires fewer multiplications than either the standard fast Fourier transform (FFT) or Winograd's more conventional algorithm. However, more additions are required.

Reed, I. S.↗
NASA NTRS1979

A simultaneous coordinate relaxation algorithm for large, sparse matrix eigenvalue problems

An algorithm is proposed for a scheme of simultaneous coordinate relaxation. A variant of root-shifting coordinate relaxation, this procedure consists of iterating several vectors at the same time, instead of one at a time. Results of application of the algorithm to test matrices are discussed. For many matrix eigenvalue problems for which coordinate relaxation is a viable approach, the present algorithm is more effective than previous implementations of coordinate relaxation. Total central processor operations should be decreased due to significantly improved convergence.

Raffenetti, R. C.↗
NASA NTRS1979

Preliminary test results of a flight management algorithm for fuel conservative descents in a time based metered traffic environment

A flight management algorithm designed to improve the accuracy of delivering the airplane fuel efficiently to a metering fix at a time designated by air traffic control is discussed. The algorithm provides a 3-D path with time control (4-D) for a test B 737 airplane to make an idle thrust, clean configured descent to arrive at the metering fix at a predetermined time, altitude, and airspeed. The descent path is calculated for a constant Mach/airspeed schedule from linear approximations of airplane performance with considerations given for gross weight, wind, and nonstandard pressure and temperature effects. The flight management descent algorithms and the results of the flight tests are discussed.

Knox, C. E.↗
NASA NTRS1980

Algorithm for calculating turbine cooling flow and the resulting decrease in turbine efficiency

An algorithm is presented for calculating both the quantity of compressor bleed flow required to cool the turbine and the decrease in turbine efficiency caused by the injection of cooling air into the gas stream. The algorithm, which is intended for an axial flow, air routine in a properly written thermodynamic cycle code. Ten different cooling configurations are available for each row of cooled airfoils in the turbine. Results from the algorithm are substantiated by comparison with flows predicted by major engine manufacturers for given bulk metal temperatures and given cooling configurations. A list of definitions for the terms in the subroutine is presented.

Gauntner, J. W.↗
NASA NTRS1980

A new algorithm for horizontal capture trajectories

An algorithm which transfers an aircraft from an initial position and heading to a final position and heading was developed for onboard synthesis of horizontal flight paths. The algorithm finds all solutions possible, and selects the one with minimum path length. Degenerate conditions in which one or more of the basic segments is missing are handled without difficulty. The solution to this problem is derived, and a FORTRAN listing of the algorithm is provided.

Mclean, J. D.↗
NASA NTRS1980

An interaction algorithm for prediction of mean and fluctuating velocities in two-dimensional aerodynamic wake flows

A theoretical analysis is presented yielding sets of partial differential equations for determination of turbulent aerodynamic flowfields in the vicinity of an airfoil trailing edge. A four phase interaction algorithm is derived to complete the analysis. Following input, the first computational phase is an elementary viscous corrected two dimensional potential flow solution yielding an estimate of the inviscid-flow induced pressure distribution. Phase C involves solution of the turbulent two dimensional boundary layer equations over the trailing edge, with transition to a two dimensional parabolic Navier-Stokes equation system describing the near-wake merging of the upper and lower surface boundary layers. An iteration provides refinement of the potential flow induced pressure coupling to the viscous flow solutions. The final phase is a complete two dimensional Navier-Stokes analysis of the wake flow in the vicinity of a blunt-bases airfoil. A finite element numerical algorithm is presented which is applicable to solution of all partial differential equation sets of inviscid-viscous aerodynamic interaction algorithm. Numerical results are discussed.

Baker, A. J.↗
NASA NTRS1980

Algorithm for fixed-range optimal trajectories

An algorithm for synthesizing optimal aircraft trajectories for specified range was developed and implemented in a computer program written in FORTRAN IV. The algorithm, its computer implementation, and a set of example optimum trajectories for the Boeing 727-100 aircraft are described. The algorithm optimizes trajectories with respect to a cost function that is the weighted sum of fuel cost and time cost. The optimum trajectory consists at most of a three segments: climb, cruise, and descent. The climb and descent profiles are generated by integrating a simplified set of kinematic and dynamic equations wherein the total energy of the aircraft is the independent or time like variable. At each energy level the optimum airspeeds and thrust settings are obtained as the values that minimize the variational Hamiltonian. Although the emphasis is on an off-line, open-loop computation, eventually the most important application will be in an on-board flight management system.

Lee, H. Q.↗
NASA NTRS1980

Development and test results of a flight management algorithm for fuel conservative descents in a time-based metered traffic environment

A simple flight management descent algorithm designed to improve the accuracy of delivering an airplane in a fuel-conservative manner to a metering fix at a time designated by air traffic control was developed and flight tested. This algorithm provides a three dimensional path with terminal area time constraints (four dimensional) for an airplane to make an idle thrust, clean configured (landing gear up, flaps zero, and speed brakes retracted) descent to arrive at the metering fix at a predetermined time, altitude, and airspeed. The descent path was calculated for a constant Mach/airspeed schedule from linear approximations of airplane performance with considerations given for gross weight, wind, and nonstandard pressure and temperature effects. The flight management descent algorithm is described. The results of the flight tests flown with the Terminal Configured Vehicle airplane are presented.

Knox, C. E.↗
NASA NTRS1979

An 'adding' algorithm for the Markov chain formalism for radiation transfer

An adding algorithm is presented, that extends the Markov chain method and considers a preceding calculation as a single state of a new Markov chain. This method takes advantage of the description of the radiation transport as a stochastic process. Successive application of this procedure makes calculation possible for any optical depth without increasing the size of the linear system used. It is determined that the time required for the algorithm is comparable to that for a doubling calculation for homogeneous atmospheres. For an inhomogeneous atmosphere the new method is considerably faster than the standard adding routine. It is concluded that the algorithm is efficient, accurate, and suitable for smaller computers in calculating the diffuse intensity scattered by an inhomogeneous planetary atmosphere.

Esposito, L. W.↗
NASA NTRS1979

A general algorithm for the solution of Kepler's equation for elliptic orbits

An efficient algorithm is presented for the solution of Kepler's equation f(E)=E-M-e sin E=0, where e is the eccentricity, M the mean anomaly and E the eccentric anomaly. This algorithm is based on simple initial approximations that are cubics in M, and an iterative scheme that is a slight generalization of the Newton-Raphson method. Extensive testing of this algorithm has been performed on the UNIVAC 1108 computer. Solutions for 20,000 pairs of values of e and M show that for single precision, 42.0% of the cases require one iteration, 57.8% two and 0.2% three. For double precision one additional iteration is required.

Ng, E. W.↗
NASA NTRS1980

A diagonal form of an implicit approximate-factorization algorithm with application to a two dimensional inlet

A modification of an implicit approximate-factorization finite-difference algorithm applied to the two dimensional Euler and Navier-Stokes equations in general curvilinear coordinates is presented for supersonic free stream flow about and through inlets. The modification transforms the coupled system of equations into an uncoupled diagonal form which requires less computation work. For steady-state applications the resulting diagonal algorithm retains the stability and accuracy characteristics of the original algorithm. Solutions are given for inviscid and laminar flow about a two dimensional wedge inlet configuration. Comparisons are made between computed results and exact theory.

Chaussee, D. S.↗
NASA NTRS1980

The SASS scattering coefficient algorithm

This paper describes the algorithms used to convert engineering unit data obtained from the Seasat-A satellite scatterometer (SASS) to radar scattering coefficients and associated supporting parameters. A description is given of the instrument receiver and related processing used by the scatterometer to measure signal power backscattered from the earth's surface. The applicable radar equation used for determining scattering coefficient is derived. Sample results of SASS data processed through current algorithm development facility (ADF) scattering coefficient algorithms are presented which include scattering coefficient values for both water and land surfaces. Scattering coefficient signatures for these two surface types are seen to have distinctly different characteristics. Scattering coefficient measurements of the Amazon rain forest indicate the usefulness of this type of data as a stable calibration reference target.

Bracalente, E. M.↗
NASA NTRS1981

Project resource reallocation algorithm

A methodology for adjusting baseline cost estimates according to project schedule changes is described. An algorithm which performs a linear expansion or contraction of the baseline project resource distribution in proportion to the project schedule expansion or contraction is presented. Input to the algorithm consists of the deck of cards (PACE input data) prepared for the baseline project schedule as well as a specification of the nature of the baseline schedule change. Output of the algorithm is a new deck of cards with all work breakdown structure block and element of cost estimates redistributed for the new project schedule. This new deck can be processed through PACE to produce a detailed cost estimate for the new schedule.

Myers, J. E.↗