Worst and average case roundoff error analysis for FFT

被引:18
作者
Tasche, M
Zeuner, H
机构
[1] Univ Rostock, Dept Math, D-18051 Rostock, Germany
[2] Med Univ Lubeck, Inst Math, D-23560 Lubeck, Germany
关键词
roundoff error analysis; worst case study; average case study; precomputed twiddle factors; fast Fourier transform;
D O I
10.1023/A:1021923430250
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
This paper presents both worst case and average case analysis of roundoff errors occuring in the floating point computation of fast Fourier transform (FFT) with precomputed twiddle factors and shows the strong influence of precomputation errors on the numerical stability of FFT. Numerical tests confirm the theoretical results.
引用
收藏
页码:563 / 581
页数:19
相关论文
共 13 条
[1]  
[Anonymous], 1997, ALGORITHMS DISCRETE
[2]  
[Anonymous], HDB ANAL COMPUTATION
[3]   Componentwise error analysis for FFTs with applications to fast Helmholtz solvers [J].
Arioli, M ;
MuntheKaas, H ;
Valdettaro, L .
NUMERICAL ALGORITHMS, 1996, 12 (1-2) :65-88
[4]  
Behnke H., 1976, THEORIE ANAL FUNKTIO
[5]  
CALVETTI D, 1991, MATH COMPUT, V56, P755, DOI 10.1090/S0025-5718-1991-1068824-0
[6]  
CHU CY, 1987, THESIS CORNELL U ITH
[7]  
Higham N. J., 1996, ACCURACY STABILITY N
[8]   ROUNDOFF ERROR ANALYSIS OF FAST FOURIER TRANSFORM [J].
RAMOS, GU .
MATHEMATICS OF COMPUTATION, 1971, 25 (116) :757-&
[9]   Accuracy of the discrete Fourier transform and the fast Fourier transform [J].
Schatzman, JC .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1996, 17 (05) :1150-1166
[10]  
TASCHE M, IN PRESS J COMPUT AN