NAG Library Routine Document

f06rbf  (dlangb)

1

Purpose

2

Specification

3

Description

4

References

5

Arguments

1:     $\mathbf{norm}$ – Character(1)Input

On entry: specifies the value to be returned.

$\mathbf{norm}=\text{'1'}$ or $\text{'O'}$

The $1$-norm.

$\mathbf{norm}=\text{'I'}$

The $\infty$-norm.

$\mathbf{norm}=\text{'F'}$ or $\text{'E'}$

The Frobenius (or Euclidean) norm.

$\mathbf{norm}=\text{'M'}$

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

Constraint: $\mathbf{norm}=\text{'1'}$, $\text{'O'}$, $\text{'I'}$, $\text{'F'}$, $\text{'E'}$ or $\text{'M'}$.

2:     $\mathbf{n}$ – IntegerInput

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

When $\mathbf{n}=0$, f06rbf returns zero.

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

3:     $\mathbf{kl}$ – IntegerInput

On entry: $k_l$, the number of subdiagonals within the band of $A$.

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

4:     $\mathbf{ku}$ – IntegerInput

On entry: $k_u$, the number of superdiagonals within the band of $A$.

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

5:     $\mathbf{ab}\left(\mathbf{ldab},*\right)$ – Real (Kind=nag_wp) arrayInput

Note: the second dimension of the array ab must be at least $\mathbf{n}$.

On entry: the $n$ by $n$ band matrix $A$.

The matrix is stored in rows $1$ to $k_l+k_u+1$, more precisely, the element $A_{ij}$ must be stored in

$$\mathbf{ab}\left(k_u+1+i-j,j\right)\text{\hspace{1em} for }\max \left(1,j-k_u\right)\le i\le \min \left(n,j+k_l\right)\text{.}$$

6:     $\mathbf{ldab}$ – IntegerInput

On entry: the first dimension of the array ab as declared in the (sub)program from which f06rbf is called.

Constraint: $\mathbf{ldab}\ge \mathbf{kl}+\mathbf{ku}+1$.

7:     $\mathbf{work}\left(*\right)$ – Real (Kind=nag_wp) arrayWorkspace

Note: the dimension of the array work must be at least $\max \left(1,\mathbf{n}\right)$ if $\mathbf{norm}=\text{'I'}$, and at least $1$ otherwise.

6

Error Indicators and Warnings

7

Accuracy

8

Parallelism and Performance

9

Further Comments

10

Example