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,657 records · Page 92

All sources NASA NTRS DOE OSTI

NASA NTRS1989

A parallel algorithm for switch-level timing simulation on a hypercube multiprocessor

The parallel approach to speeding up simulation is studied, specifically the simulation of digital LSI MOS circuitry on the Intel iPSC/2 hypercube. The simulation algorithm is based on RSIM, an event driven switch-level simulator that incorporates a linear transistor model for simulating digital MOS circuits. Parallel processing techniques based on the concepts of Virtual Time and rollback are utilized so that portions of the circuit may be simulated on separate processors, in parallel for as large an increase in speed as possible. A partitioning algorithm is also developed in order to subdivide the circuit for parallel processing.

Rao, Hariprasad Nannapaneni↗

NASA NTRS1988

Fast Fourier Transform algorithm design and tradeoffs

The Fast Fourier Transform (FFT) is a mainstay of certain numerical techniques for solving fluid dynamics problems. The Connection Machine CM-2 is the target for an investigation into the design of multidimensional Single Instruction Stream/Multiple Data (SIMD) parallel FFT algorithms for high performance. Critical algorithm design issues are discussed, necessary machine performance measurements are identified and made, and the performance of the developed FFT programs are measured. Fast Fourier Transform programs are compared to the currently best Cray-2 FFT program.

Kamin, Ray A., III↗

NASA NTRS1988

Efficient parallel algorithms for string editing and related problems

The string editing problem for input strings x and y consists of transforming x into y by performing a series of weighted edit operations on x of overall minimum cost. An edit operation on x can be the deletion of a symbol from x, the insertion of a symbol in x or the substitution of a symbol x with another symbol. This problem has a well known O((absolute value of x)(absolute value of y)) time sequential solution (25). The efficient Program Requirements Analysis Methods (PRAM) parallel algorithms for the string editing problem are given. If m = ((absolute value of x),(absolute value of y)) and n = max((absolute value of x),(absolute value of y)), then the CREW bound is O (log m log n) time with O (mn/log m) processors. In all algorithms, space is O (mn).

Apostolico, Alberto↗

NASA NTRS1988

DFT algorithms for bit-serial GaAs array processor architectures

Systems and Processes Engineering Corporation (SPEC) has developed an innovative array processor architecture for computing Fourier transforms and other commonly used signal processing algorithms. This architecture is designed to extract the highest possible array performance from state-of-the-art GaAs technology. SPEC's architectural design includes a high performance RISC processor implemented in GaAs, along with a Floating Point Coprocessor and a unique Array Communications Coprocessor, also implemented in GaAs technology. Together, these data processors represent the latest in technology, both from an architectural and implementation viewpoint. SPEC has examined numerous algorithms and parallel processing architectures to determine the optimum array processor architecture. SPEC has developed an array processor architecture with integral communications ability to provide maximum node connectivity. The Array Communications Coprocessor embeds communications operations directly in the core of the processor architecture. A Floating Point Coprocessor architecture has been defined that utilizes Bit-Serial arithmetic units, operating at very high frequency, to perform floating point operations. These Bit-Serial devices reduce the device integration level and complexity to a level compatible with state-of-the-art GaAs device technology.

Mcmillan, Gary B.↗

NASA NTRS1989

Concurrent algorithms for transient FE analysis

Information on concurrent algorithms for transient finite element analysis is given in viewgraph form. Information is given on concurrent dynamic algorithms, interprocessor communication, the performance of the BAR problem on the 32 Processor Hypercube, computational efficiency and accuracy analysis.

Ortiz, M.↗

NASA NTRS1989

Flux-split algorithms for the multi-dimensional Euler equations with real gases

Upwind algorithms are developed for the numerical solution of the multidimensional Euler equations for real gases. Flux-splitting methods are derived which account for a general equation of state. Approximations to the state equation based on physical arguments result in simplified algorithms which may be implemented into existing perfect-gas codes. Applications of the method to several high-Mach-number high-temperature flows are presented for two and three space dimensions.

Grossman, B.↗

NASA NTRS1988

A high-performance FFT algorithm for vector supercomputers

Many traditional algorithms for computing the fast Fourier transform (FFT) on conventional computers are unacceptable for advanced vector and parallel computers because they involve nonunit, power-of-two memory strides. A practical technique for computing the FFT that avoids all such strides and appears to be near-optimal for a variety of current vector and parallel computers is presented. Performance results of a program based on this technique are given. Notable among these results is that a FORTRAN implementation of this algorithm on the CRAY-2 runs up to 77-percent faster than Cray's assembly-coded library routine.

Bailey, David H.↗

NASA NTRS1989

A set of strongly coupled, upwind algorithms for computing flows in chemical nonequilibrium

Two new algorithms have been developed to predict the flow of viscous, hypersonic, chemically reacting gases over three-dimensional bodies. Both take advantage of the benefits of upwind differencing, Total Variation Diminishing (TVD) techniques and of a finite-volume framework, but obtain their solution in two separate manners. The first algorithym is a time-marching scheme, and is generally used to obtain solutions in the subsonic portions of the flow field. The second algorithm is a much less expensive, space-marching scheme and can be used for the computation of the larger, supersonic portion of the flow field. Both codes compute their interface fluxes with a new temporal Riemann solver and the resulting schemes are made fully implicit including the chemical source terms.

Molvik, Gregory A.↗

NASA NTRS1989

A predictive guidance algorithm for Mars entry

This report presents the derivation, logic, and performance of a Mars entry guidance algorithm for the Mars Rover Sample Return Mission. This algorithm guides the Mars entry vehicle along an equilibrium glide trajectory designed to satisfy a set of equality and inequality constraints at chute deploy. An equilibrium glide assumption permits analytic prediction of terminal state conditions and eliminates the need for determining numeric state sensitivities. Trajectory deviations due to dispersions or uncertainties in Martian atmosphere, vehicle aerodynamics, or entry interface conditions are accommodated simply by predicting the compensating equilibrium glide profile and achieving this profile with the available lift control. This Mars Predictive Equilibrium Glide guidance scheme was tested on a range of vehicle configurations with a variety of aerodynamic, atmosphere, and trajectory dispersions with a high degree of success.

Tigges, M. A.↗

NASA NTRS1989

A finite element solution algorithm for nonlinear thermal problems with severe gradients

An implicit enthalpy - flux component finite element algorithm is presented for nonlinear thermal problems with severe gradients. The algorithm is formulated to permit efficient solution of nonlinear heat transfer problems for unstructured meshes with a large range of element sizes. Two transient conduction examples illustrate the effectiveness of the approach for problems with high temperatures and steep gradients.

Thornton, Earl A.↗

NASA NTRS1988

Averaging analysis of adaptive control algorithms

The method of averaging is used to analyze discrete-time indirect adaptive control. The analysis focuses on various prediction-error-driven identification algorithms coupled with a general linear control law. The plant is not required to be in the model set of the identifier, which accounts for systems with unmodeled plant dynamics. Exogenous input signals including known command signals and unknown disturbances are also included. Both gradient and Newton-based algorithms are considered.

Phillips, Stephen M.↗

NASA NTRS1989

An enhanced mode shape identification algorithm

A mode shape identification algorithm is developed which is characterized by a low sensitivity to measurement noise and a high accuracy of mode identification. The algorithm proposed here is also capable of identifying the mode shapes of structures with significant damping. The combined results indicate that mode shape identification is much more dependent on measurement noise than identification of natural frequencies. Accurate detection of modal parameters and mode shapes is demonstrated for modes with damping ratios exceeding 15 percent.

Roemer, Michael J.↗

NASA NTRS1989

A computational fluid dynamics algorithm on a massively parallel computer

The implementation and performance of a finite-difference algorithm for the compressible Navier-Stokes equations in two or three dimensions on the Connection Machine are described. This machine is a single-instruction multiple-data machine with up to 65536 physical processors. The implicit portion of the algorithm is of particular interest. Running times and megadrop rates are given for two- and three-dimensional problems. Included are comparisons with the standard codes on a Cray X-MP/48.

Jespersen, Dennis C.↗

NASA NTRS1989

LU-SGS implicit algorithm for three-dimensional incompressible Navier-Stokes equations with source term

A numerical method is developed for solving the incompressible Navier-Stokes equations using the concept of pseudocompressibility. A lower-upper symmetric-Gauss-Seidel implicit scheme is developed for three-dimensional incompressible viscous flow computations. The present algorithm offers additional advantages when solving the flow equations with source terms. Complete vectorizability of the algorithm on oblique planes of sweep in three-dimensions is accomplished in a new flow solver, INS3D-LU code. Spatial differencing is a second-order accurate semi-discrete finite-volume method augmented by a third-order accurate numerical dissipation model which is based on spectral-radii. Comparison of numerical solutions for a curved duct with experimental data shows good agreement. The method is applied to calculate the inducer flow of the Space Shuttle Main Engine turbopump.

Yoon, Seokkwan↗

NASA NTRS1989

The development of an explicit thermochemical nonequilibrium algorithm and its application to compute three dimensional AFE flowfields

This study presents a three-dimensional explicit, finite-difference, shock-capturing numerical algorithm applied to viscous hypersonic flows in thermochemical nonequilibrium. The algorithm employs a two-temperature physical model. Equations governing the finite-rate chemical reactions are fully-coupled to the gas dynamic equations using a novel coupling technique. The new coupling method maintains stability in the explicit, finite-rate formulation while allowing relatively large global time steps. The code uses flux-vector accuracy. Comparisons with experimental data and other numerical computations verify the accuracy of the present method. The code is used to compute the three-dimensional flowfield over the Aeroassist Flight Experiment (AFE) vehicle at one of its trajectory points.

Palmer, Grant↗

NASA NTRS1989

A correction algorithm for particle size distribution measurements made with the forward-scattering spectrometer probe

A correction algorithm for evaluating the particle size distribution measurements of atmospheric aerosols obtained with a forward-scattering spectrometer probe (FSSP) is examined. A model based on Poisson statistics is employed to calculate the average diameter and rms width of the particle size distribution. The dead time and coincidence errors in the measured number density are estimated. The model generated data are compared with a Monte Carlo simulation of the FSSP operation. It is observed that the correlation between the actual and measured size distribution is nonlinear. It is noted that the algorithm permits more accurate calculation of the average diameter and rms width of the distribution compared to uncorrected measured quantities.

Lock, James A.↗

NASA NTRS1989

Recursive form of the eigensystem realization algorithm for system identification

An algorithm is developed for recursively calculating the minimum realization of a linear system from sampled impulse response data. The Gram-Schmidt orthonormalization technique is used to generate an orthonormal basis for factorization of the data matrix. The system matrix thus identified is in upper Hessenberg form, which has advantages for the identification of modal parameters including damping coefficients, frequencies, mode shapes, and modal participation factors. It also has the property that once an element of the system matrix is computed, it is never altered as the dimension of the model is increased in the recursive process. Numerical examples are presented for comparison of the recursive and nonrecursive forms of the eigensystem realization algorithm.

Longman, Richard W.↗

NASA NTRS1989

A polynomial time algorithm for checking the robust stability of a polytope of polynomials

An efficient algorithm to check the robust stability of a polytope of polynomials is proposed. This problem is equivalent to a zero-exclusion condition at each frequency. It is shown that such a condition has to be checked at only a finite number of frequencies. This problem is formulated as a parametric linear program, which can be solved by the simplex procedure with additional computations between steps, consisting of polynomial evaluations and calculation of positive polynomial roots. The algorithm requires a finite number of steps (corresponding to frequency checks), and, in the important case of the polytope of parameters being a hypercube, this number is at most O(m3n), where n is the degree of the polynomials in the family and m is the number of parameters.

Sideris, Athanasios↗