Integer, Intent (In)	::	n, lda, lwork
Integer, Intent (Out)	::	info
Real (Kind=nag_wp), Intent (Inout)	::	d(), e()
Complex (Kind=nag_wp), Intent (Inout)	::	a(lda,), tau()
Complex (Kind=nag_wp), Intent (Out)	::	work(max(1,lwork))
Character (1), Intent (In)	::	uplo

C Header Interface

#include <nag.h>

void	f08fsf_ (const char uplo, const Integer n, Complex a[], const Integer lda, double d[], double e[], Complex tau[], Complex work[], const Integer lwork, Integer *info, const Charlen length_uplo)

The routine may be called by the names f08fsf, nagf_lapackeig_zhetrd or its LAPACK name zhetrd.

3 Description

f08fsf reduces a complex Hermitian matrix

A

to real symmetric tridiagonal form

T

by a unitary similarity transformation:

A = Q T Q^{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).

4 References

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

5 Arguments

1: $uplo$ – Character(1) Input

On entry: indicates whether the upper or lower triangular part of

A

is stored.

$uplo ='U'$: The upper triangular part of $A$ is stored.
$uplo ='L'$: The lower triangular part of $A$ is stored.

Constraint:

uplo ='U'

'L'

2: $n$ – Integer Input

On entry:

n

, the order of the matrix

A

Constraint:

n \geq 0

3: $a (lda, *)$ – Complex (Kind=nag_wp) array Input/Output

Note: the second dimension of the array a must be at least

\max (1, n)

On entry: the

n \times n

Hermitian matrix

A

If $uplo ='U'$ , the upper triangular part of $A$ must be stored and the elements of the array below the diagonal are not referenced.
If $uplo ='L'$ , the lower triangular part of $A$ must be stored and the elements of the array above the diagonal are not referenced.

On exit: a is overwritten by the tridiagonal matrix

T

and details of the unitary matrix

Q

as specified by uplo.

4: $lda$ – Integer Input

On entry: the first dimension of the array a as declared in the (sub)program from which f08fsf is called.

Constraint:

lda \geq \max (1, n)

5: $d (*)$ – Real (Kind=nag_wp) array Output

Note: the dimension of the array d must be at least

\max (1, n)

On exit: the diagonal elements of the tridiagonal matrix

T

6: $e (*)$ – Real (Kind=nag_wp) array Output

Note: the dimension of the array e must be at least

\max (1, n - 1)

On exit: the off-diagonal elements of the tridiagonal matrix

T

7: $tau (*)$ – Complex (Kind=nag_wp) array Output

Note: the dimension of the array tau must be at least

\max (1, n - 1)

On exit: further details of the unitary matrix

Q

8: $work (\max (1, lwork))$ – Complex (Kind=nag_wp) array Workspace

On exit: if

info = 0

, the real part of

work (1)

contains the minimum value of lwork required for optimal performance.

9: $lwork$ – Integer Input

On entry: the dimension of the array work as declared in the (sub)program from which f08fsf is called.

lwork = - 1

, a workspace query is assumed; the routine only calculates the optimal size of the work array, returns this value as the first entry of the work array, and no error message related to lwork is issued.

Suggested value: for optimal performance,

lwork \geq n \times nb

, where

nb

is the optimal block size.

Constraint:

lwork \geq 1

lwork = - 1

10: $info$ – Integer Output

On exit:

info = 0

unless the routine detects an error (see Section 6).

6 Error Indicators and Warnings

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

7 Accuracy

The computed tridiagonal matrix

T

is exactly similar to a nearby matrix

(A + E)

, where

{‖ E ‖}_{2} \leq c (n) ε {‖ A ‖}_{2},

c (n)

is a modestly increasing function of

n

, and

ε

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.

8 Parallelism and Performance

f08fsf is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.

f08fsf 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.

9 Further Comments

The total number of real floating-point operations is approximately

\frac{16}{3} n^{3}

To form the unitary matrix

Q

f08fsf may be followed by a call to f08ftf :

Call zungtr(uplo,n,a,lda,tau,work,lwork,info)

To apply

Q

to an

n \times p

complex matrix

C

f08fsf may be followed by a call to f08fuf . For example,

Call zunmtr('Left',uplo,'No Transpose',n,p,a,lda,tau,c,ldc, &
              work,lwork,info)

forms the matrix product

Q C

The real analogue of this routine is f08fef.

10 Example

This example reduces the matrix

A

to tridiagonal form, where

A = (\begin{array}{r} - 2.28 + 0.00 i & 1.78 - 2.03 i & 2.26 + 0.10 i & - 0.12 + 2.53 i \\ 1.78 + 2.03 i & - 1.12 + 0.00 i & 0.01 + 0.43 i & - 1.07 + 0.86 i \\ 2.26 - 0.10 i & 0.01 - 0.43 i & - 0.37 + 0.00 i & 2.31 - 0.92 i \\ - 0.12 - 2.53 i & - 1.07 - 0.86 i & 2.31 + 0.92 i & - 0.73 + 0.00 i \end{array}) .

f08fs: FL CL CPP AD

NAG FL Interfacef08fsf (zhetrd)

▸▿ Contents

1 Purpose

2 Specification

3 Description

4 References

5 Arguments

6 Error Indicators and Warnings

7 Accuracy

8 Parallelism and Performance

9 Further Comments

10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results

NAG FL Interface
f08fsf (zhetrd)