NFFT Logo 3.0 API Reference
Main Page | Modules | Data Structures | Directories | File List | Data Fields | Globals

quadratureS2_test
[Fast evaluation of quadrature formulae on the sphere]


Enumerations

enum  boolean { NO = 0, YES = 1 }
 Enumeration for parameter values.
enum  testtype { ERROR = 0, TIMING = 1 }
 Enumeration for test modes.
enum  gridtype {
  GRID_GAUSS_LEGENDRE = 0, GRID_CLENSHAW_CURTIS = 1, GRID_HEALPIX = 2, GRID_EQUIDISTRIBUTION = 3,
  GRID_EQUIDISTRIBUTION_UNIFORM = 4
}
 Enumeration for quadrature grid types.
enum  functiontype {
  FUNCTION_RANDOM_BANDLIMITED = 0, FUNCTION_F1 = 1, FUNCTION_F2 = 2, FUNCTION_F3 = 3,
  FUNCTION_F4 = 4, FUNCTION_F5 = 5, FUNCTION_F6 = 6
}
 Enumeration for test functions.
enum  modes { USE_GRID = 0, RANDOM = 1 }
 TODO Add comment here.

Functions

int main (int argc, char **argv)
 The main program.

Function Documentation

int main (  int  argc,
char **  argv
) 
 

The main program.

Parameters:
argc The number of arguments
argv An array containing the arguments as C-strings
Returns:
Exit code
< The index variable for testcases

< The number of testcases

< The array containing the cut-off degrees * $N$

< The maximum cut-off degree $N$ for the* current testcase

< The array containing the grid size parameters

< The maximum grid size parameter

< The array containing the grid size parameters

< Index variable for cut-off degrees

< The maximum number of cut-off degrees

< The testfunction

< The test function's bandwidth

< Whether to use the NFSFT algorithm or not

< Whether to use the NFFT algorithm or not

< Whether to use the FPT algorithm or not

< The current NFFT cut-off parameter

< The current NFSFT threshold parameter

< The type of quadrature grid to be used

< The number of repetitions to be performed

< The number of repetitions to be performed

< The quadrature weights

< The quadrature nodes

< The quadrature nodes

< The reference function values

< The function values

< The function values

< The reference spherical Fourier * coefficients

< The spherical Fourier coefficients

< The NFSFT plan

< The NFSFT plan

< The NFSFT plan

< The computation time needed for a single * run

< The average computation time needed

< The average error $E_\infty$

< The average error $E_2$

< A loop variable

< A loop variable

< A loop variable

< A loop variable

< The current number of different * colatitudinal angles (for grids)

< The current number of different * longitudinal angles (for grids).

< The total number nodes.

< An array for saving the angles theta of a * grid

< An array for saving the angles phi of a * grid

< An FFTW plan for computing Clenshaw-Curtis quadrature weights

Definition at line 71 of file quadratureS2.c.

References nfsft_plan::f, nfsft_plan::f_hat, FFT_OUT_OF_PLACE, FFTW_INIT, nfsft_plan::N_total, ndsft_adjoint(), ndsft_trafo(), nfft_error_l_2_complex(), nfft_error_l_infty_complex(), NFFT_MAX, nfft_second(), nfsft_adjoint(), NFSFT_F_HAT_SIZE, nfsft_finalize(), nfsft_forget(), NFSFT_INDEX, nfsft_init_guru(), NFSFT_NO_FAST_ALGORITHM, NFSFT_NORMALIZED, nfsft_precompute(), nfsft_precompute_x(), nfsft_trafo(), NFSFT_USE_DPT, NFSFT_USE_NDFT, PI, PRE_PHI_HUT, PRE_PSI, nfsft_wisdom::threshold, and nfsft_plan::x.

Generated on 1 Nov 2006 by Doxygen 1.4.4