8000 GitHub - nanaln/python-nufft: Python bindings to a subset of the NUFFT algorithm
[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to content

nanaln/python-nufft

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

9 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Python bindings to a subset of the NUFFT algorithm. Only the 1D/type 3 case is implemented but it's way faster than Lomb-Scargle!

Usage

To install, run python setup.py install. Then, there is only one function: nufft. Assuming that you have a time series in t and y and you want to evaluate it at (angular) frequencies f:

import nufft
nufft.nufft(t, y, f)

You can specify your required precision using eps=1e-10. The default is 1e-10.

Authors and License

Python bindings by Dan Foreman-Mackey but the code that actually does the work is from the Greengard lab at NYU (see the website). The Fortran code is BSD licensed and the Python bindings are MIT licensed.

About

Python bindings to a subset of the NUFFT algorithm

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • Fortran 98.9%
  • Python 1.1%
0