3 * =========== DOCUMENTATION ===========
5 * Online html documentation available at
6 * http://www.netlib.org/lapack/explore-html/
11 * SUBROUTINE SGSVJ0( JOBV, M, N, A, LDA, D, SVA, MV, V, LDV, EPS,
12 * SFMIN, TOL, NSWEEP, WORK, LWORK, INFO )
14 * .. Scalar Arguments ..
15 * INTEGER INFO, LDA, LDV, LWORK, M, MV, N, NSWEEP
16 * REAL EPS, SFMIN, TOL
19 * .. Array Arguments ..
20 * REAL A( LDA, * ), SVA( N ), D( N ), V( LDV, * ),
27 *>\details \b Purpose:
30 *> SGSVJ0 is called from SGESVJ as a pre-processor and that is its main
31 *> purpose. It applies Jacobi rotations in the same way as SGESVJ does, but
32 *> it does not check convergence (stopping criterion). Few tuning
33 *> parameters (marked by [TP]) are available for the implementer.
37 *> SGSVJ0 is used just to enable SGESVJ to call a simplified version of
38 *> itself to work on a submatrix of the original matrix.
42 *> Zlatko Drmac (Zagreb, Croatia) and Kresimir Veselic (Hagen, Germany)
44 *> Bugs, Examples and Comments
45 *> ~~~~~~~~~~~~~~~~~~~~~~~~~~~
46 *> Please report all bugs and send interesting test examples and comments to
47 *> drmac@math.hr. Thank you.
56 *> JOBV is CHARACTER*1
57 *> Specifies whether the output from this procedure is used
58 *> to compute the matrix V:
59 *> = 'V': the product of the Jacobi rotations is accumulated
60 *> by postmulyiplying the N-by-N array V.
61 *> (See the description of V.)
62 *> = 'A': the product of the Jacobi rotations is accumulated
63 *> by postmulyiplying the MV-by-N array V.
64 *> (See the descriptions of MV and V.)
65 *> = 'N': the Jacobi rotations are not accumulated.
71 *> The number of rows of the input matrix A. M >= 0.
77 *> The number of columns of the input matrix A.
83 *> A is REAL array, dimension (LDA,N)
84 *> On entry, M-by-N matrix A, such that A*diag(D) represents
87 *> A_onexit * D_onexit represents the input matrix A*diag(D)
88 *> post-multiplied by a sequence of Jacobi rotations, where the
89 *> rotation threshold and the total number of sweeps are given in
90 *> TOL and NSWEEP, respectively.
91 *> (See the descriptions of D, TOL and NSWEEP.)
97 *> The leading dimension of the array A. LDA >= max(1,M).
102 *> D is REAL array, dimension (N)
103 *> The array D accumulates the scaling factors from the fast scaled
105 *> On entry, A*diag(D) represents the input matrix.
106 *> On exit, A_onexit*diag(D_onexit) represents the input matrix
107 *> post-multiplied by a sequence of Jacobi rotations, where the
108 *> rotation threshold and the total number of sweeps are given in
109 *> TOL and NSWEEP, respectively.
110 *> (See the descriptions of A, TOL and NSWEEP.)
113 *> \param[in,out] SVA
115 *> SVA is REAL array, dimension (N)
116 *> On entry, SVA contains the Euclidean norms of the columns of
117 *> the matrix A*diag(D).
118 *> On exit, SVA contains the Euclidean norms of the columns of
119 *> the matrix onexit*diag(D_onexit).
125 *> If JOBV .EQ. 'A', then MV rows of V are post-multipled by a
126 *> sequence of Jacobi rotations.
127 *> If JOBV = 'N', then MV is not referenced.
132 *> V is REAL array, dimension (LDV,N)
133 *> If JOBV .EQ. 'V' then N rows of V are post-multipled by a
134 *> sequence of Jacobi rotations.
135 *> If JOBV .EQ. 'A' then MV rows of V are post-multipled by a
136 *> sequence of Jacobi rotations.
137 *> If JOBV = 'N', then V is not referenced.
143 *> The leading dimension of the array V, LDV >= 1.
144 *> If JOBV = 'V', LDV .GE. N.
145 *> If JOBV = 'A', LDV .GE. MV.
151 *> EPS = SLAMCH('Epsilon')
157 *> SFMIN = SLAMCH('Safe Minimum')
163 *> TOL is the threshold for Jacobi rotations. For a pair
164 *> A(:,p), A(:,q) of pivot columns, the Jacobi rotation is
165 *> applied only if ABS(COS(angle(A(:,p),A(:,q)))) .GT. TOL.
171 *> NSWEEP is the number of sweeps of Jacobi rotations to be
177 *> WORK is REAL array, dimension LWORK.
183 *> LWORK is the dimension of WORK. LWORK .GE. M.
189 *> = 0 : successful exit.
190 *> < 0 : if INFO = -i, then the i-th argument had an illegal value
197 *> \author Univ. of Tennessee
198 *> \author Univ. of California Berkeley
199 *> \author Univ. of Colorado Denver
202 *> \date November 2011
204 *> \ingroup realOTHERcomputational
206 * =====================================================================
207 SUBROUTINE SGSVJ0( JOBV, M, N, A, LDA, D, SVA, MV, V, LDV, EPS,
208 $ SFMIN, TOL, NSWEEP, WORK, LWORK, INFO )
210 * -- LAPACK computational routine (version 1.23, October 23. 2008.) --
211 * -- LAPACK is a software package provided by Univ. of Tennessee, --
212 * -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
215 * .. Scalar Arguments ..
216 INTEGER INFO, LDA, LDV, LWORK, M, MV, N, NSWEEP
220 * .. Array Arguments ..
221 REAL A( LDA, * ), SVA( N ), D( N ), V( LDV, * ),
225 * =====================================================================
227 * .. Local Parameters ..
228 REAL ZERO, HALF, ONE, TWO
229 PARAMETER ( ZERO = 0.0E0, HALF = 0.5E0, ONE = 1.0E0,
232 * .. Local Scalars ..
233 REAL AAPP, AAPP0, AAPQ, AAQQ, APOAQ, AQOAP, BIG,
234 $ BIGTHETA, CS, MXAAPQ, MXSINJ, ROOTBIG, ROOTEPS,
235 $ ROOTSFMIN, ROOTTOL, SMALL, SN, T, TEMP1, THETA,
237 INTEGER BLSKIP, EMPTSW, i, ibr, IERR, igl, IJBLSK, ir1,
238 $ ISWROT, jbc, jgl, KBL, LKAHEAD, MVL, NBL,
239 $ NOTROT, p, PSKIPPED, q, ROWSKIP, SWBAND
240 LOGICAL APPLV, ROTOK, RSVEC
245 * .. Intrinsic Functions ..
246 INTRINSIC ABS, AMAX1, FLOAT, MIN0, SIGN, SQRT
248 * .. External Functions ..
252 EXTERNAL ISAMAX, LSAME, SDOT, SNRM2
254 * .. External Subroutines ..
255 EXTERNAL SAXPY, SCOPY, SLASCL, SLASSQ, SROTM, SSWAP
257 * .. Executable Statements ..
259 * Test the input parameters.
261 APPLV = LSAME( JOBV, 'A' )
262 RSVEC = LSAME( JOBV, 'V' )
263 IF( .NOT.( RSVEC .OR. APPLV .OR. LSAME( JOBV, 'N' ) ) ) THEN
265 ELSE IF( M.LT.0 ) THEN
267 ELSE IF( ( N.LT.0 ) .OR. ( N.GT.M ) ) THEN
269 ELSE IF( LDA.LT.M ) THEN
271 ELSE IF( ( RSVEC.OR.APPLV ) .AND. ( MV.LT.0 ) ) THEN
273 ELSE IF( ( RSVEC.AND.( LDV.LT.N ) ).OR.
274 $ ( APPLV.AND.( LDV.LT.MV ) ) ) THEN
276 ELSE IF( TOL.LE.EPS ) THEN
278 ELSE IF( NSWEEP.LT.0 ) THEN
280 ELSE IF( LWORK.LT.M ) THEN
288 CALL XERBLA( 'SGSVJ0', -INFO )
294 ELSE IF( APPLV ) THEN
297 RSVEC = RSVEC .OR. APPLV
299 ROOTEPS = SQRT( EPS )
300 ROOTSFMIN = SQRT( SFMIN )
303 ROOTBIG = ONE / ROOTSFMIN
304 BIGTHETA = ONE / ROOTEPS
305 ROOTTOL = SQRT( TOL )
307 * .. Row-cyclic Jacobi SVD algorithm with column pivoting ..
309 EMPTSW = ( N*( N-1 ) ) / 2
313 * .. Row-cyclic pivot strategy with de Rijk's pivoting ..
317 *[TP] SWBAND is a tuning parameter. It is meaningful and effective
318 * if SGESVJ is used as a computational routine in the preconditioned
319 * Jacobi SVD algorithm SGESVJ. For sweeps i=1:SWBAND the procedure
323 *[TP] KBL is a tuning parameter that defines the tile size in the
324 * tiling of the p-q loops of pivot pairs. In general, an optimal
325 * value of KBL depends on the matrix dimensions and on the
326 * parameters of the computer's memory.
329 IF( ( NBL*KBL ).NE.N )NBL = NBL + 1
331 BLSKIP = ( KBL**2 ) + 1
332 *[TP] BLKSKIP is a tuning parameter that depends on SWBAND and KBL.
334 ROWSKIP = MIN0( 5, KBL )
335 *[TP] ROWSKIP is a tuning parameter.
338 *[TP] LKAHEAD is a tuning parameter.
342 DO 1993 i = 1, NSWEEP
354 igl = ( ibr-1 )*KBL + 1
356 DO 1002 ir1 = 0, MIN0( LKAHEAD, NBL-ibr )
360 DO 2001 p = igl, MIN0( igl+KBL-1, N-1 )
362 * .. de Rijk's pivoting
363 q = ISAMAX( N-p+1, SVA( p ), 1 ) + p - 1
365 CALL SSWAP( M, A( 1, p ), 1, A( 1, q ), 1 )
366 IF( RSVEC )CALL SSWAP( MVL, V( 1, p ), 1,
378 * Column norms are periodically updated by explicit
381 * Some BLAS implementations compute SNRM2(M,A(1,p),1)
382 * as SQRT(SDOT(M,A(1,p),1,A(1,p),1)), which may result in
383 * overflow for ||A(:,p)||_2 > SQRT(overflow_threshold), and
384 * undeflow for ||A(:,p)||_2 < SQRT(underflow_threshold).
385 * Hence, SNRM2 cannot be trusted, not even in the case when
386 * the true norm is far from the under(over)flow boundaries.
387 * If properly implemented SNRM2 is available, the IF-THEN-ELSE
388 * below should read "AAPP = SNRM2( M, A(1,p), 1 ) * D(p)".
390 IF( ( SVA( p ).LT.ROOTBIG ) .AND.
391 $ ( SVA( p ).GT.ROOTSFMIN ) ) THEN
392 SVA( p ) = SNRM2( M, A( 1, p ), 1 )*D( p )
396 CALL SLASSQ( M, A( 1, p ), 1, TEMP1, AAPP )
397 SVA( p ) = TEMP1*SQRT( AAPP )*D( p )
405 IF( AAPP.GT.ZERO ) THEN
409 DO 2002 q = p + 1, MIN0( igl+KBL-1, N )
413 IF( AAQQ.GT.ZERO ) THEN
416 IF( AAQQ.GE.ONE ) THEN
417 ROTOK = ( SMALL*AAPP ).LE.AAQQ
418 IF( AAPP.LT.( BIG / AAQQ ) ) THEN
419 AAPQ = ( SDOT( M, A( 1, p ), 1, A( 1,
420 $ q ), 1 )*D( p )*D( q ) / AAQQ )
423 CALL SCOPY( M, A( 1, p ), 1, WORK, 1 )
424 CALL SLASCL( 'G', 0, 0, AAPP, D( p ),
425 $ M, 1, WORK, LDA, IERR )
426 AAPQ = SDOT( M, WORK, 1, A( 1, q ),
430 ROTOK = AAPP.LE.( AAQQ / SMALL )
431 IF( AAPP.GT.( SMALL / AAQQ ) ) THEN
432 AAPQ = ( SDOT( M, A( 1, p ), 1, A( 1,
433 $ q ), 1 )*D( p )*D( q ) / AAQQ )
436 CALL SCOPY( M, A( 1, q ), 1, WORK, 1 )
437 CALL SLASCL( 'G', 0, 0, AAQQ, D( q ),
438 $ M, 1, WORK, LDA, IERR )
439 AAPQ = SDOT( M, WORK, 1, A( 1, p ),
444 MXAAPQ = AMAX1( MXAAPQ, ABS( AAPQ ) )
446 * TO rotate or NOT to rotate, THAT is the question ...
448 IF( ABS( AAPQ ).GT.TOL ) THEN
451 * ROTATED = ROTATED + ONE
463 THETA = -HALF*ABS( AQOAP-APOAQ ) / AAPQ
465 IF( ABS( THETA ).GT.BIGTHETA ) THEN
468 FASTR( 3 ) = T*D( p ) / D( q )
469 FASTR( 4 ) = -T*D( q ) / D( p )
470 CALL SROTM( M, A( 1, p ), 1,
471 $ A( 1, q ), 1, FASTR )
472 IF( RSVEC )CALL SROTM( MVL,
476 SVA( q ) = AAQQ*SQRT( AMAX1( ZERO,
477 $ ONE+T*APOAQ*AAPQ ) )
478 AAPP = AAPP*SQRT( AMAX1( ZERO,
479 $ ONE-T*AQOAP*AAPQ ) )
480 MXSINJ = AMAX1( MXSINJ, ABS( T ) )
484 * .. choose correct signum for THETA and rotate
486 THSIGN = -SIGN( ONE, AAPQ )
487 T = ONE / ( THETA+THSIGN*
488 $ SQRT( ONE+THETA*THETA ) )
489 CS = SQRT( ONE / ( ONE+T*T ) )
492 MXSINJ = AMAX1( MXSINJ, ABS( SN ) )
493 SVA( q ) = AAQQ*SQRT( AMAX1( ZERO,
494 $ ONE+T*APOAQ*AAPQ ) )
495 AAPP = AAPP*SQRT( AMAX1( ZERO,
496 $ ONE-T*AQOAP*AAPQ ) )
498 APOAQ = D( p ) / D( q )
499 AQOAP = D( q ) / D( p )
500 IF( D( p ).GE.ONE ) THEN
501 IF( D( q ).GE.ONE ) THEN
503 FASTR( 4 ) = -T*AQOAP
506 CALL SROTM( M, A( 1, p ), 1,
509 IF( RSVEC )CALL SROTM( MVL,
510 $ V( 1, p ), 1, V( 1, q ),
513 CALL SAXPY( M, -T*AQOAP,
516 CALL SAXPY( M, CS*SN*APOAQ,
522 CALL SAXPY( MVL, -T*AQOAP,
532 IF( D( q ).GE.ONE ) THEN
533 CALL SAXPY( M, T*APOAQ,
536 CALL SAXPY( M, -CS*SN*AQOAP,
542 CALL SAXPY( MVL, T*APOAQ,
551 IF( D( p ).GE.D( q ) ) THEN
552 CALL SAXPY( M, -T*AQOAP,
555 CALL SAXPY( M, CS*SN*APOAQ,
571 CALL SAXPY( M, T*APOAQ,
582 $ T*APOAQ, V( 1, p ),
595 * .. have to use modified Gram-Schmidt like transformation
596 CALL SCOPY( M, A( 1, p ), 1, WORK, 1 )
597 CALL SLASCL( 'G', 0, 0, AAPP, ONE, M,
598 $ 1, WORK, LDA, IERR )
599 CALL SLASCL( 'G', 0, 0, AAQQ, ONE, M,
600 $ 1, A( 1, q ), LDA, IERR )
601 TEMP1 = -AAPQ*D( p ) / D( q )
602 CALL SAXPY( M, TEMP1, WORK, 1,
604 CALL SLASCL( 'G', 0, 0, ONE, AAQQ, M,
605 $ 1, A( 1, q ), LDA, IERR )
606 SVA( q ) = AAQQ*SQRT( AMAX1( ZERO,
608 MXSINJ = AMAX1( MXSINJ, SFMIN )
610 * END IF ROTOK THEN ... ELSE
612 * In the case of cancellation in updating SVA(q), SVA(p)
613 * recompute SVA(q), SVA(p).
614 IF( ( SVA( q ) / AAQQ )**2.LE.ROOTEPS )
616 IF( ( AAQQ.LT.ROOTBIG ) .AND.
617 $ ( AAQQ.GT.ROOTSFMIN ) ) THEN
618 SVA( q ) = SNRM2( M, A( 1, q ), 1 )*
623 CALL SLASSQ( M, A( 1, q ), 1, T,
625 SVA( q ) = T*SQRT( AAQQ )*D( q )
628 IF( ( AAPP / AAPP0 ).LE.ROOTEPS ) THEN
629 IF( ( AAPP.LT.ROOTBIG ) .AND.
630 $ ( AAPP.GT.ROOTSFMIN ) ) THEN
631 AAPP = SNRM2( M, A( 1, p ), 1 )*
636 CALL SLASSQ( M, A( 1, p ), 1, T,
638 AAPP = T*SQRT( AAPP )*D( p )
644 * A(:,p) and A(:,q) already numerically orthogonal
645 IF( ir1.EQ.0 )NOTROT = NOTROT + 1
646 PSKIPPED = PSKIPPED + 1
649 * A(:,q) is zero column
650 IF( ir1.EQ.0 )NOTROT = NOTROT + 1
651 PSKIPPED = PSKIPPED + 1
654 IF( ( i.LE.SWBAND ) .AND.
655 $ ( PSKIPPED.GT.ROWSKIP ) ) THEN
656 IF( ir1.EQ.0 )AAPP = -AAPP
665 * bailed out of q-loop
671 IF( ( ir1.EQ.0 ) .AND. ( AAPP.EQ.ZERO ) )
672 $ NOTROT = NOTROT + MIN0( igl+KBL-1, N ) - p
677 * end of doing the block ( ibr, ibr )
681 *........................................................
682 * ... go to the off diagonal blocks
684 igl = ( ibr-1 )*KBL + 1
686 DO 2010 jbc = ibr + 1, NBL
688 jgl = ( jbc-1 )*KBL + 1
690 * doing the block at ( ibr, jbc )
693 DO 2100 p = igl, MIN0( igl+KBL-1, N )
697 IF( AAPP.GT.ZERO ) THEN
701 DO 2200 q = jgl, MIN0( jgl+KBL-1, N )
705 IF( AAQQ.GT.ZERO ) THEN
708 * .. M x 2 Jacobi SVD ..
710 * .. Safe Gram matrix computation ..
712 IF( AAQQ.GE.ONE ) THEN
713 IF( AAPP.GE.AAQQ ) THEN
714 ROTOK = ( SMALL*AAPP ).LE.AAQQ
716 ROTOK = ( SMALL*AAQQ ).LE.AAPP
718 IF( AAPP.LT.( BIG / AAQQ ) ) THEN
719 AAPQ = ( SDOT( M, A( 1, p ), 1, A( 1,
720 $ q ), 1 )*D( p )*D( q ) / AAQQ )
723 CALL SCOPY( M, A( 1, p ), 1, WORK, 1 )
724 CALL SLASCL( 'G', 0, 0, AAPP, D( p ),
725 $ M, 1, WORK, LDA, IERR )
726 AAPQ = SDOT( M, WORK, 1, A( 1, q ),
730 IF( AAPP.GE.AAQQ ) THEN
731 ROTOK = AAPP.LE.( AAQQ / SMALL )
733 ROTOK = AAQQ.LE.( AAPP / SMALL )
735 IF( AAPP.GT.( SMALL / AAQQ ) ) THEN
736 AAPQ = ( SDOT( M, A( 1, p ), 1, A( 1,
737 $ q ), 1 )*D( p )*D( q ) / AAQQ )
740 CALL SCOPY( M, A( 1, q ), 1, WORK, 1 )
741 CALL SLASCL( 'G', 0, 0, AAQQ, D( q ),
742 $ M, 1, WORK, LDA, IERR )
743 AAPQ = SDOT( M, WORK, 1, A( 1, p ),
748 MXAAPQ = AMAX1( MXAAPQ, ABS( AAPQ ) )
750 * TO rotate or NOT to rotate, THAT is the question ...
752 IF( ABS( AAPQ ).GT.TOL ) THEN
754 * ROTATED = ROTATED + 1
762 THETA = -HALF*ABS( AQOAP-APOAQ ) / AAPQ
763 IF( AAQQ.GT.AAPP0 )THETA = -THETA
765 IF( ABS( THETA ).GT.BIGTHETA ) THEN
767 FASTR( 3 ) = T*D( p ) / D( q )
768 FASTR( 4 ) = -T*D( q ) / D( p )
769 CALL SROTM( M, A( 1, p ), 1,
770 $ A( 1, q ), 1, FASTR )
771 IF( RSVEC )CALL SROTM( MVL,
775 SVA( q ) = AAQQ*SQRT( AMAX1( ZERO,
776 $ ONE+T*APOAQ*AAPQ ) )
777 AAPP = AAPP*SQRT( AMAX1( ZERO,
778 $ ONE-T*AQOAP*AAPQ ) )
779 MXSINJ = AMAX1( MXSINJ, ABS( T ) )
782 * .. choose correct signum for THETA and rotate
784 THSIGN = -SIGN( ONE, AAPQ )
785 IF( AAQQ.GT.AAPP0 )THSIGN = -THSIGN
786 T = ONE / ( THETA+THSIGN*
787 $ SQRT( ONE+THETA*THETA ) )
788 CS = SQRT( ONE / ( ONE+T*T ) )
790 MXSINJ = AMAX1( MXSINJ, ABS( SN ) )
791 SVA( q ) = AAQQ*SQRT( AMAX1( ZERO,
792 $ ONE+T*APOAQ*AAPQ ) )
793 AAPP = AAPP*SQRT( AMAX1( ZERO,
794 $ ONE-T*AQOAP*AAPQ ) )
796 APOAQ = D( p ) / D( q )
797 AQOAP = D( q ) / D( p )
798 IF( D( p ).GE.ONE ) THEN
800 IF( D( q ).GE.ONE ) THEN
802 FASTR( 4 ) = -T*AQOAP
805 CALL SROTM( M, A( 1, p ), 1,
808 IF( RSVEC )CALL SROTM( MVL,
809 $ V( 1, p ), 1, V( 1, q ),
812 CALL SAXPY( M, -T*AQOAP,
815 CALL SAXPY( M, CS*SN*APOAQ,
819 CALL SAXPY( MVL, -T*AQOAP,
831 IF( D( q ).GE.ONE ) THEN
832 CALL SAXPY( M, T*APOAQ,
835 CALL SAXPY( M, -CS*SN*AQOAP,
839 CALL SAXPY( MVL, T*APOAQ,
850 IF( D( p ).GE.D( q ) ) THEN
851 CALL SAXPY( M, -T*AQOAP,
854 CALL SAXPY( M, CS*SN*APOAQ,
870 CALL SAXPY( M, T*APOAQ,
881 $ T*APOAQ, V( 1, p ),
894 IF( AAPP.GT.AAQQ ) THEN
895 CALL SCOPY( M, A( 1, p ), 1, WORK,
897 CALL SLASCL( 'G', 0, 0, AAPP, ONE,
898 $ M, 1, WORK, LDA, IERR )
899 CALL SLASCL( 'G', 0, 0, AAQQ, ONE,
900 $ M, 1, A( 1, q ), LDA,
902 TEMP1 = -AAPQ*D( p ) / D( q )
903 CALL SAXPY( M, TEMP1, WORK, 1,
905 CALL SLASCL( 'G', 0, 0, ONE, AAQQ,
906 $ M, 1, A( 1, q ), LDA,
908 SVA( q ) = AAQQ*SQRT( AMAX1( ZERO,
910 MXSINJ = AMAX1( MXSINJ, SFMIN )
912 CALL SCOPY( M, A( 1, q ), 1, WORK,
914 CALL SLASCL( 'G', 0, 0, AAQQ, ONE,
915 $ M, 1, WORK, LDA, IERR )
916 CALL SLASCL( 'G', 0, 0, AAPP, ONE,
917 $ M, 1, A( 1, p ), LDA,
919 TEMP1 = -AAPQ*D( q ) / D( p )
920 CALL SAXPY( M, TEMP1, WORK, 1,
922 CALL SLASCL( 'G', 0, 0, ONE, AAPP,
923 $ M, 1, A( 1, p ), LDA,
925 SVA( p ) = AAPP*SQRT( AMAX1( ZERO,
927 MXSINJ = AMAX1( MXSINJ, SFMIN )
930 * END IF ROTOK THEN ... ELSE
932 * In the case of cancellation in updating SVA(q)
933 * .. recompute SVA(q)
934 IF( ( SVA( q ) / AAQQ )**2.LE.ROOTEPS )
936 IF( ( AAQQ.LT.ROOTBIG ) .AND.
937 $ ( AAQQ.GT.ROOTSFMIN ) ) THEN
938 SVA( q ) = SNRM2( M, A( 1, q ), 1 )*
943 CALL SLASSQ( M, A( 1, q ), 1, T,
945 SVA( q ) = T*SQRT( AAQQ )*D( q )
948 IF( ( AAPP / AAPP0 )**2.LE.ROOTEPS ) THEN
949 IF( ( AAPP.LT.ROOTBIG ) .AND.
950 $ ( AAPP.GT.ROOTSFMIN ) ) THEN
951 AAPP = SNRM2( M, A( 1, p ), 1 )*
956 CALL SLASSQ( M, A( 1, p ), 1, T,
958 AAPP = T*SQRT( AAPP )*D( p )
965 PSKIPPED = PSKIPPED + 1
970 PSKIPPED = PSKIPPED + 1
974 IF( ( i.LE.SWBAND ) .AND. ( IJBLSK.GE.BLSKIP ) )
980 IF( ( i.LE.SWBAND ) .AND.
981 $ ( PSKIPPED.GT.ROWSKIP ) ) THEN
994 IF( AAPP.EQ.ZERO )NOTROT = NOTROT +
995 $ MIN0( jgl+KBL-1, N ) - jgl + 1
996 IF( AAPP.LT.ZERO )NOTROT = 0
1002 * end of the jbc-loop
1004 *2011 bailed out of the jbc-loop
1005 DO 2012 p = igl, MIN0( igl+KBL-1, N )
1006 SVA( p ) = ABS( SVA( p ) )
1010 *2000 :: end of the ibr-loop
1013 IF( ( SVA( N ).LT.ROOTBIG ) .AND. ( SVA( N ).GT.ROOTSFMIN ) )
1015 SVA( N ) = SNRM2( M, A( 1, N ), 1 )*D( N )
1019 CALL SLASSQ( M, A( 1, N ), 1, T, AAPP )
1020 SVA( N ) = T*SQRT( AAPP )*D( N )
1023 * Additional steering devices
1025 IF( ( i.LT.SWBAND ) .AND. ( ( MXAAPQ.LE.ROOTTOL ) .OR.
1026 $ ( ISWROT.LE.N ) ) )SWBAND = i
1028 IF( ( i.GT.SWBAND+1 ) .AND. ( MXAAPQ.LT.FLOAT( N )*TOL ) .AND.
1029 $ ( FLOAT( N )*MXAAPQ*MXSINJ.LT.TOL ) ) THEN
1033 IF( NOTROT.GE.EMPTSW )GO TO 1994
1036 * end i=1:NSWEEP loop
1037 * #:) Reaching this point means that the procedure has comleted the given
1038 * number of iterations.
1042 * #:) Reaching this point means that during the i-th sweep all pivots were
1043 * below the given tolerance, causing early exit.
1046 * #:) INFO = 0 confirms successful iterations.
1049 * Sort the vector D.
1050 DO 5991 p = 1, N - 1
1051 q = ISAMAX( N-p+1, SVA( p ), 1 ) + p - 1
1059 CALL SSWAP( M, A( 1, p ), 1, A( 1, q ), 1 )
1060 IF( RSVEC )CALL SSWAP( MVL, V( 1, p ), 1, V( 1, q ), 1 )