NAG CL Interfacef16sec (zhpmv)

Settings help

CL Name Style:

1Purpose

f16sec performs matrix-vector multiplication for a complex Hermitian matrix stored in packed form.

2Specification

 #include
 void f16sec (Nag_OrderType order, Nag_UploType uplo, Integer n, Complex alpha, const Complex ap[], const Complex x[], Integer incx, Complex beta, Complex y[], Integer incy, NagError *fail)
The function may be called by the names: f16sec, nag_blast_zhpmv or nag_zhpmv.

3Description

f16sec performs the matrix-vector operation
 $y←αAx + βy ,$
where $A$ is an $n×n$ complex Hermitian matrix stored in packed form, $x$ and $y$ are $n$-element complex vectors, and $\alpha$ and $\beta$ are complex scalars.

4References

Basic Linear Algebra Subprograms Technical (BLAST) Forum (2001) Basic Linear Algebra Subprograms Technical (BLAST) Forum Standard University of Tennessee, Knoxville, Tennessee https://www.netlib.org/blas/blast-forum/blas-report.pdf

5Arguments

1: $\mathbf{order}$Nag_OrderType Input
On entry: the order argument specifies the two-dimensional storage scheme being used, i.e., row-major ordering or column-major ordering. C language defined storage is specified by ${\mathbf{order}}=\mathrm{Nag_RowMajor}$. See Section 3.1.3 in the Introduction to the NAG Library CL Interface for a more detailed explanation of the use of this argument.
Constraint: ${\mathbf{order}}=\mathrm{Nag_RowMajor}$ or $\mathrm{Nag_ColMajor}$.
2: $\mathbf{uplo}$Nag_UploType Input
On entry: specifies whether the upper or lower triangular part of $A$ is stored.
${\mathbf{uplo}}=\mathrm{Nag_Upper}$
The upper triangular part of $A$ is stored.
${\mathbf{uplo}}=\mathrm{Nag_Lower}$
The lower triangular part of $A$ is stored.
Constraint: ${\mathbf{uplo}}=\mathrm{Nag_Upper}$ or $\mathrm{Nag_Lower}$.
3: $\mathbf{n}$Integer Input
On entry: $n$, the order of the matrix $A$.
Constraint: ${\mathbf{n}}\ge 0$.
4: $\mathbf{alpha}$Complex Input
On entry: the scalar $\alpha$.
5: $\mathbf{ap}\left[\mathit{dim}\right]$const Complex Input
Note: the dimension, dim, of the array ap must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}×\left({\mathbf{n}}+1\right)/2\right)$.
On entry: the $n×n$ Hermitian matrix $A$, packed by rows or columns.
The storage of elements ${A}_{ij}$ depends on the order and uplo arguments as follows:
if ${\mathbf{order}}=\mathrm{Nag_ColMajor}$ and ${\mathbf{uplo}}=\mathrm{Nag_Upper}$,
${A}_{ij}$ is stored in ${\mathbf{ap}}\left[\left(j-1\right)×j/2+i-1\right]$, for $i\le j$;
if ${\mathbf{order}}=\mathrm{Nag_ColMajor}$ and ${\mathbf{uplo}}=\mathrm{Nag_Lower}$,
${A}_{ij}$ is stored in ${\mathbf{ap}}\left[\left(2n-j\right)×\left(j-1\right)/2+i-1\right]$, for $i\ge j$;
if ${\mathbf{order}}=\mathrm{Nag_RowMajor}$ and ${\mathbf{uplo}}=\mathrm{Nag_Upper}$,
${A}_{ij}$ is stored in ${\mathbf{ap}}\left[\left(2n-i\right)×\left(i-1\right)/2+j-1\right]$, for $i\le j$;
if ${\mathbf{order}}=\mathrm{Nag_RowMajor}$ and ${\mathbf{uplo}}=\mathrm{Nag_Lower}$,
${A}_{ij}$ is stored in ${\mathbf{ap}}\left[\left(i-1\right)×i/2+j-1\right]$, for $i\ge j$.
6: $\mathbf{x}\left[\mathit{dim}\right]$const Complex Input
Note: the dimension, dim, of the array x must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,1+\left({\mathbf{n}}-1\right)|{\mathbf{incx}}|\right)$.
On entry: the $n$-element vector $x$.
If ${\mathbf{incx}}>0$, ${x}_{\mathit{i}}$ must be stored in ${\mathbf{x}}\left[\left(\mathit{i}-1\right)×{\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[\left({\mathbf{n}}-\mathit{i}\right)×|{\mathbf{incx}}|\right]$, for $\mathit{i}=1,2,\dots ,{\mathbf{n}}$.
Intermediate elements of x are not referenced. If ${\mathbf{n}}=0$, x is not referenced and may be NULL.
7: $\mathbf{incx}$Integer Input
On entry: the increment in the subscripts of x between successive elements of $x$.
Constraint: ${\mathbf{incx}}\ne 0$.
8: $\mathbf{beta}$Complex Input
On entry: the scalar $\beta$.
9: $\mathbf{y}\left[\mathit{dim}\right]$Complex Input/Output
Note: the dimension, dim, of the array y must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,1+\left({\mathbf{n}}-1\right)|{\mathbf{incy}}|\right)$.
On entry: the vector $y$. See x for details of storage.
If ${\mathbf{beta}}=0$, y need not be set.
On exit: the updated vector $y$.
10: $\mathbf{incy}$Integer Input
On entry: the increment in the subscripts of y between successive elements of $y$.
Constraint: ${\mathbf{incy}}\ne 0$.
11: $\mathbf{fail}$NagError * Input/Output
The NAG error argument (see Section 7 in the Introduction to the NAG Library CL Interface).

6Error Indicators and Warnings

NE_ALLOC_FAIL
Dynamic memory allocation failed.
See Section 3.1.2 in the Introduction to the NAG Library CL Interface for further information.
NE_BAD_PARAM
On entry, argument $⟨\mathit{\text{value}}⟩$ had an illegal value.
NE_INT
On entry, ${\mathbf{incx}}=⟨\mathit{\text{value}}⟩$.
Constraint: ${\mathbf{incx}}\ne 0$.
On entry, ${\mathbf{incy}}=⟨\mathit{\text{value}}⟩$.
Constraint: ${\mathbf{incy}}\ne 0$.
On entry, ${\mathbf{n}}=⟨\mathit{\text{value}}⟩$.
Constraint: ${\mathbf{n}}\ge 0$.
NE_NO_LICENCE
Your licence key may have expired or may not have been installed correctly.
See Section 8 in the Introduction to the NAG Library CL Interface for further information.

7Accuracy

The BLAS standard requires accurate implementations which avoid unnecessary over/underflow (see Section 2.7 of Basic Linear Algebra Subprograms Technical (BLAST) Forum (2001)).

8Parallelism and Performance

f16sec is not threaded in any implementation.

None.

10Example

This example computes the matrix-vector product
 $y=αAx+βy$
where
 $A = ( 1.0+0.0i 2.0-1.0i 3.0-1.0i 4.0-1.0i 2.0+1.0i 2.0+0.0i 3.0-2.0i 4.0-2.0i 3.0+1.0i 3.0+2.0i 3.0+0.0i 4.0-3.0i 4.0+1.0i 4.0+1.0i 4.0+3.0i 4.0+0.0i ) ,$
 $x = ( -1.0+1.0i 2.0-3.0i -3.0+2.0i 1.0-1.0i ) ,$
 $y = ( 2.5+2.5i 2.5+1.5i 2.5+5.0i 6.0+9.0i ) ,$
 $α=1.0+0.0i and β=2.0+0.0i .$

10.1Program Text

Program Text (f16sece.c)

10.2Program Data

Program Data (f16sece.d)

10.3Program Results

Program Results (f16sece.r)