# NAG FL Interfacef08gsf (zhptrd)

## 1Purpose

f08gsf reduces a complex Hermitian matrix to tridiagonal form, using packed storage.

## 2Specification

Fortran Interface
 Subroutine f08gsf ( uplo, n, ap, d, e, tau, info)
 Integer, Intent (In) :: n Integer, Intent (Out) :: info Real (Kind=nag_wp), Intent (Out) :: d(n), e(n-1) Complex (Kind=nag_wp), Intent (Inout) :: ap(*) Complex (Kind=nag_wp), Intent (Out) :: tau(n-1) Character (1), Intent (In) :: uplo
#include <nag.h>
 void f08gsf_ (const char *uplo, const Integer *n, Complex ap[], double d[], double e[], Complex tau[], Integer *info, const Charlen length_uplo)
The routine may be called by the names f08gsf, nagf_lapackeig_zhptrd or its LAPACK name zhptrd.

## 3Description

f08gsf 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). Routines are provided to work with $Q$ in this representation (see Section 9).

## 4References

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

## 5Arguments

1: $\mathbf{uplo}$Character(1) Input
On entry: indicates whether the upper or lower triangular part of $A$ is stored.
${\mathbf{uplo}}=\text{'U'}$
The upper triangular part of $A$ is stored.
${\mathbf{uplo}}=\text{'L'}$
The lower triangular part of $A$ is stored.
Constraint: ${\mathbf{uplo}}=\text{'U'}$ or $\text{'L'}$.
2: $\mathbf{n}$Integer Input
On entry: $n$, the order of the matrix $A$.
Constraint: ${\mathbf{n}}\ge 0$.
3: $\mathbf{ap}\left(*\right)$Complex (Kind=nag_wp) array Input/Output
Note: the dimension 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 columns.
More precisely,
• if ${\mathbf{uplo}}=\text{'U'}$, the upper triangle of $A$ must be stored with element ${A}_{ij}$ in ${\mathbf{ap}}\left(i+j\left(j-1\right)/2\right)$ for $i\le j$;
• if ${\mathbf{uplo}}=\text{'L'}$, the lower triangle of $A$ must be stored with element ${A}_{ij}$ in ${\mathbf{ap}}\left(i+\left(2n-j\right)\left(j-1\right)/2\right)$ for $i\ge j$.
On exit: ap is overwritten by the tridiagonal matrix $T$ and details of the unitary matrix $Q$.
4: $\mathbf{d}\left({\mathbf{n}}\right)$Real (Kind=nag_wp) array Output
On exit: the diagonal elements of the tridiagonal matrix $T$.
5: $\mathbf{e}\left({\mathbf{n}}-1\right)$Real (Kind=nag_wp) array Output
On exit: the off-diagonal elements of the tridiagonal matrix $T$.
6: $\mathbf{tau}\left({\mathbf{n}}-1\right)$Complex (Kind=nag_wp) array Output
On exit: further details of the unitary matrix $Q$.
7: $\mathbf{info}$Integer Output
On exit: ${\mathbf{info}}=0$ unless the routine detects an error (see Section 6).

## 6Error Indicators and Warnings

${\mathbf{info}}<0$
If ${\mathbf{info}}=-i$, argument $i$ had an illegal value. An explanatory message is output, and execution of the program is terminated.

## 7Accuracy

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.

## 8Parallelism and Performance

f08gsf makes calls to BLAS and/or LAPACK routines, which may be threaded within the vendor library used by this implementation. Consult the documentation for the vendor library for further information.
Please consult the X06 Chapter Introduction for information on how to control and interrogate the OpenMP environment used within this routine. Please also consult the Users' Note for your implementation for any additional implementation-specific information.

The total number of real floating-point operations is approximately $\frac{16}{3}{n}^{3}$.
To form the unitary matrix $Q$ f08gsf may be followed by a call to f08gtf :
`Call zupgtr(uplo,n,ap,tau,q,ldq,work,info)`
To apply $Q$ to an $n$ by $p$ complex matrix $C$ f08gsf may be followed by a call to f08guf . For example,
```Call zupmtr('Left',uplo,'No Transpose',n,p,ap,tau,c,ldc,work, &
info)```
forms the matrix product $QC$.
The real analogue of this routine is f08gef.

## 10Example

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.

### 10.1Program Text

Program Text (f08gsfe.f90)

### 10.2Program Data

Program Data (f08gsfe.d)

### 10.3Program Results

Program Results (f08gsfe.r)