chegst()

subroutine chegst	(	integer	itype,
		character	uplo,
		integer	n,
		complex, dimension( lda, * )	a,
		integer	lda,
		complex, dimension( ldb, * )	b,
		integer	ldb,
		integer	info
	)

CHEGST

Download CHEGST + dependencies [TGZ] [ZIP] [TXT]

Purpose:

 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.

Parameters

[in]	ITYPE	ITYPE is 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.
[in]	UPLO	UPLO is CHARACTER*1 = '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.
[in]	N	N is INTEGER The order of the matrices A and B. N >= 0.
[in,out]	A	A is COMPLEX array, dimension (LDA,N) On entry, the Hermitian matrix A. If UPLO = 'U', the leading N-by-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.
[in]	LDA	LDA is INTEGER The leading dimension of the array A. LDA >= max(1,N).
[in,out]	B	B is COMPLEX array, dimension (LDB,N) The triangular factor from the Cholesky factorization of B, as returned by CPOTRF. B is modified by the routine but restored on exit.
[in]	LDB	LDB is INTEGER The leading dimension of the array B. LDB >= max(1,N).
[out]	INFO	INFO is INTEGER = 0: successful exit < 0: if INFO = -i, the i-th argument had an illegal value

Author

Univ. of Tennessee

Univ. of California Berkeley

Univ. of Colorado Denver

NAG Ltd.

Definition at line 127 of file chegst.f.

*
*  -- LAPACK computational routine --
*  -- LAPACK is a software package provided by Univ. of Tennessee,    --
*  -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
*
*     .. Scalar Arguments ..
      CHARACTER          UPLO
      INTEGER            INFO, ITYPE, LDA, LDB, N
*     ..
*     .. Array Arguments ..
      COMPLEX            A( LDA, * ), B( LDB, * )
*     ..
*
*  =====================================================================
*
*     .. Parameters ..
      REAL               ONE
      parameter( one = 1.0e+0 )
      COMPLEX            CONE, HALF
      parameter( cone = ( 1.0e+0, 0.0e+0 ),
     $                   half = ( 0.5e+0, 0.0e+0 ) )
*     ..
*     .. Local Scalars ..
      LOGICAL            UPPER
      INTEGER            K, KB, NB
*     ..
*     .. External Subroutines ..
      EXTERNAL           chegs2, chemm, cher2k, ctrmm, ctrsm, xerbla
*     ..
*     .. Intrinsic Functions ..
      INTRINSIC          max, min
*     ..
*     .. External Functions ..
      LOGICAL            LSAME
      INTEGER            ILAENV
      EXTERNAL           lsame, ilaenv
*     ..
*     .. Executable Statements ..
*
*     Test the input parameters.
*
      info = 0
      upper = lsame( uplo, 'U' )
      IF( itype.LT.1 .OR. itype.GT.3 ) THEN
         info = -1
      ELSE IF( .NOT.upper .AND. .NOT.lsame( uplo, 'L' ) ) THEN
         info = -2
      ELSE IF( n.LT.0 ) THEN
         info = -3
      ELSE IF( lda.LT.max( 1, n ) ) THEN
         info = -5
      ELSE IF( ldb.LT.max( 1, n ) ) THEN
         info = -7
      END IF
      IF( info.NE.0 ) THEN
         CALL xerbla( 'CHEGST', -info )
         RETURN
      END IF
*
*     Quick return if possible
*
      IF( n.EQ.0 )
     $   RETURN
*
*     Determine the block size for this environment.
*
      nb = ilaenv( 1, 'CHEGST', uplo, n, -1, -1, -1 )
*
      IF( nb.LE.1 .OR. nb.GE.n ) THEN
*
*        Use unblocked code
*
         CALL chegs2( itype, uplo, n, a, lda, b, ldb, info )
      ELSE
*
*        Use blocked code
*
         IF( itype.EQ.1 ) THEN
            IF( upper ) THEN
*
*              Compute inv(U**H)*A*inv(U)
*
               DO 10 k = 1, n, nb
                  kb = min( n-k+1, nb )
*
*                 Update the upper triangle of A(k:n,k:n)
*
                  CALL chegs2( itype, uplo, kb, a( k, k ), lda,
     $                         b( k, k ), ldb, info )
                  IF( k+kb.LE.n ) THEN
                     CALL ctrsm( 'Left', uplo, 'Conjugate transpose',
     $                           'Non-unit', kb, n-k-kb+1, cone,
     $                           b( k, k ), ldb, a( k, k+kb ), lda )
                     CALL chemm( 'Left', uplo, kb, n-k-kb+1, -half,
     $                           a( k, k ), lda, b( k, k+kb ), ldb,
     $                           cone, a( k, k+kb ), lda )
                     CALL cher2k( uplo, 'Conjugate transpose', n-k-kb+1,
     $                            kb, -cone, a( k, k+kb ), lda,
     $                            b( k, k+kb ), ldb, one,
     $                            a( k+kb, k+kb ), lda )
                     CALL chemm( 'Left', uplo, kb, n-k-kb+1, -half,
     $                           a( k, k ), lda, b( k, k+kb ), ldb,
     $                           cone, a( k, k+kb ), lda )
                     CALL ctrsm( 'Right', uplo, 'No transpose',
     $                           'Non-unit', kb, n-k-kb+1, cone,
     $                           b( k+kb, k+kb ), ldb, a( k, k+kb ),
     $                           lda )
                  END IF
   10          CONTINUE
            ELSE
*
*              Compute inv(L)*A*inv(L**H)
*
               DO 20 k = 1, n, nb
                  kb = min( n-k+1, nb )
*
*                 Update the lower triangle of A(k:n,k:n)
*
                  CALL chegs2( itype, uplo, kb, a( k, k ), lda,
     $                         b( k, k ), ldb, info )
                  IF( k+kb.LE.n ) THEN
                     CALL ctrsm( 'Right', uplo, 'Conjugate transpose',
     $                           'Non-unit', n-k-kb+1, kb, cone,
     $                           b( k, k ), ldb, a( k+kb, k ), lda )
                     CALL chemm( 'Right', uplo, n-k-kb+1, kb, -half,
     $                           a( k, k ), lda, b( k+kb, k ), ldb,
     $                           cone, a( k+kb, k ), lda )
                     CALL cher2k( uplo, 'No transpose', n-k-kb+1, kb,
     $                            -cone, a( k+kb, k ), lda,
     $                            b( k+kb, k ), ldb, one,
     $                            a( k+kb, k+kb ), lda )
                     CALL chemm( 'Right', uplo, n-k-kb+1, kb, -half,
     $                           a( k, k ), lda, b( k+kb, k ), ldb,
     $                           cone, a( k+kb, k ), lda )
                     CALL ctrsm( 'Left', uplo, 'No transpose',
     $                           'Non-unit', n-k-kb+1, kb, cone,
     $                           b( k+kb, k+kb ), ldb, a( k+kb, k ),
     $                           lda )
                  END IF
   20          CONTINUE
            END IF
         ELSE
            IF( upper ) THEN
*
*              Compute U*A*U**H
*
               DO 30 k = 1, n, nb
                  kb = min( n-k+1, nb )
*
*                 Update the upper triangle of A(1:k+kb-1,1:k+kb-1)
*
                  CALL ctrmm( 'Left', uplo, 'No transpose', 'Non-unit',
     $                        k-1, kb, cone, b, ldb, a( 1, k ), lda )
                  CALL chemm( 'Right', uplo, k-1, kb, half, a( k, k ),
     $                        lda, b( 1, k ), ldb, cone, a( 1, k ),
     $                        lda )
                  CALL cher2k( uplo, 'No transpose', k-1, kb, cone,
     $                         a( 1, k ), lda, b( 1, k ), ldb, one, a,
     $                         lda )
                  CALL chemm( 'Right', uplo, k-1, kb, half, a( k, k ),
     $                        lda, b( 1, k ), ldb, cone, a( 1, k ),
     $                        lda )
                  CALL ctrmm( 'Right', uplo, 'Conjugate transpose',
     $                        'Non-unit', k-1, kb, cone, b( k, k ), ldb,
     $                        a( 1, k ), lda )
                  CALL chegs2( itype, uplo, kb, a( k, k ), lda,
     $                         b( k, k ), ldb, info )
   30          CONTINUE
            ELSE
*
*              Compute L**H*A*L
*
               DO 40 k = 1, n, nb
                  kb = min( n-k+1, nb )
*
*                 Update the lower triangle of A(1:k+kb-1,1:k+kb-1)
*
                  CALL ctrmm( 'Right', uplo, 'No transpose', 'Non-unit',
     $                        kb, k-1, cone, b, ldb, a( k, 1 ), lda )
                  CALL chemm( 'Left', uplo, kb, k-1, half, a( k, k ),
     $                        lda, b( k, 1 ), ldb, cone, a( k, 1 ),
     $                        lda )
                  CALL cher2k( uplo, 'Conjugate transpose', k-1, kb,
     $                         cone, a( k, 1 ), lda, b( k, 1 ), ldb,
     $                         one, a, lda )
                  CALL chemm( 'Left', uplo, kb, k-1, half, a( k, k ),
     $                        lda, b( k, 1 ), ldb, cone, a( k, 1 ),
     $                        lda )
                  CALL ctrmm( 'Left', uplo, 'Conjugate transpose',
     $                        'Non-unit', kb, k-1, cone, b( k, k ), ldb,
     $                        a( k, 1 ), lda )
                  CALL chegs2( itype, uplo, kb, a( k, k ), lda,
     $                         b( k, k ), ldb, info )
   40          CONTINUE
            END IF
         END IF
      END IF
      RETURN
*
*     End of CHEGST
*

Here is the call graph for this function:

Here is the caller graph for this function: