#include <complex.h>
#include "util.h"
#include "nfft3.h"
Go to the source code of this file.
Data Structures | |
struct | fastsum_plan_ |
plan for fast summation algorithm More... | |
Defines | |
#define | EXACT_NEARFIELD (1U<< 0) |
Constant symbols. | |
Typedefs | |
typedef fastsum_plan_ | fastsum_plan |
plan for fast summation algorithm | |
Functions | |
void | fastsum_init_guru (fastsum_plan *ths, int d, int N_total, int M_total, complex(*kernel)(), double *param, unsigned flags, int nn, int m, int p, double eps_I, double eps_B) |
initialize fast summation plan | |
void | fastsum_finalize (fastsum_plan *ths) |
finalize plan | |
void | fastsum_exact (fastsum_plan *ths) |
direct summation | |
void | fastsum_precompute (fastsum_plan *ths) |
sort source nodes, precompute Fourier coefficients, etc. | |
void | fastsum_trafo (fastsum_plan *ths) |
fast NFFT-based summation algorithm |
reference: M. Fenn, G. Steidl, Fast NFFT based summation of radial functions. Sampl. Theory Signal Image Process., 3, 1-28, 2004.
|
direct summation
|
|
finalize plan
|
|
initialize fast summation plan inner boundary outer boundary init spline for near field computation init d-dimensional NFFT plan init d-dimensional FFTW plan |
|
sort source nodes, precompute Fourier coefficients, etc. sort source knots precompute spline values for near field init NFFT plan for transposed transform in first step precompute psi, the entries of the matrix B init Fourier coefficients init NFFT plan for transform in third step precompute psi, the entries of the matrix B precompute Fourier coefficients of regularised kernel |
|
fast NFFT-based summation algorithm limits for d-dimensional near field box first step of algorithm second step of algorithm third step of algorithm add near field |