Testing The Sharpness of Known Error Bounds on The Fast Fourier Transform - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Testing The Sharpness of Known Error Bounds on The Fast Fourier Transform

Résumé

The computation of Fast Fourier Transforms (FFTs) in floating-point arithmetic is inexact due to roundings, and for some applications it can prove very useful to know a tight bound on the final error. Although it can be almost attained by specifically built input values, the best known error bound for the Cooley-Tukey FFT seems to be much larger than most actually obtained errors. Also, interval arithmetic can be used to compute a bound on the error committed with a given set of input values, but it is in general considered hampered with large overestimation. We report results of intensive computations to test the two approaches, in order to estimate the numerical performance of state-of-the-art bounds. Surprisingly enough, we observe that while interval arithmetic-based bounds are overestimated, they remain, in our computations, tighter than general known bounds.
Fichier principal
Vignette du fichier
mainIEEE_accepted.pdf (354.94 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04092770 , version 1 (09-05-2023)
hal-04092770 , version 2 (19-07-2023)

Licence

Paternité

Identifiants

  • HAL Id : hal-04092770 , version 2

Citer

Nicolas Brisebarre, Jean-Michel Muller, Joris Picot. Testing The Sharpness of Known Error Bounds on The Fast Fourier Transform. 30th IEEE International Symposium on Computer Arithmetic ARITH 2023, Sep 2023, Portland, Oregon, USA, France. ⟨hal-04092770v2⟩
68 Consultations
59 Téléchargements

Partager

Gmail Facebook X LinkedIn More