Roundoff error analysis for fast trigonometric transforms (Q2702479)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Roundoff error analysis for fast trigonometric transforms |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Roundoff error analysis for fast trigonometric transforms |
scientific article |
Statements
8 January 2002
0 references
roundoff error analysis
0 references
worst case
0 references
average case
0 references
fast Fourier transforms
0 references
twiddle factors
0 references
fast algorithms
0 references
convolutions
0 references
discrete cosine/sine transforms
0 references
0.8872469
0 references
0.88017094
0 references
0.8714255
0 references
0.86521584
0 references
0.8542938
0 references
Roundoff error analysis for fast trigonometric transforms (English)
0 references
The paper presents both worst case and average case analysis of roundoff errors occurring in the floating point computation of fast Fourier transforms (FFTs) with precomputed twiddle factors. In particular, the authors show the influence of the precomputation error involved in the twiddle factors on the numerical stability of the FFT. They enlarge their results to fast algorithms for convolutions and discrete cosine/sine transforms.NEWLINENEWLINEFor the entire collection see [Zbl 0954.65001].
0 references
