arXiv:0808.2172 Abstract | arXiv Analytics

Published 2008-08-15Version 1

The discrete Fourier transform and the FFT algorithm are extended from the circle to continuous graphs with equal edge lengths.

Categories: math.CA, math.NA

Subjects: 65T50, 34B45

Keywords: continuous graph fft, discrete fourier transform, equal edge lengths, fft algorithm

Related articles: Most relevant | Search more

arXiv:1501.07646 [math.CA] (Published 2015-01-30)

Explicit Hermite-type eigenvectors of the discrete Fourier transform

Alexey Kuznetsov

arXiv:1706.08740 [math.CA] (Published 2017-06-27)

Minimal Hermite-type eigenbasis of the discrete Fourier transform

arXiv:1602.01634 [math.CA] (Published 2016-02-04)

Salem sets, equidistribution and arithmetic progressions

Paul Potgieter