Skip to content

ThomasA/python-nufft

This branch is up to date with dfm/python-nufft:master.

Folders and files

NameName
Last commit message
Last commit date

Latest commit

author
Thomas Arildsen
Apr 13, 2018
207f206 · Apr 13, 2018

History

46 Commits
Apr 12, 2018
Dec 19, 2017
Dec 15, 2017
Mar 2, 2018
Mar 5, 2018
Mar 5, 2018
Dec 19, 2017
Dec 18, 2017
Mar 5, 2018
Dec 19, 2017
Dec 19, 2017
Dec 26, 2017

Repository files navigation

Python-NUFFT

https://travis-ci.org/ThomasA/python-nufft.svg?branch=master https://coveralls.io/repos/github/ThomasA/python-nufft/badge.svg?branch=master Documentation Status

Python bindings to a subset of the NUFFT algorithm. 1D, 2D, and 3D cases are implemented.

Usage

The documentation can be found on ReadTheDocs.

To install, run python setup.py install. Then, to evaluate a type-3 FT in 1D, use nufft.nufft1d3. Assuming that you have a time series in t and y and you want to evaluate it at (angular) frequencies f:

import nufft
ft = nufft.nufft1d3(t, y, f)

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

Authors and License

Python bindings by Dan Foreman-Mackey, Thomas Arildsen, and Marc T. Henry de Frahan 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 80.9%
  • Python 19.1%