F06 Chapter Contents
F06 Chapter Introduction
NAG Library Manual

NAG Library Routine DocumentF06GGF (ZSWAP)

Note:  before using this routine, please read the Users' Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent details.

1  Purpose

F06GGF (ZSWAP) interchanges two $n$-element complex vectors $x$ and $y$.

2  Specification

 SUBROUTINE F06GGF ( N, X, INCX, Y, INCY)
 INTEGER N, INCX, INCY COMPLEX (KIND=nag_wp) X(*), Y(*)
The routine may be called by its BLAS name zswap.

3  Description

F06GGF (ZSWAP) interchanges the elements of complex vectors $x$ and $y$ scattered with stride INCX and INCY respectively.

4  References

Lawson C L, Hanson R J, Kincaid D R and Krogh F T (1979) Basic linear algebra supbrograms for Fortran usage ACM Trans. Math. Software 5 308–325

5  Parameters

1:     N – INTEGERInput
On entry: $n$, the number of elements in $x$ and $y$.
2:     X($*$) – COMPLEX (KIND=nag_wp) arrayInput/Output
Note: the dimension of the array X must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,1+\left({\mathbf{N}}-1\right)×\left|{\mathbf{INCX}}\right|\right)$.
On entry: the original vector $x$.
If ${\mathbf{INCX}}>0$, ${x}_{\mathit{i}}$ must be stored in ${\mathbf{X}}\left(1+\left(\mathit{i}-1\right)×{\mathbf{INCX}}\right)$, for $\mathit{i}=1,2,\dots ,{\mathbf{N}}$.
If ${\mathbf{INCX}}\le 0$, ${x}_{\mathit{i}}$ must be stored in ${\mathbf{X}}\left(1+\left({\mathbf{N}}-\mathit{i}\right)×{\mathbf{INCX}}\right)$, for $\mathit{i}=1,2,\dots ,{\mathbf{N}}$.
On exit: the original vector $y$ stored in the array elements used to store the original vector $x$. Intermediate elements of X are unchanged.
3:     INCX – INTEGERInput
On entry: the increment in the subscripts of X between successive elements of $x$.
4:     Y($*$) – COMPLEX (KIND=nag_wp) arrayInput/Output
Note: the dimension of the array Y must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,1+\left({\mathbf{N}}-1\right)×\left|{\mathbf{INCY}}\right|\right)$.
On entry: the original vector $y$.
If ${\mathbf{INCY}}>0$, ${y}_{\mathit{i}}$ must be stored in ${\mathbf{Y}}\left(1+\left(\mathit{i}-1\right)×{\mathbf{INCY}}\right)$, for $\mathit{i}=1,2,\dots ,{\mathbf{N}}$.
If ${\mathbf{INCY}}\le 0$, ${y}_{\mathit{i}}$ must be stored in ${\mathbf{Y}}\left(1+\left({\mathbf{N}}-\mathit{i}\right)×{\mathbf{INCY}}\right)$, for $\mathit{i}=1,2,\dots ,{\mathbf{N}}$.
On exit: the original vector $x$ stored in the array elements used to store the original vector $y$. Intermediate elements of Y are unchanged.
5:     INCY – INTEGERInput
On entry: the increment in the subscripts of Y between successive elements of $y$.

None.

Not applicable.