# naginterfaces.library.blas.dlansf¶

naginterfaces.library.blas.dlansf(norm, transr, uplo, n, a)[source]

dlansf returns the value of the -norm, the -norm, the Frobenius norm, or the maximum absolute value of the elements of a real symmetric matrix stored in Rectangular Full Packed (RFP) format.

For full information please refer to the NAG Library document for f06wa

https://www.nag.com/numeric/nl/nagdoc_28.7/flhtml/f06/f06waf.html

Parameters
normstr, length 1

Specifies the value to be returned.

or

The -norm.

The -norm.

or

The Frobenius (or Euclidean) norm.

The value (not a norm).

transrstr, length 1

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.

uplostr, length 1

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.

nint

, the order of the matrix .

When , dlansf returns zero.

afloat, array-like, shape

The upper or lower triangular part (as specified by ) of the symmetric matrix , in either normal or transposed RFP format (as specified by ). The storage format is described in detail in the F07 Introduction.

Returns
nrmfloat

The -norm, the Frobenius norm, or the maximum absolute value of the elements of the real symmetric matrix stored in Rectangular Full Packed (RFP) format.

Raises
NagValueError
(errno )

On entry, error in parameter .

Constraint: , , , , or .

(errno )

On entry, error in parameter .

Constraint: or .

(errno )

On entry, error in parameter .

Constraint: or .

(errno )

On entry, error in parameter .

Constraint: .

Notes

No equivalent traditional C interface for this routine exists in the NAG Library.

Given a real symmetric matrix, , dlansf calculates one of the values given by

 ∥A∥1=maxj(∑ni=1∣∣aij∣∣) (the 1-norm of A), ∥A∥∞=maxi(∑nj=1∣∣aij∣∣) (the ∞-norm of A), ∥A∥F=(∑ni=1∑nj=1∣∣aij∣∣2)1/2 (the Frobenius norm of A), or maxi,j(∣∣aij∣∣) (the maximum absolute element value of A).

is stored in compact form using the RFP format. The RFP storage format is described in the F07 Introduction.

References

Basic Linear Algebra Subprograms Technical (BLAST) Forum, 2001, Basic Linear Algebra Subprograms Technical (BLAST) Forum Standard, University of Tennessee, Knoxville, Tennessee, https://www.netlib.org/blas/blast-forum/blas-report.pdf

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)