Gross, Craig; Iwen, Mark; Kämmerer, Lutz; Volkmer, Toni Sparse Fourier transforms on rank-1 lattices for the rapid and low-memory approximation of functions of many variables. (English) Zbl 1478.65143 Sampl. Theory Signal Process. Data Anal. 20, No. 1, Paper No. 1, 45 p. (2022). MSC: 65T40 65D15 42B05 65Y20 65T50 PDFBibTeX XMLCite \textit{C. Gross} et al., Sampl. Theory Signal Process. Data Anal. 20, No. 1, Paper No. 1, 45 p. (2022; Zbl 1478.65143) Full Text: DOI arXiv
Gross, Craig; Iwen, Mark A.; Kämmerer, Lutz; Volkmer, Toni A deterministic algorithm for constructing multiple rank-1 lattices of near-optimal size. (English) Zbl 1481.65275 Adv. Comput. Math. 47, No. 6, Paper No. 86, 24 p. (2021). MSC: 65T40 65T50 42B05 42B35 68Q25 PDFBibTeX XMLCite \textit{C. Gross} et al., Adv. Comput. Math. 47, No. 6, Paper No. 86, 24 p. (2021; Zbl 1481.65275) Full Text: DOI arXiv
Choi, Bosu; Iwen, Mark; Volkmer, Toni Sparse harmonic transforms. II: Best \(s\)-term approximation guarantees for bounded orthonormal product bases in sublinear-time. (English) Zbl 1483.65030 Numer. Math. 148, No. 2, 293-362 (2021). MSC: 65D15 65D40 65T40 68W20 68W25 PDFBibTeX XMLCite \textit{B. Choi} et al., Numer. Math. 148, No. 2, 293--362 (2021; Zbl 1483.65030) Full Text: DOI arXiv
Choi, Bosu; Iwen, Mark A.; Krahmer, Felix Sparse harmonic transforms: a new class of sublinear-time algorithms for learning functions of many variables. (English) Zbl 1472.65171 Found. Comput. Math. 21, No. 2, 275-329 (2021). MSC: 65T40 41A30 PDFBibTeX XMLCite \textit{B. Choi} et al., Found. Comput. Math. 21, No. 2, 275--329 (2021; Zbl 1472.65171) Full Text: DOI arXiv
Merhi, Sami; Zhang, Ruochuan; Iwen, Mark A.; Christlieb, Andrew A new class of fully discrete sparse Fourier transforms: faster stable implementations with guarantees. (English) Zbl 1431.65253 J. Fourier Anal. Appl. 25, No. 3, 751-784 (2019). MSC: 65T50 65T40 68W25 PDFBibTeX XMLCite \textit{S. Merhi} et al., J. Fourier Anal. Appl. 25, No. 3, 751--784 (2019; Zbl 1431.65253) Full Text: DOI arXiv
Hu, Xianfeng; Iwen, Mark; Kim, Hyejin Rapidly computing sparse Legendre expansions via sparse Fourier transforms. (English) Zbl 1365.65034 Numer. Algorithms 74, No. 4, 1029-1059 (2017). Reviewer: Adhemar Bultheel (Leuven) MSC: 65D15 41A10 40A25 65T50 PDFBibTeX XMLCite \textit{X. Hu} et al., Numer. Algorithms 74, No. 4, 1029--1059 (2017; Zbl 1365.65034) Full Text: DOI arXiv