SPGST: reduces a real symmetric-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**T)*A*inv(U) or inv(L)*A*inv(L**T) 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**T or L**T*A*L. B must have been previously factorized as U**T*U or L*L**T by DPPTRF. More...

Public Member Functions
pure subroutine	dspgst (itype, uplo, n, ap, bp, info)

	la_dspgst

	la_qspgst

pure subroutine	sspgst (itype, uplo, n, ap, bp, info)

	la_sspgst

Detailed Description

SPGST: reduces a real symmetric-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**T)*A*inv(U) or inv(L)*A*inv(L**T) 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**T or L**T*A*L. B must have been previously factorized as U**T*U or L*L**T by DPPTRF.

Member Function/Subroutine Documentation

◆ dspgst()

pure subroutine la_lapack::spgst::dspgst	(	integer(ilp), intent(in)	itype,
		character, intent(in)	uplo,
		integer(ilp), intent(in)	n,
		real(dp), dimension(*), intent(inout)	ap,
		real(dp), dimension(*), intent(in)	bp,
		integer(ilp), intent(out)	info
	)

◆ la_dspgst()

la_lapack::spgst::la_dspgst

◆ la_qspgst()

la_lapack::spgst::la_qspgst

◆ la_sspgst()

la_lapack::spgst::la_sspgst

◆ sspgst()

pure subroutine la_lapack::spgst::sspgst	(	integer(ilp), intent(in)	itype,
		character, intent(in)	uplo,
		integer(ilp), intent(in)	n,
		real(sp), dimension(*), intent(inout)	ap,
		real(sp), dimension(*), intent(in)	bp,
		integer(ilp), intent(out)	info
	)

The documentation for this interface was generated from the following file:

la_lapack.f90