NAG FL Interface
f06gbf (zdotc)

1 Purpose

2 Specification

3 Description

4 References

5 Arguments

1: $\mathbf{n}$ – Integer Input

On entry: $n$, the number of elements in $x$ and $y$.

2: $\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.

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

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

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

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

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

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

Intermediate elements of y are not referenced.

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

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

6 Error Indicators and Warnings

7 Accuracy

8 Parallelism and Performance

9 Further Comments

10 Example