naginterfaces.library.lapackeig.zhpgst

naginterfaces.library.lapackeig.zhpgst(itype, uplo, n, ap, bp)

zhpgst reduces a complex Hermitian-definite generalized eigenproblem $Az=\lambda Bz$, $ABz=\lambda z$ or $BAz=\lambda z$ to the standard form $Cy=\lambda y$, where $A$ is a complex Hermitian matrix and $B$ has been factorized by lapacklin.zpptrf, using packed storage.

For full information please refer to the NAG Library document for f08ts

https://support.nag.com/numeric/nl/nagdoc_30/flhtml/f08/f08tsf.html

Parameters

itypeint

Indicates how the standard form is computed.

$itype=1$

if $uplo=\text{'U'}$, $C=U^{-H}A{U}^{-1}$;

if $uplo=\text{'L'}$, $C=L^{-1}A{L}^{-H}$.

$itype=2$ or $3$

if $uplo=\text{'U'}$, $C=UA{U}^H$;

if $uplo=\text{'L'}$, $C=L^{H}AL$.

uplostr, length 1

Indicates whether the upper or lower triangular part of $A$ is stored and how $B$ has been factorized.

$uplo=\text{'U'}$

The upper triangular part of $A$ is stored and $B=U^{H}U$.

$uplo=\text{'L'}$

The lower triangular part of $A$ is stored and $B=L{L}^H$.

nint

$n$, the order of the matrices $A$ and $B$.

apcomplex, array-like, shape $(n\times (n+1)/2)$

The upper or lower triangle of the $n\times n$ Hermitian matrix $A$, packed by columns.

bpcomplex, array-like, shape $(n\times (n+1)/2)$

The Cholesky factor of $B$ as specified by $uplo$ and returned by lapacklin.zpptrf.

Returns

apcomplex, ndarray, shape $(n\times (n+1)/2)$

The upper or lower triangle of $ap$ is overwritten by the corresponding upper or lower triangle of $C$ as specified by $itype$ and $uplo$, using the same packed storage format as described above.

Raises

NagValueError

(errno $-1$)

On entry, error in parameter $itype$.

Constraint: $itype=1$, $2$ or $3$.

(errno $-2$)

On entry, error in parameter $uplo$.

Constraint: $uplo=\text{'U'}$ or $\text{'L'}$.

(errno $-3$)

On entry, error in parameter $n$.

Constraint: $n\ge 0$.

Notes

To reduce the complex Hermitian-definite generalized eigenproblem $Az=\lambda Bz$, $ABz=\lambda z$ or $BAz=\lambda z$ to the standard form $Cy=\lambda y$ using packed storage, zhpgst must be preceded by a call to lapacklin.zpptrf which computes the Cholesky factorization of $B$; $B$ must be positive definite.

The different problem types are specified by the argument $itype$, 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.

$itype$	Problem	$uplo$	$B$	$C$	$z$
$1$	$Az=\lambda Bz$	‘U’ ‘L’	$U^{H}U$ $L{L}^H$	$U^{-H}A{U}^{-1}$ $L^{-1}A{L}^{-H}$	$U^{-1}y$ $L^{-H}y$
$2$	$ABz=\lambda z$	‘U’ ‘L’	$U^{H}U$ $L{L}^H$	$UA{U}^H$ $L^{H}AL$	$U^{-1}y$ $L^{-H}y$
$3$	$BAz=\lambda z$	‘U’ ‘L’	$U^{H}U$ $L{L}^H$	$UA{U}^H$ $L^{H}AL$	$U^{H}y$ $Ly$

References

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