C06GCF (PDF version)
C06 Chapter Contents
C06 Chapter Introduction
NAG Library Manual

NAG Library Routine Document


Note:  before using this routine, please read the Users' Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent details.

+ Contents

    1  Purpose
    7  Accuracy

1  Purpose

C06GCF forms the complex conjugate of a sequence of n data values.

2  Specification

REAL (KIND=nag_wp)  Y(N)

3  Description

This is a utility routine for use in conjunction with C06ECF or C06FCF to calculate inverse discrete Fourier transforms (see the C06 Chapter Introduction).

4  References


5  Parameters

1:     Y(N) – REAL (KIND=nag_wp) arrayInput/Output
On entry: if Y is declared with bounds 0:N-1 in the subroutine from which C06GCF is called, then Yj must contain the imaginary part of the jth data value, for 0 j n-1.
On exit: these values are negated.
2:     N – INTEGERInput
On entry: n, the number of data values.
Constraint: N1.
3:     IFAIL – INTEGERInput/Output
On entry: IFAIL must be set to 0, -1​ 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​ 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 -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).

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

7  Accuracy


8  Further Comments

The time taken by C06GCF is negligible.

9  Example

This example reads in a sequence of complex data values and prints their inverse discrete Fourier transform as computed by calling C06GCF, followed by C06ECF and C06GCF again.

9.1  Program Text

Program Text (c06gcfe.f90)

9.2  Program Data

Program Data (c06gcfe.d)

9.3  Program Results

Program Results (c06gcfe.r)

C06GCF (PDF version)
C06 Chapter Contents
C06 Chapter Introduction
NAG Library Manual

© The Numerical Algorithms Group Ltd, Oxford, UK. 2012