# Interval propagation through the discrete Fourier transform

@inproceedings{Angelis2020IntervalPT, title={Interval propagation through the discrete Fourier transform}, author={Marco de Angelis and Marco Behrendt and Liam A. Comerford and Yuanjin Zhang and Michael Beer}, year={2020} }

We present an algorithm for the forward propagation of intervals through the discrete Fourier transform. The algorithm yields best-possible bounds when computing the amplitude of the Fourier transform for real and complex valued sequences. We show that computing the exact bounds of the amplitude can be achieved with an exhaustive examination of all possible corners of the interval domain. However, because the number of corners increases exponentially with the number of intervals, such method is…

## References

SHOWING 1-10 OF 13 REFERENCES

### Introduction to Random Vibrations

- Mathematics
- 1983

This is the first comprehensive text on its subject to appear since the 1960s. It incorporates classical material with the many significant developments in the field and is the only up-to-date…

### On quantifying the uncertainty of stochastic process power spectrum estimates subject to missing data

- Engineering
- 2015

The issue of quantifying the uncertainty in stochastic process power spectrum estimates based on realisations with missing data is addressed. In this regard, relying on relatively relaxed assumptions…

### A Student's Guide to Fourier Transforms: With Applications in Physics and Engineering

- Physics
- 1995

Preface to the first edition Preface to the second edition 1. Physics and Fourier transforms 2. Useful properties and theorems 3. Applications I: Fraunhofer diffraction 4. Applications II: signal…

### Introduction to Numerical Analysis

- Mathematics
- 2001

1. The numerical evaluation of expressions 2. Linear systems of equations 3. Interpolation and numerical differentiation 4. Numerical integration 5. Univariate nonlinear equations 6. Systems of…

### An algorithm for the machine calculation of complex Fourier series

- Computer Science
- 1965

Good generalized these methods and gave elegant algorithms for which one class of applications is the calculation of Fourier series, applicable to certain problems in which one must multiply an N-vector by an N X N matrix which can be factored into m sparse matrices.

### Introduction to Interval Analysis

- Computer Science
- 2009

This unique book provides an introduction to a subject whose use has steadily increased over the past 40 years, and provides broad coverage of the subject as well as the historical perspective of one of the originators of modern interval analysis.

### and C

- Stein, Introduction to algorithms
- 2009