JuliaApproximation / JuliaApproximation/FastTransforms.jl
More flexible fourier transforms
Nobody has claimed this yet.
- Dominant language
- Julia
- Stars
- 281
- Forks
- 27
- PR merge metrics
- No merged PRs in 30d
Description
Currently I don't see a way to compute the nonuniform fourier transform at arbitrary points. nufft2 is the closest variant, but it requires a regular grid of x, y coordinates in the transform space. A more flexible one should take any number of arbitrary (x, y) pairs and return the same number of fourier coefficients. Or did I overlook something?
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by reviewing the existing nufft2 implementation and its accepted regular-grid x, y coordinates. Determine how arbitrary (x, y) pairs should map to Fourier coefficients, and define completion as supporting any number of input pairs while preserving the existing transform behavior.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- julia
- Domain
- data
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100