NAG Library Function Document

nag_zhpgst (f08tsc)

+− 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

1 Purpose

nag_zhpgst (f08tsc) reduces a complex Hermitian-definite generalized eigenproblem

A z = λ B z

A B z = λ z

B A z = λ z

to the standard form

C y = λ y

, where

A

is a complex Hermitian matrix and

B

has been factorized by nag_zpptrf (f07grc), using packed storage.

2 Specification

#include <nag.h>

#include <nagf08.h>

void	nag_zhpgst (Nag_OrderType order, Nag_ComputeType comp_type, Nag_UploType uplo, Integer n, Complex ap[], const Complex bp[], NagError *fail)

3 Description

To reduce the complex Hermitian-definite generalized eigenproblem

A z = λ B z

A B z = λ z

B A z = λ z

to the standard form

C y = λ y

using packed storage, nag_zhpgst (f08tsc) must be preceded by a call to nag_zpptrf (f07grc) which computes the Cholesky factorization of

B

;

B

must be positive definite.

The different problem types are specified by the argument comp_type, as indicated in the table below. The table shows how

C

is computed by the function, and also how the eigenvectors

z

of the original problem can be recovered from the eigenvectors of the standard form.

comp_type	Problem	uplo	$B$	$C$	$z$
$Nag_Compute_1$	$A z = λ B z$	$Nag_Upper$ $Nag_Lower$	$U^{H} U$ $L L^{H}$	$U^{- H} A U^{- 1}$ $L^{- 1} A L^{- H}$	$U^{- 1} y$ $L^{- H} y$
$Nag_Compute_2$	$A B z = λ z$	$Nag_Upper$ $Nag_Lower$	$U^{H} U$ $L L^{H}$	$U A U^{H}$ $L^{H} A L$	$U^{- 1} y$ $L^{- H} y$
$Nag_Compute_3$	$B A z = λ z$	$Nag_Upper$ $Nag_Lower$	$U^{H} U$ $L L^{H}$	$U A U^{H}$ $L^{H} A L$	$U^{H} y$ $L y$

4 References

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

5 Arguments

1: order – Nag_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

order = Nag_RowMajor

. See Section 3.2.1.3 in the Essential Introduction for a more detailed explanation of the use of this argument.

Constraint:

order = Nag_RowMajor

Nag_ColMajor

2: comp_type – Nag_ComputeTypeInput

On entry: indicates how the standard form is computed.

$comp_type = Nag_Compute_1$

if $uplo = Nag_Upper$ , $C = U^{- H} A U^{- 1}$ ;
if $uplo = Nag_Lower$ , $C = L^{- 1} A L^{- H}$ .

$comp_type = Nag_Compute_2$ or $Nag_Compute_3$

if $uplo = Nag_Upper$ , $C = U A U^{H}$ ;
if $uplo = Nag_Lower$ , $C = L^{H} A L$ .

Constraint:

comp_type = Nag_Compute_1

Nag_Compute_2

Nag_Compute_3

3: uplo – Nag_UploTypeInput

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

A

is stored and how

B

has been factorized.

$uplo = Nag_Upper$: The upper triangular part of $A$ is stored and $B = U^{H} U$ .
$uplo = Nag_Lower$: The lower triangular part of $A$ is stored and $B = L L^{H}$ .

Constraint:

uplo = Nag_Upper

Nag_Lower

4: n – IntegerInput

On entry:

n

, the order of the matrices

A

and

B

Constraint:

n \geq 0

5: ap[ $\dim$ ] – ComplexInput/Output

Note: the dimension, dim, of the array ap must be at least

\max (1, n \times (n + 1) / 2)

On entry: the upper or lower triangle of the

n

n

Hermitian matrix

A

, packed by rows or columns.

The storage of elements

A_{i j}

depends on the order and uplo arguments as follows:

if $order = Nag_ColMajor$ and $uplo = Nag_Upper$ ,
$A_{i j}$ is stored in $ap [(j - 1) \times j / 2 + i - 1]$ , for $i \leq j$ ;
if $order = Nag_ColMajor$ and $uplo = Nag_Lower$ ,
$A_{i j}$ is stored in $ap [(2 n - j) \times (j - 1) / 2 + i - 1]$ , for $i \geq j$ ;
if $order = Nag_RowMajor$ and $uplo = Nag_Upper$ ,
$A_{i j}$ is stored in $ap [(2 n - i) \times (i - 1) / 2 + j - 1]$ , for $i \leq j$ ;
if $order = Nag_RowMajor$ and $uplo = Nag_Lower$ ,
$A_{i j}$ is stored in $ap [(i - 1) \times i / 2 + j - 1]$ , for $i \geq j$ .

On exit: the upper or lower triangle of ap is overwritten by the corresponding upper or lower triangle of

C

as specified by comp_type and uplo, using the same packed storage format as described above.

6: bp[ $\dim$ ] – const ComplexInput

Note: the dimension, dim, of the array bp must be at least

\max (1, n \times (n + 1) / 2)

On entry: the Cholesky factor of

B

as specified by uplo and returned by nag_zpptrf (f07grc).

7: fail – NagError *Input/Output

The NAG error argument (see Section 3.6 in the Essential Introduction).

6 Error Indicators and Warnings

NE_BAD_PARAM: On entry, argument $⟨value⟩$ had an illegal value.
NE_INT: On entry, $n = ⟨value⟩$ .
Constraint: $n \geq 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

Forming the reduced matrix

C

is a stable procedure. However it involves implicit multiplication by

B^{- 1}

if (

comp_type = Nag_Compute_1

) or

B

(if

comp_type = Nag_Compute_2

Nag_Compute_3

). When nag_zhpgst (f08tsc) is used as a step in the computation of eigenvalues and eigenvectors of the original problem, there may be a significant loss of accuracy if

B

is ill-conditioned with respect to inversion.

8 Parallelism and Performance

nag_zhpgst (f08tsc) is not threaded by NAG in any implementation.

nag_zhpgst (f08tsc) 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 Users' Note for your implementation for any additional implementation-specific information.

9 Further Comments

The total number of real floating-point operations is approximately

4 n^{3}

The real analogue of this function is nag_dspgst (f08tec).

10 Example

This example computes all the eigenvalues of

A z = λ B z

, where

A = (\begin{array}{r} - 7.36 + 0.00 i & 0.77 - 0.43 i & - 0.64 - 0.92 i & 3.01 - 6.97 i \\ 0.77 + 0.43 i & 3.49 + 0.00 i & 2.19 + 4.45 i & 1.90 + 3.73 i \\ - 0.64 + 0.92 i & 2.19 - 4.45 i & 0.12 + 0.00 i & 2.88 - 3.17 i \\ 3.01 + 6.97 i & 1.90 - 3.73 i & 2.88 + 3.17 i & - 2.54 + 0.00 i \end{array})

and

B = (\begin{array}{r} 3.23 + 0.00 i & 1.51 - 1.92 i & 1.90 + 0.84 i & 0.42 + 2.50 i \\ 1.51 + 1.92 i & 3.58 + 0.00 i & - 0.23 + 1.11 i & - 1.18 + 1.37 i \\ 1.90 - 0.84 i & - 0.23 - 1.11 i & 4.09 + 0.00 i & 2.33 - 0.14 i \\ 0.42 - 2.50 i & - 1.18 - 1.37 i & 2.33 + 0.14 i & 4.29 + 0.00 i \end{array}),

using packed storage. Here

B

is Hermitian positive definite and must first be factorized by nag_zpptrf (f07grc). The program calls nag_zhpgst (f08tsc) to reduce the problem to the standard form

C y = λ y

; then nag_zhptrd (f08gsc) to reduce

C

to tridiagonal form, and nag_dsterf (f08jfc) to compute the eigenvalues.

NAG Library Function Documentnag_zhpgst (f08tsc)

+− 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 Library Function Document

nag_zhpgst (f08tsc)