NAG Library Routine Document
C06FPF
1 Purpose
C06FPF computes the discrete Fourier transforms of $m$ sequences, each containing $n$ real data values. This routine is designed to be particularly efficient on vector processors.
2 Specification
INTEGER 
M, N, IFAIL 
REAL (KIND=nag_wp) 
X(M*N), TRIG(2*N), WORK(M*N) 
CHARACTER(1) 
INIT 

3 Description
Given
$m$ sequences of
$n$ real data values
${x}_{\mathit{j}}^{\mathit{p}}$, for
$\mathit{j}=0,1,\dots ,n1$ and
$\mathit{p}=1,2,\dots ,m$, C06FPF simultaneously calculates the Fourier transforms of all the sequences defined by
(Note the scale factor
$\frac{1}{\sqrt{n}}$ in this definition.)
The transformed values
${\hat{z}}_{k}^{p}$ are complex, but for each value of
$p$ the
${\hat{z}}_{k}^{p}$ form a Hermitian sequence (i.e.,
${\hat{z}}_{nk}^{p}$ is the complex conjugate of
${\hat{z}}_{k}^{p}$), so they are completely determined by
$mn$ real numbers (see also the
C06 Chapter Introduction).
The discrete Fourier transform is sometimes defined using a positive sign in the exponential term:
To compute this form, this routine should be followed by forming the complex conjugates of the
${\hat{z}}_{k}^{p}$; that is
$x\left(\mathit{k}\right)=x\left(\mathit{k}\right)$, for
$\mathit{k}=\left(n/2+1\right)\times m+1,\dots ,m\times n$.
The routine uses a variant of the fast Fourier transform (FFT) algorithm (see
Brigham (1974)) known as the Stockham selfsorting algorithm, which is described in
Temperton (1983). Special coding is provided for the factors
$2$,
$3$,
$4$,
$5$ and
$6$. This routine is designed to be particularly efficient on vector processors, and it becomes especially fast as
$m$, the number of transforms to be computed in parallel, increases.
4 References
Brigham E O (1974) The Fast Fourier Transform Prentice–Hall
Temperton C (1983) Fast mixedradix real Fourier transforms J. Comput. Phys. 52 340–350
5 Parameters
 1: M – INTEGERInput
On entry: $m$, the number of sequences to be transformed.
Constraint:
${\mathbf{M}}\ge 1$.
 2: N – INTEGERInput
On entry: $n$, the number of real values in each sequence.
Constraint:
${\mathbf{N}}\ge 1$.
 3: X(${\mathbf{M}}\times {\mathbf{N}}$) – REAL (KIND=nag_wp) arrayInput/Output
On entry: the data must be stored in
X as if in a twodimensional array of dimension
$\left(1:{\mathbf{M}},0:{\mathbf{N}}1\right)$; each of the
$m$ sequences is stored in a
row of the array. In other words, if the data values of the
$p$th sequence to be transformed are denoted by
${x}_{j}^{p}$, for
$\mathit{j}=0,1,\dots ,n1$, then the
$mn$ elements of the array
X must contain the values
On exit: the
$m$ discrete Fourier transforms stored as if in a twodimensional array of dimension
$\left(1:{\mathbf{M}},0:{\mathbf{N}}1\right)$. Each of the
$m$ transforms is stored in a
row of the array in Hermitian form, overwriting the corresponding original sequence. If the
$n$ components of the discrete Fourier transform
${\hat{z}}_{k}^{p}$ are written as
${a}_{k}^{p}+i{b}_{k}^{p}$, then for
$0\le k\le n/2$,
${a}_{k}^{p}$ is contained in
${\mathbf{X}}\left(p,k\right)$, and for
$1\le k\le \left(n1\right)/2$,
${b}_{k}^{p}$ is contained in
${\mathbf{X}}\left(p,nk\right)$. (See also
Section 2.1.2 in the C06 Chapter Introduction.)
 4: INIT – CHARACTER(1)Input
On entry: indicates whether trigonometric coefficients are to be calculated.
 ${\mathbf{INIT}}=\text{'I'}$
 Calculate the required trigonometric coefficients for the given value of $n$, and store in the array TRIG.
 ${\mathbf{INIT}}=\text{'S'}$ or $\text{'R'}$
 The required trigonometric coefficients are assumed to have been calculated and stored in the array TRIG in a prior call to one of C06FPF, C06FQF or C06FRF. The routine performs a simple check that the current value of $n$ is consistent with the values stored in TRIG.
Constraint:
${\mathbf{INIT}}=\text{'I'}$, $\text{'S'}$ or $\text{'R'}$.
 5: TRIG($2\times {\mathbf{N}}$) – REAL (KIND=nag_wp) arrayInput/Output
On entry: if
${\mathbf{INIT}}=\text{'S'}$ or
$\text{'R'}$,
TRIG must contain the required trigonometric coefficients that have been previously calculated. Otherwise
TRIG need not be set.
On exit: contains the required coefficients (computed by the routine if ${\mathbf{INIT}}=\text{'I'}$).
 6: WORK(${\mathbf{M}}\times {\mathbf{N}}$) – REAL (KIND=nag_wp) arrayWorkspace
 7: IFAIL – INTEGERInput/Output

On entry:
IFAIL must be set to
$0$,
$1\text{ or}1$. If you are unfamiliar with this parameter you should refer to
Section 3.3 in the Essential Introduction for details.
For environments where it might be inappropriate to halt program execution when an error is detected, the value
$1\text{ or}1$ is recommended. If the output of error messages is undesirable, then the value
$1$ is recommended. Otherwise, if you are not familiar with this parameter, the recommended value is
$0$.
When the value $\mathbf{1}\text{ or}\mathbf{1}$ is used it is essential to test the value of IFAIL on exit.
On exit:
${\mathbf{IFAIL}}={\mathbf{0}}$ unless the routine detects an error or a warning has been flagged (see
Section 6).
6 Error Indicators and Warnings
If on entry
${\mathbf{IFAIL}}={\mathbf{0}}$ or
${{\mathbf{1}}}$, explanatory error messages are output on the current error message unit (as defined by
X04AAF).
Errors or warnings detected by the routine:
 ${\mathbf{IFAIL}}=1$

On entry,  ${\mathbf{M}}<1$. 
 ${\mathbf{IFAIL}}=2$

On entry,  ${\mathbf{N}}<1$. 
 ${\mathbf{IFAIL}}=3$

On entry,  ${\mathbf{INIT}}\ne \text{'I'}$, $\text{'S'}$ or $\text{'R'}$. 
 ${\mathbf{IFAIL}}=4$

Not used at this Mark.
 ${\mathbf{IFAIL}}=5$

On entry,  ${\mathbf{INIT}}=\text{'S'}$ or $\text{'R'}$, but the array TRIG and the current value of N are inconsistent. 
 ${\mathbf{IFAIL}}=6$

An unexpected error has occurred in an internal call. Check all subroutine calls and array dimensions. Seek expert help.
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).
The time taken by C06FPF is approximately proportional to $nm\mathrm{log}n$, but also depends on the factors of $n$. C06FPF 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.
9 Example
This example reads in sequences of real data values and prints their discrete Fourier transforms (as computed by C06FPF). The Fourier transforms are expanded into full complex form using and printed. Inverse transforms are then calculated by conjugating and calling
C06FQF showing that the original sequences are restored.
9.1 Program Text
Program Text (c06fpfe.f90)
9.2 Program Data
Program Data (c06fpfe.d)
9.3 Program Results
Program Results (c06fpfe.r)