HPGST: reduces a complex Hermitian-definite generalized eigenproblem to standard form, using packed storage. If ITYPE = 1, the problem is A*x = lambda*B*x, and A is overwritten by inv(U**H)*A*inv(U) or inv(L)*A*inv(L**H) If ITYPE = 2 or 3, the problem is A*B*x = lambda*x or B*A*x = lambda*x, and A is overwritten by U*A*U**H or L**H*A*L. B must have been previously factorized as U**H*U or L*L**H by CPPTRF.
More...
|
pure subroutine | chpgst (itype, uplo, n, ap, bp, info) |
|
| la_chpgst |
|
| la_whpgst |
|
pure subroutine | zhpgst (itype, uplo, n, ap, bp, info) |
|
| la_zhpgst |
|
HPGST: reduces a complex Hermitian-definite generalized eigenproblem to standard form, using packed storage. If ITYPE = 1, the problem is A*x = lambda*B*x, and A is overwritten by inv(U**H)*A*inv(U) or inv(L)*A*inv(L**H) If ITYPE = 2 or 3, the problem is A*B*x = lambda*x or B*A*x = lambda*x, and A is overwritten by U*A*U**H or L**H*A*L. B must have been previously factorized as U**H*U or L*L**H by CPPTRF.
◆ chpgst()
pure subroutine la_lapack::hpgst::chpgst |
( |
integer(ilp), intent(in) |
itype, |
|
|
character, intent(in) |
uplo, |
|
|
integer(ilp), intent(in) |
n, |
|
|
complex(sp), dimension(*), intent(inout) |
ap, |
|
|
complex(sp), dimension(*), intent(in) |
bp, |
|
|
integer(ilp), intent(out) |
info |
|
) |
| |
◆ la_chpgst()
la_lapack::hpgst::la_chpgst |
◆ la_whpgst()
la_lapack::hpgst::la_whpgst |
◆ la_zhpgst()
la_lapack::hpgst::la_zhpgst |
◆ zhpgst()
pure subroutine la_lapack::hpgst::zhpgst |
( |
integer(ilp), intent(in) |
itype, |
|
|
character, intent(in) |
uplo, |
|
|
integer(ilp), intent(in) |
n, |
|
|
complex(dp), dimension(*), intent(inout) |
ap, |
|
|
complex(dp), dimension(*), intent(in) |
bp, |
|
|
integer(ilp), intent(out) |
info |
|
) |
| |
The documentation for this interface was generated from the following file: