NAG Library Function Document

nag_dsp_norm (f16rdc)

1  Purpose

2  Specification

3  Description

4  References

5  Arguments

1:     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.2.1.3 in the Essential Introduction for a more detailed explanation of the use of this argument.

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

2:     norm – Nag_NormTypeInput

On entry: specifies the value to be returned.

$\mathbf{norm}=\mathrm{Nag\_OneNorm}$

The $1$-norm.

$\mathbf{norm}=\mathrm{Nag\_InfNorm}$

The $\infty$-norm.

$\mathbf{norm}=\mathrm{Nag\_FrobeniusNorm}$

The Frobenius (or Euclidean) norm.

$\mathbf{norm}=\mathrm{Nag\_MaxNorm}$

The value ${\displaystyle \underset{i,j}{\max }}\left|a_{ij}\right|$ (not a norm).

Constraint: $\mathbf{norm}=\mathrm{Nag\_OneNorm}$, $\mathrm{Nag\_InfNorm}$, $\mathrm{Nag\_FrobeniusNorm}$ or $\mathrm{Nag\_MaxNorm}$.

3:     uplo – Nag_UploTypeInput

On entry: specifies whether the upper or lower triangular part of $A$ is stored.

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

The upper triangular part of $A$ is stored.

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

The lower triangular part of $A$ is stored.

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

4:     n – IntegerInput

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

If $n=0$, then n is set to zero.

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

5:     ap[$\mathit{dim}$] – const doubleInput

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

On entry: the $n$ by $n$ symmetric matrix $A$, packed by rows or columns.

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[\left(j-1\right)\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[\left(2n-j\right)\times \left(j-1\right)/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[\left(2n-i\right)\times \left(i-1\right)/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[\left(i-1\right)\times i/2+j-1\right]$, for $i\ge j$.

6:     r – double *Output

On exit: the value of the norm specified by norm.

7:     fail – NagError *Input/Output

The NAG error argument (see Section 3.6 in the Essential Introduction).

6  Error Indicators and Warnings

NE_ALLOC_FAIL

Dynamic memory allocation failed.

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$.

7  Accuracy

8  Parallelism and Performance

9  Further Comments

10  Example