this routine should be preceded and followed by the complex conjugation of the data values and the transform (by negating the imaginary parts stored in

y

c06fcf uses the fast Fourier transform (FFT) algorithm (see Brigham (1974)).

4 References

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

5 Arguments

1: $x (n)$ – Real (Kind=nag_wp) array Input/Output: On entry: if x is declared with bounds $(0 : n - 1)$ in the subroutine from which c06fcf is called, $x (j)$ must contain $x_{j}$ , the real part of $z_{j}$ , for $j = 0, 1, \dots, n - 1$ .

On exit: the real parts $a_{k}$ of the components of the discrete Fourier transform. If x is declared with bounds $(0 : n - 1)$ in the subroutine from which c06fcf is called, for $0 \leq k \leq n - 1$ , $a_{k}$ is contained in $x (k)$ .
2: $y (n)$ – Real (Kind=nag_wp) array Input/Output: On entry: if y is declared with bounds $(0 : n - 1)$ in the subroutine from which c06fcf is called, $y (j)$ must contain $y_{j}$ , the imaginary part of $z_{j}$ , for $j = 0, 1, \dots, n - 1$ .

On exit: the imaginary parts $b_{k}$ of the components of the discrete Fourier transform. If y is declared with bounds $(0 : n - 1)$ in the subroutine from which c06fcf is called, then for $0 \leq k \leq n - 1$ , $b_{k}$ is contained in $y (k)$ .
3: $n$ – Integer Input: On entry: $n$ , the number of data values.

Constraint: $n > 1$ .
4: $work (n)$ – Real (Kind=nag_wp) array Workspace
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 = 3$: On entry, $n = ⟨ value ⟩$ .
Constraint: $n > 1$ .

$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

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

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

c06fcf 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

. c06fcf is faster if the only prime factors of

n

are

2

3

5

; and fastest of all if

n

is a power of

2

10 Example

This example reads in a sequence of complex data values and prints their discrete Fourier transform (as computed by c06fcf). It then performs an inverse transform using c06fcf, and prints the sequence so obtained alongside the original data values.

c06fc: FL CL CPP AD PY MB

NAG FL Interfacec06fcf (fft_​complex_​1d_​sep)

▸▿ 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
c06fcf (fft_complex_1d_sep)