Engineering Papers⌕ Search

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.

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

At least 523 records · Page 29

A combined finite element-boundary element formulation for solution of two-dimensional problems via CGFFT

A method for the computation of electromagnetic scattering from arbitrary two-dimensional bodies is presented. The method combines the finite element and boundary element methods leading to a system for solution via the conjugate gradient Fast Fourier Transform (FFT) algorithm. Two forms of boundaries aimed at reducing the storage requirement of the boundary integral are investigated. It is shown that the boundary integral becomes convolutional when a circular enclosure is chosen, resulting in reduced storage requirement when the system is solved via the conjugate gradient FFT method. The same holds for the ogival enclosure, except that some of the boundary integrals are not convolutional and must be carefully treated to maintain O(N) memory requirement. Results for several circular and ogival structures are presented and shown to be in excellent agreement with those obtained by traditional methods.

Collins, Jeffery D.↗

Spread-spectrum code acquisition in the presence of Doppler shift and data modulation

A spread-spectrum code acquisition technique for a direct-sequence (DS) system in the presence of Doppler effect and data modulation is investigated. Both the carrier-frequency offset and code-frequency offset due to severe Doppler effect are considered. The code-chip slipping during the correlation process caused by code-frequency offset can degrade the acquisition performance significantly. However, this issue can be alleviated by compensating code-frequency offset in an appropriate manner. Results are presented for the cases with and without data modulation. Coherent detection is considered when there is no data modulation. If data modulation is present, the authors partition the correlation time into subintervals and the integration results in these subintervals are square-law noncoherently combined for detection. The implementation of this code acquisition technique using the fast Fourier transform (FFT) algorithm is described. The use of theoretical results to estimate the hardware complexity of an actual system is illustrated step by step, showing that implementation is feasible with existing technology. The tradeoff between hardware complexity and acquisition performance is discussed.

Cheng, Unjeng↗

An approximate methods approach to probabilistic structural analysis

A major research and technology program in Probabilistic Structural Analysis Methods (PSAM) is currently being sponsored by the NASA Lewis Research Center with Southwest Research Institute as the prime contractor. This program is motivated by the need to accurately predict structural response in an environment where the loadings, the material properties, and even the structure may be considered random. The heart of PSAM is a software package which combines advanced structural analysis codes with a fast probability integration (FPI) algorithm for the efficient calculation of stochastic structural response. The basic idea of PAAM is simple: make an approximate calculation of system response, including calculation of the associated probabilities, with minimal computation time and cost, based on a simplified representation of the geometry, loads, and material. The deterministic solution resulting should give a reasonable and realistic description of performance-limiting system responses, although some error will be inevitable. If the simple model has correctly captured the basic mechanics of the system, however, including the proper functional dependence of stress, frequency, etc. on design parameters, then the response sensitivities calculated may be of significantly higher accuracy.

Mcclung, R. C.↗

Modelling and computationally efficient time domain linear equalisation of nonlinear bandlimited QPSK satellite channels

The problem of modeling and equalization of a nonlinear satellite channel is considered. The channel is assumed to be bandlimited and exhibits both amplitude and phase nonlinearities. In traditional models, computations are usually performed in the frequency domain and solutions are based on complex numerical techniques. A discrete time model is used to represent the satellite link with both uplink and downlink white Gaussian noise. Under conditions of practical interest, a simple and computationally efficient time-domain design technique for the minimum mean square error linear equalizer is presented. The efficiency of this technique is enhanced by the use of a fast and simple iterative algorithm for the computation of the autocorrelation coefficients of the output of the nonlinear channel. Numerical results on the evaluations of bit error probability and other relevant parameters needed in the design and analysis of a nonlinear bandlimited QPSK system demonstrate the simplicity and computational efficiency of the proposed approach.

Konstantinides, K.↗

Steady-state analysis of a nonlinear rotor-housing system

The periodic steady state response of a high pressure oxygen turbopump (HBOTP) of a Space Shuttle main engine (SSME), involving a clearance between the bearing and housing carrier, is sought. A harmonic balance method utilizig Fast Fourier Transform (FFT) algorithm is developed for the analysis. An impedance method is used to reduce the number of degrees of freedom to the displacements at the bearing clearance. Harmonic and subharmonic responses to imbalance for various system parameters are studied. The results show that the computational technique developed in this study is an effective and flexible method for determining the stable and unstable periodic response of complex rotor-housing systems with clearance type nonlinearity.

Noah, S. T.↗

Ordered fast fourier transforms on a massively parallel hypercube multiprocessor

Design alternatives for ordered Fast Fourier Transformation (FFT) algorithms were examined on massively parallel hypercube multiprocessors such as the Connection Machine. Particular emphasis is placed on reducing communication which is known to dominate the overall computing time. To this end, the order and computational phases of the FFT were combined, and the sequence to processor maps that reduce communication were used. The class of ordered transforms is expanded to include any FFT in which the order of the transform is the same as that of the input sequence. Two such orderings are examined, namely, standard-order and A-order which can be implemented with equal ease on the Connection Machine where orderings are determined by geometries and priorities. If the sequence has N = 2 exp r elements and the hypercube has P = 2 exp d processors, then a standard-order FFT can be implemented with d + r/2 + 1 parallel transmissions. An A-order sequence can be transformed with 2d - r/2 parallel transmissions which is r - d + 1 fewer than the standard order. A parallel method for computing the trigonometric coefficients is presented that does not use trigonometric functions or interprocessor communication. A performance of 0.9 GFLOPS was obtained for an A-order transform on the Connection Machine.

Tong, Charles↗

Probabilistic Structural Analysis Methods (PSAM) for select space propulsion system components

The fourth year of technical developments on the Numerical Evaluation of Stochastic Structures Under Stress (NESSUS) system for Probabilistic Structural Analysis Methods is summarized. The effort focused on the continued expansion of the Probabilistic Finite Element Method (PFEM) code, the implementation of the Probabilistic Boundary Element Method (PBEM), and the implementation of the Probabilistic Approximate Methods (PAppM) code. The principal focus for the PFEM code is the addition of a multilevel structural dynamics capability. The strategy includes probabilistic loads, treatment of material, geometry uncertainty, and full probabilistic variables. Enhancements are included for the Fast Probability Integration (FPI) algorithms and the addition of Monte Carlo simulation as an alternate. Work on the expert system and boundary element developments continues. The enhanced capability in the computer codes is validated by applications to a turbine blade and to an oxidizer duct.

Source record↗

Probabilistic Structural Analysis Methods (PSAM) for select space propulsion system components

This annual report summarizes the work completed during the third year of technical effort on the referenced contract. Principal developments continue to focus on the Probabilistic Finite Element Method (PFEM) which has been under development for three years. Essentially all of the linear capabilities within the PFEM code are in place. Major progress in the application or verifications phase was achieved. An EXPERT module architecture was designed and partially implemented. EXPERT is a user interface module which incorporates an expert system shell for the implementation of a rule-based interface utilizing the experience and expertise of the user community. The Fast Probability Integration (FPI) Algorithm continues to demonstrate outstanding performance characteristics for the integration of probability density functions for multiple variables. Additionally, an enhanced Monte Carlo simulation algorithm was developed and demonstrated for a variety of numerical strategies.

Source record↗

Control of unsteady separated flow associated with the dynamic stall of airfoils

An effort to understand and control the unsteady separated flow associated with the dynamic stall of airfoils was funded for three years through the NASA cooperative agreement program. As part of this effort a substantial data base was compiled detailing the effects various parameters have on the development of the dynamic stall flow field. Parameters studied include Mach number, pitch rate, and pitch history, as well as Reynolds number (through two different model chord lengths) and the condition of the boundary layer at the leading edge of the airfoil (through application of surface roughness). It was found for free stream Mach numbers as low as 0.4 that a region of supersonic flow forms on the leading edge of the suction surface of the airfoil at moderate angles of attack. The shocks which form in this supersonic region induce boundary-layer separation and advance the dynamic stall process. Under such conditions a supercritical airfoil profile is called for to produce a flow field having a weaker leading-edge pressure gradient and no leading-edge shocks. An airfoil having an adaptive-geometry, or dynamically deformable leading edge (DDLE), is under development as a unique active flow-control device. The DDLE, formed of carbon-fiber composite and fiberglass, can be flexed between a NACA 0012 profile and a supercritical profile in a controllable fashion while the airfoil is executing an angle-of-attack pitch-up maneuver. The dynamic stall data were recorded using point diffraction interferometry (PDI), a noninvasive measurement technique. A new high-speed cinematography system was developed for recording interferometric images. The system is capable of phase-locking with the pitching airfoil motion for real-time documentation of the development of the dynamic stall flow field. Computer-aided image analysis algorithms were developed for fast and accurate reduction of the images, improving interpretation of the results.

Wilder, M. C.↗

Tools for Atmospheric Radiative Transfer: Streamer and FluxNet

Two tools for the solution of radiative transfer problems are presented. Streamer is a highly flexible medium spectral resolution radiative transfer model based on the plane-parallel theory of radiative transfer. Capable of computing either fluxes or radiances, it is suitable for studying radiative processes at the surface or within the atmosphere and for the development of remote-sensing algorithms. FluxNet is a fast neural network-based implementation of Streamer for computing surface fluxes. It allows for a sophisticated treatment of radiative processes in the analysis of large data sets and potential integration into geophysical models where computational efficiency is an issue. Documentation and tools for the development of alternative versions of Fluxnet are available. Collectively, Streamer and FluxNet solve a wide variety of problems related to radiative transfer: Streamer provides the detail and sophistication needed to perform basic research on most aspects of complex radiative processes while the efficiency and simplicity of FluxNet make it ideal for operational use.

Key, Jeffrey R.↗

Registration assisted mosaic generation

This paper presents a general strategy for assembling mosaics from numerous individual images where uncertainty exists in the position and orientation of those images. Both of the presented applications relate to remotely operated camera platforms, the first being the Galileo solid state imaging (SSI) camera presently in orbit around Jupiter, and the second being the Imager for Mars Pathfinder (IMP) stereo camera on Mars. A basic strategy in both applications is to determine the correct relative camera pointing followed by direct map projection of the images. It is assumed that approximate camera pointing exists sufficient to locate adjacent images and to place initial tiepoints within reach of the correlator. Spatial correlation is used to fix tiepoints whose initial locations are predicted by the camera pointing. We use either an fast fourier transform (fft) algorithm or a variant of Gruen's scheme permitting limited image rotation and skew. The Gruen correlator has three hierarchical modes: 1) A classical spatial least squares correlation on integral pixel boundaries used when rotation is small. 2) An annealing non-deterministic search used when rotations are unknown. A simplex deterministic search used for the end game. The correlation operation can be performed either interactively or autonomously. The final camera pointing solution relies upon a simplex downhill search in 2n or 3n dimensions where n is the number of images comprising the mosaic and the objective function to be minimized is the disagreement between tiepoint locations predicted from the camera pointing with those observed by the correlator. For Galileo the 3n unknowns are euler angles defining camera pointing in planet coordinates, and for Mars Pathfinder they are 2n unknowns representing commanded azimuth and elevation in the Lander coordinate system.

Lorre, Jean J.↗

On Fast Post-Processing of Global Positioning System Simulator Truth Data and Receiver Measurements and Solutions Data

Post-Processing of data related to a Global Positioning System (GPS) simulation is an important activity in qualification of a GPS receiver for space flight. Because a GPS simulator is a critical resource it is desirable to move off the pertinent simulation data from the simulator as soon as a test is completed. The simulator data files are usually moved to a Personal Computer (PC), where the post-processing of the receiver logged measurements and solutions data and simulated data is performed. Typically post-processing is accomplished using PC-based commercial software languages and tools. Because of commercial software systems generality their general-purpose functions are notoriously slow and more than often are the bottleneck problem even for short duration experiments. For example, it may take 8 hours to post-process data from a 6-hour simulation. There is a need to do post-processing faster, especially in order to use the previous test results as feedback for a next simulation setup. This paper demonstrates that a fast software linear interpolation algorithm is applicable to a large class of engineering problems, like GPS simulation data post-processing, where computational time is a critical resource and is one of the most important considerations. An approach is developed that allows to speed-up post-processing by an order of magnitude. It is based on improving the post-processing bottleneck interpolation algorithm using apriori information that is specific to the GPS simulation application. The presented post-processing scheme was used in support of a few successful space flight missions carrying GPS receivers. A future approach to solving the post-processing performance problem using Field Programmable Gate Array (FPGA) technology is described.

Kizhner, Semion↗

Fast Quaternion Attitude Estimation from Two Vector Measurements

Many spacecraft attitude determination methods use exactly two vector measurements. The two vectors are typically the unit vector to the Sun and the Earth's magnetic field vector for coarse "sun-mag" attitude determination or unit vectors to two stars tracked by two star trackers for fine attitude determination. Existing closed-form attitude estimates based on Wahba's optimality criterion for two arbitrarily weighted observations are somewhat slow to evaluate. This paper presents two new fast quaternion attitude estimation algorithms using two vector observations, one optimal and one suboptimal. The suboptimal method gives the same estimate as the TRIAD algorithm, at reduced computational cost. Simulations show that the TRIAD estimate is almost as accurate as the optimal estimate in representative test scenarios.

Markley, F. Landis↗

Multiobjective Optimization Using a Pareto Differential Evolution Approach

Differential Evolution is a simple, fast, and robust evolutionary algorithm that has proven effective in determining the global optimum for several difficult single-objective optimization problems. In this paper, the Differential Evolution algorithm is extended to multiobjective optimization problems by using a Pareto-based approach. The algorithm performs well when applied to several test optimization problems from the literature.

Madavan, Nateri K.↗

Use of Multi-Resolution Wavelet Feature Pyramids for Automatic Registration of Multi-Sensor Imagery

The problem of image registration, or alignment of two or more images representing the same scene or object, has to be addressed in various disciplines that employ digital imaging. In the area of remote sensing, just like in medical imaging or computer vision, it is necessary to design robust, fast and widely applicable algorithms that would allow automatic registration of images generated by various imaging platforms at the same or different times, and that would provide sub-pixel accuracy. One of the main issues that needs to be addressed when developing a registration algorithm is what type of information should be extracted from the images being registered, to be used in the search for the geometric transformation that best aligns them. The main objective of this paper is to evaluate several wavelet pyramids that may be used both for invariant feature extraction and for representing images at multiple spatial resolutions to accelerate registration. We find that the band-pass wavelets obtained from the Steerable Pyramid due to Simoncelli perform better than two types of low-pass pyramids when the images being registered have relatively small amount of nonlinear radiometric variations between them. Based on these findings, we propose a modification of a gradient-based registration algorithm that has recently been developed for medical data. We test the modified algorithm on several sets of real and synthetic satellite imagery.

Zavorin, Ilya↗

Multiobjective Aerodynamic Shape Optimization Using Pareto Differential Evolution and Generalized Response Surface Metamodels

Differential Evolution (DE) is a simple, fast, and robust evolutionary algorithm that has proven effective in determining the global optimum for several difficult single-objective optimization problems. The DE algorithm has been recently extended to multiobjective optimization problem by using a Pareto-based approach. In this paper, a Pareto DE algorithm is applied to multiobjective aerodynamic shape optimization problems that are characterized by computationally expensive objective function evaluations. To improve computational expensive the algorithm is coupled with generalized response surface meta-models based on artificial neural networks. Results are presented for some test optimization problems from the literature to demonstrate the capabilities of the method.

Madavan, Nateri K.↗

Use of multiresolution wavelet feature pyramids for automatic registration of multisensor imagery

The problem of image registration, or the alignment of two or more images representing the same scene or object, has to be addressed in various disciplines that employ digital imaging. In the area of remote sensing, just like in medical imaging or computer vision, it is necessary to design robust, fast, and widely applicable algorithms that would allow automatic registration of images generated by various imaging platforms at the same or different times and that would provide subpixel accuracy. One of the main issues that needs to be addressed when developing a registration algorithm is what type of information should be extracted from the images being registered, to be used in the search for the geometric transformation that best aligns them. The main objective of this paper is to evaluate several wavelet pyramids that may be used both for invariant feature extraction and for representing images at multiple spatial resolutions to accelerate registration. We find that the bandpass wavelets obtained from the steerable pyramid due to Simoncelli performs best in terms of accuracy and consistency, while the low-pass wavelets obtained from the same pyramid give the best results in terms of the radius of convergence. Based on these findings, we propose a modification of a gradient-based registration algorithm that has recently been developed for medical data. We test the modified algorithm on several sets of real and synthetic satellite imagery.

Evaluation Studies↗

Distributed simulation for formation flying applications

High fidelity engineering simulation plays a key role in the rapidly developing field of space-based formation flying. This paper describes the design and implementation of the Formation Algorithms and Simulation Testbed (FAST).

formation flying↗