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 489 articles , 1 standard article )

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

1 2 3 ... 23 24 25 next

  1. Bright, Curtis; Kotsireas, Ilias; Heinle, Albert; Ganesh, Vijay: Complex Golay pairs up to length 28: a search via computer algebra and programmatic SAT (2021)
  2. Costa, Pedro; Phillips, Everett; Brandt, Luca; Fatica, Massimiliano: GPU acceleration of \textitCaNSfor massively-parallel direct numerical simulations of canonical fluid flows (2021)
  3. Hare, Kevin G.; Jankauskas, Jonas: On Newman and Littlewood polynomials with a prescribed number of zeros inside the unit disk (2021)
  4. Languasco, Alessandro: Efficient computation of the Euler-Kronecker constants of prime cyclotomic fields (2021)
  5. Anantharamu, Sreevatsa; Mahesh, Krishnan: Analysis of wall-pressure fluctuation sources from direct numerical simulation of turbulent channel flow (2020)
  6. Bright, Curtis; Kotsireas, Ilias; Ganesh, Vijay: Applying computer algebra systems with SAT solvers to the Williamson conjecture (2020)
  7. Cantisán, Julia; Coccolo, Mattia; Seoane, Jesús M.; Sanjuán, Miguel A. F.: Delay-induced resonance in the time-delayed Duffing oscillator (2020)
  8. Cayama, Jorge; Cuesta, Carlota M.; de la Hoz, Francisco: Numerical approximation of the fractional Laplacian on (\mathbbR) using orthogonal families (2020)
  9. Chang, Patrick; Pienaar, Etienne; Gebbie, Tim: Malliavin-Mancino estimators implemented with nonuniform fast Fourier transforms (2020)
  10. Chillotti, Ilaria; Gama, Nicolas; Georgieva, Mariya; Izabachène, Malika: TFHE: fast fully homomorphic encryption over the torus (2020)
  11. Dimitrina S. Dimitrova, Vladimir K. Kaishev, Senren Tan: Computing the Kolmogorov-Smirnov Distribution When the Underlying CDF is Purely Discrete, Mixed, or Continuous (2020) not zbMATH
  12. Einkemmer, Lukas; Ostermann, Alexander; Piazzola, Chiara: A low-rank projector-splitting integrator for the Vlasov-Maxwell equations with divergence correction (2020)
  13. Ernesti, Felix; Schneider, Matti; Böhlke, Thomas: Fast implicit solvers for phase-field fracture problems on heterogeneous microstructures (2020)
  14. Feng, Hongsong; Zhao, Shan: FFT-based high order central difference schemes for three-dimensional Poisson’s equation with various types of boundary conditions (2020)
  15. García-Cervera, Carlos J.; Giorgi, Tiziana; Joo, Sookyung: Boundary vortex formation in polarization-modulated orthogonal smectic liquid crystals (2020)
  16. Haddar, Houssem; Liu, Xiaoli: A time domain factorization method for obstacles with impedance boundary conditions (2020)
  17. Héctor Andrade-Loarca, Gitta Kutyniok: tfShearlab: The TensorFlow Digital Shearlet Transform for Deep Learning (2020) arXiv
  18. Jorba, Àngel; Jorba-Cuscó, Marc; Rosales, José J.: The vicinity of the Earth-Moon (L_1) point in the bicircular problem (2020)
  19. Jose Manuel López; Daniel Feldmann; Markus Rampp; Alberto Vela-Martín; Liang Shie; Marc Avila: nsCouette - A high-performance code for direct numerical simulations of turbulent Taylor-Couette flow (2020) not zbMATH
  20. Ju, Caleb; Solomonik, Edgar: Derivation and analysis of fast bilinear algorithms for convolution (2020)

1 2 3 ... 23 24 25 next