Main Page | Modules | Data Structures | Directories | File List | Data Fields | Globals | Related Pages

fastsum_test.c File Reference

Simple test program for the fast NFFT-based summation algorithm. More...

#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <complex.h>
#include <math.h>
#include "fastsum.h"
#include "kernels.h"

Functions

int main (int argc, char **argv)


Detailed Description

Simple test program for the fast NFFT-based summation algorithm.

Author:
Markus Fenn
Date:
2006

Function Documentation

int main int  argc,
char **  argv
 

< indices

< number of dimensions

< number of source nodes

< number of target nodes

< expansion degree

< cut-off parameter

< degree of smoothness

< name of kernel

< kernel function

< parameter for kernel

< plan for fast summation

< array for direct computation

< for time measurement

< for error computation

< inner boundary

< outer boundary

init two dimensional fastsum plan

init source knots in a d-ball with radius 0.25-eps_b/2

init target knots in a d-ball with radius 0.25-eps_b/2

direct computation

copy result

precomputation

fast computation

compute max error

finalise the plan


Generated on Wed May 10 20:39:39 2006 for NFFT by  doxygen 1.4.4