Overview
Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore nonuniform Fast Fourier Transform (NUFFT) algorithms and their implementation in Julia through this 10-minute conference talk from JuliaCon Local Paris 2025. Learn how NUFFT algorithms enable efficient evaluation of Fourier series from non-equispaced points, with applications spanning medical imaging to physical system simulations. Discover the NonuniformFFTs.jl package, which provides a highly optimized NUFFT implementation compatible with both CPUs and various GPU platforms. Examine the unique features and optimization strategies that make this implementation one of the fastest available GPU solutions for large-scale problems. Gain insights into the technical approaches used to achieve high performance in nonuniform FFT computations and understand how this Julia package addresses the computational challenges of working with non-equispaced data points in Fourier analysis.
Syllabus
FFTs on non-equispaced points with NonuniformFFTs.jl | Polanco | Paris 2025
Taught by
The Julia Programming Language