c06gq forms the complex conjugates of

m

Hermitian sequences, each containing

n

data values.

Syntax

C#
public static void c06gq( int m, int n, double[] x, out int ifail )

Visual Basic
Public Shared Sub c06gq ( _ m As Integer, _ n As Integer, _ x As Double(), _ <OutAttribute> ByRef ifail As Integer _ )

Visual C++
public: static void c06gq( int m, int n, array<double>^ x, [OutAttribute] int% ifail )

F#
static member c06gq : m : int * n : int * x : float[] * ifail : int byref -> unit

m: Type: System..::..Int32
On entry: $m$ , the number of Hermitian sequences to be conjugated.

Constraint: $m \geq 1$ .

n: Type: System..::..Int32
On entry: $n$ , the number of data values in each Hermitian sequence.

Constraint: $n \geq 1$ .

x: Type: array<System..::..Double>[]()[][]
An array of size [ $m \times n$ ]
On entry: the data must be stored in x as if in a two-dimensional array of dimension $(1 : m, 0 : n - 1)$ ; each of the $m$ sequences is stored in a row of the array in Hermitian form. If the $n$ data values $z_{j}^{p}$ are written as $x_{j}^{p} + i y_{j}^{p}$ , then for $0 \leq j \leq n / 2$ , $x_{j}^{p}$ is contained in $x [p - 1, j]$ , and for $1 \leq j \leq (n - 1) / 2$ , $y_{j}^{p}$ is contained in $x [p, n - j]$ . (See also [] in the C06 class Chapter Introduction.)
On exit: the imaginary parts $y_{j}^{p}$ are negated. The real parts $x_{j}^{p}$ are not referenced.

ifail: Type: System..::..Int32%
On exit: $ifail = 0$ unless the method detects an error or a warning has been flagged (see [Error Indicators and Warnings]).

Description

This is a utility method for use in conjunction with c06fp and c06fq to calculate inverse discrete Fourier transforms (see the C06 class).

None.

Errors or warnings detected by the method:

$ifail = 1$

On entry,

m < 1

$ifail = 2$

On entry,

n < 1

Exact.

None.

None.