version 1.3, 2010/08/06 15:28:51
|
version 1.17, 2018/05/29 07:18:14
|
Line 1
|
Line 1
|
|
*> \brief <b> ZGEEVX computes the eigenvalues and, optionally, the left and/or right eigenvectors for GE matrices</b> |
|
* |
|
* =========== DOCUMENTATION =========== |
|
* |
|
* Online html documentation available at |
|
* http://www.netlib.org/lapack/explore-html/ |
|
* |
|
*> \htmlonly |
|
*> Download ZGEEVX + dependencies |
|
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zgeevx.f"> |
|
*> [TGZ]</a> |
|
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zgeevx.f"> |
|
*> [ZIP]</a> |
|
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zgeevx.f"> |
|
*> [TXT]</a> |
|
*> \endhtmlonly |
|
* |
|
* Definition: |
|
* =========== |
|
* |
|
* SUBROUTINE ZGEEVX( BALANC, JOBVL, JOBVR, SENSE, N, A, LDA, W, VL, |
|
* LDVL, VR, LDVR, ILO, IHI, SCALE, ABNRM, RCONDE, |
|
* RCONDV, WORK, LWORK, RWORK, INFO ) |
|
* |
|
* .. Scalar Arguments .. |
|
* CHARACTER BALANC, JOBVL, JOBVR, SENSE |
|
* INTEGER IHI, ILO, INFO, LDA, LDVL, LDVR, LWORK, N |
|
* DOUBLE PRECISION ABNRM |
|
* .. |
|
* .. Array Arguments .. |
|
* DOUBLE PRECISION RCONDE( * ), RCONDV( * ), RWORK( * ), |
|
* $ SCALE( * ) |
|
* COMPLEX*16 A( LDA, * ), VL( LDVL, * ), VR( LDVR, * ), |
|
* $ W( * ), WORK( * ) |
|
* .. |
|
* |
|
* |
|
*> \par Purpose: |
|
* ============= |
|
*> |
|
*> \verbatim |
|
*> |
|
*> ZGEEVX computes for an N-by-N complex nonsymmetric matrix A, the |
|
*> eigenvalues and, optionally, the left and/or right eigenvectors. |
|
*> |
|
*> Optionally also, it computes a balancing transformation to improve |
|
*> the conditioning of the eigenvalues and eigenvectors (ILO, IHI, |
|
*> SCALE, and ABNRM), reciprocal condition numbers for the eigenvalues |
|
*> (RCONDE), and reciprocal condition numbers for the right |
|
*> eigenvectors (RCONDV). |
|
*> |
|
*> The right eigenvector v(j) of A satisfies |
|
*> A * v(j) = lambda(j) * v(j) |
|
*> where lambda(j) is its eigenvalue. |
|
*> The left eigenvector u(j) of A satisfies |
|
*> u(j)**H * A = lambda(j) * u(j)**H |
|
*> where u(j)**H denotes the conjugate transpose of u(j). |
|
*> |
|
*> The computed eigenvectors are normalized to have Euclidean norm |
|
*> equal to 1 and largest component real. |
|
*> |
|
*> Balancing a matrix means permuting the rows and columns to make it |
|
*> more nearly upper triangular, and applying a diagonal similarity |
|
*> transformation D * A * D**(-1), where D is a diagonal matrix, to |
|
*> make its rows and columns closer in norm and the condition numbers |
|
*> of its eigenvalues and eigenvectors smaller. The computed |
|
*> reciprocal condition numbers correspond to the balanced matrix. |
|
*> Permuting rows and columns will not change the condition numbers |
|
*> (in exact arithmetic) but diagonal scaling will. For further |
|
*> explanation of balancing, see section 4.10.2 of the LAPACK |
|
*> Users' Guide. |
|
*> \endverbatim |
|
* |
|
* Arguments: |
|
* ========== |
|
* |
|
*> \param[in] BALANC |
|
*> \verbatim |
|
*> BALANC is CHARACTER*1 |
|
*> Indicates how the input matrix should be diagonally scaled |
|
*> and/or permuted to improve the conditioning of its |
|
*> eigenvalues. |
|
*> = 'N': Do not diagonally scale or permute; |
|
*> = 'P': Perform permutations to make the matrix more nearly |
|
*> upper triangular. Do not diagonally scale; |
|
*> = 'S': Diagonally scale the matrix, ie. replace A by |
|
*> D*A*D**(-1), where D is a diagonal matrix chosen |
|
*> to make the rows and columns of A more equal in |
|
*> norm. Do not permute; |
|
*> = 'B': Both diagonally scale and permute A. |
|
*> |
|
*> Computed reciprocal condition numbers will be for the matrix |
|
*> after balancing and/or permuting. Permuting does not change |
|
*> condition numbers (in exact arithmetic), but balancing does. |
|
*> \endverbatim |
|
*> |
|
*> \param[in] JOBVL |
|
*> \verbatim |
|
*> JOBVL is CHARACTER*1 |
|
*> = 'N': left eigenvectors of A are not computed; |
|
*> = 'V': left eigenvectors of A are computed. |
|
*> If SENSE = 'E' or 'B', JOBVL must = 'V'. |
|
*> \endverbatim |
|
*> |
|
*> \param[in] JOBVR |
|
*> \verbatim |
|
*> JOBVR is CHARACTER*1 |
|
*> = 'N': right eigenvectors of A are not computed; |
|
*> = 'V': right eigenvectors of A are computed. |
|
*> If SENSE = 'E' or 'B', JOBVR must = 'V'. |
|
*> \endverbatim |
|
*> |
|
*> \param[in] SENSE |
|
*> \verbatim |
|
*> SENSE is CHARACTER*1 |
|
*> Determines which reciprocal condition numbers are computed. |
|
*> = 'N': None are computed; |
|
*> = 'E': Computed for eigenvalues only; |
|
*> = 'V': Computed for right eigenvectors only; |
|
*> = 'B': Computed for eigenvalues and right eigenvectors. |
|
*> |
|
*> If SENSE = 'E' or 'B', both left and right eigenvectors |
|
*> must also be computed (JOBVL = 'V' and JOBVR = 'V'). |
|
*> \endverbatim |
|
*> |
|
*> \param[in] N |
|
*> \verbatim |
|
*> N is INTEGER |
|
*> The order of the matrix A. N >= 0. |
|
*> \endverbatim |
|
*> |
|
*> \param[in,out] A |
|
*> \verbatim |
|
*> A is COMPLEX*16 array, dimension (LDA,N) |
|
*> On entry, the N-by-N matrix A. |
|
*> On exit, A has been overwritten. If JOBVL = 'V' or |
|
*> JOBVR = 'V', A contains the Schur form of the balanced |
|
*> version of the matrix A. |
|
*> \endverbatim |
|
*> |
|
*> \param[in] LDA |
|
*> \verbatim |
|
*> LDA is INTEGER |
|
*> The leading dimension of the array A. LDA >= max(1,N). |
|
*> \endverbatim |
|
*> |
|
*> \param[out] W |
|
*> \verbatim |
|
*> W is COMPLEX*16 array, dimension (N) |
|
*> W contains the computed eigenvalues. |
|
*> \endverbatim |
|
*> |
|
*> \param[out] VL |
|
*> \verbatim |
|
*> VL is COMPLEX*16 array, dimension (LDVL,N) |
|
*> If JOBVL = 'V', the left eigenvectors u(j) are stored one |
|
*> after another in the columns of VL, in the same order |
|
*> as their eigenvalues. |
|
*> If JOBVL = 'N', VL is not referenced. |
|
*> u(j) = VL(:,j), the j-th column of VL. |
|
*> \endverbatim |
|
*> |
|
*> \param[in] LDVL |
|
*> \verbatim |
|
*> LDVL is INTEGER |
|
*> The leading dimension of the array VL. LDVL >= 1; if |
|
*> JOBVL = 'V', LDVL >= N. |
|
*> \endverbatim |
|
*> |
|
*> \param[out] VR |
|
*> \verbatim |
|
*> VR is COMPLEX*16 array, dimension (LDVR,N) |
|
*> If JOBVR = 'V', the right eigenvectors v(j) are stored one |
|
*> after another in the columns of VR, in the same order |
|
*> as their eigenvalues. |
|
*> If JOBVR = 'N', VR is not referenced. |
|
*> v(j) = VR(:,j), the j-th column of VR. |
|
*> \endverbatim |
|
*> |
|
*> \param[in] LDVR |
|
*> \verbatim |
|
*> LDVR is INTEGER |
|
*> The leading dimension of the array VR. LDVR >= 1; if |
|
*> JOBVR = 'V', LDVR >= N. |
|
*> \endverbatim |
|
*> |
|
*> \param[out] ILO |
|
*> \verbatim |
|
*> ILO is INTEGER |
|
*> \endverbatim |
|
*> |
|
*> \param[out] IHI |
|
*> \verbatim |
|
*> IHI is INTEGER |
|
*> ILO and IHI are integer values determined when A was |
|
*> balanced. The balanced A(i,j) = 0 if I > J and |
|
*> J = 1,...,ILO-1 or I = IHI+1,...,N. |
|
*> \endverbatim |
|
*> |
|
*> \param[out] SCALE |
|
*> \verbatim |
|
*> SCALE is DOUBLE PRECISION array, dimension (N) |
|
*> Details of the permutations and scaling factors applied |
|
*> when balancing A. If P(j) is the index of the row and column |
|
*> interchanged with row and column j, and D(j) is the scaling |
|
*> factor applied to row and column j, then |
|
*> SCALE(J) = P(J), for J = 1,...,ILO-1 |
|
*> = D(J), for J = ILO,...,IHI |
|
*> = P(J) for J = IHI+1,...,N. |
|
*> The order in which the interchanges are made is N to IHI+1, |
|
*> then 1 to ILO-1. |
|
*> \endverbatim |
|
*> |
|
*> \param[out] ABNRM |
|
*> \verbatim |
|
*> ABNRM is DOUBLE PRECISION |
|
*> The one-norm of the balanced matrix (the maximum |
|
*> of the sum of absolute values of elements of any column). |
|
*> \endverbatim |
|
*> |
|
*> \param[out] RCONDE |
|
*> \verbatim |
|
*> RCONDE is DOUBLE PRECISION array, dimension (N) |
|
*> RCONDE(j) is the reciprocal condition number of the j-th |
|
*> eigenvalue. |
|
*> \endverbatim |
|
*> |
|
*> \param[out] RCONDV |
|
*> \verbatim |
|
*> RCONDV is DOUBLE PRECISION array, dimension (N) |
|
*> RCONDV(j) is the reciprocal condition number of the j-th |
|
*> right eigenvector. |
|
*> \endverbatim |
|
*> |
|
*> \param[out] WORK |
|
*> \verbatim |
|
*> WORK is COMPLEX*16 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 dimension of the array WORK. If SENSE = 'N' or 'E', |
|
*> LWORK >= max(1,2*N), and if SENSE = 'V' or 'B', |
|
*> LWORK >= N*N+2*N. |
|
*> For good performance, LWORK must generally be larger. |
|
*> |
|
*> If LWORK = -1, then a workspace query is assumed; the routine |
|
*> only calculates the optimal size of the WORK array, returns |
|
*> this value as the first entry of the WORK array, and no error |
|
*> message related to LWORK is issued by XERBLA. |
|
*> \endverbatim |
|
*> |
|
*> \param[out] RWORK |
|
*> \verbatim |
|
*> RWORK is DOUBLE PRECISION array, dimension (2*N) |
|
*> \endverbatim |
|
*> |
|
*> \param[out] INFO |
|
*> \verbatim |
|
*> INFO is INTEGER |
|
*> = 0: successful exit |
|
*> < 0: if INFO = -i, the i-th argument had an illegal value. |
|
*> > 0: if INFO = i, the QR algorithm failed to compute all the |
|
*> eigenvalues, and no eigenvectors or condition numbers |
|
*> have been computed; elements 1:ILO-1 and i+1:N of W |
|
*> contain eigenvalues which have converged. |
|
*> \endverbatim |
|
* |
|
* Authors: |
|
* ======== |
|
* |
|
*> \author Univ. of Tennessee |
|
*> \author Univ. of California Berkeley |
|
*> \author Univ. of Colorado Denver |
|
*> \author NAG Ltd. |
|
* |
|
*> \date June 2016 |
|
* |
|
* @precisions fortran z -> c |
|
* |
|
*> \ingroup complex16GEeigen |
|
* |
|
* ===================================================================== |
SUBROUTINE ZGEEVX( BALANC, JOBVL, JOBVR, SENSE, N, A, LDA, W, VL, |
SUBROUTINE ZGEEVX( BALANC, JOBVL, JOBVR, SENSE, N, A, LDA, W, VL, |
$ LDVL, VR, LDVR, ILO, IHI, SCALE, ABNRM, RCONDE, |
$ LDVL, VR, LDVR, ILO, IHI, SCALE, ABNRM, RCONDE, |
$ RCONDV, WORK, LWORK, RWORK, INFO ) |
$ RCONDV, WORK, LWORK, RWORK, INFO ) |
|
implicit none |
* |
* |
* -- LAPACK driver routine (version 3.2) -- |
* -- LAPACK driver routine (version 3.7.0) -- |
* -- LAPACK is a software package provided by Univ. of Tennessee, -- |
* -- LAPACK is a software package provided by Univ. of Tennessee, -- |
* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- |
* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- |
* November 2006 |
* June 2016 |
* |
* |
* .. Scalar Arguments .. |
* .. Scalar Arguments .. |
CHARACTER BALANC, JOBVL, JOBVR, SENSE |
CHARACTER BALANC, JOBVL, JOBVR, SENSE |
Line 19
|
Line 305
|
$ W( * ), WORK( * ) |
$ W( * ), WORK( * ) |
* .. |
* .. |
* |
* |
* Purpose |
|
* ======= |
|
* |
|
* ZGEEVX computes for an N-by-N complex nonsymmetric matrix A, the |
|
* eigenvalues and, optionally, the left and/or right eigenvectors. |
|
* |
|
* Optionally also, it computes a balancing transformation to improve |
|
* the conditioning of the eigenvalues and eigenvectors (ILO, IHI, |
|
* SCALE, and ABNRM), reciprocal condition numbers for the eigenvalues |
|
* (RCONDE), and reciprocal condition numbers for the right |
|
* eigenvectors (RCONDV). |
|
* |
|
* The right eigenvector v(j) of A satisfies |
|
* A * v(j) = lambda(j) * v(j) |
|
* where lambda(j) is its eigenvalue. |
|
* The left eigenvector u(j) of A satisfies |
|
* u(j)**H * A = lambda(j) * u(j)**H |
|
* where u(j)**H denotes the conjugate transpose of u(j). |
|
* |
|
* The computed eigenvectors are normalized to have Euclidean norm |
|
* equal to 1 and largest component real. |
|
* |
|
* Balancing a matrix means permuting the rows and columns to make it |
|
* more nearly upper triangular, and applying a diagonal similarity |
|
* transformation D * A * D**(-1), where D is a diagonal matrix, to |
|
* make its rows and columns closer in norm and the condition numbers |
|
* of its eigenvalues and eigenvectors smaller. The computed |
|
* reciprocal condition numbers correspond to the balanced matrix. |
|
* Permuting rows and columns will not change the condition numbers |
|
* (in exact arithmetic) but diagonal scaling will. For further |
|
* explanation of balancing, see section 4.10.2 of the LAPACK |
|
* Users' Guide. |
|
* |
|
* Arguments |
|
* ========= |
|
* |
|
* BALANC (input) CHARACTER*1 |
|
* Indicates how the input matrix should be diagonally scaled |
|
* and/or permuted to improve the conditioning of its |
|
* eigenvalues. |
|
* = 'N': Do not diagonally scale or permute; |
|
* = 'P': Perform permutations to make the matrix more nearly |
|
* upper triangular. Do not diagonally scale; |
|
* = 'S': Diagonally scale the matrix, ie. replace A by |
|
* D*A*D**(-1), where D is a diagonal matrix chosen |
|
* to make the rows and columns of A more equal in |
|
* norm. Do not permute; |
|
* = 'B': Both diagonally scale and permute A. |
|
* |
|
* Computed reciprocal condition numbers will be for the matrix |
|
* after balancing and/or permuting. Permuting does not change |
|
* condition numbers (in exact arithmetic), but balancing does. |
|
* |
|
* JOBVL (input) CHARACTER*1 |
|
* = 'N': left eigenvectors of A are not computed; |
|
* = 'V': left eigenvectors of A are computed. |
|
* If SENSE = 'E' or 'B', JOBVL must = 'V'. |
|
* |
|
* JOBVR (input) CHARACTER*1 |
|
* = 'N': right eigenvectors of A are not computed; |
|
* = 'V': right eigenvectors of A are computed. |
|
* If SENSE = 'E' or 'B', JOBVR must = 'V'. |
|
* |
|
* SENSE (input) CHARACTER*1 |
|
* Determines which reciprocal condition numbers are computed. |
|
* = 'N': None are computed; |
|
* = 'E': Computed for eigenvalues only; |
|
* = 'V': Computed for right eigenvectors only; |
|
* = 'B': Computed for eigenvalues and right eigenvectors. |
|
* |
|
* If SENSE = 'E' or 'B', both left and right eigenvectors |
|
* must also be computed (JOBVL = 'V' and JOBVR = 'V'). |
|
* |
|
* N (input) INTEGER |
|
* The order of the matrix A. N >= 0. |
|
* |
|
* A (input/output) COMPLEX*16 array, dimension (LDA,N) |
|
* On entry, the N-by-N matrix A. |
|
* On exit, A has been overwritten. If JOBVL = 'V' or |
|
* JOBVR = 'V', A contains the Schur form of the balanced |
|
* version of the matrix A. |
|
* |
|
* LDA (input) INTEGER |
|
* The leading dimension of the array A. LDA >= max(1,N). |
|
* |
|
* W (output) COMPLEX*16 array, dimension (N) |
|
* W contains the computed eigenvalues. |
|
* |
|
* VL (output) COMPLEX*16 array, dimension (LDVL,N) |
|
* If JOBVL = 'V', the left eigenvectors u(j) are stored one |
|
* after another in the columns of VL, in the same order |
|
* as their eigenvalues. |
|
* If JOBVL = 'N', VL is not referenced. |
|
* u(j) = VL(:,j), the j-th column of VL. |
|
* |
|
* LDVL (input) INTEGER |
|
* The leading dimension of the array VL. LDVL >= 1; if |
|
* JOBVL = 'V', LDVL >= N. |
|
* |
|
* VR (output) COMPLEX*16 array, dimension (LDVR,N) |
|
* If JOBVR = 'V', the right eigenvectors v(j) are stored one |
|
* after another in the columns of VR, in the same order |
|
* as their eigenvalues. |
|
* If JOBVR = 'N', VR is not referenced. |
|
* v(j) = VR(:,j), the j-th column of VR. |
|
* |
|
* LDVR (input) INTEGER |
|
* The leading dimension of the array VR. LDVR >= 1; if |
|
* JOBVR = 'V', LDVR >= N. |
|
* |
|
* ILO (output) INTEGER |
|
* IHI (output) INTEGER |
|
* ILO and IHI are integer values determined when A was |
|
* balanced. The balanced A(i,j) = 0 if I > J and |
|
* J = 1,...,ILO-1 or I = IHI+1,...,N. |
|
* |
|
* SCALE (output) DOUBLE PRECISION array, dimension (N) |
|
* Details of the permutations and scaling factors applied |
|
* when balancing A. If P(j) is the index of the row and column |
|
* interchanged with row and column j, and D(j) is the scaling |
|
* factor applied to row and column j, then |
|
* SCALE(J) = P(J), for J = 1,...,ILO-1 |
|
* = D(J), for J = ILO,...,IHI |
|
* = P(J) for J = IHI+1,...,N. |
|
* The order in which the interchanges are made is N to IHI+1, |
|
* then 1 to ILO-1. |
|
* |
|
* ABNRM (output) DOUBLE PRECISION |
|
* The one-norm of the balanced matrix (the maximum |
|
* of the sum of absolute values of elements of any column). |
|
* |
|
* RCONDE (output) DOUBLE PRECISION array, dimension (N) |
|
* RCONDE(j) is the reciprocal condition number of the j-th |
|
* eigenvalue. |
|
* |
|
* RCONDV (output) DOUBLE PRECISION array, dimension (N) |
|
* RCONDV(j) is the reciprocal condition number of the j-th |
|
* right eigenvector. |
|
* |
|
* WORK (workspace/output) COMPLEX*16 array, dimension (MAX(1,LWORK)) |
|
* On exit, if INFO = 0, WORK(1) returns the optimal LWORK. |
|
* |
|
* LWORK (input) INTEGER |
|
* The dimension of the array WORK. If SENSE = 'N' or 'E', |
|
* LWORK >= max(1,2*N), and if SENSE = 'V' or 'B', |
|
* LWORK >= N*N+2*N. |
|
* For good performance, LWORK must generally be larger. |
|
* |
|
* If LWORK = -1, then a workspace query is assumed; the routine |
|
* only calculates the optimal size of the WORK array, returns |
|
* this value as the first entry of the WORK array, and no error |
|
* message related to LWORK is issued by XERBLA. |
|
* |
|
* RWORK (workspace) DOUBLE PRECISION array, dimension (2*N) |
|
* |
|
* INFO (output) INTEGER |
|
* = 0: successful exit |
|
* < 0: if INFO = -i, the i-th argument had an illegal value. |
|
* > 0: if INFO = i, the QR algorithm failed to compute all the |
|
* eigenvalues, and no eigenvectors or condition numbers |
|
* have been computed; elements 1:ILO-1 and i+1:N of W |
|
* contain eigenvalues which have converged. |
|
* |
|
* ===================================================================== |
* ===================================================================== |
* |
* |
* .. Parameters .. |
* .. Parameters .. |
Line 192
|
Line 315
|
LOGICAL LQUERY, SCALEA, WANTVL, WANTVR, WNTSNB, WNTSNE, |
LOGICAL LQUERY, SCALEA, WANTVL, WANTVR, WNTSNB, WNTSNE, |
$ WNTSNN, WNTSNV |
$ WNTSNN, WNTSNV |
CHARACTER JOB, SIDE |
CHARACTER JOB, SIDE |
INTEGER HSWORK, I, ICOND, IERR, ITAU, IWRK, K, MAXWRK, |
INTEGER HSWORK, I, ICOND, IERR, ITAU, IWRK, K, |
$ MINWRK, NOUT |
$ LWORK_TREVC, MAXWRK, MINWRK, NOUT |
DOUBLE PRECISION ANRM, BIGNUM, CSCALE, EPS, SCL, SMLNUM |
DOUBLE PRECISION ANRM, BIGNUM, CSCALE, EPS, SCL, SMLNUM |
COMPLEX*16 TMP |
COMPLEX*16 TMP |
* .. |
* .. |
Line 203
|
Line 326
|
* .. |
* .. |
* .. External Subroutines .. |
* .. External Subroutines .. |
EXTERNAL DLABAD, DLASCL, XERBLA, ZDSCAL, ZGEBAK, ZGEBAL, |
EXTERNAL DLABAD, DLASCL, XERBLA, ZDSCAL, ZGEBAK, ZGEBAL, |
$ ZGEHRD, ZHSEQR, ZLACPY, ZLASCL, ZSCAL, ZTREVC, |
$ ZGEHRD, ZHSEQR, ZLACPY, ZLASCL, ZSCAL, ZTREVC3, |
$ ZTRSNA, ZUNGHR |
$ ZTRSNA, ZUNGHR |
* .. |
* .. |
* .. External Functions .. |
* .. External Functions .. |
Line 213
|
Line 336
|
EXTERNAL LSAME, IDAMAX, ILAENV, DLAMCH, DZNRM2, ZLANGE |
EXTERNAL LSAME, IDAMAX, ILAENV, DLAMCH, DZNRM2, ZLANGE |
* .. |
* .. |
* .. Intrinsic Functions .. |
* .. Intrinsic Functions .. |
INTRINSIC DBLE, DCMPLX, DCONJG, DIMAG, MAX, SQRT |
INTRINSIC DBLE, DCMPLX, CONJG, AIMAG, MAX, SQRT |
* .. |
* .. |
* .. Executable Statements .. |
* .. Executable Statements .. |
* |
* |
Line 267
|
Line 390
|
MAXWRK = N + N*ILAENV( 1, 'ZGEHRD', ' ', N, 1, N, 0 ) |
MAXWRK = N + N*ILAENV( 1, 'ZGEHRD', ' ', N, 1, N, 0 ) |
* |
* |
IF( WANTVL ) THEN |
IF( WANTVL ) THEN |
|
CALL ZTREVC3( 'L', 'B', SELECT, N, A, LDA, |
|
$ VL, LDVL, VR, LDVR, |
|
$ N, NOUT, WORK, -1, RWORK, -1, IERR ) |
|
LWORK_TREVC = INT( WORK(1) ) |
|
MAXWRK = MAX( MAXWRK, LWORK_TREVC ) |
CALL ZHSEQR( 'S', 'V', N, 1, N, A, LDA, W, VL, LDVL, |
CALL ZHSEQR( 'S', 'V', N, 1, N, A, LDA, W, VL, LDVL, |
$ WORK, -1, INFO ) |
$ WORK, -1, INFO ) |
ELSE IF( WANTVR ) THEN |
ELSE IF( WANTVR ) THEN |
|
CALL ZTREVC3( 'R', 'B', SELECT, N, A, LDA, |
|
$ VL, LDVL, VR, LDVR, |
|
$ N, NOUT, WORK, -1, RWORK, -1, IERR ) |
|
LWORK_TREVC = INT( WORK(1) ) |
|
MAXWRK = MAX( MAXWRK, LWORK_TREVC ) |
CALL ZHSEQR( 'S', 'V', N, 1, N, A, LDA, W, VR, LDVR, |
CALL ZHSEQR( 'S', 'V', N, 1, N, A, LDA, W, VR, LDVR, |
$ WORK, -1, INFO ) |
$ WORK, -1, INFO ) |
ELSE |
ELSE |
Line 281
|
Line 414
|
$ WORK, -1, INFO ) |
$ WORK, -1, INFO ) |
END IF |
END IF |
END IF |
END IF |
HSWORK = WORK( 1 ) |
HSWORK = INT( WORK(1) ) |
* |
* |
IF( ( .NOT.WANTVL ) .AND. ( .NOT.WANTVR ) ) THEN |
IF( ( .NOT.WANTVL ) .AND. ( .NOT.WANTVR ) ) THEN |
MINWRK = 2*N |
MINWRK = 2*N |
Line 439
|
Line 572
|
$ WORK( IWRK ), LWORK-IWRK+1, INFO ) |
$ WORK( IWRK ), LWORK-IWRK+1, INFO ) |
END IF |
END IF |
* |
* |
* If INFO > 0 from ZHSEQR, then quit |
* If INFO .NE. 0 from ZHSEQR, then quit |
* |
* |
IF( INFO.GT.0 ) |
IF( INFO.NE.0 ) |
$ GO TO 50 |
$ GO TO 50 |
* |
* |
IF( WANTVL .OR. WANTVR ) THEN |
IF( WANTVL .OR. WANTVR ) THEN |
* |
* |
* Compute left and/or right eigenvectors |
* Compute left and/or right eigenvectors |
* (CWorkspace: need 2*N) |
* (CWorkspace: need 2*N, prefer N + 2*N*NB) |
* (RWorkspace: need N) |
* (RWorkspace: need N) |
* |
* |
CALL ZTREVC( SIDE, 'B', SELECT, N, A, LDA, VL, LDVL, VR, LDVR, |
CALL ZTREVC3( SIDE, 'B', SELECT, N, A, LDA, VL, LDVL, VR, LDVR, |
$ N, NOUT, WORK( IWRK ), RWORK, IERR ) |
$ N, NOUT, WORK( IWRK ), LWORK-IWRK+1, |
|
$ RWORK, N, IERR ) |
END IF |
END IF |
* |
* |
* Compute condition numbers if desired |
* Compute condition numbers if desired |
Line 478
|
Line 612
|
CALL ZDSCAL( N, SCL, VL( 1, I ), 1 ) |
CALL ZDSCAL( N, SCL, VL( 1, I ), 1 ) |
DO 10 K = 1, N |
DO 10 K = 1, N |
RWORK( K ) = DBLE( VL( K, I ) )**2 + |
RWORK( K ) = DBLE( VL( K, I ) )**2 + |
$ DIMAG( VL( K, I ) )**2 |
$ AIMAG( VL( K, I ) )**2 |
10 CONTINUE |
10 CONTINUE |
K = IDAMAX( N, RWORK, 1 ) |
K = IDAMAX( N, RWORK, 1 ) |
TMP = DCONJG( VL( K, I ) ) / SQRT( RWORK( K ) ) |
TMP = CONJG( VL( K, I ) ) / SQRT( RWORK( K ) ) |
CALL ZSCAL( N, TMP, VL( 1, I ), 1 ) |
CALL ZSCAL( N, TMP, VL( 1, I ), 1 ) |
VL( K, I ) = DCMPLX( DBLE( VL( K, I ) ), ZERO ) |
VL( K, I ) = DCMPLX( DBLE( VL( K, I ) ), ZERO ) |
20 CONTINUE |
20 CONTINUE |
Line 501
|
Line 635
|
CALL ZDSCAL( N, SCL, VR( 1, I ), 1 ) |
CALL ZDSCAL( N, SCL, VR( 1, I ), 1 ) |
DO 30 K = 1, N |
DO 30 K = 1, N |
RWORK( K ) = DBLE( VR( K, I ) )**2 + |
RWORK( K ) = DBLE( VR( K, I ) )**2 + |
$ DIMAG( VR( K, I ) )**2 |
$ AIMAG( VR( K, I ) )**2 |
30 CONTINUE |
30 CONTINUE |
K = IDAMAX( N, RWORK, 1 ) |
K = IDAMAX( N, RWORK, 1 ) |
TMP = DCONJG( VR( K, I ) ) / SQRT( RWORK( K ) ) |
TMP = CONJG( VR( K, I ) ) / SQRT( RWORK( K ) ) |
CALL ZSCAL( N, TMP, VR( 1, I ), 1 ) |
CALL ZSCAL( N, TMP, VR( 1, I ), 1 ) |
VR( K, I ) = DCMPLX( DBLE( VR( K, I ) ), ZERO ) |
VR( K, I ) = DCMPLX( DBLE( VR( K, I ) ), ZERO ) |
40 CONTINUE |
40 CONTINUE |