NFFT.jl
NFFT.jl copied to clipboard
Julia implementation of the Non-equidistant Fast Fourier Transform (NFFT)
We want to integrate the "exponential of semicircle" window proposed in this paper: https://arxiv.org/abs/1808.06736 I am not completely sure but my FINUFFT wrapper indicates that it is slightly more accurate...
There are the real versions of the NFFT called NFCT and NFST: https://www-user.tu-chemnitz.de/~potts/nfft/fast_trig.php In my vision we can nicely put them together into `AbstractNFFT.jl` and `NFFT.jl`. To do this we...
Taken from #80: We want `p * f` to convert the vector `f` to the appropriate data type (e.g. `Float64` -> `ComplexF64`). This got removed during restructuring of the interface.
I open this issue for discussions around the benchmark suite located here: https://github.com/JuliaMath/NFFT.jl/tree/master/benchmark The results are automatically integrated into our documentation https://juliamath.github.io/NFFT.jl/dev/performance/ My idea would be to have a quick...
Dear Tobias & crew, I'm very glad you have mathematical descriptions of the transforms - this is essential for a professional math library. But there are a bunch of typos...
The result of a 1D NFFT of length N and a (N,1)-dimensional NFFT are quite inconsistent. Here is a MWE: ``` using NFFT M = 4 x1 = collect((-Int(M/2)):(Int(M/2)-1))/M N1...
This PR (hopefully) closes #100. The goal of this PR is to seamlessly create either CPU or GPU plans depending on the given argument(s). At the bottom of this comment...
Bumps [codecov/codecov-action](https://github.com/codecov/codecov-action) from 4 to 5. Release notes Sourced from codecov/codecov-action's releases. v5.0.0 v5 Release v5 of the Codecov GitHub Action will use the Codecov Wrapper to encapsulate the CLI....
This PR has the following changes: - Extend #159 to also work with GPU arrays, i.e., `convolve!` now works with real (GPU) array types - Use the new `Real` capabilities...