Recent papers and pre-prints related to FFTs

[bkm]

Steinbach, P.; Werner, M. (2017). “Gearshift:The FFT Benchmark Suite for Heterogeneous Platforms”. In: Kunkel J., Yokota R., Balaji P., Keyes D. (eds) High Performance Computing. ISC 2017. Lecture Notes in Computer Science, vol 10266. Springer, Cham. arXiv

[bkm]

Gholami, A.: Hill, J.: Malhotra, D.: Biros, G. (2016). “AccFFT: A library for distributed-memory FFT on CPU and GPU architectures”. arXiv

[bkm]

Gholami, A.: Malhotra, D.: Sundar, H. Biros,G. “FFT, FMM, or Multigrid? A comparative Study of State-Of-the-Art Poisson Solvers for Uniform and Nonuniform Grids in the Unit Cube” SIAM J. Sci. Comput., 38(3), C280–C306, arXiv

[bkm]

Liang, X.: Chen, J.: Tao, D.: Li, S.: Wu, P.: Li, H.: Ouyang, K.: Liu, Y.: Song, F.: Chen, Z. “Correcting soft errors online in fast fourier transform”
SC '17 Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis Article 30

[bkm]

Cecka, C. “Low communication FMM-accelerated FFT on GPUs”
SC '17 Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis Article 54

[bkm]

Tyutlyaeva, E.: Konyukhov, S.: Odintsov, I.: Moskovsky, A. “The Elbrus Platform Feasibility Assessment for High-Performance Computations” Proc. Russian Supercomputing Days 2016. Communications in Computer and Information Science, vol 687. Springer

[bkm]

Zhang, F.: Hu, C.: Yin, Q.: Hu, W. “A GPU Based Memory Optimized Parallel Method for FFT Implementation” ArXiv Preprint 2017

[bkm]

Bittens, S.: Zhang, R.: Iwen, M.A.: “A Deterministic Sparse FFT for Functions with Structured Fourier Sparsity” ArXiv Preprint 2017

[bkm]

George, J: Nejadriahl, H: Sorger, V. “Towards On-Chip Optical FFTs for Convolutional Neural Networks” ArXiv Preprint 2017

[bkm]

Bilardi, G.: Scquizzato, M.: Silvestri, F. “A Lower Bound Technique for Communication in BSP” ArXiv Preprint 2017

[bkm]

Mehri, S.: Zhang, R.: Iwen, M.A.: Christlieb, A. “A New Class Of Fully Discrete Sparse Fourier Transforms:
Faster Stable Implementations with Guarantees” Preprint

[bkm]

Roberts, M.: Bowman, J.C. “Multithreaded implicitly dealiased convolutions” pre-print paper

Bowman, J.C.: Ghoggali, Z. “The partial fast Fourier transform” pre-print

[bkm]

Kaparlov, M. “
Sample Efficient Estimation and Recovery in Sparse FFT via Isolation on Average” ArXiv pre-print

[bkm]

Shamshirgar, D.S: Tornberg A.-K. “Fast Ewald summation for electrostatic potentials with arbitrary periodicity” ArXiv pre-print

Shamshirgar, D.S.: Hess, B.: Tornberg, A.-K. “A comparison of the Spectral Ewald and Smooth Particle Mesh Ewald methods in GROMACS” ArXiv pre-print

[bkm]

Adámek, K.: Dimoudi, S.: Giles, M.: Armour, W. “Improved Acceleration of the GPU Fourier Domain Acceleration Search Algorithm” ArXiv pre-print

[bkm]

Nejadriahi, H.: HillerKuss, D.: George, J.K.: Sorger, V.J. “Integrated All-Optical Fast Fourier Transform: Design and Sensitivity Analysis” ArXiv pre-print

[bkm]

Yu, Q.: Maddah-Ali, M.A.: Avestimehr, A.S. “Coded Fourier Transform” ArXiv pre-print

[bkm]

Mortensen, M. “Shenfun – automating the spectral Galerkin method” ArXiv pre-print

[bkm]

Richardson, L.F.: Eddy, W.F. “An Algorithm for the 2D Radix-2 Sliding Window Fourier Transform” ArXiv pre-print

[bkm]

Ruiz-Antolin, D.: Townsend, A. “A nonuniform fast Fourier transform based on low rank approximation” ArXiv pre-print