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 c06pcf with

direct ='F'

followed by a call with

direct ='B'

will restore the original data.

c06pcf uses a variant of the fast Fourier transform (FFT) algorithm (see Brigham (1974)) known as the Stockham self-sorting algorithm, which is described in Temperton (1983). If

n

is a large prime number or if

n

contains large prime factors, then the Fourier transform is performed using Bluestein's algorithm (see Bluestein (1968)), which expresses the DFT as a convolution that in turn can be efficiently computed using FFTs of highly composite sizes.

4 References

Bluestein L I (1968) A linear filtering approach to the computation of the discrete Fourier transform Northeast Electronics Research and Engineering Meeting Record 10 218–219

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$ – Character(1) Input: On entry: if the forward transform as defined in Section 3 is to be computed, direct must be set equal to 'F'.
If the backward transform is to be computed, direct must be set equal to 'B'.

Constraint: $direct ='F'$ or $'B'$ .
2: $x (n)$ – Complex (Kind=nag_wp) array Input/Output: On entry: if x is declared with bounds $(0 : n - 1)$ in the subroutine from which c06pcf is called, $x (j)$ must contain $z_{j}$ , for $j = 0, 1, \dots, n - 1$ .

On exit: the components of the discrete Fourier transform. If x is declared with bounds $(0 : n - 1)$ in the subroutine from which c06pcf is called, ${\hat{z}}_{k}$ is contained in $x (k)$ , for $0 \leq k \leq n - 1$ .
3: $n$ – Integer Input: On entry: $n$ , the number of data values.

Constraint: $n \geq 1$ .
4: $work (*)$ – Complex (Kind=nag_wp) array Workspace: Note: the dimension of the array work must be at least $2 \times n + 15$ .

The workspace requirements as documented for c06pcf may be an overestimate in some implementations.

On exit: the real part of $work (1)$ contains the minimum workspace required for the current value of n with this implementation.
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, $n = ⟨ value ⟩$ .
Constraint: $n \geq 1$ .

$ifail = 2$: On entry, $direct = ⟨ value ⟩$ .
Constraint: $direct ='F'$ or $'B'$ .

$ifail = 4$: 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 subsequent inverse transform and comparing the results with the original sequence (in exact arithmetic they would be identical).

8 Parallelism and Performance

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

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

n \times \log (n)

, but also depends on the factorization of

n

. c06pcf is faster if the only prime factors of

n

are

2

3

5

; and fastest of all if

n

is a power of

2

. When the Bluestein's FFT algorithm is in use, an additional complex workspace of size approximately

8 n

is allocated.

10 Example

This example reads in a sequence of complex data values and prints their discrete Fourier transform (as computed by c06pcf with

direct ='F'

). It then performs an inverse transform using c06pcf with

direct ='B'

, and prints the sequence so obtained alongside the original data values.

c06pc: FL CL CPP AD

NAG FL Interfacec06pcf (fft_​complex_​1d)

▸▿ 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 FL Interface
c06pcf (fft_complex_1d)