*nix Documentation Project
·  Home
 +   man pages
·  Linux HOWTOs
·  FreeBSD Tips
·  *niX Forums

  man pages->IRIX man pages -> complib/chegst (3)              
Title
Content
Arch
Section
 

Contents


CHEGST(3F)							    CHEGST(3F)


NAME    [Toc]    [Back]

     CHEGST - reduce a complex Hermitian-definite generalized eigenproblem to
     standard form

SYNOPSIS    [Toc]    [Back]

     SUBROUTINE	CHEGST(	ITYPE, UPLO, N,	A, LDA,	B, LDB,	INFO )

	 CHARACTER	UPLO

	 INTEGER	INFO, ITYPE, LDA, LDB, N

	 COMPLEX	A( LDA,	* ), B(	LDB, * )

PURPOSE    [Toc]    [Back]

     CHEGST 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.

ARGUMENTS    [Toc]    [Back]

     ITYPE   (input) INTEGER
	     = 1: compute inv(U**H)*A*inv(U) or	inv(L)*A*inv(L**H);
	     = 2 or 3: compute U*A*U**H	or L**H*A*L.

     UPLO    (input) CHARACTER
	     = 'U':  Upper triangle of A is stored and B is factored as
	     U**H*U; = 'L':  Lower triangle of A is stored and B is factored
	     as	L*L**H.

     N	     (input) INTEGER
	     The order of the matrices A and B.	 N >= 0.

     A	     (input/output) COMPLEX array, dimension (LDA,N)
	     On	entry, the Hermitian matrix A.	If UPLO	= 'U', the leading Nby-N
 upper	triangular part	of A contains the upper	triangular
	     part of the matrix	A, and the strictly lower triangular part of A
	     is	not referenced.	 If UPLO = 'L',	the leading N-by-N lower
	     triangular	part of	A contains the lower triangular	part of	the
	     matrix A, and the strictly	upper triangular part of A is not
	     referenced.

	     On	exit, if INFO =	0, the transformed matrix, stored in the same
	     format as A.





									Page 1






CHEGST(3F)							    CHEGST(3F)



     LDA     (input) INTEGER
	     The leading dimension of the array	A.  LDA	>= max(1,N).

     B	     (input) COMPLEX array, dimension (LDB,N)
	     The triangular factor from	the Cholesky factorization of B, as
	     returned by CPOTRF.

     LDB     (input) INTEGER
	     The leading dimension of the array	B.  LDB	>= max(1,N).

     INFO    (output) INTEGER
	     = 0:  successful exit
	     < 0:  if INFO = -i, the i-th argument had an illegal value
CHEGST(3F)							    CHEGST(3F)


NAME    [Toc]    [Back]

     CHEGST - reduce a complex Hermitian-definite generalized eigenproblem to
     standard form

SYNOPSIS    [Toc]    [Back]

     SUBROUTINE	CHEGST(	ITYPE, UPLO, N,	A, LDA,	B, LDB,	INFO )

	 CHARACTER	UPLO

	 INTEGER	INFO, ITYPE, LDA, LDB, N

	 COMPLEX	A( LDA,	* ), B(	LDB, * )

PURPOSE    [Toc]    [Back]

     CHEGST 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.

ARGUMENTS    [Toc]    [Back]

     ITYPE   (input) INTEGER
	     = 1: compute inv(U**H)*A*inv(U) or	inv(L)*A*inv(L**H);
	     = 2 or 3: compute U*A*U**H	or L**H*A*L.

     UPLO    (input) CHARACTER
	     = 'U':  Upper triangle of A is stored and B is factored as
	     U**H*U; = 'L':  Lower triangle of A is stored and B is factored
	     as	L*L**H.

     N	     (input) INTEGER
	     The order of the matrices A and B.	 N >= 0.

     A	     (input/output) COMPLEX array, dimension (LDA,N)
	     On	entry, the Hermitian matrix A.	If UPLO	= 'U', the leading Nby-N
 upper	triangular part	of A contains the upper	triangular
	     part of the matrix	A, and the strictly lower triangular part of A
	     is	not referenced.	 If UPLO = 'L',	the leading N-by-N lower
	     triangular	part of	A contains the lower triangular	part of	the
	     matrix A, and the strictly	upper triangular part of A is not
	     referenced.

	     On	exit, if INFO =	0, the transformed matrix, stored in the same
	     format as A.





									Page 1






CHEGST(3F)							    CHEGST(3F)



     LDA     (input) INTEGER
	     The leading dimension of the array	A.  LDA	>= max(1,N).

     B	     (input) COMPLEX array, dimension (LDB,N)
	     The triangular factor from	the Cholesky factorization of B, as
	     returned by CPOTRF.

     LDB     (input) INTEGER
	     The leading dimension of the array	B.  LDB	>= max(1,N).

     INFO    (output) INTEGER
	     = 0:  successful exit
	     < 0:  if INFO = -i, the i-th argument had an illegal value


									PPPPaaaaggggeeee 2222
[ Back ]
 Similar pages
Name OS Title
zhpgst IRIX reduce a complex Hermitian-definite generalized eigenproblem to standard form, using packed storage
chpgst IRIX reduce a complex Hermitian-definite generalized eigenproblem to standard form, using packed storage
ssygs2 IRIX reduce a real symmetric-definite generalized eigenproblem to standard form
ssygst IRIX reduce a real symmetric-definite generalized eigenproblem to standard form
dsygst IRIX reduce a real symmetric-definite generalized eigenproblem to standard form
dsygs2 IRIX reduce a real symmetric-definite generalized eigenproblem to standard form
sspgst IRIX reduce a real symmetric-definite generalized eigenproblem to standard form, using packed storage
dspgst IRIX reduce a real symmetric-definite generalized eigenproblem to standard form, using packed storage
zhbgv IRIX a complex generalized Hermitian-definite banded eigenproblem, of the form A*x=(lambda)*B*x
chbgv IRIX a complex generalized Hermitian-definite banded eigenproblem, of the form A*x=(lambda)*B*x
Copyright © 2004-2005 DeniX Solutions SRL
newsletter delivery service