Flatiron Institute Nonuniform Fast Fourier Transform

• Overview
  • What does FINUFFT do?
  • Why FINUFFT? Features and comparison against other CPU NUFFT libraries
  • GPU version: cuFINUFFT
  • Do I even need a NUFFT?
• Installation
  • Including FINUFFT into your own CMake project
  • CMake based installation and compilation
    • Notes on compiler flags for various systems
  • Classic GNU make based route
    • Quick linux GNU make install instructions
    • Make build tasks and options
    • Dependencies
  • 1) Linux: tips for installing dependencies and compiling
  • 2) Mac OSX: tips for installing dependencies and compiling
    • The clang route (default)
    • The GCC route
  • 3) Windows GNU make: tips for compiling
  • Building a Python interface to a locally compiled library
    • A few words about python environments
• Directories in this package
• Mathematical definitions of transforms
• Example usage from C++ and C
  • Quick-start example in C++
  • Quick-start example in C
  • 2D example in C++
  • Vectorized interface example
  • Guru interface examples
  • Thread safety for single-threaded transforms, and global state
• Documentation of all C++ functions
  • Simple and vectorized interfaces
    • 1D transforms
    • 2D transforms
    • 3D transforms
  • Guru plan interface
• Options parameters (CPU)
  • Summary and quick advice
  • Documentation of all options
    • Data handling options
    • Diagnostic options
    • Algorithm performance options
    • Thread safety options (advanced)
• Error (status) codes
  • Large internal arrays
• Troubleshooting
  • Mathematical “issues” and error size
  • Speed issues and advice
    • CPU library speed
    • GPU library speed
  • Crash (segfault) issues and advice
  • Other known issues with library or interfaces
  • Bug reports
• Tutorials and application demos
  • Fast evaluation of Fourier series at arbitrary points
    • 1D Fourier series
    • 2D Fourier series
  • Efficient evaluation of (continuous) Fourier transforms
    • 1D FTs evaluated at arbitrary frequencies
    • Faster FTs when frequencies lie on a grid
    • 1D FTs of singular functions
    • 2D FTs
    • Further reading
  • Periodic Poisson solve on non-Cartesian quadrature grid
  • Efficient sampling from Gaussian Random Fields (GRFs)
    • Further reading
  • Inverse 1D type 2 NUFFT: fitting a Fourier series to scattered samples
    • Well-conditioned example
    • Ill-conditioned example
    • Further reading
• Usage from Fortran
  • Quick-start example
  • Changing options
  • Summary of Fortran interface
  • Code examples
• MATLAB/octave interfaces
  • Quick-start examples
  • Full documentation
• Python interface
  • Quick-start examples
  • Full documentation
    • nufft1d1()
    • nufft1d2()
    • nufft1d3()
    • nufft2d1()
    • nufft2d2()
    • nufft2d3()
    • nufft3d1()
    • nufft3d2()
    • nufft3d3()
    • Plan
      • Plan.setpts()
      • Plan.execute()
• Julia interfaces (CPU and GPU)
• Changelog
• Developer notes
• Related packages
  • Other recommended NUFFT libraries
• Dependent packages, wrappers, users, and citations
  • Packages relying on FINUFFT or cuFINUFFT
  • Other wrappers to (cu)FINUFFT
  • Research output using (cu)FINUFFT
  • Some citations to FINUFFT that do not appear to be actual users
• Acknowledgments
• References
  • Background references
  • Talk slides