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. Software37, 2
1: – Character(1)Input
On entry: specifies the value to be returned.
The Frobenius (or Euclidean) norm.
The value (not a norm).
, , , , or .
2: – Character(1)Input
On entry: specifies whether the RFP representation of is normal or transposed.
The matrix is stored in normal RFP format.
The matrix is stored in transposed RFP format.
3: – Character(1)Input
On entry: specifies whether the upper or lower triangular part of is stored.
The upper triangular part of is stored.
The lower triangular part of is stored.
4: – IntegerInput
On entry: , the order of the matrix .
When , f06waf returns zero.
5: – Real (Kind=nag_wp) arrayInput
On entry: the upper or lower triangular part (as specified by uplo) of the symmetric matrix , in either normal or transposed RFP format (as specified by transr). The storage format is described in detail in Section 3.3.3 in the F07 Chapter Introduction.
6: – Real (Kind=nag_wp) arrayWorkspace
Note: the dimension of the array work
must be at least
if , or , and at least otherwise.