f16 Chapter Contents
f16 Chapter Introduction
NAG Library Manual

# NAG Library Function Documentnag_zherk (f16zpc)

## 1  Purpose

nag_zherk (f16zpc) performs a rank-$k$ update on a complex Hermitian matrix.

## 2  Specification

 #include #include
 void nag_zherk (Nag_OrderType order, Nag_UploType uplo, Nag_TransType trans, Integer n, Integer k, double alpha, const Complex a[], Integer pda, double beta, Complex c[], Integer pdc, NagError *fail)

## 3  Description

nag_zherk (f16zpc) performs one of the Hermitian rank-$k$ update operations
 $C←αAAH + βC or C←αAHA + βC ,$
where $A$ is a complex matrix, $C$ is an $n$ by $n$ complex Hermitian matrix, and $\alpha$ and $\beta$ are real scalars.

## 4  References

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

## 5  Arguments

1:     orderNag_OrderTypeInput
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.2.1.3 in the Essential Introduction for a more detailed explanation of the use of this argument.
Constraint: ${\mathbf{order}}=\mathrm{Nag_RowMajor}$ or $\mathrm{Nag_ColMajor}$.
2:     uploNag_UploTypeInput
On entry: specifies whether the upper or lower triangular part of $C$ is stored.
${\mathbf{uplo}}=\mathrm{Nag_Upper}$
The upper triangular part of $C$ is stored.
${\mathbf{uplo}}=\mathrm{Nag_Lower}$
The lower triangular part of $C$ is stored.
Constraint: ${\mathbf{uplo}}=\mathrm{Nag_Upper}$ or $\mathrm{Nag_Lower}$.
3:     transNag_TransTypeInput
On entry: specifies the operation to be performed.
${\mathbf{trans}}=\mathrm{Nag_NoTrans}$
$C←\alpha A{A}^{\mathrm{H}}+\beta C$.
${\mathbf{trans}}=\mathrm{Nag_ConjTrans}$
$C←\alpha {A}^{\mathrm{H}}A+\beta C$.
Constraint: ${\mathbf{trans}}=\mathrm{Nag_NoTrans}$ or $\mathrm{Nag_ConjTrans}$.
4:     nIntegerInput
On entry: $n$, the order of the matrix $C$; the number of rows of $A$ if ${\mathbf{trans}}=\mathrm{Nag_NoTrans}$, or the number of columns of $A$ otherwise.
Constraint: ${\mathbf{n}}\ge 0$.
5:     kIntegerInput
On entry: $k$, the number of columns of $A$ if ${\mathbf{trans}}=\mathrm{Nag_NoTrans}$, or the number of rows of $A$ otherwise.
Constraint: ${\mathbf{k}}\ge 0$.
On entry: the scalar $\alpha$.
7:     a[$\mathit{dim}$]const ComplexInput
Note: the dimension, dim, of the array a must be at least
• $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{pda}}×{\mathbf{k}}\right)$ when ${\mathbf{trans}}=\mathrm{Nag_NoTrans}$ and ${\mathbf{order}}=\mathrm{Nag_ColMajor}$;
• $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}×{\mathbf{pda}}\right)$ when ${\mathbf{trans}}=\mathrm{Nag_NoTrans}$ and ${\mathbf{order}}=\mathrm{Nag_RowMajor}$;
• $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{pda}}×{\mathbf{n}}\right)$ when ${\mathbf{trans}}=\mathrm{Nag_Trans}$ or $\mathrm{Nag_ConjTrans}$ and ${\mathbf{order}}=\mathrm{Nag_ColMajor}$;
• $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{k}}×{\mathbf{pda}}\right)$ when ${\mathbf{trans}}=\mathrm{Nag_Trans}$ or $\mathrm{Nag_ConjTrans}$ and ${\mathbf{order}}=\mathrm{Nag_RowMajor}$.
If ${\mathbf{order}}=\mathrm{Nag_ColMajor}$, ${A}_{ij}$ is stored in ${\mathbf{a}}\left[\left(j-1\right)×{\mathbf{pda}}+i-1\right]$.
If ${\mathbf{order}}=\mathrm{Nag_RowMajor}$, ${A}_{ij}$ is stored in ${\mathbf{a}}\left[\left(i-1\right)×{\mathbf{pda}}+j-1\right]$.
On entry: the matrix $A$; $A$ is $n$ by $k$ if ${\mathbf{trans}}=\mathrm{Nag_NoTrans}$, or $k$ by $n$ otherwise.
8:     pdaIntegerInput
On entry: the stride separating row or column elements (depending on the value of order) in the array a.
Constraints:
• if ${\mathbf{order}}=\mathrm{Nag_ColMajor}$,
• if ${\mathbf{trans}}=\mathrm{Nag_NoTrans}$, ${\mathbf{pda}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}\right)$;
• if ${\mathbf{trans}}=\mathrm{Nag_Trans}$ or $\mathrm{Nag_ConjTrans}$, ${\mathbf{pda}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{k}}\right)$;
• if ${\mathbf{order}}=\mathrm{Nag_RowMajor}$,
• if ${\mathbf{trans}}=\mathrm{Nag_NoTrans}$, ${\mathbf{pda}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{k}}\right)$;
• if ${\mathbf{trans}}=\mathrm{Nag_Trans}$ or $\mathrm{Nag_ConjTrans}$, ${\mathbf{pda}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}\right)$.
On entry: the scalar $\beta$.
10:   c[$\mathit{dim}$]ComplexInput/Output
Note: the dimension, dim, of the array c must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{pdc}}×{\mathbf{n}}\right)$.
On entry: the $n$ by $n$ Hermitian matrix $C$.
If ${\mathbf{order}}=\mathrm{Nag_ColMajor}$, ${C}_{ij}$ is stored in ${\mathbf{c}}\left[\left(j-1\right)×{\mathbf{pdc}}+i-1\right]$.
If ${\mathbf{order}}=\mathrm{Nag_RowMajor}$, ${C}_{ij}$ is stored in ${\mathbf{c}}\left[\left(i-1\right)×{\mathbf{pdc}}+j-1\right]$.
If ${\mathbf{uplo}}=\mathrm{Nag_Upper}$, the upper triangular part of $C$ must be stored and the elements of the array below the diagonal are not referenced.
If ${\mathbf{uplo}}=\mathrm{Nag_Lower}$, the lower triangular part of $C$ must be stored and the elements of the array above the diagonal are not referenced.
On exit: the updated matrix $C$. The imaginary parts of the diagonal elements are set to zero.
11:   pdcIntegerInput
On entry: the stride separating row or column elements (depending on the value of order) of the matrix $C$ in the array c.
Constraint: ${\mathbf{pdc}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}\right)$.
12:   failNagError *Input/Output
The NAG error argument (see Section 3.6 in the Essential Introduction).

## 6  Error Indicators and Warnings

NE_ALLOC_FAIL
Dynamic memory allocation failed.
On entry, argument $⟨\mathit{\text{value}}⟩$ had an illegal value.
NE_ENUM_INT_2
On entry, ${\mathbf{trans}}=⟨\mathit{\text{value}}⟩$, ${\mathbf{k}}=⟨\mathit{\text{value}}⟩$, ${\mathbf{pda}}=⟨\mathit{\text{value}}⟩$.
Constraint: if ${\mathbf{trans}}=\mathrm{Nag_NoTrans}$, ${\mathbf{pda}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{k}}\right)$.
On entry, ${\mathbf{trans}}=⟨\mathit{\text{value}}⟩$, ${\mathbf{k}}=⟨\mathit{\text{value}}⟩$, ${\mathbf{pda}}=⟨\mathit{\text{value}}⟩$.
Constraint: if ${\mathbf{trans}}=\mathrm{Nag_Trans}$ or $\mathrm{Nag_ConjTrans}$, ${\mathbf{pda}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{k}}\right)$.
On entry, ${\mathbf{trans}}=⟨\mathit{\text{value}}⟩$, ${\mathbf{n}}=⟨\mathit{\text{value}}⟩$, ${\mathbf{pda}}=⟨\mathit{\text{value}}⟩$.
Constraint: if ${\mathbf{trans}}=\mathrm{Nag_NoTrans}$, ${\mathbf{pda}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}\right)$.
On entry, ${\mathbf{trans}}=⟨\mathit{\text{value}}⟩$, ${\mathbf{n}}=⟨\mathit{\text{value}}⟩$, ${\mathbf{pda}}=⟨\mathit{\text{value}}⟩$.
Constraint: if ${\mathbf{trans}}=\mathrm{Nag_Trans}$ or $\mathrm{Nag_ConjTrans}$, ${\mathbf{pda}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}\right)$.
NE_INT
On entry, ${\mathbf{k}}=⟨\mathit{\text{value}}⟩$.
Constraint: ${\mathbf{k}}\ge 0$.
On entry, ${\mathbf{n}}=⟨\mathit{\text{value}}⟩$.
Constraint: ${\mathbf{n}}\ge 0$.
NE_INT_2
On entry, ${\mathbf{pdc}}=⟨\mathit{\text{value}}⟩$, ${\mathbf{n}}=⟨\mathit{\text{value}}⟩$.
Constraint: ${\mathbf{pdc}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}\right)$.
NE_INTERNAL_ERROR
An internal error has occurred in this function. Check the function call and any array sizes. If the call is correct then please contact NAG for assistance.

## 7  Accuracy

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

Not applicable.

None.

## 10  Example

Perform rank-$k$ update of complex Hermitian $4$ by $4$ matrix $C$ using $4$ by $2$ matrix $A$ ($k=2$), $C=C-A{A}^{\mathrm{T}}$, where
 $C = 4.78+0.00i 2.00+0.30i 2.89+1.34i -1.89-1.15i 2.00-0.30i -4.11+0.00i 2.36+4.25i 0.04+3.69i 2.89-1.34i 2.36-4.25i 4.15+0.00i -0.02-0.46i -1.89+1.15i 0.04-3.69i -0.02+0.46i 0.33+0.00i$
and
 $A = 1.7+-2.3i -1.8+2.4i 2.9+-2.1i 1.2+1.4i -2.9+1.0i 0.6+0.8i 1.5+0.9i -1.4+-1.7i .$

### 10.1  Program Text

Program Text (f16zpce.c)

### 10.2  Program Data

Program Data (f16zpce.d)

### 10.3  Program Results

Program Results (f16zpce.r)