NAG CL Interface
c06psc (fft_complex_1d_multi_col)
1
Purpose
c06psc computes the discrete Fourier transforms of sequences each containing complex data values.
2
Specification
void |
c06psc (Nag_TransformDirection direct,
Integer n,
Integer m,
Complex x[],
NagError *fail) |
|
The function may be called by the names: c06psc, nag_sum_fft_complex_1d_multi_col or nag_sum_fft_complex_1d_multi.
3
Description
Given
sequences of
complex data values
, for
and
,
c06psc simultaneously calculates the (
forward or
backward) discrete Fourier transforms of all the sequences defined by
(Note the scale factor
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 c06psc with followed by a call with 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
,
and
.
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:
– Nag_TransformDirection
Input
-
On entry: if the forward transform as defined in
Section 3 is to be computed,
direct must be set equal to
.
If the backward transform is to be computed,
direct must be set equal to
.
Constraint:
or .
-
2:
– Integer
Input
-
On entry: , the number of complex values in each sequence.
Constraint:
.
-
3:
– Integer
Input
-
On entry: , the number of sequences to be transformed.
Constraint:
.
-
4:
– Complex
Input/Output
-
On entry: the complex data values
stored in , for and .
On exit: is overwritten by the complex transforms.
-
5:
– NagError *
Input/Output
-
The NAG error argument (see
Section 7 in the Introduction to the NAG Library CL Interface).
6
Error Indicators and Warnings
- NE_ALLOC_FAIL
-
Dynamic memory allocation failed.
See
Section 3.1.2 in the Introduction to the NAG Library CL Interface for further information.
- NE_BAD_PARAM
-
On entry, argument had an illegal value.
- NE_INT
-
On entry, .
Constraint: .
On entry, .
Constraint: .
- 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.
See
Section 7.5 in the Introduction to the NAG Library CL Interface for further information.
- NE_NO_LICENCE
-
Your licence key may have expired or may not have been installed correctly.
See
Section 8 in the Introduction to the NAG Library CL 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
c06psc is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.
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.
The time taken by c06psc is approximately proportional to , but also depends on the factors of . c06psc is fastest if the only prime factors of are , and , and is particularly slow if is a large prime, or has large prime factors.
This function internally allocates a workspace of Complex values.
10
Example
This example reads in sequences of complex data values and prints their discrete Fourier transforms (as computed by c06psc with ). Inverse transforms are then calculated using c06psc with and printed out, showing that the original sequences are restored.
10.1
Program Text
10.2
Program Data
10.3
Program Results