Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “FFT”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
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 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 NTRS1990

Interpolation And FFT Of Near-Field Antenna Measurements

Bivariate Lagrange interpolation applied to plane-polar measurement scans. Report discusses recent advances in application of fast-Fourier-transform (FFT) techniques to measurements of near radiation fields of antennas on plane-polar grid. Attention focused mainly on use of such measurements to calculate far radiation fields. Also discussion of use of FFT's in holographic diagnosis of distortions of antenna reflectors. Advantage of scheme, it speeds calculations because it requires fewer data and manipulations of data than other schemes used for this purpose.

Gatti, Mark S.↗
NASA NTRS1990

The use of the FFT for the efficient solution of the problem of electromagnetic scattering by a body of revolution

The enhancement of the computational efficiency of the body of revolution (BOR) scattering problem is discused with a view to making it practical for solving large-body problems. The problem of EM scattering by a perfectly conducting BOR is considered, although the methods can be extended to multilayered dielectric bodies as well. Typically, the generation of the elements of the moment method matrix consumes a major portion of the computational time. It is shown how this time can be significantly reduced by manipulating the expression for the matrix elements to permit efficient FFT computation. A technique for extracting the singularity of the Green function that appears within the integrands of the matrix diagonal is also presented, further enhancing the usefulness of the FFT. The computation time can thus be improved by at least an order of magnitude for large bodies in comparison to that for previous algorithms.

Gedney, Stephen D.↗
NASA NTRS1992

Efficient Two-Dimensional-FFT Program

Program computes 64 X 64-point fast Fourier transform in less than 17 microseconds. Optimized 64 X 64 Point Two-Dimensional Fast Fourier Transform combines performance of real- and complex-valued one-dimensional fast Fourier transforms (FFT's) to execute two-dimensional FFT and coefficients of power spectrum. Coefficients used in many applications, including analyzing spectra, convolution, digital filtering, processing images, and compressing data. Source code written in C, 8086 Assembly, and Texas Instruments TMS320C30 Assembly languages.

Miko, J.↗
NASA NTRS1991

The Filled Arm Fizeau Telescope (FFT)

Attention is given to the design of a Mills Cross imaging interferometer in which the arms are fully filled with mirror segments of a Ritchey-Chretien primary and which has sensitivity to 27th magnitude per pixel and resolution a factor of 10 greater than Hubble. The optical design, structural configuration, thermal disturbances, and vibration, material, control, and metrology issues, as well as scientific capabilities are discussed, and technology needs are identified. The technologies under consideration are similar to those required for the development of the other imaging interferometers that have been proposed over the past decade. A comparison of the imaging capabilities of a 30-m diameter FFT, an 8-m telescope with a collecting area equal to that of the FFT, and the HST is presented.

Synnott, S. P.↗
NASA NTRS1996

Error and Complexity Analysis for a Collocation-Grid-Projection Plus Precorrected-FFT Algorithm for Solving Potential Integral Equations with LaPlace or Helmholtz Kernels

In this paper we derive error bounds for a collocation-grid-projection scheme tuned for use in multilevel methods for solving boundary-element discretizations of potential integral equations. The grid-projection scheme is then combined with a precorrected FFT style multilevel method for solving potential integral equations with 1/r and e(sup ikr)/r kernels. A complexity analysis of this combined method is given to show that for homogeneous problems, the method is order n natural log n nearly independent of the kernel. In addition, it is shown analytically and experimentally that for an inhomogeneity generated by a very finely discretized surface, the combined method slows to order n(sup 4/3). Finally, examples are given to show that the collocation-based grid-projection plus precorrected-FFT scheme is competitive with fast-multipole algorithms when considering realistic problems and 1/r kernels, but can be used over a range of spatial frequencies with only a small performance penalty.

Phillips, J. R.↗
DOE OSTI2024

Generalized grain boundary constitutive description implemented in a strain-gradient large-strain FFT-based formulation: Application to nano-metallic laminates

Herein this paper presents a general treatment of grain boundary constitutive behavior in the context of strain-gradient (SG) plasticity, and its numerical implementation in a large-strain (LS) elasto-viscoplastic (EVP) fast Fourier transform (FFT)-based micromechanical model. Two novel grain boundary constitutive equations are proposed, allowing for more accurate description of the Burgers vector flow at the grain boundary. The capabilities of the generalized SG-LS-EVPFFT formulation are illustrated for the case of kink-band formation during layer-parallel compression of nano-metallic laminates (NMLs), requiring consideration of the interaction between dislocations and interfaces.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Non-local large-strain FFT-based formulation and its application to interface-dominated plasticity of nano-metallic laminates

Here, this paper presents a novel formulation and its robust numerical implementation of strain-gradient (SG) crystal plasticity within a large-strain (LS) elasto-viscoplastic (EVP) fast Fourier transform (FFT)-based micromechanical model. The resulting non-local SG-LS-EVPFFT formulation is used to model and understand the process of kink band formation during layer-parallel compression of nano-metallic laminates (NMLs). NMLs are layered composites with nanoscale thicknesses, thus requiring consideration of the interaction between dislocations and interfaces within the micromechanical model. The length-scale parameter of the SG model is calibrated by simulating a double pile-up and comparing predictions to analytical solution. This required new expressions for the defect energy, resulting in more accurate double pile-up predictions. The calibrated SG-LS-EVPFFT model is then used to simulate layer-parallel compression of copper-niobium NML. Formation of kink bands is predicted, and the model is used to rationalize the microscopic mechanisms enabling the formation process. It is found that accumulation of dislocations at interfaces leads to activation of layer-parallel slip, which in turn leads to kink band formation.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Ameliorating the Courant-Friedrichs-Lewy condition in spherical coordinates: A double FFT filter method for general relativistic MHD in dynamical spacetimes

Numerical simulations of merging compact objects and their remnants form the theoretical foundation for gravitational wave and multimessenger astronomy. While Cartesian-coordinate-based adaptive mesh refinement is commonly used for simulations, spherical-like coordinates are more suitable for nearly spherical remnants and azimuthal flows due to lower numerical dissipation in the evolution of fluid angular momentum, as well as requiring fewer numbers of computational cells. However, the use of spherical coordinates to numerically solve hyperbolic partial differential equations can result in severe Courant-Friedrichs-Lewy (CFL) stability condition time step limitations, which can make simulations prohibitively expensive. This paper addresses this issue for the numerical solution of coupled spacetime and general relativistic magnetohydrodynamics evolutions by introducing a double fast Fourier transform (FFT) filter and implementing it within the fully message passing interface (mpi)-parallelized sphericalnr framework in the einstein toolkit. In conclusion, we demonstrate the effectiveness and robustness of the filtering algorithm by applying it to a number of challenging code tests, and show that it passes these tests effectively, demonstrating convergence while also increasing the time step significantly compared to unfiltered simulations.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

MOSAIC: An Effective FFT-based Numerical Method to Assess Aging Properties of Concrete

As the nuclear fleet in the United States ages and subsequent license renewal applications grow, the prediction of concrete durability at extended operation becomes more important. To address this issue, a Fast-Fourier Transform (FFT) method is utilized to simulate aging-related degradation of concrete within the Microstructure Oriented Scientific Analysis of Irradiated Concrete (MOSAIC) software. MOSAIC utilizes compositional phase maps to simulate damage from radiation-induced volumetric expansion (RIVE), applied force, creep, and thermal expansion. This compositional detail allows each mineral in the microstructure to be assigned specific material properties, allowing the simulation to be as accurate and representative as possible. The principal goal of MOSAIC is to simulate the effects of nonlinear aging mechanisms occurring in nuclear concrete on the macroscopic mechanical properties, using only the aggregate microstructure compositional information as a starting point. Here, several realistic example simulations are shown to demonstrate the utility and uniqueness of the MOSAIC software.

36 MATERIALS SCIENCE↗
NASA NTRS1975

Simulation of multicorrelated random processes using the FFT algorithm

A technique for the digital simulation of multicorrelated Gaussian random processes is described. This technique is based upon generating discrete frequency functions which correspond to the Fourier transform of the desired random processes, and then using the fast Fourier transform (FFT) algorithm to obtain the actual random processes. The main advantage of this method of simulation over other methods is computation time; it appears to be more than an order of magnitude faster than present methods of simulation. One of the main uses of multicorrelated simulated random processes is in solving nonlinear random vibration problems by numerical integration of the governing differential equations. The response of a nonlinear string to a distributed noise input is presented as an example.

Wittig, L. E.↗
NASA NTRS1976

Biplex, pipelined FFT

A method of implementing a pipelined fast Fourier transform (FFT) is presented that makes full use of the elements that comprise it. For a given bandwidth and spectral resolution, this approach requires 25 percent less memory, and needs only half the logic speed required for the conventional implementation. Since the spectrum is broken into two parts, two analog-to-digital converters, and attendant mixer-filters, are needed. These two input elements need only operate at half the speed of the one they replaced.

Emerson, R. F.↗
NASA NTRS1984

Microprocessor implementation of an FFT for ionospheric VLF observations

A fast Fourier transform algorithm is implemented on a CMOS microprocessor for application to very low-frequency electric fields (less than 10 kHz) sensed on high-altitude scientific balloons. Two FFT's are calculated simultaneously by associating them with conjugate symmetric and conjugate antisymmetric results. One goal of the system was to detect spectral signatures associated with fast time variations present in natural signals such as whistlers and chorus. Although a full evaluation of the system was not possible for operational reasons, a measure of the system's success has been defined and evaluated.

Elvidge, J.↗
NASA NTRS1989

A test of a modified algorithm for computing spherical harmonic coefficients using an FFT

The Dilts (1985) algorithm for computing the spherical harmonic expansion coefficients for a function on a sphere, on the basis of a two-dimensional FFT, is presently modified, tested, and found to eliminate problems of overflow and large storage requirements associated with the encounter of harmonic degree values greater than 16. Results from timing tests show the Dilts program to be impractical, however, for the computation of spherical harmonic expansion coefficients for large harmonic degree values.

Elowitz, Mark↗
NASA NTRS1989

FFT-local gravimetric geoid computation

Model computations show that changes of sampling interval introduce only 0.3 cm changes, whereas zero padding provides an improvement of more than 5 cm in the fast Fourier transformation (FFT) generated geoid. For the Global Positioning System (GPS) survey of Franklin County, Ohio, the parameters selected as a result of model computations, allow large reduction in local data requirements while still retaining the cm accuracy when tapering and padding is applied. The results are shown in tables.

Nagy, Dezso↗