404 lines
13 KiB
Fortran
404 lines
13 KiB
Fortran
*> \brief \b CHEGVD
|
|
*
|
|
* =========== DOCUMENTATION ===========
|
|
*
|
|
* Online html documentation available at
|
|
* http://www.netlib.org/lapack/explore-html/
|
|
*
|
|
*> \htmlonly
|
|
*> Download CHEGVD + dependencies
|
|
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/chegvd.f">
|
|
*> [TGZ]</a>
|
|
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/chegvd.f">
|
|
*> [ZIP]</a>
|
|
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/chegvd.f">
|
|
*> [TXT]</a>
|
|
*> \endhtmlonly
|
|
*
|
|
* Definition:
|
|
* ===========
|
|
*
|
|
* SUBROUTINE CHEGVD( ITYPE, JOBZ, UPLO, N, A, LDA, B, LDB, W, WORK,
|
|
* LWORK, RWORK, LRWORK, IWORK, LIWORK, INFO )
|
|
*
|
|
* .. Scalar Arguments ..
|
|
* CHARACTER JOBZ, UPLO
|
|
* INTEGER INFO, ITYPE, LDA, LDB, LIWORK, LRWORK, LWORK, N
|
|
* ..
|
|
* .. Array Arguments ..
|
|
* INTEGER IWORK( * )
|
|
* REAL RWORK( * ), W( * )
|
|
* COMPLEX A( LDA, * ), B( LDB, * ), WORK( * )
|
|
* ..
|
|
*
|
|
*
|
|
*> \par Purpose:
|
|
* =============
|
|
*>
|
|
*> \verbatim
|
|
*>
|
|
*> CHEGVD computes all the eigenvalues, and optionally, the eigenvectors
|
|
*> of a complex generalized Hermitian-definite eigenproblem, of the form
|
|
*> A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x. Here A and
|
|
*> B are assumed to be Hermitian and B is also positive definite.
|
|
*> If eigenvectors are desired, it uses a divide and conquer algorithm.
|
|
*>
|
|
*> \endverbatim
|
|
*
|
|
* Arguments:
|
|
* ==========
|
|
*
|
|
*> \param[in] ITYPE
|
|
*> \verbatim
|
|
*> ITYPE is INTEGER
|
|
*> Specifies the problem type to be solved:
|
|
*> = 1: A*x = (lambda)*B*x
|
|
*> = 2: A*B*x = (lambda)*x
|
|
*> = 3: B*A*x = (lambda)*x
|
|
*> \endverbatim
|
|
*>
|
|
*> \param[in] JOBZ
|
|
*> \verbatim
|
|
*> JOBZ is CHARACTER*1
|
|
*> = 'N': Compute eigenvalues only;
|
|
*> = 'V': Compute eigenvalues and eigenvectors.
|
|
*> \endverbatim
|
|
*>
|
|
*> \param[in] UPLO
|
|
*> \verbatim
|
|
*> UPLO is CHARACTER*1
|
|
*> = 'U': Upper triangles of A and B are stored;
|
|
*> = 'L': Lower triangles of A and B are stored.
|
|
*> \endverbatim
|
|
*>
|
|
*> \param[in] N
|
|
*> \verbatim
|
|
*> N is INTEGER
|
|
*> The order of the matrices A and B. N >= 0.
|
|
*> \endverbatim
|
|
*>
|
|
*> \param[in,out] A
|
|
*> \verbatim
|
|
*> 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. If UPLO = 'L',
|
|
*> the leading N-by-N lower triangular part of A contains
|
|
*> the lower triangular part of the matrix A.
|
|
*>
|
|
*> On exit, if JOBZ = 'V', then if INFO = 0, A contains the
|
|
*> matrix Z of eigenvectors. The eigenvectors are normalized
|
|
*> as follows:
|
|
*> if ITYPE = 1 or 2, Z**H*B*Z = I;
|
|
*> if ITYPE = 3, Z**H*inv(B)*Z = I.
|
|
*> If JOBZ = 'N', then on exit the upper triangle (if UPLO='U')
|
|
*> or the lower triangle (if UPLO='L') of A, including the
|
|
*> diagonal, is destroyed.
|
|
*> \endverbatim
|
|
*>
|
|
*> \param[in] LDA
|
|
*> \verbatim
|
|
*> LDA is INTEGER
|
|
*> The leading dimension of the array A. LDA >= max(1,N).
|
|
*> \endverbatim
|
|
*>
|
|
*> \param[in,out] B
|
|
*> \verbatim
|
|
*> B is COMPLEX array, dimension (LDB, N)
|
|
*> On entry, the Hermitian matrix B. If UPLO = 'U', the
|
|
*> leading N-by-N upper triangular part of B contains the
|
|
*> upper triangular part of the matrix B. If UPLO = 'L',
|
|
*> the leading N-by-N lower triangular part of B contains
|
|
*> the lower triangular part of the matrix B.
|
|
*>
|
|
*> On exit, if INFO <= N, the part of B containing the matrix is
|
|
*> overwritten by the triangular factor U or L from the Cholesky
|
|
*> factorization B = U**H*U or B = L*L**H.
|
|
*> \endverbatim
|
|
*>
|
|
*> \param[in] LDB
|
|
*> \verbatim
|
|
*> LDB is INTEGER
|
|
*> The leading dimension of the array B. LDB >= max(1,N).
|
|
*> \endverbatim
|
|
*>
|
|
*> \param[out] W
|
|
*> \verbatim
|
|
*> W is REAL array, dimension (N)
|
|
*> If INFO = 0, the eigenvalues in ascending order.
|
|
*> \endverbatim
|
|
*>
|
|
*> \param[out] WORK
|
|
*> \verbatim
|
|
*> WORK is COMPLEX array, dimension (MAX(1,LWORK))
|
|
*> On exit, if INFO = 0, WORK(1) returns the optimal LWORK.
|
|
*> \endverbatim
|
|
*>
|
|
*> \param[in] LWORK
|
|
*> \verbatim
|
|
*> LWORK is INTEGER
|
|
*> The length of the array WORK.
|
|
*> If N <= 1, LWORK >= 1.
|
|
*> If JOBZ = 'N' and N > 1, LWORK >= N + 1.
|
|
*> If JOBZ = 'V' and N > 1, LWORK >= 2*N + N**2.
|
|
*>
|
|
*> If LWORK = -1, then a workspace query is assumed; the routine
|
|
*> only calculates the optimal sizes of the WORK, RWORK and
|
|
*> IWORK arrays, returns these values as the first entries of
|
|
*> the WORK, RWORK and IWORK arrays, and no error message
|
|
*> related to LWORK or LRWORK or LIWORK is issued by XERBLA.
|
|
*> \endverbatim
|
|
*>
|
|
*> \param[out] RWORK
|
|
*> \verbatim
|
|
*> RWORK is REAL array, dimension (MAX(1,LRWORK))
|
|
*> On exit, if INFO = 0, RWORK(1) returns the optimal LRWORK.
|
|
*> \endverbatim
|
|
*>
|
|
*> \param[in] LRWORK
|
|
*> \verbatim
|
|
*> LRWORK is INTEGER
|
|
*> The dimension of the array RWORK.
|
|
*> If N <= 1, LRWORK >= 1.
|
|
*> If JOBZ = 'N' and N > 1, LRWORK >= N.
|
|
*> If JOBZ = 'V' and N > 1, LRWORK >= 1 + 5*N + 2*N**2.
|
|
*>
|
|
*> If LRWORK = -1, then a workspace query is assumed; the
|
|
*> routine only calculates the optimal sizes of the WORK, RWORK
|
|
*> and IWORK arrays, returns these values as the first entries
|
|
*> of the WORK, RWORK and IWORK arrays, and no error message
|
|
*> related to LWORK or LRWORK or LIWORK is issued by XERBLA.
|
|
*> \endverbatim
|
|
*>
|
|
*> \param[out] IWORK
|
|
*> \verbatim
|
|
*> IWORK is INTEGER array, dimension (MAX(1,LIWORK))
|
|
*> On exit, if INFO = 0, IWORK(1) returns the optimal LIWORK.
|
|
*> \endverbatim
|
|
*>
|
|
*> \param[in] LIWORK
|
|
*> \verbatim
|
|
*> LIWORK is INTEGER
|
|
*> The dimension of the array IWORK.
|
|
*> If N <= 1, LIWORK >= 1.
|
|
*> If JOBZ = 'N' and N > 1, LIWORK >= 1.
|
|
*> If JOBZ = 'V' and N > 1, LIWORK >= 3 + 5*N.
|
|
*>
|
|
*> If LIWORK = -1, then a workspace query is assumed; the
|
|
*> routine only calculates the optimal sizes of the WORK, RWORK
|
|
*> and IWORK arrays, returns these values as the first entries
|
|
*> of the WORK, RWORK and IWORK arrays, and no error message
|
|
*> related to LWORK or LRWORK or LIWORK is issued by XERBLA.
|
|
*> \endverbatim
|
|
*>
|
|
*> \param[out] INFO
|
|
*> \verbatim
|
|
*> INFO is INTEGER
|
|
*> = 0: successful exit
|
|
*> < 0: if INFO = -i, the i-th argument had an illegal value
|
|
*> > 0: CPOTRF or CHEEVD returned an error code:
|
|
*> <= N: if INFO = i and JOBZ = 'N', then the algorithm
|
|
*> failed to converge; i off-diagonal elements of an
|
|
*> intermediate tridiagonal form did not converge to
|
|
*> zero;
|
|
*> if INFO = i and JOBZ = 'V', then the algorithm
|
|
*> failed to compute an eigenvalue while working on
|
|
*> the submatrix lying in rows and columns INFO/(N+1)
|
|
*> through mod(INFO,N+1);
|
|
*> > N: if INFO = N + i, for 1 <= i <= N, then the leading
|
|
*> principal minor of order i of B is not positive.
|
|
*> The factorization of B could not be completed and
|
|
*> no eigenvalues or eigenvectors were computed.
|
|
*> \endverbatim
|
|
*
|
|
* Authors:
|
|
* ========
|
|
*
|
|
*> \author Univ. of Tennessee
|
|
*> \author Univ. of California Berkeley
|
|
*> \author Univ. of Colorado Denver
|
|
*> \author NAG Ltd.
|
|
*
|
|
*> \ingroup complexHEeigen
|
|
*
|
|
*> \par Further Details:
|
|
* =====================
|
|
*>
|
|
*> \verbatim
|
|
*>
|
|
*> Modified so that no backsubstitution is performed if CHEEVD fails to
|
|
*> converge (NEIG in old code could be greater than N causing out of
|
|
*> bounds reference to A - reported by Ralf Meyer). Also corrected the
|
|
*> description of INFO and the test on ITYPE. Sven, 16 Feb 05.
|
|
*> \endverbatim
|
|
*
|
|
*> \par Contributors:
|
|
* ==================
|
|
*>
|
|
*> Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA
|
|
*>
|
|
* =====================================================================
|
|
SUBROUTINE CHEGVD( ITYPE, JOBZ, UPLO, N, A, LDA, B, LDB, W, WORK,
|
|
$ LWORK, RWORK, LRWORK, IWORK, LIWORK, INFO )
|
|
*
|
|
* -- LAPACK driver 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 JOBZ, UPLO
|
|
INTEGER INFO, ITYPE, LDA, LDB, LIWORK, LRWORK, LWORK, N
|
|
* ..
|
|
* .. Array Arguments ..
|
|
INTEGER IWORK( * )
|
|
REAL RWORK( * ), W( * )
|
|
COMPLEX A( LDA, * ), B( LDB, * ), WORK( * )
|
|
* ..
|
|
*
|
|
* =====================================================================
|
|
*
|
|
* .. Parameters ..
|
|
COMPLEX CONE
|
|
PARAMETER ( CONE = ( 1.0E+0, 0.0E+0 ) )
|
|
* ..
|
|
* .. Local Scalars ..
|
|
LOGICAL LQUERY, UPPER, WANTZ
|
|
CHARACTER TRANS
|
|
INTEGER LIOPT, LIWMIN, LOPT, LROPT, LRWMIN, LWMIN
|
|
* ..
|
|
* .. External Functions ..
|
|
LOGICAL LSAME
|
|
EXTERNAL LSAME
|
|
* ..
|
|
* .. External Subroutines ..
|
|
EXTERNAL CHEEVD, CHEGST, CPOTRF, CTRMM, CTRSM, XERBLA
|
|
* ..
|
|
* .. Intrinsic Functions ..
|
|
INTRINSIC MAX, REAL
|
|
* ..
|
|
* .. Executable Statements ..
|
|
*
|
|
* Test the input parameters.
|
|
*
|
|
WANTZ = LSAME( JOBZ, 'V' )
|
|
UPPER = LSAME( UPLO, 'U' )
|
|
LQUERY = ( LWORK.EQ.-1 .OR. LRWORK.EQ.-1 .OR. LIWORK.EQ.-1 )
|
|
*
|
|
INFO = 0
|
|
IF( N.LE.1 ) THEN
|
|
LWMIN = 1
|
|
LRWMIN = 1
|
|
LIWMIN = 1
|
|
ELSE IF( WANTZ ) THEN
|
|
LWMIN = 2*N + N*N
|
|
LRWMIN = 1 + 5*N + 2*N*N
|
|
LIWMIN = 3 + 5*N
|
|
ELSE
|
|
LWMIN = N + 1
|
|
LRWMIN = N
|
|
LIWMIN = 1
|
|
END IF
|
|
LOPT = LWMIN
|
|
LROPT = LRWMIN
|
|
LIOPT = LIWMIN
|
|
IF( ITYPE.LT.1 .OR. ITYPE.GT.3 ) THEN
|
|
INFO = -1
|
|
ELSE IF( .NOT.( WANTZ .OR. LSAME( JOBZ, 'N' ) ) ) THEN
|
|
INFO = -2
|
|
ELSE IF( .NOT.( UPPER .OR. LSAME( UPLO, 'L' ) ) ) THEN
|
|
INFO = -3
|
|
ELSE IF( N.LT.0 ) THEN
|
|
INFO = -4
|
|
ELSE IF( LDA.LT.MAX( 1, N ) ) THEN
|
|
INFO = -6
|
|
ELSE IF( LDB.LT.MAX( 1, N ) ) THEN
|
|
INFO = -8
|
|
END IF
|
|
*
|
|
IF( INFO.EQ.0 ) THEN
|
|
WORK( 1 ) = LOPT
|
|
RWORK( 1 ) = LROPT
|
|
IWORK( 1 ) = LIOPT
|
|
*
|
|
IF( LWORK.LT.LWMIN .AND. .NOT.LQUERY ) THEN
|
|
INFO = -11
|
|
ELSE IF( LRWORK.LT.LRWMIN .AND. .NOT.LQUERY ) THEN
|
|
INFO = -13
|
|
ELSE IF( LIWORK.LT.LIWMIN .AND. .NOT.LQUERY ) THEN
|
|
INFO = -15
|
|
END IF
|
|
END IF
|
|
*
|
|
IF( INFO.NE.0 ) THEN
|
|
CALL XERBLA( 'CHEGVD', -INFO )
|
|
RETURN
|
|
ELSE IF( LQUERY ) THEN
|
|
RETURN
|
|
END IF
|
|
*
|
|
* Quick return if possible
|
|
*
|
|
IF( N.EQ.0 )
|
|
$ RETURN
|
|
*
|
|
* Form a Cholesky factorization of B.
|
|
*
|
|
CALL CPOTRF( UPLO, N, B, LDB, INFO )
|
|
IF( INFO.NE.0 ) THEN
|
|
INFO = N + INFO
|
|
RETURN
|
|
END IF
|
|
*
|
|
* Transform problem to standard eigenvalue problem and solve.
|
|
*
|
|
CALL CHEGST( ITYPE, UPLO, N, A, LDA, B, LDB, INFO )
|
|
CALL CHEEVD( JOBZ, UPLO, N, A, LDA, W, WORK, LWORK, RWORK, LRWORK,
|
|
$ IWORK, LIWORK, INFO )
|
|
LOPT = INT( MAX( REAL( LOPT ), REAL( WORK( 1 ) ) ) )
|
|
LROPT = INT( MAX( REAL( LROPT ), REAL( RWORK( 1 ) ) ) )
|
|
LIOPT = INT( MAX( REAL( LIOPT ), REAL( IWORK( 1 ) ) ) )
|
|
*
|
|
IF( WANTZ .AND. INFO.EQ.0 ) THEN
|
|
*
|
|
* Backtransform eigenvectors to the original problem.
|
|
*
|
|
IF( ITYPE.EQ.1 .OR. ITYPE.EQ.2 ) THEN
|
|
*
|
|
* For A*x=(lambda)*B*x and A*B*x=(lambda)*x;
|
|
* backtransform eigenvectors: x = inv(L)**H *y or inv(U)*y
|
|
*
|
|
IF( UPPER ) THEN
|
|
TRANS = 'N'
|
|
ELSE
|
|
TRANS = 'C'
|
|
END IF
|
|
*
|
|
CALL CTRSM( 'Left', UPLO, TRANS, 'Non-unit', N, N, CONE,
|
|
$ B, LDB, A, LDA )
|
|
*
|
|
ELSE IF( ITYPE.EQ.3 ) THEN
|
|
*
|
|
* For B*A*x=(lambda)*x;
|
|
* backtransform eigenvectors: x = L*y or U**H *y
|
|
*
|
|
IF( UPPER ) THEN
|
|
TRANS = 'C'
|
|
ELSE
|
|
TRANS = 'N'
|
|
END IF
|
|
*
|
|
CALL CTRMM( 'Left', UPLO, TRANS, 'Non-unit', N, N, CONE,
|
|
$ B, LDB, A, LDA )
|
|
END IF
|
|
END IF
|
|
*
|
|
WORK( 1 ) = LOPT
|
|
RWORK( 1 ) = LROPT
|
|
IWORK( 1 ) = LIOPT
|
|
*
|
|
RETURN
|
|
*
|
|
* End of CHEGVD
|
|
*
|
|
END
|