SEARCH · Engineering Papers

Results for “fast 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 307 records · Page 17

All sources NASA NTRS DOE OSTI

NASA NTRS1979

A new approach to the solution of large, full matrix equations: A two-dimensional potential flow feasibility study

An approach to the solution of matrix problems resulting from integral equations of mathematical physics is presented. Based on the inherent smoothness in such equations, the problem is reformulated using a set of orthogonal basis vectors, leading to an equivalent coefficient problem which can be of lower order without significantly impairing the accuracy of the solution. This approach was evaluated using a two-dimensional Neumann problem describing the inviscid, incompressible flow over an airfoil. Two different kinds of mode functions were investigated, namely eigenfunction series and Fourier series. The method using Fourier series was found preferable. It uses all of the coefficients from a Fast Fourier Transform algorithm in an approximate method which exploits the known structure of the transformed coefficient matrix and very promising results for the flow over a realistic airfoil are obtained. On the basis of the results presented here, an order of magnitude reduction in this computer time can be expected for such problems as compared with the time for a direct matrix solution.

James, R. M.↗

NASA NTRS1978

An automated technique for stellar magnitude, color index, and position measurements of astronomical photographs

Computer programs have been developed for use in collecting and processing data from a PDS scanning microdensitometer. The goal is to obtain fast and simple algorithms for handling an entire astronomical photograph with one-pass digitization. This capability is realized by a real-time detection scheme that provides a data compression of a factor of 100, and a processing program that produces a catalog of magnitudes, color indices, and positions for up to 90,000 multicolor stellar images.

Green, R. F.↗

NASA NTRS1979

Computer analysis of shells of revolution using asymptotic results

It is suggested that asymptotic results for the behavior of thin shells can be incorporated in a general computer code for the analysis of a complex shell structure. The advantage when compared to existing finite difference or finite element codes is a substantial reduction in computational labor with the capability of working to a specified level of accuracy. A reduction in user preparation time and dependance on user judgment is also gained, since mesh spacing can be internally generated. The general theory is described in this paper, as well as the implementation in the computer code FAST 1 (Functional Algorithm for Shell Theory) for the analysis of the general axisymmetric shell structure with axisymmetric loading.

Steele, C. R.↗

NASA NTRS1982

Computing the Power-Density Spectrum for an Engineering Model

Computer program for calculating of power-density spectrum (PDS) from data base generated by Advanced Continuous Simulation Language (ACSL) uses algorithm that employs fast Fourier transform (FFT) to calculate PDS of variable. Accomplished by first estimating autocovariance function of variable and then taking FFT of smoothed autocovariance function to obtain PDS. Fast-Fourier-transform technique conserves computer resources.

Dunn, H. J.↗

NASA NTRS1980

A Fourier transform with speed improvements for microprocessor applications

A fast Fourier transform algorithm for the RCA 1802microprocessor was developed for spacecraft instrument applications. The computations were tailored for the restrictions an eight bit machine imposes. The algorithm incorporates some aspects of Walsh function sequency to improve operational speed. This method uses a register to add a value proportional to the period of the band being processed before each computation is to be considered. If the result overflows into the DF register, the data sample is used in computation; otherwise computation is skipped. This operation is repeated for each of the 64 data samples. This technique is used for both sine and cosine portions of the computation. The processing uses eight bit data, but because of the many computations that can increase the size of the coefficient, floating point form is used. A method to reduce the alias problem in the lower bands is also described.

Lokerson, D. C.↗

NASA NTRS1981

TAIR: A transonic airfoil analysis computer code

The operation of the TAIR (Transonic AIRfoil) computer code, which uses a fast, fully implicit algorithm to solve the conservative full-potential equation for transonic flow fields about arbitrary airfoils, is described on two levels of sophistication: simplified operation and detailed operation. The program organization and theory are elaborated to simplify modification of TAIR for new applications. Examples with input and output are given for a wide range of cases, including incompressible, subcritical compressible, and transonic calculations.

Dougherty, F. C.↗

NASA NTRS1984

Transonic Airfoil Analysis

Program uses fast iteration scheme for solving transonic flow field around arbitrary airfoils. Transonic Airfoil Analysis Computer Code, TAIR, employs fast, fully implicit algorithm to solve conservative full-potiential equation for steady transonic flow field about arbitrary airfoil immersed in subsonic free stream. TAIR written in FORTRAN IV.

Holst, T. L.↗

NASA NTRS1982

Numerical evaluation of the Rayleigh integral for planar radiators using the FFT

Rayleigh's integral formula is evaluated numerically for planar radiators of any shape, with any specified velocity in the source plane using the fast Fourier transfrom algorithm. The major advantage of this technique is its speed of computation - over 400 times faster than a straightforward two-dimensional numerical integration. The technique is developed for computation of the radiated pressure in the nearfield of the source and can be easily extended to provide, with little computation time, the vector intensity in the nearfield. Computations with the FFT of the nearfield pressure of baffled rectangular plates with clamped and free boundaries are compared with the 'exact' solution to illuminate any errors. The bias errors, introduced by the FFT, are investigated and a technique is developed to significantly reduce them.

Williams, E. G.↗

NASA NTRS1985

Secondary pattern computation of an offset reflector antenna

Reflector antennas are widely used in communications satellite systems because they provide high gain at low cost. In analyzing reflector antennas the computation of the secondary pattern is the main concern. A computer program for calculating the secondary pattern of an offset reflector has been developed and implemented at the NASA Lewis Research Center. The theoretical foundation for this program is based on the use of geometrical optics to describe the fields from the feed to the reflector surface and to the aperture plane. The resulting aperture field distribution is then transformed to the far-field zone by the fast Fourier transform algorithm. Comparing this technique with other well-known techniques (the geometrical theory of diffraction, physical optics (Jacobi-Bessel), etc.) shows good agreement for large (diameter of 100 lambda or greater) reflector antennas.

Acosta, R. J.↗

NASA NTRS1989

Neural learning of constrained nonlinear transformations

Two issues that are fundamental to developing autonomous intelligent robots, namely, rudimentary learning capability and dexterous manipulation, are examined. A powerful neural learning formalism is introduced for addressing a large class of nonlinear mapping problems, including redundant manipulator inverse kinematics, commonly encountered during the design of real-time adaptive control mechanisms. Artificial neural networks with terminal attractor dynamics are used. The rapid network convergence resulting from the infinite local stability of these attractors allows the development of fast neural learning algorithms. Approaches to manipulator inverse kinematics are reviewed, the neurodynamics model is discussed, and the neural learning algorithm is presented.

Barhen, Jacob↗

NASA NTRS1989

Fast transform decoding of nonsystematic Reed-Solomon codes

A Reed-Solomon (RS) code is considered to be a special case of a redundant residue polynomial (RRP) code, and a fast transform decoding algorithm to correct both errors and erasures is presented. This decoding scheme is an improvement of the decoding algorithm for the RRP code suggested by Shiozaki and Nishida, and can be realized readily on very large scale integration chips.

Truong, T. K.↗

NASA NTRS1989

A numerically exact full wave packet approach to molecule-surface scattering

A numerically exact spectral method for solving the time-dependent Schroedinger equation in spherical coordinates is described. The angular dependence of the wave function is represented on a two-dimensional grid of evenly spaced points. The fast Fourier transform algorithm is used to transform between the angle space representation of the wave function and its conjugate representation in momentum space. The time propagation of the wave function is evaluated using an expansion of the time evolution operator as a series of Chebyshev polynomials. Calculations performed for a model system representing H2 scattering from a rectangular corrugated surface yield transition probabilities that are in excellent agreement with those obtained using the close-coupling wave packet (CCWP) method. However, the new method is found to require substantially more computation time than the CCWP method because of the large number of grid points needed to represent the angular dependence of the wave function and the variation in the number of terms required in the Chebyshev representation of the time evolution operator.

Mowrey, R. C.↗

NASA NTRS1991

The RAPT control method for nonlinear systems

The Rapid Advancement Preview Tracking (RAPT) control method uses both a nonlinear system model and a linearized system model to provide a form of feedback/preview control for nonlinear systems. It uses measurements of the states to calculate the current preview control signal from a local linearization of the state equations, and then iteratively calculates a perturbation correction for that control using the nonlinear equations. The corrected control signal is then applied to the system, driving the end-effector to the next position along a specified trajectory. Computer simulations of tracking control for two-link planar manipulators indicate that this algorithm may be fast enough for real-time control.

Long, T. W.↗

NASA NTRS1993

Controls-structures-interaction dynamics during RCS control of the Orbiter/SRMS/SSF configuration

During the assembly flights of the Space Station Freedom (SSF), the Orbiter will either dock with the SSF and retract to the final berthed position, or will grapple the SSF using the Shuttle Remote Manipulator System (SRMS) and maneuver the SRMS coupled vehicles to their final berthed position. The SRMS method is expected to take approximately one to one and a half hours to complete and require periodic attitude corrections by either the Orbiter or the SSF reaction control system (RCS) or continuous control by a control moment gyro (CMG) system with RCS desaturation as required. Free drift of the attached vehicles is not currently thought to be acceptable because the desired system attitude will quickly deteriorate due to unbalanced gravity gradient and aerodynamic torques resulting in power generation problems, thermodynamic control problems, and communications problems. This paper deals with the simulation and control of the SRMS during trunnion/latch interaction dynamics and during RCS maneuvers. The SRMS servo drive joints have highly non-linear elastic characteristics which tend to degrade sensitive control strategies. In addition the system natural frequencies are extremely low and depend on the drive joint deflections and SRMS geometric position. The lowest mean period of oscillation for the Orbiter/SRMS/SSF(MB6) system in brakes hold mode positioned near the final berthed position is approximately 120 seconds. A detailed finite element model of the SRMS has been developed and used in a newly developed SRMS systems dynamics simulation to investigate the non-linear transient response dynamics of the Orbiter/SRMS/SSF systems. The present SRMS control strategy of brakes only recommended by the Charles Draper Labs is contrasted with a robust controller developed by the authors. The robust controller uses an optimal inear quadratic regulator (LQR) to optimally place the closed-loop poles of a multivariable continuous-time system within the common region of an open sector with the sector angle plus or minus 45 degrees from the negative real axis, and the left-hand side of a parallel to the imaginary axis in the complex s-plane. This guarantees that the critical damping ratio for the desired control modes is equal to or in excess of 0.707. The matrix sign function is used for solving the Riccati equations which appear in the controller design procedure. Fast and stable algorithms have recently been developed for the computation of the matrix sign function. Simulation results are given which demonstrate the potential CSI involvement for the current SRMS control system and the proposed control system.

Schliesing, J. A.↗

NASA NTRS1993

Mapping agroecological zones and time lag in vegetation growth by means of Fourier analysis of time series of NDVI images

Examples are presented of applications of a fast Fourier transform algorithm to analyze time series of images of Normalized Difference Vegetation Index values. The results obtained for a case study on Zambia indicated that differences in vegetation development among map units of an existing agroclimatic map were not significant, while reliable differences were observed among the map units obtained using the Fourier analysis.

Menenti, M.↗

NASA NTRS1994

Efficient massively parallel simulation of dynamic channel assignment schemes for wireless cellular communications

Fast, efficient parallel algorithms are presented for discrete event simulations of dynamic channel assignment schemes for wireless cellular communication networks. The driving events are call arrivals and departures, in continuous time, to cells geographically distributed across the service area. A dynamic channel assignment scheme decides which call arrivals to accept, and which channels to allocate to the accepted calls, attempting to minimize call blocking while ensuring co-channel interference is tolerably low. Specifically, the scheme ensures that the same channel is used concurrently at different cells only if the pairwise distances between those cells are sufficiently large. Much of the complexity of the system comes from ensuring this separation. The network is modeled as a system of interacting continuous time automata, each corresponding to a cell. To simulate the model, conservative methods are used; i.e., methods in which no errors occur in the course of the simulation and so no rollback or relaxation is needed. Implemented on a 16K processor MasPar MP-1, an elegant and simple technique provides speedups of about 15 times over an optimized serial simulation running on a high speed workstation. A drawback of this technique, typical of conservative methods, is that processor utilization is rather low. To overcome this, new methods were developed that exploit slackness in event dependencies over short intervals of time, thereby raising the utilization to above 50 percent and the speedup over the optimized serial code to about 120 times.

Greenberg, Albert G.↗

NASA NTRS2002

An Investigation into the Potential Application of Wavelets to Modal Testing and Analysis

The analysis of transient data of the type found in vibrating mechanical systems has been greatly improved through the use of modern techniques such as Fourier analysis. This is especially true when considered in conjunction with the development of the so-called Fast Fourier Transform algorithm by Cooley and the tremendous strides in computational power of the last several decades. The usefulness of the discrete Fourier Transform is its ability to transform sampled data from the "time-domain" to the "frequency domain," thereby allowing the analyst to decompose a signal into its frequency content. More recent developments have led to the wavelet transform. The strength of wavelet analysis is its ability to maintain both time and frequency information, thus making it an attractive candidate for the analysis of non-stationary signals. This report is an overview of wavelet theory and the potential use of the wavelet transform as an alternative to Fourier analysis in modal identification.

A. Fort Gwinn, Jr.↗

NASA NTRS1999

Scientific Programming Using Java: A Remote Sensing Example

This paper presents results of a project to port remote sensing code from the C programming language to Java. The advantages and disadvantages of using Java versus C as a scientific programming language in remote sensing applications are discussed. Remote sensing applications deal with voluminous data that require effective memory management, such as buffering operations, when processed. Some of these applications also implement complex computational algorithms, such as Fast Fourier Transformation analysis, that are very performance intensive. Factors considered include performance, precision, complexity, rapidity of development, ease of code reuse, ease of maintenance, memory management, and platform independence. Performance of radiometric calibration code written in Java for the graphical user interface and of using C for the domain model are also presented.

Prados, Don↗