NAG Library Routine Document

F06SDF (ZHBMV)

1  Purpose

2  Specification

3  Description

4  References

5  Parameters

1:     $\mathrm{UPLO}$ – CHARACTER(1)Input

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

$\mathbf{UPLO}=\text{'U'}$

The upper triangular part of $A$ is stored.

$\mathbf{UPLO}=\text{'L'}$

The lower triangular part of $A$ is stored.

Constraint: $\mathbf{UPLO}=\text{'U'}$ or $\text{'L'}$.

2:     $\mathrm{N}$ – INTEGERInput

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

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

3:     $\mathrm{K}$ – INTEGERInput

On entry: $k$, the number of subdiagonals or superdiagonals of the matrix $A$.

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

4:     $\mathrm{ALPHA}$ – COMPLEX (KIND=nag_wp)Input

On entry: the scalar $\alpha$.

5:     $\mathrm{A}\left(\mathbf{LDA},*\right)$ – COMPLEX (KIND=nag_wp) arrayInput

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

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

The matrix is stored in rows $1$ to $k+1$, more precisely,

• if $\mathbf{UPLO}=\text{'U'}$, the elements of the upper triangle of $A$ within the band must be stored with element $A_{ij}$ in $\mathbf{A}\left(k+1+i-j,j\right)\text{ for }\max \left(1,j-k\right)\le i\le j$;
• if $\mathbf{UPLO}=\text{'L'}$, the elements of the lower triangle of $A$ within the band must be stored with element $A_{ij}$ in $\mathbf{A}\left(1+i-j,j\right)\text{ for }j\le i\le \min \left(n,j+k\right)\text{.}$

6:     $\mathrm{LDA}$ – INTEGERInput

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

Constraint: $\mathbf{LDA}\ge \mathbf{K}+1$.

7:     $\mathrm{X}\left(*\right)$ – COMPLEX (KIND=nag_wp) arrayInput

Note: the dimension of the array X must be at least $\max \left(1,1+\left(\mathbf{N}-1\right)\times \left|\mathbf{INCX}\right|\right)$.

On entry: the $n$-element vector $x$.

If $\mathbf{INCX}>0$, $x_{\mathit{i}}$ must be stored in $\mathbf{X}\left(1+\left(\mathit{i}-1\right)\times \mathbf{INCX}\right)$, for $\mathit{i}=1,2,\dots ,\mathbf{N}$.

If $\mathbf{INCX}<0$, $x_{\mathit{i}}$ must be stored in $\mathbf{X}\left(1-\left(\mathbf{N}-\mathit{i}\right)\times \mathbf{INCX}\right)$, for $\mathit{i}=1,2,\dots ,\mathbf{N}$.

Intermediate elements of X are not referenced.

8:     $\mathrm{INCX}$ – INTEGERInput

On entry: the increment in the subscripts of X between successive elements of $x$.

Constraint: $\mathbf{INCX}\ne 0$.

9:     $\mathrm{BETA}$ – COMPLEX (KIND=nag_wp)Input

On entry: the scalar $\beta$.

10:   $\mathrm{Y}\left(*\right)$ – COMPLEX (KIND=nag_wp) arrayInput/Output

Note: the dimension of the array Y must be at least $\max \left(1,1+\left(\mathbf{N}-1\right)\times \left|\mathbf{INCY}\right|\right)$.

On entry: the $n$-element vector $y$, if $\mathbf{BETA}=0$, Y need not be set.

If $\mathbf{INCY}>0$, $y_{\mathit{i}}$ must be stored in $\mathbf{Y}\left(1+\left(\mathit{i}–1\right)\times \mathbf{INCY}\right)$, for $\mathit{i}=1,2,\dots ,\mathbf{N}$.

If $\mathbf{INCY}<0$, $y_{\mathit{i}}$ must be stored in $\mathbf{Y}\left(1–\left(\mathbf{N}–\mathit{i}\right)\times \mathbf{INCY}\right)$, for $\mathit{i}=1,2,\dots ,\mathbf{N}$.

On exit: the updated vector $y$ stored in the array elements used to supply the original vector $y$.

11:   $\mathrm{INCY}$ – INTEGERInput

On entry: the increment in the subscripts of Y between successive elements of $y$.

Constraint: $\mathbf{INCY}\ne 0$.

6  Error Indicators and Warnings

7  Accuracy

8  Parallelism and Performance

9  Further Comments

10  Example