|
3.2.2 |
| Fast NFFT-based summation algorithm | |
| Header file for the fast NFFT-based summation algorithm | |
| Simple test program for the fast NFFT-based summation algorithm, called by fastsum.m | |
| Simple test program for the fast NFFT-based summation algorithm | |
| File with predefined kernels for the fast summation algorithm | |
| Header file with predefined kernels for the fast summation algorithm | |
| NFFT-based pseudo-polar FFT and inverse | |
| NFFT-based polar FFT and inverse on modified polar grid | |
| NFFT-based polar FFT and inverse | |
| NFFT-based discrete inverse Radon transform | |
| NFFT-based discrete Radon transform | |
| Testing the nfft | |
| Testing ndft, Horner-like ndft, and fully precomputed ndft | |
| Testing the nfft againt a Taylor expansion based version | |
| Header file for utility functions used by the nfft3 library | |
| Header file for adjoint solver | |
| Implementation file for the FPT module | |
| Implementation file for the NFSFT module | |
| Header file for functions related to Wigner-d/D functions | |
| Implementation file for the solver module | |