SEARCH

SEARCH BY CITATION

References

  • [1]
    A. Dutt and V. Rokhlin, SIAM J. Sci. Comput. 14(6), 1368–1393 (1993).
  • [2]
    A. Dutt and V. Rokhlin, Appl. Comput. Harmon. Anal. 2(1), 85–100 (1995).
  • [3]
    G. Beylkin, Appl. Comput. Harmon. Anal. 2(4), 363–381 (1995).
  • [4]
    G. Steidl, Adv. Comput. Math. 9(3–4), 337–352 (1998).
  • [5]
    A. F. Ware, SIAM Rev. 40, 838 – 856 (1998).
  • [6]
    D. Potts, G. Steidl, and M. Tasche, Fast Fourier transforms for nonequispaced data: A tutorial, in: Modern Sampling Theory: Mathematics and Applications, edited by J. J. Benedetto and P. J. S. G. Ferreira (Birkhäuser, Boston, MA, USA, 2001), chap. 12, pp. 247 – 270.
  • [7]
    J. A. Fessler and B. P. Sutton, IEEE Trans. Signal Process. 51, 560 – 574 (2003).
  • [8]
    L. Greengard and J. Y. Lee, SIAM Rev. 46(3), 443–454 (electronic) (2004).
  • [9]
    J. Keiner, S. Kunis, and D. Potts, ACM Trans. Math. Software 36(4), Art. 19, 30 (2009).
  • [10]
    T. Sorensen, T. Schaeffter, K. Noe, and M. Hansen, IEEE Transactions on Medical Imaging 27(4), 538 –547 (2008).
  • [11]
    P. Gwosdek, C. Schmaltz, J. Weickert, and T. Teubner, Preprint (2011).
  • [12]
    J. Keiner, S. Kunis, and D. Potts, NFFT 3.0, C subroutine library, http://www.tu-chemnitz.de/˜potts/nfft.
  • [13]
    S. Kunis and S. Kunis, CUNFFT 1.0beta, CUDA subroutine library, http://www.analysis.uni-osnabrueck.de.
  • [14]
    C. F. Van Loan, Computational Frameworks for the Fast Fourier Transform (SIAM, Philadelphia, PA, USA, 1992).
  • [15]
    M. Frigo and S. G. Johnson, Proceedings of the IEEE 93(2), 216 – 231 (2005).
  • [16]
    NVIDIA Corporation, NVIDIA CUDA C Programming Guide 2012, Version 4.2, http://developer.nvidia.com/nvidia-gpu-computing-documentation.
  • [17]
    NVIDIA Corporation, CUDA Toolkit 4.1 CUFFT Library Programming Guide 2012, http://developer.nvidia.com/nvidia-gpu-computing-documentation.