Roundoff errors in the fast computation of discrete convolutions
Applications of Mathematics, Tome 26 (1981) no. 4, pp. 241-262 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

The efficient evaluation of a discrete convolution is usually carried out as a repated evaluation of a discrete convolution of a special type with the help of the fast Fourier transform. The paper is concerned with the analysis of the roundoff errors in the fast computation of this convolution. To obtain a comparison, the roundoff errors in the usual (direct) computation of this convolution are also considered. A stochastic model of the propagation of roundoff errors. is employed. The theoretical results are compared with the actual roundoff errors is employed. The theoretical results are compared with the actual roundoff errors occurring in the evaluation of a simple model discrete convolution.
The efficient evaluation of a discrete convolution is usually carried out as a repated evaluation of a discrete convolution of a special type with the help of the fast Fourier transform. The paper is concerned with the analysis of the roundoff errors in the fast computation of this convolution. To obtain a comparison, the roundoff errors in the usual (direct) computation of this convolution are also considered. A stochastic model of the propagation of roundoff errors. is employed. The theoretical results are compared with the actual roundoff errors is employed. The theoretical results are compared with the actual roundoff errors occurring in the evaluation of a simple model discrete convolution.
DOI : 10.21136/AM.1981.103916
Classification : 42A15, 65F30, 65T05, 65T40
Keywords: discrete convolution; fast Fourier transform; analysis of the roundoff errors; stochastic model
@article{10_21136_AM_1981_103916,
     author = {Segeth, Karel},
     title = {Roundoff errors in the fast computation of discrete convolutions},
     journal = {Applications of Mathematics},
     pages = {241--262},
     year = {1981},
     volume = {26},
     number = {4},
     doi = {10.21136/AM.1981.103916},
     mrnumber = {0623505},
     zbl = {0474.65025},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/AM.1981.103916/}
}
TY  - JOUR
AU  - Segeth, Karel
TI  - Roundoff errors in the fast computation of discrete convolutions
JO  - Applications of Mathematics
PY  - 1981
SP  - 241
EP  - 262
VL  - 26
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.21136/AM.1981.103916/
DO  - 10.21136/AM.1981.103916
LA  - en
ID  - 10_21136_AM_1981_103916
ER  - 
%0 Journal Article
%A Segeth, Karel
%T Roundoff errors in the fast computation of discrete convolutions
%J Applications of Mathematics
%D 1981
%P 241-262
%V 26
%N 4
%U http://geodesic.mathdoc.fr/articles/10.21136/AM.1981.103916/
%R 10.21136/AM.1981.103916
%G en
%F 10_21136_AM_1981_103916
Segeth, Karel. Roundoff errors in the fast computation of discrete convolutions. Applications of Mathematics, Tome 26 (1981) no. 4, pp. 241-262. doi: 10.21136/AM.1981.103916

[1] R. Alt: Error propagation in Fourier transforms. Math. Comput. Simulation 20 (1978), 37-43. | DOI | MR | Zbl

[2] J. W. Cooley J. W. Tukey: An algorithm for the machine calculation of complex Fourier series. Math. Соmр. 19 (1965), 297-301. | MR

[3] P. J. Davis P. Rabinowitz: Methods of Numerical Integration. Academic Press, New York 1975. | MR

[4] R. W. Hamming: Numerical Methods for Scientists and Engineers. McGraw-Hill, New York 1962. | MR | Zbl

[5] D. R. Hartree: Note on systematic roundoff errors in numerical integration. J. Res. Nat. Bur. Standards 42 (1949), 62. | MR

[6] H. D. Helms: Fast Fourier transform method of computing difference equations and simulating filters. IEEE Trans. Audio Electroacoust. AU-15 (1967), 85-90. | DOI

[7] P. Henrici: Elements of Numerical Analysis. Wiley, New York 1964. | MR | Zbl

[8] H. D. Huskey: On the precision of a certain procedure of numerical integration. J. Res. Nat. Bur. Standards 42 (1949), 57-62. | DOI | MR

[9] L. Jolley: Summation of Series. Chapman and Hall, London 1925.

[10] T. Kaneko B. Liu: Accumulation of round-off error in fast Fourier transforms. J. Assoc. Comput. Mach. 17 (1970), 637-654. | DOI | MR

[11] T. Kaneko B. Liu: On local roundoff errors in floating-point arithmetic. J. Assoc. Comput. Mach. 20 (1973), 391-398. | DOI | MR

[12] G. U. Ramos: Roundoff error analysis of the fast Fourier transform. Math. Соmр. 25 (1971), 757-768., | MR | Zbl

[13] P. H. Sterbenz: Floating-Point Computation. Prentics-Hall, Englewood Cliffs, N. J., 1974. | MR

[14] System/360 Scientific Subroutine Package. IBM Corporation, White Plains, N. Y., 1910.

[15] T. Thong B. Liu: Accumulation of roundoff errors in floating point FFT. IEEE Trans. Circuits and Systems 24 (1977), 132-143. | DOI | MR

[16] T. Thong B. Liu: Floating point fast Fourier transform computation using double precision floating point accumulators. ACM Trans. Math. Software 3 (1977), 54-59. | DOI | MR

[17] J. H. Wilkinson: Rounding Errors in Algebraic Processes. HMSO, London 1963. | MR | Zbl

Cité par Sources :