FFTW

FFTW is a C subroutine library for computing the discrete Fourier transform (DFT) in one or more dimensions, of arbitrary input size, and of both real and complex data (as well as of even/odd data, i.e. the discrete cosine/sine transforms or DCT/DST). We believe that FFTW, which is free software, should become the FFT library of choice for most applications. The latest official release of FFTW is version 3.3.3, available from our download page. Version 3.3 introduced support for the AVX x86 extensions, a distributed-memory implementation on top of MPI, and a Fortran 2003 API. Version 3.3.1 introduced support for the ARM Neon extensions.


References in zbMATH (referenced in 341 articles , 1 standard article )

Showing results 1 to 20 of 341.
Sorted by year (citations)

1 2 3 ... 16 17 18 next

  1. Antti-Pekka Hynninen, Dmitry I. Lyakh: cuTT: A High-Performance Tensor Transpose Library for CUDA Compatible GPUs (2017) arXiv
  2. Attems, Maximilian; Casalderrey-Solana, Jorge; Mateos, David; Santos-Oliván, Daniel; Sopuerta, Carlos F.; Triana, Miquel; Zilhão, Miguel: Paths to equilibrium in non-conformal collisions (2017)
  3. Bürgel, Florian; Kazimierski, Kamil S.; Lechleiter, Armin: A sparsity regularization and total variation based computational framework for the inverse medium problem in scattering (2017)
  4. Clara Happ: Object-Oriented Software for Functional Data (2017) arXiv
  5. Cook, Steven C.; Hohenegger, Christel; Shinar, Tamar: A micro-macro framework for analyzing steric and hydrodynamic interactions in gliding assays (2017)
  6. Engelberg, Shlomo: Elementary number theory and Rader’s FFT (2017)
  7. Huang, Wen; Gallivan, K.A.; Zhang, Xiangxiong: Solving phaselift by low-rank Riemannian optimization methods for complex semidefinite constraints (2017)
  8. Hu, Xianfeng; Iwen, Mark; Kim, Hyejin: Rapidly computing sparse Legendre expansions via sparse Fourier transforms (2017)
  9. Kruglyakov, Mikhail; Bloshanskaya, Lidia: High-performance parallel solver for integral equations of electromagnetics based on Galerkin method (2017)
  10. Moscovich, Amit; Nadler, Boaz: Fast calculation of boundary crossing probabilities for Poisson processes (2017)
  11. Peter Steinbach, Matthias Werner: gearshifft - The FFT Benchmark Suite for Heterogeneous Platforms (2017) arXiv
  12. Robin Scheibler, Eric Bezzam, Ivan Dokmanic: Pyroomacoustics: A Python package for audio room simulations and array processing algorithms (2017) arXiv
  13. Slevinsky, Richard Mikael; Olver, Sheehan: A fast and well-conditioned spectral method for singular integral equations (2017)
  14. Zhang, Chenglong; Gamba, Irene M.: A conservative scheme for Vlasov Poisson Landau modeling collisional plasmas (2017)
  15. Zulkoski, Edward; Bright, Curtis; Heinle, Albert; Kotsireas, Ilias; Czarnecki, Krzysztof; Ganesh, Vijay: Combining SAT solvers with computer algebra systems to verify combinatorial conjectures (2017)
  16. Anderson, Christopher R.: High order expanding domain methods for the solution of Poisson’s equation in infinite domains (2016)
  17. Balac, Stéphane; Fernandez, Arnaud: SPIP: a computer program implementing the interaction picture method for simulation of light-wave propagation in optical fibre (2016)
  18. Breiten, Tobias; Simoncini, Valeria; Stoll, Martin: Low-rank solvers for fractional differential equations (2016)
  19. Candy, J.; Belli, E.A.; Bravenec, R.V.: A high-accuracy Eulerian gyrokinetic solver for collisional plasmas (2016)
  20. Chillotti, Ilaria; Gama, Nicolas; Georgieva, Mariya; Izabachène, Malika: Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds (2016)

1 2 3 ... 16 17 18 next