NAG Library Function Document

nag_ztfttr (f01vhc)

1

Purpose

2

Specification

3

Description

4

References

5

Arguments

1:    $\mathbf{order}$ – Nag_OrderTypeInput

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.3.1.3 in How to Use the NAG Library and its Documentation 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_StoreInput

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_UploTypeInput

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}$ – IntegerInput

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

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

5:    $\mathbf{ar}\left[\mathbf{n}\times \left(\mathbf{n}+1\right)/2\right]$ – const ComplexInput

On entry: the upper or lower $n$ by $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.3.3 in the f07 Chapter Introduction.

6:    $\mathbf{a}\left[\mathit{dim}\right]$ – ComplexOutput

Note: the dimension, dim, of the array a must be at least $\mathbf{pda}\times \mathbf{n}$.

On exit: the triangular matrix $A$.

If $\mathbf{order}=\mathrm{Nag\_ColMajor}$, $A_{ij}$ is stored in $\mathbf{a}\left[\left(j-1\right)\times \mathbf{pda}+i-1\right]$.

If $\mathbf{order}=\mathrm{Nag\_RowMajor}$, $A_{ij}$ is stored in $\mathbf{a}\left[\left(i-1\right)\times \mathbf{pda}+j-1\right]$.

If $\mathbf{uplo}=\mathrm{Nag\_Upper}$, $A$ is upper triangular and the elements of the array below the diagonal are not set.

If $\mathbf{uplo}=\mathrm{Nag\_Lower}$, $A$ is lower triangular and the elements of the array above the diagonal are not set.

7:    $\mathbf{pda}$ – IntegerInput

On entry: the stride separating row or column elements (depending on the value of order) of the matrix $A$ in the array a.

Constraint: $\mathbf{pda}\ge \max \left(1,\mathbf{n}\right)$.

8:    $\mathbf{fail}$ – NagError *Input/Output

The NAG error argument (see Section 3.7 in How to Use the NAG Library and its Documentation).

6

Error Indicators and Warnings

NE_ALLOC_FAIL

Dynamic memory allocation failed.
See Section 2.3.1.2 in How to Use the NAG Library and its Documentation 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_INT_2

On entry, $\mathbf{pda}=〈\mathit{\text{value}}〉$ and $\mathbf{n}=〈\mathit{\text{value}}〉$.
Constraint: $\mathbf{pda}\ge \max \left(1,\mathbf{n}\right)$.

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 2.7.6 in How to Use the NAG Library and its Documentation for further information.

NE_NO_LICENCE

Your licence key may have expired or may not have been installed correctly.
See Section 2.7.5 in How to Use the NAG Library and its Documentation for further information.

7

Accuracy

8

Parallelism and Performance

9

Further Comments

10

Example

10.1

Program Text

Program Text (f01vhce.c)

10.2

Program Data

Program Data (f01vhce.d)

10.3

Program Results

Program Results (f01vhce.r)