c06fq computes the discrete Fourier transforms of Hermitian sequences, each containing complex data values. This method is designed to be particularly efficient on vector processors.
- Type: System..::..Int32On entry: , the number of sequences to be transformed.Constraint: .
- Type: System..::..Int32On entry: , the number of data values in each sequence.Constraint: .
- Type: array<System..::..Double>()An array of size On entry: the data must be stored in x as if in a two-dimensional array of dimension ; each of the sequences is stored in a row of the array in Hermitian form. If the data values are written as , then for , is contained in , and for , is contained in . (See also  in the C06 class Chapter Introduction.)On exit: the components of the discrete Fourier transforms, stored as if in a two-dimensional array of dimension . Each of the transforms is stored as a row of the array, overwriting the corresponding original sequence. If the components of the discrete Fourier transform are denoted by , for , then the elements of the array x contain the values
- Type: System..::..StringOn entry: indicates whether trigonometric coefficients are to be calculated.
Constraint: , or .
- Calculate the required trigonometric coefficients for the given value of , and store in the array trig.
- The required trigonometric coefficients are assumed to have been calculated and stored in the array trig in a prior call to one of c06fp, c06fq or c06fr. The method performs a simple check that the current value of is consistent with the values stored in trig.
- Type: array<System..::..Double>()An array of size On entry: if or , 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 method if ).
Given Hermitian sequences of complex data values , for and , c06fq simultaneously calculates the Fourier transforms of all the sequences defined by
(Note the scale factor in this definition.)
The transformed values are purely real (see also the C06 class).
The discrete Fourier transform is sometimes defined using a positive sign in the exponential term
To compute this form, this method should be preceded by forming the complex conjugates of the ; that is , for .
The method 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 coding is provided for the factors , , , and . This method is designed to be particularly efficient on vector processors, and it becomes especially fast as , the number of transforms to be computed in parallel, increases.
Brigham E O (1974) The Fast Fourier Transform Prentice–Hall
Temperton C (1983) Fast mixed-radix real Fourier transforms J. Comput. Phys. 52 340–350
Errors or warnings detected by the method:
On entry, . On entry, . On entry, , or .
- Not used at this Mark.
- An unexpected error has occurred in an internal call. Check all method calls and array dimensions. Seek expert help.
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).