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

Public API
[NFSFT]


Defines

#define NFSFT_NORMALIZED_OLD   1<<0
 If set, all computations are carried out with spherical harmonics normalized with respect to the $\text{L}^2\left(\mathbb{S}^2\right)$ standard inner product

\[ <f,g>_{\mathbb{S}^2} = \int_{0}^{\pi} \int_{-\pi}^{\pi} f(\vartheta,\varphi) \overline{g(\vartheta,\varphi)} \; d\varphi \; d\vartheta. \]

.

#define NFSFT_FAST_ONLY_OLD   1<<1
 If set, only the fast transformations work.
#define NFSFT_BW_WINDOW_OLD   1<<2
 If set, only fast transformations for bandwidth in a certain bandwidth window will work.
#define NFSFT_USE_NDFT_OLD   1<<3
 If set, the direct NDFT algorithm will be used.

Typedefs

typedef nfsft_plan_s_oldnfsft_plan_old
 Typedef for transform plans.
typedef int nfsft_precompute_flags_old
 Typedef for precomputation flags.
typedef int nfsft_flags_old
 Typedef for transform flags.
typedef infsft_plan_s_oldinfsft_plan_old
 Typedef for inverse transform plans.
typedef int infsft_flags_old
 Typedef for inverse transform flags.

Functions

nfsft_plan_old nfsft_init_old (int M, int D, complex **f_hat, double *x, complex *f, nfsft_flags_old flags)
 Creates a transform plan.
void nfsft_forget_old ()
 Forget all wisdom.
void ndsft_trafo_old (nfsft_plan_old plan)
 Executes a direct NDSFT, i.e.
void ndsft_adjoint_old (nfsft_plan_old plan)
 Executes a direct adjoint NDSFT, i.e.
void nfsft_trafo_old (nfsft_plan_old plan)
 Executes a NFSFT, i.e.
void nfsft_adjoint_old (nfsft_plan_old plan)
 Executes an adjoint NFSFT, i.e.
void nfsft_finalize_old (nfsft_plan_old plan)
 Destroys a plan.

Define Documentation

#define NFSFT_BW_WINDOW_OLD   1<<2
 

If set, only fast transformations for bandwidth in a certain bandwidth window will work.

If $N$ is the power of two up to which precomputations is done, only transformations for bandwidth $M$ with $N/2 < M \le N$ will work.

See also:
nfsft_precompute_old

nfsft_trafo_old

nfsft_adjoint_old

Author:
Jens Keiner

#define NFSFT_FAST_ONLY_OLD   1<<1
 

If set, only the fast transformations work.

See also:
nfsft_precompute_old

nfsft_trafo_old

nfsft_adjoint_old

Author:
Jens Keiner

#define NFSFT_NORMALIZED_OLD   1<<0
 

If set, all computations are carried out with spherical harmonics normalized with respect to the $\text{L}^2\left(\mathbb{S}^2\right)$ standard inner product

\[ <f,g>_{\mathbb{S}^2} = \int_{0}^{\pi} \int_{-\pi}^{\pi} f(\vartheta,\varphi) \overline{g(\vartheta,\varphi)} \; d\varphi \; d\vartheta. \]

.

See also:
nfsft_init

nfsft_trafo_old

nfsft_adjoint_old

ndsft_trafo_old

ndsft_adjoint_old

Author:
Jens Keiner

#define NFSFT_USE_NDFT_OLD   1<<3
 

If set, the direct NDFT algorithm will be used.

See also:
nfsft_trafo_old

nfsft_adjoint_old

Author:
Jens Keiner


Typedef Documentation

typedef int infsft_flags_old
 

Typedef for inverse transform flags.

Author:
Jens Keiner

typedef struct infsft_plan_s_old* infsft_plan_old
 

Typedef for inverse transform plans.

Author:
Jens Keiner

typedef int nfsft_flags_old
 

Typedef for transform flags.

Author:
Jens Keiner

typedef struct nfsft_plan_s_old* nfsft_plan_old
 

Typedef for transform plans.

Author:
Jens Keiner

typedef int nfsft_precompute_flags_old
 

Typedef for precomputation flags.

Author:
Jens Keiner


Function Documentation

void ndsft_adjoint_old nfsft_plan_old  plan  ) 
 

Executes a direct adjoint NDSFT, i.e.

Check for normalization.

void ndsft_trafo_old nfsft_plan_old  plan  ) 
 

Executes a direct NDSFT, i.e.

Check for normalization.

void nfsft_adjoint_old nfsft_plan_old  plan  ) 
 

Executes an adjoint NFSFT, i.e.

Counter for loops

Check for normalization.

void nfsft_finalize_old nfsft_plan_old  plan  ) 
 

Destroys a plan.

  • plan The plan
Author:
Jens Keiner

void nfsft_forget_old  ) 
 

Forget all wisdom.

Author:
Jens Keiner

nfsft_plan_old nfsft_init_old int  M,
int  D,
complex **  f_hat,
double *  x,
complex *  f,
nfsft_flags_old  flags
 

Creates a transform plan.

  • M The bandwidth $M$
  • D The number of nodes $D$
  • f_hat Fourier coefficients $\left(a_k^n\right)_{(k,n) \in \mathcal{I}^M}$
  • x The nodes $\left(\mathbf{\xi}_d\right)_{d = 0}^{D - 1}$
  • f Function values $\left(f_d\right)_{d = 0}^{D - 1}$
  • flags Flags
Returns:
The plan
Author:
Jens Keiner

void nfsft_trafo_old nfsft_plan_old  plan  ) 
 

Executes a NFSFT, i.e.

Counter for loops

Check for normalization.


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