A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions

Lutz Kämmerer, Felix Krahmer, Toni Volkmer. A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions. Numerical Algorithms, 89(4):1479-1520, 2022. [doi]

@article{KammererKV22,
  title = {A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions},
  author = {Lutz Kämmerer and Felix Krahmer and Toni Volkmer},
  year = {2022},
  doi = {10.1007/s11075-021-01162-1},
  url = {https://doi.org/10.1007/s11075-021-01162-1},
  researchr = {https://researchr.org/publication/KammererKV22},
  cites = {0},
  citedby = {0},
  journal = {Numerical Algorithms},
  volume = {89},
  number = {4},
  pages = {1479-1520},
}