This routine calls c06pqf and c06prf to perform 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: $y ((m / 2 + 1) \times n)$ – Complex (Kind=nag_wp) array Input: On entry: the Hermitian sequence of complex input dataset $z$ , where $z_{j_{1} j_{2}}$ is stored in $y (j_{2} \times (m / 2 + 1) + j_{1})$ , for $j_{1} = 0, 1, \dots, m / 2$ and $j_{2} = 0, 1, \dots, n - 1$ . That is, if y is regarded as a two-dimensional array of dimension $(0 : m / 2, 0 : n - 1)$ , $y (j_{1}, j_{2})$ must contain $z_{j_{1} j_{2}}$ .
4: $x (m \times n)$ – Real (Kind=nag_wp) array Output: On exit: the real output dataset $\hat{x}$ , where ${\hat{x}}_{k_{1} k_{2}}$ is stored in $x (k_{2} \times m + k_{1})$ , for $k_{1} = 0, 1, \dots, m - 1$ and $k_{2} = 0, 1, \dots, n - 1$ . That is, if x is regarded as a two-dimensional array of dimension $(0 : m - 1, 0 : n - 1)$ , $x (k_{1}, k_{2})$ contains ${\hat{x}}_{k_{1} k_{2}}$ .
5: $ifail$ – Integer Input/Output: On entry: ifail must be set to $0$ , $−1$ or $1$ to set behaviour on detection of an error; these values have no effect when no error is detected.
A value of $0$ causes the printing of an error message and program execution will be halted; otherwise program execution continues. A value of $−1$ means that an error message is printed while a value of $1$ means that it is not.

If halting is not appropriate, the value $−1$ or $1$ is recommended. If message printing is undesirable, then the value $1$ is recommended. Otherwise, the value $0$ is recommended. When the value $- 1$ or $1$ is used it is essential to test the value of ifail on exit.

On exit: $ifail = 0$ unless the routine detects an error or a warning has been flagged (see Section 6).

6 Error Indicators and Warnings

If on entry

ifail = 0

−1

, explanatory error messages are output on the current error message unit (as defined by x04aaf).

Errors or warnings detected by the routine:

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

$ifail = 2$: On entry, $n = ⟨ value ⟩$ .
Constraint: $n \geq 1$ .

$ifail = 3$: An internal error has occurred in this routine. Check the routine call and any array sizes. If the call is correct then please contact NAG for assistance.

$ifail = - 99$: An unexpected error has been triggered by this routine. Please contact NAG.
See Section 7 in the Introduction to the NAG Library FL Interface for further information.

$ifail = - 399$: Your licence key may have expired or may not have been installed correctly.
See Section 8 in the Introduction to the NAG Library FL Interface for further information.

$ifail = - 999$: Dynamic memory allocation failed.
See Section 9 in the Introduction to the NAG Library FL Interface for further information.

7 Accuracy

Some indication of accuracy can be obtained by performing a forward transform using c06pvf and a backward transform using c06pwf, 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.

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

c06pwf 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 routine. Please also consult the Users' Note for your implementation for any additional implementation-specific information.

9 Further Comments

The time taken by c06pwf is approximately proportional to

m n \log (m n)

, but also depends on the factors of

m

and

n

. c06pwf 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 c06pwf. The total size of these arrays is approximately proportional to

m n

10 Example

See c06pvf.

NAG Library Manual, Mark 28.5

Interfaces: FL CL CPP AD PY MB

NAG FL Interface Introduction

C06 (Sum) Chapter Contents

C06 (Sum) Chapter Introduction

c06pw: FL CL CPP AD PY MB

NAG FL Interfacec06pwf (fft_​hermitian_​2d)

▸▿ Contents

1 Purpose

2 Specification

3 Description