in this definition.) The minus sign is taken in the argument of the exponential within the summation when the forward transform is required, and the plus sign is taken when the backward transform is required.

A call of c06pxc with

direct = Nag_ForwardTransform

followed by a call with

direct = Nag_BackwardTransform

will restore the original data.

This function performs multiple one-dimensional discrete Fourier transforms by the fast Fourier transform (FFT) algorithm (see Brigham (1974)).

4 References

Brigham E O (1974) The Fast Fourier Transform Prentice–Hall

Temperton C (1983) Self-sorting mixed-radix fast Fourier transforms J. Comput. Phys. 52 1–23

5 Arguments

1: $direct$ – Nag_TransformDirection Input: On entry: if the forward transform as defined in Section 3 is to be computed, direct must be set equal to $Nag_ForwardTransform$ .
If the backward transform is to be computed, direct must be set equal to $Nag_BackwardTransform$ .

Constraint: $direct = Nag_ForwardTransform$ or $Nag_BackwardTransform$ .
2: $n1$ – Integer Input: On entry: $n_{1}$ , the first dimension of the transform.

Constraint: $n1 \geq 1$ .
3: $n2$ – Integer Input: On entry: $n_{2}$ , the second dimension of the transform.

Constraint: $n2 \geq 1$ .
4: $n3$ – Integer Input: On entry: $n_{3}$ , the third dimension of the transform.

Constraint: $n3 \geq 1$ .
5: $x [n1 \times n2 \times n3]$ – Complex Input/Output: On entry: the complex data values. Data values are stored in x using column-major ordering for storing multidimensional arrays; that is, $z_{j_{1} j_{2} j_{3}}$ is stored in $x [j_{1} + n_{1} j_{2} + n_{1} n_{2} j_{3}]$ .

On exit: the corresponding elements of the computed transform.
6: $fail$ – NagError * Input/Output: The NAG error argument (see Section 7 in the Introduction to the NAG Library CL Interface).

6 Error Indicators and Warnings

NE_ALLOC_FAIL: Dynamic memory allocation failed.
See Section 3.1.2 in the Introduction to the NAG Library CL Interface for further information.
NE_BAD_PARAM: On entry, argument $⟨ value ⟩$ had an illegal value.
NE_INT: On entry, $n1 = ⟨ value ⟩$ .
Constraint: $n1 \geq 1$ .

On entry, $n2 = ⟨ value ⟩$ .
Constraint: $n2 \geq 1$ .

On entry, $n3 = ⟨ value ⟩$ .
Constraint: $n3 \geq 1$ .
NE_INTERNAL_ERROR: An internal error has occurred in this function. Check the function call and any array sizes. If the call is correct then please contact NAG for assistance.
See Section 7.5 in the Introduction to the NAG Library CL Interface for further information.
NE_NO_LICENCE: Your licence key may have expired or may not have been installed correctly.
See Section 8 in the Introduction to the NAG Library CL Interface for further information.

7 Accuracy

Some indication of accuracy can be obtained by performing a subsequent inverse transform and comparing the results with the original sequence (in exact arithmetic they would be identical).

8 Parallelism and Performance

Background information to multithreading can be found in the Multithreading documentation.

c06pxc is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.

c06pxc makes calls to BLAS and/or LAPACK routines, which may be threaded within the vendor library used by this implementation. Consult the documentation for the vendor library for further information.

Please consult the X06 Chapter Introduction for information on how to control and interrogate the OpenMP environment used within this function. Please also consult the Users' Note for your implementation for any additional implementation-specific information.

9 Further Comments

The time taken is approximately proportional to

n_{1} n_{2} n_{3} \times \log (n_{1} n_{2} n_{3})

, but also depends on the factorization of the individual dimensions

n_{1}

n_{2}

and

n_{3}

. c06pxc is faster if the only prime factors are

2

3

5

; and fastest of all if they are powers of

2

10 Example

This example reads in a trivariate sequence of complex data values and prints the three-dimensional Fourier transform. It then performs an inverse transform and prints the sequence so obtained, which may be compared to the original data values.

c06px: FL CL CPP AD PY MB

NAG CL Interfacec06pxc (fft_​complex_​3d)

▸▿ Contents

1 Purpose

2 Specification

3 Description

4 References

5 Arguments

6 Error Indicators and Warnings

7 Accuracy

8 Parallelism and Performance

9 Further Comments

10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results

NAG CL Interface
c06pxc (fft_complex_3d)