NAG FL Interface
f06tbf (zsyr)

1 Purpose

2 Specification

3 Description

4 References

5 Arguments

1: $\mathbf{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: $\mathbf{n}$ – Integer Input

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

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

3: $\mathbf{alpha}$ – Complex (Kind=nag_wp) Input

On entry: the scalar $\alpha$.

4: $\mathbf{x}\left(*\right)$ – Complex (Kind=nag_wp) array Input

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

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

If $\mathbf{incx}>0$, $x_{\mathit{i}}$ must be stored in $\mathbf{x}\left(1+(\mathit{i}-1)\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-(\mathbf{n}-\mathit{i})\times \mathbf{incx}\right)$, for $\mathit{i}=1,2,\dots ,\mathbf{n}$.

Intermediate elements of x are not referenced.

5: $\mathbf{incx}$ – Integer Input

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

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

6: $\mathbf{a}(\mathbf{lda},*)$ – Complex (Kind=nag_wp) array Input/Output

Note: the second dimension of the array a must be at least $\max (1,\mathbf{n})$.

On entry: the $n\times n$ symmetric matrix $A$.

• If $\mathbf{uplo}=\text{'U'}$, the upper triangular part of $A$ must be stored and the elements of the array below the diagonal are not referenced.
• If $\mathbf{uplo}=\text{'L'}$, the lower triangular part of $A$ must be stored and the elements of the array above the diagonal are not referenced.

On exit: the updated matrix $A$.

7: $\mathbf{lda}$ – Integer Input

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

Constraint: $\mathbf{lda}\ge \max (1,\mathbf{n})$.

6 Error Indicators and Warnings

7 Accuracy

8 Parallelism and Performance

9 Further Comments

10 Example