f08 Chapter Contents
f08 Chapter Introduction
NAG C Library Manual

NAG Library Function Documentnag_zhptrd (f08gsc)

1  Purpose

nag_zhptrd (f08gsc) reduces a complex Hermitian matrix to tridiagonal form, using packed storage.

2  Specification

 #include #include
 void nag_zhptrd (Nag_OrderType order, Nag_UploType uplo, Integer n, Complex ap[], double d[], double e[], Complex tau[], NagError *fail)

3  Description

nag_zhptrd (f08gsc) reduces a complex Hermitian matrix $A$, held in packed storage, to real symmetric tridiagonal form $T$ by a unitary similarity transformation: $A=QT{Q}^{\mathrm{H}}$.
The matrix $Q$ is not formed explicitly but is represented as a product of $n-1$ elementary reflectors (see the f08 Chapter Introduction for details). Functions are provided to work with $Q$ in this representation (see Section 8).

4  References

Golub G H and Van Loan C F (1996) Matrix Computations (3rd Edition) Johns Hopkins University Press, Baltimore

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 Nag_ColMajor.
2:     uploNag_UploTypeInput
On entry: indicates 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:     nIntegerInput
On entry: $n$, the order of the matrix $A$.
Constraint: ${\mathbf{n}}\ge 0$.
4:     ap[$\mathit{dim}$]ComplexInput/Output
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 upper or lower triangle of the $n$ by $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$.
On exit: ap is overwritten by the tridiagonal matrix $T$ and details of the unitary matrix $Q$.
5:     d[n]doubleOutput
On exit: the diagonal elements of the tridiagonal matrix $T$.
6:     e[${\mathbf{n}}-1$]doubleOutput
On exit: the off-diagonal elements of the tridiagonal matrix $T$.
7:     tau[${\mathbf{n}}-1$]ComplexOutput
On exit: further details of the unitary matrix $Q$.
8:     failNagError *Input/Output
The NAG error argument (see Section 3.6 in the Essential Introduction).

6  Error Indicators and Warnings

On entry, argument $〈\mathit{\text{value}}〉$ had an illegal value.
NE_INT
On entry, ${\mathbf{n}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{n}}\ge 0$.
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 computed tridiagonal matrix $T$ is exactly similar to a nearby matrix $\left(A+E\right)$, where
 $E2≤ cn ε A2 ,$
$c\left(n\right)$ is a modestly increasing function of $n$, and $\epsilon$ is the machine precision.
The elements of $T$ themselves may be sensitive to small perturbations in $A$ or to rounding errors in the computation, but this does not affect the stability of the eigenvalues and eigenvectors.

The total number of real floating point operations is approximately $\frac{16}{3}{n}^{3}$.
To form the unitary matrix $Q$ nag_zhptrd (f08gsc) may be followed by a call to nag_zupgtr (f08gtc):
nag_zupgtr(order,uplo,n,ap,tau,&q,pdq,&fail)
To apply $Q$ to an $n$ by $p$ complex matrix $C$ nag_zhptrd (f08gsc) may be followed by a call to nag_zupmtr (f08guc). For example,
nag_zupmtr(order,Nag_LeftSide,uplo,Nag_NoTrans,n,p,ap,tau,&c,
pdc,&fail)
forms the matrix product $QC$.
The real analogue of this function is nag_dsptrd (f08gec).

9  Example

This example reduces the matrix $A$ to tridiagonal form, where
 $A = -2.28+0.00i 1.78-2.03i 2.26+0.10i -0.12+2.53i 1.78+2.03i -1.12+0.00i 0.01+0.43i -1.07+0.86i 2.26-0.10i 0.01-0.43i -0.37+0.00i 2.31-0.92i -0.12-2.53i -1.07-0.86i 2.31+0.92i -0.73+0.00i ,$
using packed storage.

9.1  Program Text

Program Text (f08gsce.c)

9.2  Program Data

Program Data (f08gsce.d)

9.3  Program Results

Program Results (f08gsce.r)