Fast Gauss transforms with complex parameters using NFFTs

Stefan Kunis, Daniel Potts, Gabriele SteidlJ. Num. Math 2006 · OpenReview

Abstract

We construct a fast algorithm for the computation of discrete Gauss transforms with complex parameters, capable of dealing with non equispaced points. Our algorithm is based on the fast Fourier transform at non equispaced knots and requires only ( N ) arithmetic operations.
BibTeX
@article{kunis2006fast,
  author = {Stefan Kunis and Daniel Potts and Gabriele Steidl},
  title = {{Fast Gauss transforms with complex parameters using NFFTs}},
  journal = {J. Num. Math.},
  year = {2006},
  url = {https://openreview.net/forum?id=nwylcjLBdj},
}

Loading related content...

Figure