NAG CL Interface
f01vkc (ztpttf)

1 Purpose

2 Specification

3 Description

4 References

5 Arguments

1: $\mathbf{order}$ – Nag_OrderType Input

On entry: the order argument specifies the two-dimensional storage scheme being used, i.e., row-major ordering or column-major ordering. C language defined storage is specified by $\mathbf{order}=\mathrm{Nag\_RowMajor}$. See Section 3.1.3 in the Introduction to the NAG Library CL Interface for a more detailed explanation of the use of this argument.

Constraint: $\mathbf{order}=\mathrm{Nag\_RowMajor}$ or $\mathrm{Nag\_ColMajor}$.

2: $\mathbf{transr}$ – Nag_RFP_Store Input

On entry: specifies whether the normal RFP representation of $A$ or its conjugate transpose is stored.

$\mathbf{transr}=\mathrm{Nag\_RFP\_Normal}$

The RFP representation of the matrix $A$ is stored.

$\mathbf{transr}=\mathrm{Nag\_RFP\_ConjTrans}$

The conjugate transpose of the RFP representation of the matrix $A$ is stored.

Constraint: $\mathbf{transr}=\mathrm{Nag\_RFP\_Normal}$ or $\mathrm{Nag\_RFP\_ConjTrans}$.

3: $\mathbf{uplo}$ – Nag_UploType Input

On entry: specifies whether $A$ is upper or lower triangular.

$\mathbf{uplo}=\mathrm{Nag\_Upper}$

$A$ is upper triangular.

$\mathbf{uplo}=\mathrm{Nag\_Lower}$

$A$ is lower triangular.

Constraint: $\mathbf{uplo}=\mathrm{Nag\_Upper}$ or $\mathrm{Nag\_Lower}$.

4: $\mathbf{n}$ – Integer Input

On entry: $n$, the order of the matrix $A$.

Constraint: $\mathbf{n}\ge 0$.

5: $\mathbf{ap}\left[\mathit{dim}\right]$ – const Complex Input

Note: the dimension, dim, of the array ap must be at least $\mathbf{n}\times (\mathbf{n}+1)/2$.

On entry: the $n\times n$ triangular matrix $A$, packed by rows or columns depending on order.

The storage of elements $A_{ij}$ depends on the order and uplo arguments as follows:

if $\mathbf{order}=\mathrm{Nag\_ColMajor}$ and $\mathbf{uplo}=\mathrm{Nag\_Upper}$,

$A_{ij}$ is stored in $\mathbf{ap}\left[(j-1)\times j/2+i-1\right]$, for $i\le j$;

if $\mathbf{order}=\mathrm{Nag\_ColMajor}$ and $\mathbf{uplo}=\mathrm{Nag\_Lower}$,

$A_{ij}$ is stored in $\mathbf{ap}\left[(2n-j)\times (j-1)/2+i-1\right]$, for $i\ge j$;

if $\mathbf{order}=\mathrm{Nag\_RowMajor}$ and $\mathbf{uplo}=\mathrm{Nag\_Upper}$,

$A_{ij}$ is stored in $\mathbf{ap}\left[(2n-i)\times (i-1)/2+j-1\right]$, for $i\le j$;

if $\mathbf{order}=\mathrm{Nag\_RowMajor}$ and $\mathbf{uplo}=\mathrm{Nag\_Lower}$,

$A_{ij}$ is stored in $\mathbf{ap}\left[(i-1)\times i/2+j-1\right]$, for $i\ge j$.

6: $\mathbf{ar}\left[\mathbf{n}\times (\mathbf{n}+1)/2\right]$ – Complex Output

On exit: the upper or lower $n\times n$ triangular matrix $A$ (as specified by uplo) in either normal or transposed RFP format (as specified by transr). The storage format is described in Section 3.4.3 in the F07 Chapter Introduction.

7: $\mathbf{fail}$ – 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 $⟨\mathit{\text{value}}⟩$ had an illegal value.

NE_INT

On entry, $\mathbf{n}=⟨\mathit{\text{value}}⟩$.
Constraint: $\mathbf{n}\ge 0$.

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

8 Parallelism and Performance

9 Further Comments

10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results