FFT formulations of adaptive Fourier decomposition
Keywords: 42A50; 32A30; 32A35; 46J15; Fast Fourier transform; Computational complexity; Adaptive decomposition; Greedy algorithm; Reproducing kernel Hilbert space;