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

4 References

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

Temperton C (1983) Fast mixed-radix real Fourier transforms J. Comput. Phys. 52 340–350

5 Arguments

1: $m$ – Integer Input: On entry: $m$ , the first dimension of the transform.

Constraint: $m \geq 1$ .
2: $n$ – Integer Input: On entry: $n$ , the second dimension of the transform.

Constraint: $n \geq 1$ .
3: $x [m \times n]$ – const double Input: On entry: the real input dataset $x$ , where $x_{j_{1} j_{2}}$ is stored in $x [j_{2} \times m + j_{1}]$ , for $j_{1} = 0, 1, \dots, m - 1$ and $j_{2} = 0, 1, \dots, n - 1$ .
4: $y [(m / 2 + 1) \times n]$ – Complex Output: On exit: the complex output dataset $\hat{z}$ , where ${\hat{z}}_{k_{1} k_{2}}$ is stored in $y [k_{2} \times (m / 2 + 1) + k_{1}]$ , for $k_{1} = 0, 1, \dots, m / 2$ and $k_{2} = 0, 1, \dots, n - 1$ . Note the first dimension is cut roughly by half to remove the redundant information due to conjugate symmetry.
5: $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, $m = ⟨ value ⟩$ .
Constraint: $m \geq 1$ .

On entry, $n = ⟨ value ⟩$ .
Constraint: $n \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 forward transform using c06pvc and a backward transform using c06pwc, 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.

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

c06pvc 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 by c06pvc is approximately proportional to

m n \log (m n)

, but also depends on the factors of

m

and

n

. c06pvc is fastest if the only prime factors of

m

and

n

are

2

3

and

5

, and is particularly slow if

m

n

is a large prime, or has large prime factors.

Workspace is internally allocated by c06pvc. The total size of these arrays is approximately proportional to

m n

10 Example

This example reads in a bivariate sequence of real data values and prints their discrete Fourier transforms as computed by c06pvc. Inverse transforms are then calculated by calling c06pwc showing that the original sequences are restored.

c06pv: FL CL CPP AD PY MB

NAG CL Interfacec06pvc (fft_​real_​2d)

▸▿ 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
c06pvc (fft_real_2d)