, nag_sum_fft_complex_1d_multi (c06psc) simultaneously calculates the (forward or backward) discrete Fourier transforms of all the sequences defined by

{\hat{z}}_{k}^{p} = \frac{1}{\sqrt{n}} \sum_{j = 0}^{n - 1} z_{j}^{p} \times \exp (\pm i \frac{2 π j k}{n}), k = 0, 1, \dots, n - 1 ​ and ​ p = 1, 2, \dots, m .

(Note the scale factor

\frac{1}{\sqrt{n}}

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 nag_sum_fft_complex_1d_multi (c06psc) with

direct = Nag_ForwardTransform

followed by a call with

direct = Nag_BackwardTransform

will restore the original data.

The function 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). Special code is provided for the factors

2

3

and

5

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_TransformDirectionInput: 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: $n$ – IntegerInput: On entry: $n$ , the number of complex values in each sequence.

Constraint: $n \geq 1$ .
3: $m$ – IntegerInput: On entry: $m$ , the number of sequences to be transformed.

Constraint: $m \geq 1$ .
4: $x [n \times m]$ – ComplexInput/Output: On entry: the complex data values $z_{j}^{p}$ stored in $x [(p - 1) \times n + j]$ , for $j = 0, 1, \dots, n - 1$ and $p = 1, 2, \dots, m$ .

On exit: is overwritten by the complex transforms.
5: $fail$ – NagError *Input/Output: The NAG error argument (see Section 3.7 in How to Use the NAG Library and its Documentation).

6

Error Indicators and Warnings

NE_ALLOC_FAIL: Dynamic memory allocation failed.
See Section 2.3.1.2 in How to Use the NAG Library and its Documentation for further information.
NE_BAD_PARAM: On entry, argument $〈value〉$ had an illegal value.

$〈value〉$ is an invalid value of direct.
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.

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 2.7.6 in How to Use the NAG Library and its Documentation for further information.
NE_NO_LICENCE: Your licence key may have expired or may not have been installed correctly.
See Section 2.7.5 in How to Use the NAG Library and its Documentation 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

nag_sum_fft_complex_1d_multi (c06psc) is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.

nag_sum_fft_complex_1d_multi (c06psc) 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 nag_sum_fft_complex_1d_multi (c06psc) is approximately proportional to

n m \log (n)

, but also depends on the factors of

n

. nag_sum_fft_complex_1d_multi (c06psc) is fastest if the only prime factors of

n

are

2

3

and

5

, and is particularly slow if

n

is a large prime, or has large prime factors. This function internally allocates a workspace of

n m + n + 15

Complex values.

10

Example

This example reads in sequences of complex data values and prints their discrete Fourier transforms (as computed by nag_sum_fft_complex_1d_multi (c06psc) with

direct = Nag_ForwardTransform

). Inverse transforms are then calculated using nag_sum_fft_complex_1d_multi (c06psc) with

direct = Nag_BackwardTransform

and printed out, showing that the original sequences are restored.

NAG Library Function Document

nag_sum_fft_complex_1d_multi (c06psc)

▸▿ 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

1

Purpose

2

Specification

3

Description