Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Implement a new fast method based on NFFT #8

Open
giordano opened this issue Jun 29, 2019 · 1 comment
Open

Implement a new fast method based on NFFT #8

giordano opened this issue Jun 29, 2019 · 1 comment
Labels
enhancement help wanted

Comments

@giordano
Copy link
Member

giordano commented Jun 29, 2019 •
edited
Loading

It would be interesting to implement the method described in

For the NFFT, there are

  • the NFFT.jl package, a pure Julia implementation of the Non-equidistant Fast Fourier Transform
  • the Julia interface to the C library, which however is not packaged properly and thus is not easily callable by this package
  • FINUFFT.jl, wrapper around finufft
@giordano
Copy link
Member Author

There's now a Python implementation of this method at https://github.com/flatironinstitute/nifty-ls/. See also the accompanying paper

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
enhancement help wanted
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@giordano