Forward interval propagation through the discrete Fourier transform

Tools

de Angelis, Marco and Behrendt, Marco and Comerford, Liam and Zhang, Yuanjin and Beer, Michael; Sofi, Alba and Muscolino, Giuseppe and Muhanna, Rafi L., eds. (2021) Forward interval propagation through the discrete Fourier transform. In: REC 2021. Risk and Uncertainty in Engineering Computations (REC), [S.I.], pp. 39-52.

[thumbnail of De-Marco-etal-REC-2021-Forward-interval-propagation-through-the-discrete]
Preview
 Text. Filename: De_Marco_etal_REC_2021_Forward_interval_propagation_through_the_discrete.pdf
Accepted Author Manuscript
License: Strathprints license 1.0
Download (991kB)| Preview

Abstract

In this paper an algorithm for the forward interval propagation on the amplitude of the discrete Fourier transform (DFT) is presented. The algorithm yields best-possible bounds on the amplitude of the DFT for real and complex valued sequences. We show that computing the exact bounds for the amplitude of the DFT can be achieved with an exhaustive examination of all possible corners of the interval-shaped domain. However, because the number of corners increases exponentially with the number of intervals, such method is infeasible for large interval signals. We provide an algorithm that does not need such an exhaustive search, and show that the best possible bounds for the amplitude can be obtained propagating complex pairs only from the convex hull of endpoints at each term of the Fourier series. Because the convex hull is always tightly inscribed in the respective rigorous bounding box resulting from interval arithmetic, we conclude that the obtained bounds are guaranteed to enclose the true values.

ORCID iDs

de Angelis, Marco ORCID logoORCID: https://orcid.org/0000-0001-8851-023X, Behrendt, Marco, Comerford, Liam, Zhang, Yuanjin and Beer, Michael; Sofi, Alba, Muscolino, Giuseppe and Muhanna, Rafi L.
CORE (COnnecting REpositories)