f01vm copies a complex triangular matrix, stored in a Rectangular Full Packed (RFP) format, to packed format.

Syntax

C#
public static void f01vm(
	string transr,
	string uplo,
	int n,
	Complex[] arf,
	Complex[] ap,
	out int info
)
Visual Basic
Public Shared Sub f01vm ( _
	transr As String, _
	uplo As String, _
	n As Integer, _
	arf As Complex(), _
	ap As Complex(), _
	<OutAttribute> ByRef info As Integer _
)
Visual C++
public:
static void f01vm(
	String^ transr, 
	String^ uplo, 
	int n, 
	array<Complex>^ arf, 
	array<Complex>^ ap, 
	[OutAttribute] int% info
)
F#
static member f01vm : 
        transr : string * 
        uplo : string * 
        n : int * 
        arf : Complex[] * 
        ap : Complex[] * 
        info : int byref -> unit 

Parameters

transr
Type: System..::..String
On entry: specifies whether the normal RFP representation of A or its conjugate transpose is stored.
transr="N"
The matrix A is stored in normal RFP format.
transr="C"
The conjugate transpose of the RFP representation of the matrix A is stored.
Constraint: transr="N" or "C".
uplo
Type: System..::..String
On entry: specifies whether A is upper or lower triangular.
uplo="U"
A is upper triangular.
uplo="L"
A is lower triangular.
Constraint: uplo="U" or "L".
n
Type: System..::..Int32
On entry: n, the order of the matrix A.
Constraint: n0.
arf
Type: array<NagLibrary..::..Complex>[]()[][]

[Missing <param name="arf"/> documentation for "M:NagLibrary.F01.f01vm(System.String,System.String,System.Int32,NagLibrary.Complex[],NagLibrary.Complex[],System.Int32@)"]

ap
Type: array<NagLibrary..::..Complex>[]()[][]
An array of size [n×n+1/2]
On exit: the n by n triangular matrix A.
info
Type: System..::..Int32%
On exit: info=0 unless the method detects an error (see [Error Indicators and Warnings]).

Description

f01vm packs a complex n by n triangular matrix A, stored in RFP format, to packed format. This method is intended for possible use in conjunction with methods from f06 f07 f16 where some methods that use triangular matrices store them in RFP format. The RFP storage format is described in recomm_32a in f07 and the packed storage format is described in recomm_32 in f07.

References

Gustavson F G, Waśniewski J, Dongarra J J and Langou J (2010) Rectangular full packed format for Cholesky's algorithm: factorization, solution, and inversion ACM Trans. Math. Software 37, 2

Error Indicators and Warnings

info<0
If info=-i, argument i had an illegal value. An explanatory message is output, and execution of the program is terminated.
ifail=-9000
An error occured, see message report.
ifail=-6000
Invalid Parameters value
ifail=-8000
Negative dimension for array value
ifail=-6000
Invalid Parameters value

Accuracy

Not applicable.

Parallelism and Performance

None.

Further Comments

None.

Example

This example reads in a triangular matrix in RFP format and copies it to packed format.

Example program (C#): f01vme.cs

Example program data: f01vme.d

Example program results: f01vme.r

See Also