HEGST: reduces a complex Hermitian-definite generalized eigenproblem to standard form. 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 CPOTRF. More...

Public Member Functions
pure subroutine	chegst (itype, uplo, n, a, lda, b, ldb, info)

	la_chegst

	la_whegst

pure subroutine	zhegst (itype, uplo, n, a, lda, b, ldb, info)

	la_zhegst

Detailed Description

HEGST: reduces a complex Hermitian-definite generalized eigenproblem to standard form. 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 CPOTRF.

Member Function/Subroutine Documentation

◆ chegst()

pure subroutine la_lapack::hegst::chegst	(	integer(ilp), intent(in)	itype,
		character, intent(in)	uplo,
		integer(ilp), intent(in)	n,
		complex(sp), dimension(lda,*), intent(inout)	a,
		integer(ilp), intent(in)	lda,
		complex(sp), dimension(ldb,*), intent(inout)	b,
		integer(ilp), intent(in)	ldb,
		integer(ilp), intent(out)	info
	)

Here is the call graph for this function:

◆ la_chegst()

la_lapack::hegst::la_chegst

◆ la_whegst()

la_lapack::hegst::la_whegst

◆ la_zhegst()

la_lapack::hegst::la_zhegst

◆ zhegst()

pure subroutine la_lapack::hegst::zhegst	(	integer(ilp), intent(in)	itype,
		character, intent(in)	uplo,
		integer(ilp), intent(in)	n,
		complex(dp), dimension(lda,*), intent(inout)	a,
		integer(ilp), intent(in)	lda,
		complex(dp), dimension(ldb,*), intent(inout)	b,
		integer(ilp), intent(in)	ldb,
		integer(ilp), intent(out)	info
	)