NAG Library Routine Document

c06fbf (fft_hermitian_1d_rfmt)


c06fbf calculates the discrete Fourier transform of a Hermitian sequence of n complex data values (using a work array for extra speed).


Fortran Interface
Subroutine c06fbf ( x, n, work, ifail)
Integer, Intent (In):: n
Integer, Intent (Inout):: ifail
Real (Kind=nag_wp), Intent (Inout):: x(n)
Real (Kind=nag_wp), Intent (Out):: work(n)
C Header Interface
#include <nagmk26.h>
void  c06fbf_ (double x[], const Integer *n, double work[], Integer *ifail)


Given a Hermitian sequence of n complex data values zj  (i.e., a sequence such that z0  is real and z n-j  is the complex conjugate of zj , for j=1,2,,n-1), c06fbf calculates their discrete Fourier transform defined by
x^k = 1n j=0 n-1 zj × exp -i 2πjk n ,   k= 0, 1, , n-1 .  
(Note the scale factor of 1n  in this definition.) The transformed values x^k  are purely real (see also the C06 Chapter Introduction).
To compute the inverse discrete Fourier transform defined by
y^k = 1n j=0 n-1 zj × exp +i 2πjk n ,  
this routine should be preceded by forming the complex conjugates of the z^k ; that is, xk=-xk, for k=n/2+2,,n.
c06fbf uses the fast Fourier transform (FFT) algorithm (see Brigham (1974)).


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


1:     xn – Real (Kind=nag_wp) arrayInput/Output
On entry: the sequence to be transformed stored in Hermitian form. If the data values zj are written as xj + i yj, and if x is declared with bounds 0:n-1 in the subroutine from which c06fbf is called, then for 0 j n/2, xj is contained in xj, and for 1 j n-1 / 2 , yj is contained in xn-j. (See also Section 2.1.2 in the C06 Chapter Introduction and Section 10.)
On exit: the components of the discrete Fourier transform x^k. If x is declared with bounds 0:n-1 in the subroutine from which c06fbf is called, x^k is stored in xk, for k=0,1,,n-1.
2:     n – IntegerInput
On entry: n, the number of data values.
Constraint: n>1.
3:     workn – Real (Kind=nag_wp) arrayWorkspace
4:     ifail – IntegerInput/Output
On entry: ifail must be set to 0, -1 or 1. If you are unfamiliar with this argument you should refer to Section 3.4 in How to Use the NAG Library and its Documentation for details.
For environments where it might be inappropriate to halt program execution when an error is detected, the value -1 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 argument, the recommended value is 0. 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).

Error Indicators and Warnings

If on entry ifail=0 or -1, explanatory error messages are output on the current error message unit (as defined by x04aaf).
Errors or warnings detected by the routine:
On entry, n=value.
Constraint: n>1.
An unexpected error has been triggered by this routine. Please contact NAG.
See Section 3.9 in How to Use the NAG Library and its Documentation for further information.
Your licence key may have expired or may not have been installed correctly.
See Section 3.8 in How to Use the NAG Library and its Documentation for further information.
Dynamic memory allocation failed.
See Section 3.7 in How to Use the NAG Library and its Documentation for further information.


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).

Parallelism and Performance

c06fbf is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.
c06fbf 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.

Further Comments

The time taken is approximately proportional to n × logn, but also depends on the factorization of n. c06fbf is faster if the only prime factors of n are 2, 3 or 5; and fastest of all if n is a power of 2.


This example reads in a sequence of real data values which is assumed to be a Hermitian sequence of complex data values stored in Hermitian form. The input sequence is expanded into a full complex sequence and printed alongside the original sequence. The discrete Fourier transform (as computed by c06fbf) is printed out. It then performs an inverse transform using c06faf and conjugation, and prints the sequence so obtained alongside the original data values.

Program Text

Program Text (c06fbfe.f90)

Program Data

Program Data (c06fbfe.d)

Program Results

Program Results (c06fbfe.r)