version 1.3, 2016/08/27 15:34:47
|
version 1.4, 2017/06/17 10:54:11
|
Line 1
|
Line 1
|
*> \brief \b ZGESVJ |
*> \brief <b> ZGESVJ </b> |
* |
* |
* =========== DOCUMENTATION =========== |
* =========== DOCUMENTATION =========== |
* |
* |
* Online html documentation available at |
* Online html documentation available at |
* http://www.netlib.org/lapack/explore-html/ |
* http://www.netlib.org/lapack/explore-html/ |
* |
* |
*> \htmlonly |
*> \htmlonly |
*> Download ZGESVJ + dependencies |
*> Download ZGESVJ + dependencies |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zgesvj.f"> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zgesvj.f"> |
*> [TGZ]</a> |
*> [TGZ]</a> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zgesvj.f"> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zgesvj.f"> |
*> [ZIP]</a> |
*> [ZIP]</a> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zgesvj.f"> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zgesvj.f"> |
*> [TXT]</a> |
*> [TXT]</a> |
*> \endhtmlonly |
*> \endhtmlonly |
* |
* |
* Definition: |
* Definition: |
* =========== |
* =========== |
* |
* |
* SUBROUTINE ZGESVJ( JOBA, JOBU, JOBV, M, N, A, LDA, SVA, MV, V, |
* SUBROUTINE ZGESVJ( JOBA, JOBU, JOBV, M, N, A, LDA, SVA, MV, V, |
* LDV, CWORK, LWORK, RWORK, LRWORK, INFO ) |
* LDV, CWORK, LWORK, RWORK, LRWORK, INFO ) |
* |
* |
* .. Scalar Arguments .. |
* .. Scalar Arguments .. |
* INTEGER INFO, LDA, LDV, LWORK, LRWORK, M, MV, N |
* INTEGER INFO, LDA, LDV, LWORK, LRWORK, M, MV, N |
* CHARACTER*1 JOBA, JOBU, JOBV |
* CHARACTER*1 JOBA, JOBU, JOBV |
Line 29
|
Line 29
|
* COMPLEX*16 A( LDA, * ), V( LDV, * ), CWORK( LWORK ) |
* COMPLEX*16 A( LDA, * ), V( LDV, * ), CWORK( LWORK ) |
* DOUBLE PRECISION RWORK( LRWORK ), SVA( N ) |
* DOUBLE PRECISION RWORK( LRWORK ), SVA( N ) |
* .. |
* .. |
* |
* |
* |
* |
*> \par Purpose: |
*> \par Purpose: |
* ============= |
* ============= |
Line 64
|
Line 64
|
*> JOBU is CHARACTER*1 |
*> JOBU is CHARACTER*1 |
*> Specifies whether to compute the left singular vectors |
*> Specifies whether to compute the left singular vectors |
*> (columns of U): |
*> (columns of U): |
*> = 'U': The left singular vectors corresponding to the nonzero |
*> = 'U' or 'F': The left singular vectors corresponding to the nonzero |
*> singular values are computed and returned in the leading |
*> singular values are computed and returned in the leading |
*> columns of A. See more details in the description of A. |
*> columns of A. See more details in the description of A. |
*> The default numerical orthogonality threshold is set to |
*> The default numerical orthogonality threshold is set to |
*> approximately TOL=CTOL*EPS, CTOL=DSQRT(M), EPS=DLAMCH('E'). |
*> approximately TOL=CTOL*EPS, CTOL=SQRT(M), EPS=DLAMCH('E'). |
*> = 'C': Analogous to JOBU='U', except that user can control the |
*> = 'C': Analogous to JOBU='U', except that user can control the |
*> level of numerical orthogonality of the computed left |
*> level of numerical orthogonality of the computed left |
*> singular vectors. TOL can be set to TOL = CTOL*EPS, where |
*> singular vectors. TOL can be set to TOL = CTOL*EPS, where |
Line 88
|
Line 88
|
*> JOBV is CHARACTER*1 |
*> JOBV is CHARACTER*1 |
*> Specifies whether to compute the right singular vectors, that |
*> Specifies whether to compute the right singular vectors, that |
*> is, the matrix V: |
*> is, the matrix V: |
*> = 'V' : the matrix V is computed and returned in the array V |
*> = 'V' or 'J': the matrix V is computed and returned in the array V |
*> = 'A' : the Jacobi rotations are applied to the MV-by-N |
*> = 'A' : the Jacobi rotations are applied to the MV-by-N |
*> array V. In other words, the right singular vector |
*> array V. In other words, the right singular vector |
*> matrix V is not computed explicitly, instead it is |
*> matrix V is not computed explicitly; instead it is |
*> applied to an MV-by-N matrix initially stored in the |
*> applied to an MV-by-N matrix initially stored in the |
*> first MV rows of V. |
*> first MV rows of V. |
*> = 'N' : the matrix V is not computed and the array V is not |
*> = 'N' : the matrix V is not computed and the array V is not |
Line 101
|
Line 101
|
*> \param[in] M |
*> \param[in] M |
*> \verbatim |
*> \verbatim |
*> M is INTEGER |
*> M is INTEGER |
*> The number of rows of the input matrix A. 1/DLAMCH('E') > M >= 0. |
*> The number of rows of the input matrix A. 1/DLAMCH('E') > M >= 0. |
*> \endverbatim |
*> \endverbatim |
*> |
*> |
*> \param[in] N |
*> \param[in] N |
Line 206
|
Line 206
|
*> |
*> |
*> \param[in,out] CWORK |
*> \param[in,out] CWORK |
*> \verbatim |
*> \verbatim |
*> CWORK is COMPLEX*16 array, dimension M+N. |
*> CWORK is COMPLEX*16 array, dimension max(1,LWORK). |
*> Used as work space. |
*> Used as workspace. |
|
*> If on entry LWORK .EQ. -1, then a workspace query is assumed and |
|
*> no computation is done; CWORK(1) is set to the minial (and optimal) |
|
*> length of CWORK. |
*> \endverbatim |
*> \endverbatim |
*> |
*> |
*> \param[in] LWORK |
*> \param[in] LWORK |
Line 218
|
Line 221
|
*> |
*> |
*> \param[in,out] RWORK |
*> \param[in,out] RWORK |
*> \verbatim |
*> \verbatim |
*> RWORK is DOUBLE PRECISION array, dimension max(6,M+N). |
*> RWORK is DOUBLE PRECISION array, dimension max(6,LRWORK). |
*> On entry, |
*> On entry, |
*> If JOBU .EQ. 'C' : |
*> If JOBU .EQ. 'C' : |
*> RWORK(1) = CTOL, where CTOL defines the threshold for convergence. |
*> RWORK(1) = CTOL, where CTOL defines the threshold for convergence. |
Line 244
|
Line 247
|
*> RWORK(6) = the largest absolute value over all sines of the |
*> RWORK(6) = the largest absolute value over all sines of the |
*> Jacobi rotation angles in the last sweep. It can be |
*> Jacobi rotation angles in the last sweep. It can be |
*> useful for a post festum analysis. |
*> useful for a post festum analysis. |
|
*> If on entry LRWORK .EQ. -1, then a workspace query is assumed and |
|
*> no computation is done; RWORK(1) is set to the minial (and optimal) |
|
*> length of RWORK. |
*> \endverbatim |
*> \endverbatim |
*> |
*> |
*> \param[in] LRWORK |
*> \param[in] LRWORK |
*> \verbatim |
*> \verbatim |
*> LRWORK is INTEGER |
*> LRWORK is INTEGER |
*> Length of RWORK, LRWORK >= MAX(6,N). |
*> Length of RWORK, LRWORK >= MAX(6,N). |
*> \endverbatim |
*> \endverbatim |
*> |
*> |
Line 257
|
Line 263
|
*> INFO is INTEGER |
*> INFO is INTEGER |
*> = 0 : successful exit. |
*> = 0 : successful exit. |
*> < 0 : if INFO = -i, then the i-th argument had an illegal value |
*> < 0 : if INFO = -i, then the i-th argument had an illegal value |
*> > 0 : ZGESVJ did not converge in the maximal allowed number |
*> > 0 : ZGESVJ did not converge in the maximal allowed number |
*> (NSWEEP=30) of sweeps. The output may still be useful. |
*> (NSWEEP=30) of sweeps. The output may still be useful. |
*> See the description of RWORK. |
*> See the description of RWORK. |
*> \endverbatim |
*> \endverbatim |
*> |
*> |
* Authors: |
* Authors: |
* ======== |
* ======== |
* |
* |
*> \author Univ. of Tennessee |
*> \author Univ. of Tennessee |
*> \author Univ. of California Berkeley |
*> \author Univ. of California Berkeley |
*> \author Univ. of Colorado Denver |
*> \author Univ. of Colorado Denver |
*> \author NAG Ltd. |
*> \author NAG Ltd. |
* |
* |
*> \date June 2016 |
*> \date June 2016 |
* |
* |
*> \ingroup doubleGEcomputational |
*> \ingroup complex16GEcomputational |
* |
* |
*> \par Further Details: |
*> \par Further Details: |
* ===================== |
* ===================== |
Line 291
|
Line 297
|
*> procedure is achieved if used in an accelerated version of Drmac and |
*> procedure is achieved if used in an accelerated version of Drmac and |
*> Veselic [4,5], and it is the kernel routine in the SIGMA library [6]. |
*> Veselic [4,5], and it is the kernel routine in the SIGMA library [6]. |
*> Some tunning parameters (marked with [TP]) are available for the |
*> Some tunning parameters (marked with [TP]) are available for the |
*> implementer. |
*> implementer. |
*> The computational range for the nonzero singular values is the machine |
*> The computational range for the nonzero singular values is the machine |
*> number interval ( UNDERFLOW , OVERFLOW ). In extreme cases, even |
*> number interval ( UNDERFLOW , OVERFLOW ). In extreme cases, even |
*> denormalized singular values can be computed with the corresponding |
*> denormalized singular values can be computed with the corresponding |
*> gradual loss of accurate digits. |
*> gradual loss of accurate digits. |
*> \endverbatim |
*> \endverbatim |
* |
* |
*> \par Contributors: |
*> \par Contributor: |
* ================== |
* ================== |
*> |
*> |
*> \verbatim |
*> \verbatim |
*> |
*> |
*> ============ |
*> ============ |
*> |
*> |
*> Zlatko Drmac (Zagreb, Croatia) and Kresimir Veselic (Hagen, Germany) |
*> Zlatko Drmac (Zagreb, Croatia) |
|
*> |
*> \endverbatim |
*> \endverbatim |
* |
* |
*> \par References: |
*> \par References: |
* ================ |
* ================ |
*> |
*> |
*> [1] P. P. M. De Rijk: A one-sided Jacobi algorithm for computing the |
*> [1] P. P. M. De Rijk: A one-sided Jacobi algorithm for computing the |
*> singular value decomposition on a vector computer. |
*> singular value decomposition on a vector computer. |
*> SIAM J. Sci. Stat. Comp., Vol. 10 (1998), pp. 359-371. |
*> SIAM J. Sci. Stat. Comp., Vol. 10 (1998), pp. 359-371. |
*> [2] J. Demmel and K. Veselic: Jacobi method is more accurate than QR. |
*> [2] J. Demmel and K. Veselic: Jacobi method is more accurate than QR. |
*> [3] Z. Drmac: Implementation of Jacobi rotations for accurate singular |
*> [3] Z. Drmac: Implementation of Jacobi rotations for accurate singular |
*> value computation in floating point arithmetic. |
*> value computation in floating point arithmetic. |
Line 329
|
Line 336
|
*> Department of Mathematics, University of Zagreb, 2008, 2015. |
*> Department of Mathematics, University of Zagreb, 2008, 2015. |
*> \endverbatim |
*> \endverbatim |
* |
* |
*> \par Bugs, examples and comments: |
*> \par Bugs, examples and comments: |
* ================================= |
* ================================= |
*> |
*> |
*> \verbatim |
*> \verbatim |
*> =========================== |
*> =========================== |
Line 339
|
Line 346
|
*> \endverbatim |
*> \endverbatim |
*> |
*> |
* ===================================================================== |
* ===================================================================== |
SUBROUTINE ZGESVJ( JOBA, JOBU, JOBV, M, N, A, LDA, SVA, MV, V, |
SUBROUTINE ZGESVJ( JOBA, JOBU, JOBV, M, N, A, LDA, SVA, MV, V, |
$ LDV, CWORK, LWORK, RWORK, LRWORK, INFO ) |
$ LDV, CWORK, LWORK, RWORK, LRWORK, INFO ) |
* |
* |
* -- LAPACK computational routine (version 3.6.1) -- |
* -- LAPACK computational 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..-- |
* June 2016 |
* June 2016 |
* |
* |
IMPLICIT NONE |
IMPLICIT NONE |
* .. Scalar Arguments .. |
* .. Scalar Arguments .. |
INTEGER INFO, LDA, LDV, LWORK, LRWORK, M, MV, N |
INTEGER INFO, LDA, LDV, LWORK, LRWORK, M, MV, N |
CHARACTER*1 JOBA, JOBU, JOBV |
CHARACTER*1 JOBA, JOBU, JOBV |
Line 369
|
Line 376
|
* .. |
* .. |
* .. Local Scalars .. |
* .. Local Scalars .. |
COMPLEX*16 AAPQ, OMPQ |
COMPLEX*16 AAPQ, OMPQ |
DOUBLE PRECISION AAPP, AAPP0, AAPQ1, AAQQ, APOAQ, AQOAP, BIG, |
DOUBLE PRECISION AAPP, AAPP0, AAPQ1, AAQQ, APOAQ, AQOAP, BIG, |
$ BIGTHETA, CS, CTOL, EPSLN, LARGE, MXAAPQ, |
$ BIGTHETA, CS, CTOL, EPSLN, MXAAPQ, |
$ MXSINJ, ROOTBIG, ROOTEPS, ROOTSFMIN, ROOTTOL, |
$ MXSINJ, ROOTBIG, ROOTEPS, ROOTSFMIN, ROOTTOL, |
$ SKL, SFMIN, SMALL, SN, T, TEMP1, THETA, THSIGN, TOL |
$ SKL, SFMIN, SMALL, SN, T, TEMP1, THETA, THSIGN, TOL |
INTEGER BLSKIP, EMPTSW, i, ibr, IERR, igl, IJBLSK, ir1, |
INTEGER BLSKIP, EMPTSW, i, ibr, IERR, igl, IJBLSK, ir1, |
$ ISWROT, jbc, jgl, KBL, LKAHEAD, MVL, N2, N34, |
$ ISWROT, jbc, jgl, KBL, LKAHEAD, MVL, N2, N34, |
$ N4, NBL, NOTROT, p, PSKIPPED, q, ROWSKIP, SWBAND |
$ N4, NBL, NOTROT, p, PSKIPPED, q, ROWSKIP, SWBAND |
LOGICAL APPLV, GOSCALE, LOWER, LSVEC, NOSCALE, ROTOK, |
LOGICAL APPLV, GOSCALE, LOWER, LQUERY, LSVEC, NOSCALE, ROTOK, |
$ RSVEC, UCTOL, UPPER |
$ RSVEC, UCTOL, UPPER |
* .. |
* .. |
* .. |
* .. |
* .. Intrinsic Functions .. |
* .. Intrinsic Functions .. |
INTRINSIC ABS, DMAX1, DMIN1, DCONJG, DBLE, MIN0, MAX0, |
INTRINSIC ABS, MAX, MIN, CONJG, DBLE, SIGN, SQRT |
$ DSIGN, DSQRT |
|
* .. |
* .. |
* .. External Functions .. |
* .. External Functions .. |
* .. |
* .. |
Line 410
|
Line 416
|
* |
* |
* Test the input arguments |
* Test the input arguments |
* |
* |
LSVEC = LSAME( JOBU, 'U' ) |
LSVEC = LSAME( JOBU, 'U' ) .OR. LSAME( JOBU, 'F' ) |
UCTOL = LSAME( JOBU, 'C' ) |
UCTOL = LSAME( JOBU, 'C' ) |
RSVEC = LSAME( JOBV, 'V' ) |
RSVEC = LSAME( JOBV, 'V' ) .OR. LSAME( JOBV, 'J' ) |
APPLV = LSAME( JOBV, 'A' ) |
APPLV = LSAME( JOBV, 'A' ) |
UPPER = LSAME( JOBA, 'U' ) |
UPPER = LSAME( JOBA, 'U' ) |
LOWER = LSAME( JOBA, 'L' ) |
LOWER = LSAME( JOBA, 'L' ) |
* |
* |
|
LQUERY = ( LWORK .EQ. -1 ) .OR. ( LRWORK .EQ. -1 ) |
IF( .NOT.( UPPER .OR. LOWER .OR. LSAME( JOBA, 'G' ) ) ) THEN |
IF( .NOT.( UPPER .OR. LOWER .OR. LSAME( JOBA, 'G' ) ) ) THEN |
INFO = -1 |
INFO = -1 |
ELSE IF( .NOT.( LSVEC .OR. UCTOL .OR. LSAME( JOBU, 'N' ) ) ) THEN |
ELSE IF( .NOT.( LSVEC .OR. UCTOL .OR. LSAME( JOBU, 'N' ) ) ) THEN |
Line 436
|
Line 443
|
INFO = -11 |
INFO = -11 |
ELSE IF( UCTOL .AND. ( RWORK( 1 ).LE.ONE ) ) THEN |
ELSE IF( UCTOL .AND. ( RWORK( 1 ).LE.ONE ) ) THEN |
INFO = -12 |
INFO = -12 |
ELSE IF( LWORK.LT.( M+N ) ) THEN |
ELSE IF( ( LWORK.LT.( M+N ) ) .AND. ( .NOT.LQUERY ) ) THEN |
INFO = -13 |
INFO = -13 |
ELSE IF( LRWORK.LT.MAX0( N, 6 ) ) THEN |
ELSE IF( ( LRWORK.LT.MAX( N, 6 ) ) .AND. ( .NOT.LQUERY ) ) THEN |
INFO = -15 |
INFO = -15 |
ELSE |
ELSE |
INFO = 0 |
INFO = 0 |
END IF |
END IF |
Line 448
|
Line 455
|
IF( INFO.NE.0 ) THEN |
IF( INFO.NE.0 ) THEN |
CALL XERBLA( 'ZGESVJ', -INFO ) |
CALL XERBLA( 'ZGESVJ', -INFO ) |
RETURN |
RETURN |
|
ELSE IF ( LQUERY ) THEN |
|
CWORK(1) = M + N |
|
RWORK(1) = MAX( N, 6 ) |
|
RETURN |
END IF |
END IF |
* |
* |
* #:) Quick return for void matrix |
* #:) Quick return for void matrix |
Line 467
|
Line 478
|
ELSE |
ELSE |
* ... default |
* ... default |
IF( LSVEC .OR. RSVEC .OR. APPLV ) THEN |
IF( LSVEC .OR. RSVEC .OR. APPLV ) THEN |
CTOL = DSQRT( DBLE( M ) ) |
CTOL = SQRT( DBLE( M ) ) |
ELSE |
ELSE |
CTOL = DBLE( M ) |
CTOL = DBLE( M ) |
END IF |
END IF |
END IF |
END IF |
* ... and the machine dependent parameters are |
* ... and the machine dependent parameters are |
*[!] (Make sure that DLAMCH() works properly on the target machine.) |
*[!] (Make sure that SLAMCH() works properly on the target machine.) |
* |
* |
EPSLN = DLAMCH( 'Epsilon' ) |
EPSLN = DLAMCH( 'Epsilon' ) |
ROOTEPS = DSQRT( EPSLN ) |
ROOTEPS = SQRT( EPSLN ) |
SFMIN = DLAMCH( 'SafeMinimum' ) |
SFMIN = DLAMCH( 'SafeMinimum' ) |
ROOTSFMIN = DSQRT( SFMIN ) |
ROOTSFMIN = SQRT( SFMIN ) |
SMALL = SFMIN / EPSLN |
SMALL = SFMIN / EPSLN |
BIG = DLAMCH( 'Overflow' ) |
BIG = DLAMCH( 'Overflow' ) |
* BIG = ONE / SFMIN |
* BIG = ONE / SFMIN |
ROOTBIG = ONE / ROOTSFMIN |
ROOTBIG = ONE / ROOTSFMIN |
LARGE = BIG / DSQRT( DBLE( M*N ) ) |
* LARGE = BIG / SQRT( DBLE( M*N ) ) |
BIGTHETA = ONE / ROOTEPS |
BIGTHETA = ONE / ROOTEPS |
* |
* |
TOL = CTOL*EPSLN |
TOL = CTOL*EPSLN |
ROOTTOL = DSQRT( TOL ) |
ROOTTOL = SQRT( TOL ) |
* |
* |
IF( DBLE( M )*EPSLN.GE.ONE ) THEN |
IF( DBLE( M )*EPSLN.GE.ONE ) THEN |
INFO = -4 |
INFO = -4 |
Line 514
|
Line 525
|
* SQRT(N)*max_i SVA(i) does not overflow. If INFinite entries |
* SQRT(N)*max_i SVA(i) does not overflow. If INFinite entries |
* in A are detected, the procedure returns with INFO=-6. |
* in A are detected, the procedure returns with INFO=-6. |
* |
* |
SKL = ONE / DSQRT( DBLE( M )*DBLE( N ) ) |
SKL = ONE / SQRT( DBLE( M )*DBLE( N ) ) |
NOSCALE = .TRUE. |
NOSCALE = .TRUE. |
GOSCALE = .TRUE. |
GOSCALE = .TRUE. |
* |
* |
Line 529
|
Line 540
|
CALL XERBLA( 'ZGESVJ', -INFO ) |
CALL XERBLA( 'ZGESVJ', -INFO ) |
RETURN |
RETURN |
END IF |
END IF |
AAQQ = DSQRT( AAQQ ) |
AAQQ = SQRT( AAQQ ) |
IF( ( AAPP.LT.( BIG / AAQQ ) ) .AND. NOSCALE ) THEN |
IF( ( AAPP.LT.( BIG / AAQQ ) ) .AND. NOSCALE ) THEN |
SVA( p ) = AAPP*AAQQ |
SVA( p ) = AAPP*AAQQ |
ELSE |
ELSE |
Line 554
|
Line 565
|
CALL XERBLA( 'ZGESVJ', -INFO ) |
CALL XERBLA( 'ZGESVJ', -INFO ) |
RETURN |
RETURN |
END IF |
END IF |
AAQQ = DSQRT( AAQQ ) |
AAQQ = SQRT( AAQQ ) |
IF( ( AAPP.LT.( BIG / AAQQ ) ) .AND. NOSCALE ) THEN |
IF( ( AAPP.LT.( BIG / AAQQ ) ) .AND. NOSCALE ) THEN |
SVA( p ) = AAPP*AAQQ |
SVA( p ) = AAPP*AAQQ |
ELSE |
ELSE |
Line 579
|
Line 590
|
CALL XERBLA( 'ZGESVJ', -INFO ) |
CALL XERBLA( 'ZGESVJ', -INFO ) |
RETURN |
RETURN |
END IF |
END IF |
AAQQ = DSQRT( AAQQ ) |
AAQQ = SQRT( AAQQ ) |
IF( ( AAPP.LT.( BIG / AAQQ ) ) .AND. NOSCALE ) THEN |
IF( ( AAPP.LT.( BIG / AAQQ ) ) .AND. NOSCALE ) THEN |
SVA( p ) = AAPP*AAQQ |
SVA( p ) = AAPP*AAQQ |
ELSE |
ELSE |
Line 604
|
Line 615
|
AAPP = ZERO |
AAPP = ZERO |
AAQQ = BIG |
AAQQ = BIG |
DO 4781 p = 1, N |
DO 4781 p = 1, N |
IF( SVA( p ).NE.ZERO )AAQQ = DMIN1( AAQQ, SVA( p ) ) |
IF( SVA( p ).NE.ZERO )AAQQ = MIN( AAQQ, SVA( p ) ) |
AAPP = DMAX1( AAPP, SVA( p ) ) |
AAPP = MAX( AAPP, SVA( p ) ) |
4781 CONTINUE |
4781 CONTINUE |
* |
* |
* #:) Quick return for zero matrix |
* #:) Quick return for zero matrix |
Line 642
|
Line 653
|
* Protect small singular values from underflow, and try to |
* Protect small singular values from underflow, and try to |
* avoid underflows/overflows in computing Jacobi rotations. |
* avoid underflows/overflows in computing Jacobi rotations. |
* |
* |
SN = DSQRT( SFMIN / EPSLN ) |
SN = SQRT( SFMIN / EPSLN ) |
TEMP1 = DSQRT( BIG / DBLE( N ) ) |
TEMP1 = SQRT( BIG / DBLE( N ) ) |
IF( ( AAPP.LE.SN ) .OR. ( AAQQ.GE.TEMP1 ) .OR. |
IF( ( AAPP.LE.SN ) .OR. ( AAQQ.GE.TEMP1 ) .OR. |
$ ( ( SN.LE.AAQQ ) .AND. ( AAPP.LE.TEMP1 ) ) ) THEN |
$ ( ( SN.LE.AAQQ ) .AND. ( AAPP.LE.TEMP1 ) ) ) THEN |
TEMP1 = DMIN1( BIG, TEMP1 / AAPP ) |
TEMP1 = MIN( BIG, TEMP1 / AAPP ) |
* AAQQ = AAQQ*TEMP1 |
* AAQQ = AAQQ*TEMP1 |
* AAPP = AAPP*TEMP1 |
* AAPP = AAPP*TEMP1 |
ELSE IF( ( AAQQ.LE.SN ) .AND. ( AAPP.LE.TEMP1 ) ) THEN |
ELSE IF( ( AAQQ.LE.SN ) .AND. ( AAPP.LE.TEMP1 ) ) THEN |
TEMP1 = DMIN1( SN / AAQQ, BIG / (AAPP*DSQRT( DBLE(N)) ) ) |
TEMP1 = MIN( SN / AAQQ, BIG / (AAPP*SQRT( DBLE(N)) ) ) |
* AAQQ = AAQQ*TEMP1 |
* AAQQ = AAQQ*TEMP1 |
* AAPP = AAPP*TEMP1 |
* AAPP = AAPP*TEMP1 |
ELSE IF( ( AAQQ.GE.SN ) .AND. ( AAPP.GE.TEMP1 ) ) THEN |
ELSE IF( ( AAQQ.GE.SN ) .AND. ( AAPP.GE.TEMP1 ) ) THEN |
TEMP1 = DMAX1( SN / AAQQ, TEMP1 / AAPP ) |
TEMP1 = MAX( SN / AAQQ, TEMP1 / AAPP ) |
* AAQQ = AAQQ*TEMP1 |
* AAQQ = AAQQ*TEMP1 |
* AAPP = AAPP*TEMP1 |
* AAPP = AAPP*TEMP1 |
ELSE IF( ( AAQQ.LE.SN ) .AND. ( AAPP.GE.TEMP1 ) ) THEN |
ELSE IF( ( AAQQ.LE.SN ) .AND. ( AAPP.GE.TEMP1 ) ) THEN |
TEMP1 = DMIN1( SN / AAQQ, BIG / ( DSQRT( DBLE( N ) )*AAPP ) ) |
TEMP1 = MIN( SN / AAQQ, BIG / ( SQRT( DBLE( N ) )*AAPP ) ) |
* AAQQ = AAQQ*TEMP1 |
* AAQQ = AAQQ*TEMP1 |
* AAPP = AAPP*TEMP1 |
* AAPP = AAPP*TEMP1 |
ELSE |
ELSE |
Line 680
|
Line 691
|
* |
* |
EMPTSW = ( N*( N-1 ) ) / 2 |
EMPTSW = ( N*( N-1 ) ) / 2 |
NOTROT = 0 |
NOTROT = 0 |
|
|
DO 1868 q = 1, N |
DO 1868 q = 1, N |
CWORK( q ) = CONE |
CWORK( q ) = CONE |
1868 CONTINUE |
1868 CONTINUE |
* |
* |
* |
* |
* |
* |
Line 695
|
Line 706
|
* The boundaries are determined dynamically, based on the number of |
* The boundaries are determined dynamically, based on the number of |
* pivots above a threshold. |
* pivots above a threshold. |
* |
* |
KBL = MIN0( 8, N ) |
KBL = MIN( 8, N ) |
*[TP] KBL is a tuning parameter that defines the tile size in the |
*[TP] KBL is a tuning parameter that defines the tile size in the |
* tiling of the p-q loops of pivot pairs. In general, an optimal |
* tiling of the p-q loops of pivot pairs. In general, an optimal |
* value of KBL depends on the matrix dimensions and on the |
* value of KBL depends on the matrix dimensions and on the |
Line 707
|
Line 718
|
BLSKIP = KBL**2 |
BLSKIP = KBL**2 |
*[TP] BLKSKIP is a tuning parameter that depends on SWBAND and KBL. |
*[TP] BLKSKIP is a tuning parameter that depends on SWBAND and KBL. |
* |
* |
ROWSKIP = MIN0( 5, KBL ) |
ROWSKIP = MIN( 5, KBL ) |
*[TP] ROWSKIP is a tuning parameter. |
*[TP] ROWSKIP is a tuning parameter. |
* |
* |
LKAHEAD = 1 |
LKAHEAD = 1 |
Line 718
|
Line 729
|
* invokes cubic convergence. Big part of this cycle is done inside |
* invokes cubic convergence. Big part of this cycle is done inside |
* canonical subspaces of dimensions less than M. |
* canonical subspaces of dimensions less than M. |
* |
* |
IF( ( LOWER .OR. UPPER ) .AND. ( N.GT.MAX0( 64, 4*KBL ) ) ) THEN |
IF( ( LOWER .OR. UPPER ) .AND. ( N.GT.MAX( 64, 4*KBL ) ) ) THEN |
*[TP] The number of partition levels and the actual partition are |
*[TP] The number of partition levels and the actual partition are |
* tuning parameters. |
* tuning parameters. |
N4 = N / 4 |
N4 = N / 4 |
Line 816
|
Line 827
|
* |
* |
igl = ( ibr-1 )*KBL + 1 |
igl = ( ibr-1 )*KBL + 1 |
* |
* |
DO 1002 ir1 = 0, MIN0( LKAHEAD, NBL-ibr ) |
DO 1002 ir1 = 0, MIN( LKAHEAD, NBL-ibr ) |
* |
* |
igl = igl + ir1*KBL |
igl = igl + ir1*KBL |
* |
* |
DO 2001 p = igl, MIN0( igl+KBL-1, N-1 ) |
DO 2001 p = igl, MIN( igl+KBL-1, N-1 ) |
* |
* |
* .. de Rijk's pivoting |
* .. de Rijk's pivoting |
* |
* |
q = IDAMAX( N-p+1, SVA( p ), 1 ) + p - 1 |
q = IDAMAX( N-p+1, SVA( p ), 1 ) + p - 1 |
IF( p.NE.q ) THEN |
IF( p.NE.q ) THEN |
CALL ZSWAP( M, A( 1, p ), 1, A( 1, q ), 1 ) |
CALL ZSWAP( M, A( 1, p ), 1, A( 1, q ), 1 ) |
IF( RSVEC )CALL ZSWAP( MVL, V( 1, p ), 1, |
IF( RSVEC )CALL ZSWAP( MVL, V( 1, p ), 1, |
$ V( 1, q ), 1 ) |
$ V( 1, q ), 1 ) |
TEMP1 = SVA( p ) |
TEMP1 = SVA( p ) |
SVA( p ) = SVA( q ) |
SVA( p ) = SVA( q ) |
Line 851
|
Line 862
|
* If properly implemented SCNRM2 is available, the IF-THEN-ELSE-END IF |
* If properly implemented SCNRM2 is available, the IF-THEN-ELSE-END IF |
* below should be replaced with "AAPP = DZNRM2( M, A(1,p), 1 )". |
* below should be replaced with "AAPP = DZNRM2( M, A(1,p), 1 )". |
* |
* |
IF( ( SVA( p ).LT.ROOTBIG ) .AND. |
IF( ( SVA( p ).LT.ROOTBIG ) .AND. |
$ ( SVA( p ).GT.ROOTSFMIN ) ) THEN |
$ ( SVA( p ).GT.ROOTSFMIN ) ) THEN |
SVA( p ) = DZNRM2( M, A( 1, p ), 1 ) |
SVA( p ) = DZNRM2( M, A( 1, p ), 1 ) |
ELSE |
ELSE |
TEMP1 = ZERO |
TEMP1 = ZERO |
AAPP = ONE |
AAPP = ONE |
CALL ZLASSQ( M, A( 1, p ), 1, TEMP1, AAPP ) |
CALL ZLASSQ( M, A( 1, p ), 1, TEMP1, AAPP ) |
SVA( p ) = TEMP1*DSQRT( AAPP ) |
SVA( p ) = TEMP1*SQRT( AAPP ) |
END IF |
END IF |
AAPP = SVA( p ) |
AAPP = SVA( p ) |
ELSE |
ELSE |
Line 869
|
Line 880
|
* |
* |
PSKIPPED = 0 |
PSKIPPED = 0 |
* |
* |
DO 2002 q = p + 1, MIN0( igl+KBL-1, N ) |
DO 2002 q = p + 1, MIN( igl+KBL-1, N ) |
* |
* |
AAQQ = SVA( q ) |
AAQQ = SVA( q ) |
* |
* |
Line 879
|
Line 890
|
IF( AAQQ.GE.ONE ) THEN |
IF( AAQQ.GE.ONE ) THEN |
ROTOK = ( SMALL*AAPP ).LE.AAQQ |
ROTOK = ( SMALL*AAPP ).LE.AAQQ |
IF( AAPP.LT.( BIG / AAQQ ) ) THEN |
IF( AAPP.LT.( BIG / AAQQ ) ) THEN |
AAPQ = ( ZDOTC( M, A( 1, p ), 1, |
AAPQ = ( ZDOTC( M, A( 1, p ), 1, |
$ A( 1, q ), 1 ) / AAQQ ) / AAPP |
$ A( 1, q ), 1 ) / AAQQ ) / AAPP |
ELSE |
ELSE |
CALL ZCOPY( M, A( 1, p ), 1, |
CALL ZCOPY( M, A( 1, p ), 1, |
$ CWORK(N+1), 1 ) |
$ CWORK(N+1), 1 ) |
CALL ZLASCL( 'G', 0, 0, AAPP, ONE, |
CALL ZLASCL( 'G', 0, 0, AAPP, ONE, |
$ M, 1, CWORK(N+1), LDA, IERR ) |
$ M, 1, CWORK(N+1), LDA, IERR ) |
AAPQ = ZDOTC( M, CWORK(N+1), 1, |
AAPQ = ZDOTC( M, CWORK(N+1), 1, |
$ A( 1, q ), 1 ) / AAQQ |
$ A( 1, q ), 1 ) / AAQQ |
Line 892
|
Line 903
|
ELSE |
ELSE |
ROTOK = AAPP.LE.( AAQQ / SMALL ) |
ROTOK = AAPP.LE.( AAQQ / SMALL ) |
IF( AAPP.GT.( SMALL / AAQQ ) ) THEN |
IF( AAPP.GT.( SMALL / AAQQ ) ) THEN |
AAPQ = ( ZDOTC( M, A( 1, p ), 1, |
AAPQ = ( ZDOTC( M, A( 1, p ), 1, |
$ A( 1, q ), 1 ) / AAQQ ) / AAPP |
$ A( 1, q ), 1 ) / AAPP ) / AAQQ |
ELSE |
ELSE |
CALL ZCOPY( M, A( 1, q ), 1, |
CALL ZCOPY( M, A( 1, q ), 1, |
$ CWORK(N+1), 1 ) |
$ CWORK(N+1), 1 ) |
CALL ZLASCL( 'G', 0, 0, AAQQ, |
CALL ZLASCL( 'G', 0, 0, AAQQ, |
$ ONE, M, 1, |
$ ONE, M, 1, |
Line 905
|
Line 916
|
END IF |
END IF |
END IF |
END IF |
* |
* |
* AAPQ = AAPQ * DCONJG( CWORK(p) ) * CWORK(q) |
|
AAPQ1 = -ABS(AAPQ) |
* AAPQ = AAPQ * CONJG( CWORK(p) ) * CWORK(q) |
MXAAPQ = DMAX1( MXAAPQ, -AAPQ1 ) |
AAPQ1 = -ABS(AAPQ) |
|
MXAAPQ = MAX( MXAAPQ, -AAPQ1 ) |
* |
* |
* TO rotate or NOT to rotate, THAT is the question ... |
* TO rotate or NOT to rotate, THAT is the question ... |
* |
* |
IF( ABS( AAPQ1 ).GT.TOL ) THEN |
IF( ABS( AAPQ1 ).GT.TOL ) THEN |
|
OMPQ = AAPQ / ABS(AAPQ) |
* |
* |
* .. rotate |
* .. rotate |
*[RTD] ROTATED = ROTATED + ONE |
*[RTD] ROTATED = ROTATED + ONE |
Line 924
|
Line 937
|
* |
* |
IF( ROTOK ) THEN |
IF( ROTOK ) THEN |
* |
* |
OMPQ = AAPQ / ABS(AAPQ) |
AQOAP = AAQQ / AAPP |
AQOAP = AAQQ / AAPP |
|
APOAQ = AAPP / AAQQ |
APOAQ = AAPP / AAQQ |
THETA = -HALF*ABS( AQOAP-APOAQ )/AAPQ1 |
THETA = -HALF*ABS( AQOAP-APOAQ )/AAPQ1 |
* |
* |
IF( ABS( THETA ).GT.BIGTHETA ) THEN |
IF( ABS( THETA ).GT.BIGTHETA ) THEN |
* |
* |
T = HALF / THETA |
T = HALF / THETA |
CS = ONE |
CS = ONE |
|
|
CALL ZROT( M, A(1,p), 1, A(1,q), 1, |
CALL ZROT( M, A(1,p), 1, A(1,q), 1, |
$ CS, DCONJG(OMPQ)*T ) |
$ CS, CONJG(OMPQ)*T ) |
IF ( RSVEC ) THEN |
IF ( RSVEC ) THEN |
CALL ZROT( MVL, V(1,p), 1, |
CALL ZROT( MVL, V(1,p), 1, |
$ V(1,q), 1, CS, DCONJG(OMPQ)*T ) |
$ V(1,q), 1, CS, CONJG(OMPQ)*T ) |
END IF |
END IF |
|
|
SVA( q ) = AAQQ*DSQRT( DMAX1( ZERO, |
SVA( q ) = AAQQ*SQRT( MAX( ZERO, |
$ ONE+T*APOAQ*AAPQ1 ) ) |
$ ONE+T*APOAQ*AAPQ1 ) ) |
AAPP = AAPP*DSQRT( DMAX1( ZERO, |
AAPP = AAPP*SQRT( MAX( ZERO, |
$ ONE-T*AQOAP*AAPQ1 ) ) |
$ ONE-T*AQOAP*AAPQ1 ) ) |
MXSINJ = DMAX1( MXSINJ, ABS( T ) ) |
MXSINJ = MAX( MXSINJ, ABS( T ) ) |
* |
* |
ELSE |
ELSE |
* |
* |
* .. choose correct signum for THETA and rotate |
* .. choose correct signum for THETA and rotate |
* |
* |
THSIGN = -DSIGN( ONE, AAPQ1 ) |
THSIGN = -SIGN( ONE, AAPQ1 ) |
T = ONE / ( THETA+THSIGN* |
T = ONE / ( THETA+THSIGN* |
$ DSQRT( ONE+THETA*THETA ) ) |
$ SQRT( ONE+THETA*THETA ) ) |
CS = DSQRT( ONE / ( ONE+T*T ) ) |
CS = SQRT( ONE / ( ONE+T*T ) ) |
SN = T*CS |
SN = T*CS |
* |
* |
MXSINJ = DMAX1( MXSINJ, ABS( SN ) ) |
MXSINJ = MAX( MXSINJ, ABS( SN ) ) |
SVA( q ) = AAQQ*DSQRT( DMAX1( ZERO, |
SVA( q ) = AAQQ*SQRT( MAX( ZERO, |
$ ONE+T*APOAQ*AAPQ1 ) ) |
$ ONE+T*APOAQ*AAPQ1 ) ) |
AAPP = AAPP*DSQRT( DMAX1( ZERO, |
AAPP = AAPP*SQRT( MAX( ZERO, |
$ ONE-T*AQOAP*AAPQ1 ) ) |
$ ONE-T*AQOAP*AAPQ1 ) ) |
* |
* |
CALL ZROT( M, A(1,p), 1, A(1,q), 1, |
CALL ZROT( M, A(1,p), 1, A(1,q), 1, |
$ CS, DCONJG(OMPQ)*SN ) |
$ CS, CONJG(OMPQ)*SN ) |
IF ( RSVEC ) THEN |
IF ( RSVEC ) THEN |
CALL ZROT( MVL, V(1,p), 1, |
CALL ZROT( MVL, V(1,p), 1, |
$ V(1,q), 1, CS, DCONJG(OMPQ)*SN ) |
$ V(1,q), 1, CS, CONJG(OMPQ)*SN ) |
END IF |
END IF |
END IF |
END IF |
CWORK(p) = -CWORK(q) * OMPQ |
CWORK(p) = -CWORK(q) * OMPQ |
* |
* |
ELSE |
ELSE |
* .. have to use modified Gram-Schmidt like transformation |
* .. have to use modified Gram-Schmidt like transformation |
Line 985
|
Line 997
|
$ A( 1, q ), 1 ) |
$ A( 1, q ), 1 ) |
CALL ZLASCL( 'G', 0, 0, ONE, AAQQ, M, |
CALL ZLASCL( 'G', 0, 0, ONE, AAQQ, M, |
$ 1, A( 1, q ), LDA, IERR ) |
$ 1, A( 1, q ), LDA, IERR ) |
SVA( q ) = AAQQ*DSQRT( DMAX1( ZERO, |
SVA( q ) = AAQQ*SQRT( MAX( ZERO, |
$ ONE-AAPQ1*AAPQ1 ) ) |
$ ONE-AAPQ1*AAPQ1 ) ) |
MXSINJ = DMAX1( MXSINJ, SFMIN ) |
MXSINJ = MAX( MXSINJ, SFMIN ) |
END IF |
END IF |
* END IF ROTOK THEN ... ELSE |
* END IF ROTOK THEN ... ELSE |
* |
* |
Line 1004
|
Line 1016
|
AAQQ = ONE |
AAQQ = ONE |
CALL ZLASSQ( M, A( 1, q ), 1, T, |
CALL ZLASSQ( M, A( 1, q ), 1, T, |
$ AAQQ ) |
$ AAQQ ) |
SVA( q ) = T*DSQRT( AAQQ ) |
SVA( q ) = T*SQRT( AAQQ ) |
END IF |
END IF |
END IF |
END IF |
IF( ( AAPP / AAPP0 ).LE.ROOTEPS ) THEN |
IF( ( AAPP / AAPP0 ).LE.ROOTEPS ) THEN |
Line 1016
|
Line 1028
|
AAPP = ONE |
AAPP = ONE |
CALL ZLASSQ( M, A( 1, p ), 1, T, |
CALL ZLASSQ( M, A( 1, p ), 1, T, |
$ AAPP ) |
$ AAPP ) |
AAPP = T*DSQRT( AAPP ) |
AAPP = T*SQRT( AAPP ) |
END IF |
END IF |
SVA( p ) = AAPP |
SVA( p ) = AAPP |
END IF |
END IF |
Line 1051
|
Line 1063
|
ELSE |
ELSE |
SVA( p ) = AAPP |
SVA( p ) = AAPP |
IF( ( ir1.EQ.0 ) .AND. ( AAPP.EQ.ZERO ) ) |
IF( ( ir1.EQ.0 ) .AND. ( AAPP.EQ.ZERO ) ) |
$ NOTROT = NOTROT + MIN0( igl+KBL-1, N ) - p |
$ NOTROT = NOTROT + MIN( igl+KBL-1, N ) - p |
END IF |
END IF |
* |
* |
2001 CONTINUE |
2001 CONTINUE |
Line 1071
|
Line 1083
|
* doing the block at ( ibr, jbc ) |
* doing the block at ( ibr, jbc ) |
* |
* |
IJBLSK = 0 |
IJBLSK = 0 |
DO 2100 p = igl, MIN0( igl+KBL-1, N ) |
DO 2100 p = igl, MIN( igl+KBL-1, N ) |
* |
* |
AAPP = SVA( p ) |
AAPP = SVA( p ) |
IF( AAPP.GT.ZERO ) THEN |
IF( AAPP.GT.ZERO ) THEN |
* |
* |
PSKIPPED = 0 |
PSKIPPED = 0 |
* |
* |
DO 2200 q = jgl, MIN0( jgl+KBL-1, N ) |
DO 2200 q = jgl, MIN( jgl+KBL-1, N ) |
* |
* |
AAQQ = SVA( q ) |
AAQQ = SVA( q ) |
IF( AAQQ.GT.ZERO ) THEN |
IF( AAQQ.GT.ZERO ) THEN |
Line 1095
|
Line 1107
|
ROTOK = ( SMALL*AAQQ ).LE.AAPP |
ROTOK = ( SMALL*AAQQ ).LE.AAPP |
END IF |
END IF |
IF( AAPP.LT.( BIG / AAQQ ) ) THEN |
IF( AAPP.LT.( BIG / AAQQ ) ) THEN |
AAPQ = ( ZDOTC( M, A( 1, p ), 1, |
AAPQ = ( ZDOTC( M, A( 1, p ), 1, |
$ A( 1, q ), 1 ) / AAQQ ) / AAPP |
$ A( 1, q ), 1 ) / AAQQ ) / AAPP |
ELSE |
ELSE |
CALL ZCOPY( M, A( 1, p ), 1, |
CALL ZCOPY( M, A( 1, p ), 1, |
Line 1113
|
Line 1125
|
ROTOK = AAQQ.LE.( AAPP / SMALL ) |
ROTOK = AAQQ.LE.( AAPP / SMALL ) |
END IF |
END IF |
IF( AAPP.GT.( SMALL / AAQQ ) ) THEN |
IF( AAPP.GT.( SMALL / AAQQ ) ) THEN |
AAPQ = ( ZDOTC( M, A( 1, p ), 1, |
AAPQ = ( ZDOTC( M, A( 1, p ), 1, |
$ A( 1, q ), 1 ) / AAQQ ) / AAPP |
$ A( 1, q ), 1 ) / MAX(AAQQ,AAPP) ) |
|
$ / MIN(AAQQ,AAPP) |
ELSE |
ELSE |
CALL ZCOPY( M, A( 1, q ), 1, |
CALL ZCOPY( M, A( 1, q ), 1, |
$ CWORK(N+1), 1 ) |
$ CWORK(N+1), 1 ) |
Line 1126
|
Line 1139
|
END IF |
END IF |
END IF |
END IF |
* |
* |
* AAPQ = AAPQ * DCONJG(CWORK(p))*CWORK(q) |
|
|
* AAPQ = AAPQ * CONJG(CWORK(p))*CWORK(q) |
AAPQ1 = -ABS(AAPQ) |
AAPQ1 = -ABS(AAPQ) |
MXAAPQ = DMAX1( MXAAPQ, -AAPQ1 ) |
MXAAPQ = MAX( MXAAPQ, -AAPQ1 ) |
* |
* |
* TO rotate or NOT to rotate, THAT is the question ... |
* TO rotate or NOT to rotate, THAT is the question ... |
* |
* |
IF( ABS( AAPQ1 ).GT.TOL ) THEN |
IF( ABS( AAPQ1 ).GT.TOL ) THEN |
|
OMPQ = AAPQ / ABS(AAPQ) |
NOTROT = 0 |
NOTROT = 0 |
*[RTD] ROTATED = ROTATED + 1 |
*[RTD] ROTATED = ROTATED + 1 |
PSKIPPED = 0 |
PSKIPPED = 0 |
Line 1140
|
Line 1155
|
* |
* |
IF( ROTOK ) THEN |
IF( ROTOK ) THEN |
* |
* |
OMPQ = AAPQ / ABS(AAPQ) |
|
AQOAP = AAQQ / AAPP |
AQOAP = AAQQ / AAPP |
APOAQ = AAPP / AAQQ |
APOAQ = AAPP / AAQQ |
THETA = -HALF*ABS( AQOAP-APOAQ )/ AAPQ1 |
THETA = -HALF*ABS( AQOAP-APOAQ )/ AAPQ1 |
Line 1148
|
Line 1162
|
* |
* |
IF( ABS( THETA ).GT.BIGTHETA ) THEN |
IF( ABS( THETA ).GT.BIGTHETA ) THEN |
T = HALF / THETA |
T = HALF / THETA |
CS = ONE |
CS = ONE |
CALL ZROT( M, A(1,p), 1, A(1,q), 1, |
CALL ZROT( M, A(1,p), 1, A(1,q), 1, |
$ CS, DCONJG(OMPQ)*T ) |
$ CS, CONJG(OMPQ)*T ) |
IF( RSVEC ) THEN |
IF( RSVEC ) THEN |
CALL ZROT( MVL, V(1,p), 1, |
CALL ZROT( MVL, V(1,p), 1, |
$ V(1,q), 1, CS, DCONJG(OMPQ)*T ) |
$ V(1,q), 1, CS, CONJG(OMPQ)*T ) |
END IF |
END IF |
SVA( q ) = AAQQ*DSQRT( DMAX1( ZERO, |
SVA( q ) = AAQQ*SQRT( MAX( ZERO, |
$ ONE+T*APOAQ*AAPQ1 ) ) |
$ ONE+T*APOAQ*AAPQ1 ) ) |
AAPP = AAPP*DSQRT( DMAX1( ZERO, |
AAPP = AAPP*SQRT( MAX( ZERO, |
$ ONE-T*AQOAP*AAPQ1 ) ) |
$ ONE-T*AQOAP*AAPQ1 ) ) |
MXSINJ = DMAX1( MXSINJ, ABS( T ) ) |
MXSINJ = MAX( MXSINJ, ABS( T ) ) |
ELSE |
ELSE |
* |
* |
* .. choose correct signum for THETA and rotate |
* .. choose correct signum for THETA and rotate |
* |
* |
THSIGN = -DSIGN( ONE, AAPQ1 ) |
THSIGN = -SIGN( ONE, AAPQ1 ) |
IF( AAQQ.GT.AAPP0 )THSIGN = -THSIGN |
IF( AAQQ.GT.AAPP0 )THSIGN = -THSIGN |
T = ONE / ( THETA+THSIGN* |
T = ONE / ( THETA+THSIGN* |
$ DSQRT( ONE+THETA*THETA ) ) |
$ SQRT( ONE+THETA*THETA ) ) |
CS = DSQRT( ONE / ( ONE+T*T ) ) |
CS = SQRT( ONE / ( ONE+T*T ) ) |
SN = T*CS |
SN = T*CS |
MXSINJ = DMAX1( MXSINJ, ABS( SN ) ) |
MXSINJ = MAX( MXSINJ, ABS( SN ) ) |
SVA( q ) = AAQQ*DSQRT( DMAX1( ZERO, |
SVA( q ) = AAQQ*SQRT( MAX( ZERO, |
$ ONE+T*APOAQ*AAPQ1 ) ) |
$ ONE+T*APOAQ*AAPQ1 ) ) |
AAPP = AAPP*DSQRT( DMAX1( ZERO, |
AAPP = AAPP*SQRT( MAX( ZERO, |
$ ONE-T*AQOAP*AAPQ1 ) ) |
$ ONE-T*AQOAP*AAPQ1 ) ) |
* |
* |
CALL ZROT( M, A(1,p), 1, A(1,q), 1, |
CALL ZROT( M, A(1,p), 1, A(1,q), 1, |
$ CS, DCONJG(OMPQ)*SN ) |
$ CS, CONJG(OMPQ)*SN ) |
IF( RSVEC ) THEN |
IF( RSVEC ) THEN |
CALL ZROT( MVL, V(1,p), 1, |
CALL ZROT( MVL, V(1,p), 1, |
$ V(1,q), 1, CS, DCONJG(OMPQ)*SN ) |
$ V(1,q), 1, CS, CONJG(OMPQ)*SN ) |
END IF |
END IF |
END IF |
END IF |
CWORK(p) = -CWORK(q) * OMPQ |
CWORK(p) = -CWORK(q) * OMPQ |
* |
* |
ELSE |
ELSE |
* .. have to use modified Gram-Schmidt like transformation |
* .. have to use modified Gram-Schmidt like transformation |
Line 1201
|
Line 1215
|
CALL ZLASCL( 'G', 0, 0, ONE, AAQQ, |
CALL ZLASCL( 'G', 0, 0, ONE, AAQQ, |
$ M, 1, A( 1, q ), LDA, |
$ M, 1, A( 1, q ), LDA, |
$ IERR ) |
$ IERR ) |
SVA( q ) = AAQQ*DSQRT( DMAX1( ZERO, |
SVA( q ) = AAQQ*SQRT( MAX( ZERO, |
$ ONE-AAPQ1*AAPQ1 ) ) |
$ ONE-AAPQ1*AAPQ1 ) ) |
MXSINJ = DMAX1( MXSINJ, SFMIN ) |
MXSINJ = MAX( MXSINJ, SFMIN ) |
ELSE |
ELSE |
CALL ZCOPY( M, A( 1, q ), 1, |
CALL ZCOPY( M, A( 1, q ), 1, |
$ CWORK(N+1), 1 ) |
$ CWORK(N+1), 1 ) |
Line 1213
|
Line 1227
|
CALL ZLASCL( 'G', 0, 0, AAPP, ONE, |
CALL ZLASCL( 'G', 0, 0, AAPP, ONE, |
$ M, 1, A( 1, p ), LDA, |
$ M, 1, A( 1, p ), LDA, |
$ IERR ) |
$ IERR ) |
CALL ZAXPY( M, -DCONJG(AAPQ), |
CALL ZAXPY( M, -CONJG(AAPQ), |
$ CWORK(N+1), 1, A( 1, p ), 1 ) |
$ CWORK(N+1), 1, A( 1, p ), 1 ) |
CALL ZLASCL( 'G', 0, 0, ONE, AAPP, |
CALL ZLASCL( 'G', 0, 0, ONE, AAPP, |
$ M, 1, A( 1, p ), LDA, |
$ M, 1, A( 1, p ), LDA, |
$ IERR ) |
$ IERR ) |
SVA( p ) = AAPP*DSQRT( DMAX1( ZERO, |
SVA( p ) = AAPP*SQRT( MAX( ZERO, |
$ ONE-AAPQ1*AAPQ1 ) ) |
$ ONE-AAPQ1*AAPQ1 ) ) |
MXSINJ = DMAX1( MXSINJ, SFMIN ) |
MXSINJ = MAX( MXSINJ, SFMIN ) |
END IF |
END IF |
END IF |
END IF |
* END IF ROTOK THEN ... ELSE |
* END IF ROTOK THEN ... ELSE |
Line 1237
|
Line 1251
|
AAQQ = ONE |
AAQQ = ONE |
CALL ZLASSQ( M, A( 1, q ), 1, T, |
CALL ZLASSQ( M, A( 1, q ), 1, T, |
$ AAQQ ) |
$ AAQQ ) |
SVA( q ) = T*DSQRT( AAQQ ) |
SVA( q ) = T*SQRT( AAQQ ) |
END IF |
END IF |
END IF |
END IF |
IF( ( AAPP / AAPP0 )**2.LE.ROOTEPS ) THEN |
IF( ( AAPP / AAPP0 )**2.LE.ROOTEPS ) THEN |
Line 1249
|
Line 1263
|
AAPP = ONE |
AAPP = ONE |
CALL ZLASSQ( M, A( 1, p ), 1, T, |
CALL ZLASSQ( M, A( 1, p ), 1, T, |
$ AAPP ) |
$ AAPP ) |
AAPP = T*DSQRT( AAPP ) |
AAPP = T*SQRT( AAPP ) |
END IF |
END IF |
SVA( p ) = AAPP |
SVA( p ) = AAPP |
END IF |
END IF |
Line 1288
|
Line 1302
|
ELSE |
ELSE |
* |
* |
IF( AAPP.EQ.ZERO )NOTROT = NOTROT + |
IF( AAPP.EQ.ZERO )NOTROT = NOTROT + |
$ MIN0( jgl+KBL-1, N ) - jgl + 1 |
$ MIN( jgl+KBL-1, N ) - jgl + 1 |
IF( AAPP.LT.ZERO )NOTROT = 0 |
IF( AAPP.LT.ZERO )NOTROT = 0 |
* |
* |
END IF |
END IF |
Line 1299
|
Line 1313
|
* end of the jbc-loop |
* end of the jbc-loop |
2011 CONTINUE |
2011 CONTINUE |
*2011 bailed out of the jbc-loop |
*2011 bailed out of the jbc-loop |
DO 2012 p = igl, MIN0( igl+KBL-1, N ) |
DO 2012 p = igl, MIN( igl+KBL-1, N ) |
SVA( p ) = ABS( SVA( p ) ) |
SVA( p ) = ABS( SVA( p ) ) |
2012 CONTINUE |
2012 CONTINUE |
*** |
*** |
Line 1314
|
Line 1328
|
T = ZERO |
T = ZERO |
AAPP = ONE |
AAPP = ONE |
CALL ZLASSQ( M, A( 1, N ), 1, T, AAPP ) |
CALL ZLASSQ( M, A( 1, N ), 1, T, AAPP ) |
SVA( N ) = T*DSQRT( AAPP ) |
SVA( N ) = T*SQRT( AAPP ) |
END IF |
END IF |
* |
* |
* Additional steering devices |
* Additional steering devices |
Line 1322
|
Line 1336
|
IF( ( i.LT.SWBAND ) .AND. ( ( MXAAPQ.LE.ROOTTOL ) .OR. |
IF( ( i.LT.SWBAND ) .AND. ( ( MXAAPQ.LE.ROOTTOL ) .OR. |
$ ( ISWROT.LE.N ) ) )SWBAND = i |
$ ( ISWROT.LE.N ) ) )SWBAND = i |
* |
* |
IF( ( i.GT.SWBAND+1 ) .AND. ( MXAAPQ.LT.DSQRT( DBLE( N ) )* |
IF( ( i.GT.SWBAND+1 ) .AND. ( MXAAPQ.LT.SQRT( DBLE( N ) )* |
$ TOL ) .AND. ( DBLE( N )*MXAAPQ*MXSINJ.LT.TOL ) ) THEN |
$ TOL ) .AND. ( DBLE( N )*MXAAPQ*MXSINJ.LT.TOL ) ) THEN |
GO TO 1994 |
GO TO 1994 |
END IF |
END IF |
Line 1371
|
Line 1385
|
* Normalize the left singular vectors. |
* Normalize the left singular vectors. |
* |
* |
IF( LSVEC .OR. UCTOL ) THEN |
IF( LSVEC .OR. UCTOL ) THEN |
DO 1998 p = 1, N2 |
DO 1998 p = 1, N4 |
CALL ZDSCAL( M, ONE / SVA( p ), A( 1, p ), 1 ) |
* CALL ZDSCAL( M, ONE / SVA( p ), A( 1, p ), 1 ) |
|
CALL ZLASCL( 'G',0,0, SVA(p), ONE, M, 1, A(1,p), M, IERR ) |
1998 CONTINUE |
1998 CONTINUE |
END IF |
END IF |
* |
* |
Line 1386
|
Line 1401
|
END IF |
END IF |
* |
* |
* Undo scaling, if necessary (and possible). |
* Undo scaling, if necessary (and possible). |
IF( ( ( SKL.GT.ONE ) .AND. ( SVA( 1 ).LT.( BIG / SKL ) ) ) |
IF( ( ( SKL.GT.ONE ) .AND. ( SVA( 1 ).LT.( BIG / SKL ) ) ) |
$ .OR. ( ( SKL.LT.ONE ) .AND. ( SVA( MAX( N2, 1 ) ) .GT. |
$ .OR. ( ( SKL.LT.ONE ) .AND. ( SVA( MAX( N2, 1 ) ) .GT. |
$ ( SFMIN / SKL ) ) ) ) THEN |
$ ( SFMIN / SKL ) ) ) ) THEN |
DO 2400 p = 1, N |
DO 2400 p = 1, N |
SVA( P ) = SKL*SVA( P ) |
SVA( p ) = SKL*SVA( p ) |
2400 CONTINUE |
2400 CONTINUE |
SKL = ONE |
SKL = ONE |
END IF |
END IF |