Roundoff Error Analysis of the Fast Fourier Transform

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Stochastic Roundoff Error Analysis for the Fast Fourier Transform

We study the accuracy of the output of the Fast Fourier Transform by estimating the expected value and the variance of the accompanying linear forms in terms of the expected value and variance of the relative roundoff errors for the elementary operations of addition and multiplication. We compare the results with the corresponding ones for the direct algorithm for the Discrete Fourier Transform...

متن کامل

The Nonequispaced Fast Fourier Transform: Implementation and Error Analysis

The Fast Fourier Transform (FFT) reduces the number of computations required for the straightforward calculation of the discrete Fourier transform. For a one-dimensional signal of length N , this provides a reduction in complexity from O(N) to O(N log2 N) operations. Recently, fast algorithms have been introduced for discrete Fourier transforms on nonequispaced data sets (NDFT). These algorithm...

متن کامل

Analyzing the Approximation Error of the Fast Graph Fourier Transform

The graph Fourier transform (GFT) is in general dense and requires O(n) time to compute and O(n) memory space to store. In this paper, we pursue our previous work on the approximate fast graph Fourier transform (FGFT). The FGFT is computed via a truncated Jacobi algorithm, and is defined as the product of J Givens rotations (very sparse orthogonal matrices). The truncation parameter, J , repres...

متن کامل

The Fast Fourier Transform

In the next two lectures, we will continue to expand our toolbox for computing in frequency domain, by adding two important computational tools. The first, the Fast Fourier Transform (FFT) is a family of algorithms for efficiently computing the Discrete Fourier Transform. These algorithms are of great practical importance, as theymake it possible to perform frequency domain analysis of very lar...

متن کامل

Fractional-Fourier-transform calculation through the fast-Fourier-transform algorithm.

A method for the calculation of the fractional Fourier transform (FRT) by means of the fast Fourier transform (FFT) algorithm is presented. The process involves mainly two FFT's in cascade; thus the process has the same complexity as this algorithm. The method is valid for fractional orders varying from -1 to 1. Scaling factors for the FRT and Fresnel diffraction when calculated through the FFT...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Computation

سال: 1971

ISSN: 0025-5718

DOI: 10.2307/2004342