ScholarLens Back to search
1982•Earthquake Engineering & Structural DynamicsRequires access

An FFT algorithm for structural dynamics

John F. Hall

Open publisher page 32 citations

Abstract

Abstract A Fast Fourier Transform algorithm (FFT) is described which is especially suited for structural dynamics. The routine incorporates several features selected from many variations of the original Cooley and Tukey1 algorithm with the goal of making the most efficient use of computer time and storage while maintaining simplicity. Some introductory material to Fourier transform techniques and a description of the original algorithm are also included. In addition, the source listing of the subroutine FFT is reproduced.

About this research paper

What this paper is about

Abstract A Fast Fourier Transform algorithm (FFT) is described which is especially suited for structural dynamics. The routine incorporates several features selected from many variations of the original Cooley and Tukey1 algorithm with the goal of making the most efficient use of computer time and storage while maintaining simplicity. Some introductory material to Fourier transform techniques and a description of the original algorithm are also included. In addition, the source listing of the subroutine FFT is reproduced.

Why it matters

OpenAlex reports 32 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Abstract A Fast Fourier Transform algorithm (FFT) is described which is especially suited for structural dynamics. The routine incorporates several features selected from many variations of the original Cooley and Tukey1 algorithm with the goal of making the most efficient use of computer time and storage while maintaining simplicity. Some introductory material to Fourier transform techniques and a description of the original algorithm are also included. In addition, the source listing of the subroutine FFT is reproduced.

Key concepts: Fast Fourier transform, Prime-factor FFT algorithm, Cooley–Tukey FFT algorithm, Split-radix FFT algorithm, Algorithm, Subroutine, Computer science, Rader's FFT algorithm

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
An FFT algorithm for structural dynamics — Research Paper | ScholarLens