1 SUBROUTINE SGSVJ0( JOBV, M, N, A, LDA, D, SVA, MV, V, LDV, EPS,
2 + SFMIN, TOL, NSWEEP, WORK, LWORK, INFO )
4 * -- LAPACK routine (version 3.3.0) --
6 * -- Contributed by Zlatko Drmac of the University of Zagreb and --
7 * -- Kresimir Veselic of the Fernuniversitaet Hagen --
10 * -- LAPACK is a software package provided by Univ. of Tennessee, --
11 * -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
13 * This routine is also part of SIGMA (version 1.23, October 23. 2008.)
14 * SIGMA is a library of algorithms for highly accurate algorithms for
15 * computation of SVD, PSVD, QSVD, (H,K)-SVD, and for solution of the
16 * eigenvalue problems Hx = lambda M x, H M x = lambda x with H, M > 0.
20 * .. Scalar Arguments ..
21 INTEGER INFO, LDA, LDV, LWORK, M, MV, N, NSWEEP
25 * .. Array Arguments ..
26 REAL A( LDA, * ), SVA( N ), D( N ), V( LDV, * ),
33 * SGSVJ0 is called from SGESVJ as a pre-processor and that is its main
34 * purpose. It applies Jacobi rotations in the same way as SGESVJ does, but
35 * it does not check convergence (stopping criterion). Few tuning
36 * parameters (marked by [TP]) are available for the implementer.
40 * SGSVJ0 is used just to enable SGESVJ to call a simplified version of
41 * itself to work on a submatrix of the original matrix.
45 * Zlatko Drmac (Zagreb, Croatia) and Kresimir Veselic (Hagen, Germany)
47 * Bugs, Examples and Comments
48 * ~~~~~~~~~~~~~~~~~~~~~~~~~~~
49 * Please report all bugs and send interesting test examples and comments to
50 * drmac@math.hr. Thank you.
55 * JOBV (input) CHARACTER*1
56 * Specifies whether the output from this procedure is used
57 * to compute the matrix V:
58 * = 'V': the product of the Jacobi rotations is accumulated
59 * by postmulyiplying the N-by-N array V.
60 * (See the description of V.)
61 * = 'A': the product of the Jacobi rotations is accumulated
62 * by postmulyiplying the MV-by-N array V.
63 * (See the descriptions of MV and V.)
64 * = 'N': the Jacobi rotations are not accumulated.
67 * The number of rows of the input matrix A. M >= 0.
70 * The number of columns of the input matrix A.
73 * A (input/output) REAL array, dimension (LDA,N)
74 * On entry, M-by-N matrix A, such that A*diag(D) represents
77 * A_onexit * D_onexit represents the input matrix A*diag(D)
78 * post-multiplied by a sequence of Jacobi rotations, where the
79 * rotation threshold and the total number of sweeps are given in
80 * TOL and NSWEEP, respectively.
81 * (See the descriptions of D, TOL and NSWEEP.)
84 * The leading dimension of the array A. LDA >= max(1,M).
86 * D (input/workspace/output) REAL array, dimension (N)
87 * The array D accumulates the scaling factors from the fast scaled
89 * On entry, A*diag(D) represents the input matrix.
90 * On exit, A_onexit*diag(D_onexit) represents the input matrix
91 * post-multiplied by a sequence of Jacobi rotations, where the
92 * rotation threshold and the total number of sweeps are given in
93 * TOL and NSWEEP, respectively.
94 * (See the descriptions of A, TOL and NSWEEP.)
96 * SVA (input/workspace/output) REAL array, dimension (N)
97 * On entry, SVA contains the Euclidean norms of the columns of
98 * the matrix A*diag(D).
99 * On exit, SVA contains the Euclidean norms of the columns of
100 * the matrix onexit*diag(D_onexit).
103 * If JOBV .EQ. 'A', then MV rows of V are post-multipled by a
104 * sequence of Jacobi rotations.
105 * If JOBV = 'N', then MV is not referenced.
107 * V (input/output) REAL array, dimension (LDV,N)
108 * If JOBV .EQ. 'V' then N rows of V are post-multipled by a
109 * sequence of Jacobi rotations.
110 * If JOBV .EQ. 'A' then MV rows of V are post-multipled by a
111 * sequence of Jacobi rotations.
112 * If JOBV = 'N', then V is not referenced.
114 * LDV (input) INTEGER
115 * The leading dimension of the array V, LDV >= 1.
116 * If JOBV = 'V', LDV .GE. N.
117 * If JOBV = 'A', LDV .GE. MV.
119 * EPS (input) INTEGER
120 * EPS = SLAMCH('Epsilon')
122 * SFMIN (input) INTEGER
123 * SFMIN = SLAMCH('Safe Minimum')
126 * TOL is the threshold for Jacobi rotations. For a pair
127 * A(:,p), A(:,q) of pivot columns, the Jacobi rotation is
128 * applied only if ABS(COS(angle(A(:,p),A(:,q)))) .GT. TOL.
130 * NSWEEP (input) INTEGER
131 * NSWEEP is the number of sweeps of Jacobi rotations to be
134 * WORK (workspace) REAL array, dimension LWORK.
136 * LWORK (input) INTEGER
137 * LWORK is the dimension of WORK. LWORK .GE. M.
139 * INFO (output) INTEGER
140 * = 0 : successful exit.
141 * < 0 : if INFO = -i, then the i-th argument had an illegal value
143 * =====================================================================
145 * .. Local Parameters ..
146 REAL ZERO, HALF, ONE, TWO
147 PARAMETER ( ZERO = 0.0E0, HALF = 0.5E0, ONE = 1.0E0,
150 * .. Local Scalars ..
151 REAL AAPP, AAPP0, AAPQ, AAQQ, APOAQ, AQOAP, BIG,
152 + BIGTHETA, CS, MXAAPQ, MXSINJ, ROOTBIG, ROOTEPS,
153 + ROOTSFMIN, ROOTTOL, SMALL, SN, T, TEMP1, THETA,
155 INTEGER BLSKIP, EMPTSW, i, ibr, IERR, igl, IJBLSK, ir1,
156 + ISWROT, jbc, jgl, KBL, LKAHEAD, MVL, NBL,
157 + NOTROT, p, PSKIPPED, q, ROWSKIP, SWBAND
158 LOGICAL APPLV, ROTOK, RSVEC
163 * .. Intrinsic Functions ..
164 INTRINSIC ABS, AMAX1, AMIN1, FLOAT, MIN0, SIGN, SQRT
166 * .. External Functions ..
170 EXTERNAL ISAMAX, LSAME, SDOT, SNRM2
172 * .. External Subroutines ..
173 EXTERNAL SAXPY, SCOPY, SLASCL, SLASSQ, SROTM, SSWAP
175 * .. Executable Statements ..
177 * Test the input parameters.
179 APPLV = LSAME( JOBV, 'A' )
180 RSVEC = LSAME( JOBV, 'V' )
181 IF( .NOT.( RSVEC .OR. APPLV .OR. LSAME( JOBV, 'N' ) ) ) THEN
183 ELSE IF( M.LT.0 ) THEN
185 ELSE IF( ( N.LT.0 ) .OR. ( N.GT.M ) ) THEN
187 ELSE IF( LDA.LT.M ) THEN
189 ELSE IF( ( RSVEC.OR.APPLV ) .AND. ( MV.LT.0 ) ) THEN
191 ELSE IF( ( RSVEC.AND.( LDV.LT.N ) ).OR.
192 & ( APPLV.AND.( LDV.LT.MV ) ) ) THEN
194 ELSE IF( TOL.LE.EPS ) THEN
196 ELSE IF( NSWEEP.LT.0 ) THEN
198 ELSE IF( LWORK.LT.M ) THEN
206 CALL XERBLA( 'SGSVJ0', -INFO )
212 ELSE IF( APPLV ) THEN
215 RSVEC = RSVEC .OR. APPLV
217 ROOTEPS = SQRT( EPS )
218 ROOTSFMIN = SQRT( SFMIN )
221 ROOTBIG = ONE / ROOTSFMIN
222 BIGTHETA = ONE / ROOTEPS
223 ROOTTOL = SQRT( TOL )
226 * .. Row-cyclic Jacobi SVD algorithm with column pivoting ..
228 EMPTSW = ( N*( N-1 ) ) / 2
232 * .. Row-cyclic pivot strategy with de Rijk's pivoting ..
236 *[TP] SWBAND is a tuning parameter. It is meaningful and effective
237 * if SGESVJ is used as a computational routine in the preconditioned
238 * Jacobi SVD algorithm SGESVJ. For sweeps i=1:SWBAND the procedure
242 *[TP] KBL is a tuning parameter that defines the tile size in the
243 * tiling of the p-q loops of pivot pairs. In general, an optimal
244 * value of KBL depends on the matrix dimensions and on the
245 * parameters of the computer's memory.
248 IF( ( NBL*KBL ).NE.N )NBL = NBL + 1
250 BLSKIP = ( KBL**2 ) + 1
251 *[TP] BLKSKIP is a tuning parameter that depends on SWBAND and KBL.
253 ROWSKIP = MIN0( 5, KBL )
254 *[TP] ROWSKIP is a tuning parameter.
257 *[TP] LKAHEAD is a tuning parameter.
261 DO 1993 i = 1, NSWEEP
273 igl = ( ibr-1 )*KBL + 1
275 DO 1002 ir1 = 0, MIN0( LKAHEAD, NBL-ibr )
279 DO 2001 p = igl, MIN0( igl+KBL-1, N-1 )
281 * .. de Rijk's pivoting
282 q = ISAMAX( N-p+1, SVA( p ), 1 ) + p - 1
284 CALL SSWAP( M, A( 1, p ), 1, A( 1, q ), 1 )
285 IF( RSVEC )CALL SSWAP( MVL, V( 1, p ), 1,
297 * Column norms are periodically updated by explicit
300 * Some BLAS implementations compute SNRM2(M,A(1,p),1)
301 * as SQRT(SDOT(M,A(1,p),1,A(1,p),1)), which may result in
302 * overflow for ||A(:,p)||_2 > SQRT(overflow_threshold), and
303 * undeflow for ||A(:,p)||_2 < SQRT(underflow_threshold).
304 * Hence, SNRM2 cannot be trusted, not even in the case when
305 * the true norm is far from the under(over)flow boundaries.
306 * If properly implemented SNRM2 is available, the IF-THEN-ELSE
307 * below should read "AAPP = SNRM2( M, A(1,p), 1 ) * D(p)".
309 IF( ( SVA( p ).LT.ROOTBIG ) .AND.
310 + ( SVA( p ).GT.ROOTSFMIN ) ) THEN
311 SVA( p ) = SNRM2( M, A( 1, p ), 1 )*D( p )
315 CALL SLASSQ( M, A( 1, p ), 1, TEMP1, AAPP )
316 SVA( p ) = TEMP1*SQRT( AAPP )*D( p )
324 IF( AAPP.GT.ZERO ) THEN
328 DO 2002 q = p + 1, MIN0( igl+KBL-1, N )
332 IF( AAQQ.GT.ZERO ) THEN
335 IF( AAQQ.GE.ONE ) THEN
336 ROTOK = ( SMALL*AAPP ).LE.AAQQ
337 IF( AAPP.LT.( BIG / AAQQ ) ) THEN
338 AAPQ = ( SDOT( M, A( 1, p ), 1, A( 1,
339 + q ), 1 )*D( p )*D( q ) / AAQQ )
342 CALL SCOPY( M, A( 1, p ), 1, WORK, 1 )
343 CALL SLASCL( 'G', 0, 0, AAPP, D( p ),
344 + M, 1, WORK, LDA, IERR )
345 AAPQ = SDOT( M, WORK, 1, A( 1, q ),
349 ROTOK = AAPP.LE.( AAQQ / SMALL )
350 IF( AAPP.GT.( SMALL / AAQQ ) ) THEN
351 AAPQ = ( SDOT( M, A( 1, p ), 1, A( 1,
352 + q ), 1 )*D( p )*D( q ) / AAQQ )
355 CALL SCOPY( M, A( 1, q ), 1, WORK, 1 )
356 CALL SLASCL( 'G', 0, 0, AAQQ, D( q ),
357 + M, 1, WORK, LDA, IERR )
358 AAPQ = SDOT( M, WORK, 1, A( 1, p ),
363 MXAAPQ = AMAX1( MXAAPQ, ABS( AAPQ ) )
365 * TO rotate or NOT to rotate, THAT is the question ...
367 IF( ABS( AAPQ ).GT.TOL ) THEN
370 * ROTATED = ROTATED + ONE
382 THETA = -HALF*ABS( AQOAP-APOAQ ) / AAPQ
384 IF( ABS( THETA ).GT.BIGTHETA ) THEN
387 FASTR( 3 ) = T*D( p ) / D( q )
388 FASTR( 4 ) = -T*D( q ) / D( p )
389 CALL SROTM( M, A( 1, p ), 1,
390 + A( 1, q ), 1, FASTR )
391 IF( RSVEC )CALL SROTM( MVL,
395 SVA( q ) = AAQQ*SQRT( AMAX1( ZERO,
396 + ONE+T*APOAQ*AAPQ ) )
397 AAPP = AAPP*SQRT( AMAX1( ZERO,
398 + ONE-T*AQOAP*AAPQ ) )
399 MXSINJ = AMAX1( MXSINJ, ABS( T ) )
403 * .. choose correct signum for THETA and rotate
405 THSIGN = -SIGN( ONE, AAPQ )
406 T = ONE / ( THETA+THSIGN*
407 + SQRT( ONE+THETA*THETA ) )
408 CS = SQRT( ONE / ( ONE+T*T ) )
411 MXSINJ = AMAX1( MXSINJ, ABS( SN ) )
412 SVA( q ) = AAQQ*SQRT( AMAX1( ZERO,
413 + ONE+T*APOAQ*AAPQ ) )
414 AAPP = AAPP*SQRT( AMAX1( ZERO,
415 + ONE-T*AQOAP*AAPQ ) )
417 APOAQ = D( p ) / D( q )
418 AQOAP = D( q ) / D( p )
419 IF( D( p ).GE.ONE ) THEN
420 IF( D( q ).GE.ONE ) THEN
422 FASTR( 4 ) = -T*AQOAP
425 CALL SROTM( M, A( 1, p ), 1,
428 IF( RSVEC )CALL SROTM( MVL,
429 + V( 1, p ), 1, V( 1, q ),
432 CALL SAXPY( M, -T*AQOAP,
435 CALL SAXPY( M, CS*SN*APOAQ,
441 CALL SAXPY( MVL, -T*AQOAP,
451 IF( D( q ).GE.ONE ) THEN
452 CALL SAXPY( M, T*APOAQ,
455 CALL SAXPY( M, -CS*SN*AQOAP,
461 CALL SAXPY( MVL, T*APOAQ,
470 IF( D( p ).GE.D( q ) ) THEN
471 CALL SAXPY( M, -T*AQOAP,
474 CALL SAXPY( M, CS*SN*APOAQ,
490 CALL SAXPY( M, T*APOAQ,
501 + T*APOAQ, V( 1, p ),
514 * .. have to use modified Gram-Schmidt like transformation
515 CALL SCOPY( M, A( 1, p ), 1, WORK, 1 )
516 CALL SLASCL( 'G', 0, 0, AAPP, ONE, M,
517 + 1, WORK, LDA, IERR )
518 CALL SLASCL( 'G', 0, 0, AAQQ, ONE, M,
519 + 1, A( 1, q ), LDA, IERR )
520 TEMP1 = -AAPQ*D( p ) / D( q )
521 CALL SAXPY( M, TEMP1, WORK, 1,
523 CALL SLASCL( 'G', 0, 0, ONE, AAQQ, M,
524 + 1, A( 1, q ), LDA, IERR )
525 SVA( q ) = AAQQ*SQRT( AMAX1( ZERO,
527 MXSINJ = AMAX1( MXSINJ, SFMIN )
529 * END IF ROTOK THEN ... ELSE
531 * In the case of cancellation in updating SVA(q), SVA(p)
532 * recompute SVA(q), SVA(p).
533 IF( ( SVA( q ) / AAQQ )**2.LE.ROOTEPS )
535 IF( ( AAQQ.LT.ROOTBIG ) .AND.
536 + ( AAQQ.GT.ROOTSFMIN ) ) THEN
537 SVA( q ) = SNRM2( M, A( 1, q ), 1 )*
542 CALL SLASSQ( M, A( 1, q ), 1, T,
544 SVA( q ) = T*SQRT( AAQQ )*D( q )
547 IF( ( AAPP / AAPP0 ).LE.ROOTEPS ) THEN
548 IF( ( AAPP.LT.ROOTBIG ) .AND.
549 + ( AAPP.GT.ROOTSFMIN ) ) THEN
550 AAPP = SNRM2( M, A( 1, p ), 1 )*
555 CALL SLASSQ( M, A( 1, p ), 1, T,
557 AAPP = T*SQRT( AAPP )*D( p )
563 * A(:,p) and A(:,q) already numerically orthogonal
564 IF( ir1.EQ.0 )NOTROT = NOTROT + 1
565 PSKIPPED = PSKIPPED + 1
568 * A(:,q) is zero column
569 IF( ir1.EQ.0 )NOTROT = NOTROT + 1
570 PSKIPPED = PSKIPPED + 1
573 IF( ( i.LE.SWBAND ) .AND.
574 + ( PSKIPPED.GT.ROWSKIP ) ) THEN
575 IF( ir1.EQ.0 )AAPP = -AAPP
584 * bailed out of q-loop
590 IF( ( ir1.EQ.0 ) .AND. ( AAPP.EQ.ZERO ) )
591 + NOTROT = NOTROT + MIN0( igl+KBL-1, N ) - p
596 * end of doing the block ( ibr, ibr )
600 *........................................................
601 * ... go to the off diagonal blocks
603 igl = ( ibr-1 )*KBL + 1
605 DO 2010 jbc = ibr + 1, NBL
607 jgl = ( jbc-1 )*KBL + 1
609 * doing the block at ( ibr, jbc )
612 DO 2100 p = igl, MIN0( igl+KBL-1, N )
616 IF( AAPP.GT.ZERO ) THEN
620 DO 2200 q = jgl, MIN0( jgl+KBL-1, N )
624 IF( AAQQ.GT.ZERO ) THEN
627 * .. M x 2 Jacobi SVD ..
629 * .. Safe Gram matrix computation ..
631 IF( AAQQ.GE.ONE ) THEN
632 IF( AAPP.GE.AAQQ ) THEN
633 ROTOK = ( SMALL*AAPP ).LE.AAQQ
635 ROTOK = ( SMALL*AAQQ ).LE.AAPP
637 IF( AAPP.LT.( BIG / AAQQ ) ) THEN
638 AAPQ = ( SDOT( M, A( 1, p ), 1, A( 1,
639 + q ), 1 )*D( p )*D( q ) / AAQQ )
642 CALL SCOPY( M, A( 1, p ), 1, WORK, 1 )
643 CALL SLASCL( 'G', 0, 0, AAPP, D( p ),
644 + M, 1, WORK, LDA, IERR )
645 AAPQ = SDOT( M, WORK, 1, A( 1, q ),
649 IF( AAPP.GE.AAQQ ) THEN
650 ROTOK = AAPP.LE.( AAQQ / SMALL )
652 ROTOK = AAQQ.LE.( AAPP / SMALL )
654 IF( AAPP.GT.( SMALL / AAQQ ) ) THEN
655 AAPQ = ( SDOT( M, A( 1, p ), 1, A( 1,
656 + q ), 1 )*D( p )*D( q ) / AAQQ )
659 CALL SCOPY( M, A( 1, q ), 1, WORK, 1 )
660 CALL SLASCL( 'G', 0, 0, AAQQ, D( q ),
661 + M, 1, WORK, LDA, IERR )
662 AAPQ = SDOT( M, WORK, 1, A( 1, p ),
667 MXAAPQ = AMAX1( MXAAPQ, ABS( AAPQ ) )
669 * TO rotate or NOT to rotate, THAT is the question ...
671 IF( ABS( AAPQ ).GT.TOL ) THEN
673 * ROTATED = ROTATED + 1
681 THETA = -HALF*ABS( AQOAP-APOAQ ) / AAPQ
682 IF( AAQQ.GT.AAPP0 )THETA = -THETA
684 IF( ABS( THETA ).GT.BIGTHETA ) THEN
686 FASTR( 3 ) = T*D( p ) / D( q )
687 FASTR( 4 ) = -T*D( q ) / D( p )
688 CALL SROTM( M, A( 1, p ), 1,
689 + A( 1, q ), 1, FASTR )
690 IF( RSVEC )CALL SROTM( MVL,
694 SVA( q ) = AAQQ*SQRT( AMAX1( ZERO,
695 + ONE+T*APOAQ*AAPQ ) )
696 AAPP = AAPP*SQRT( AMAX1( ZERO,
697 + ONE-T*AQOAP*AAPQ ) )
698 MXSINJ = AMAX1( MXSINJ, ABS( T ) )
701 * .. choose correct signum for THETA and rotate
703 THSIGN = -SIGN( ONE, AAPQ )
704 IF( AAQQ.GT.AAPP0 )THSIGN = -THSIGN
705 T = ONE / ( THETA+THSIGN*
706 + SQRT( ONE+THETA*THETA ) )
707 CS = SQRT( ONE / ( ONE+T*T ) )
709 MXSINJ = AMAX1( MXSINJ, ABS( SN ) )
710 SVA( q ) = AAQQ*SQRT( AMAX1( ZERO,
711 + ONE+T*APOAQ*AAPQ ) )
712 AAPP = AAPP*SQRT( AMAX1( ZERO,
713 + ONE-T*AQOAP*AAPQ ) )
715 APOAQ = D( p ) / D( q )
716 AQOAP = D( q ) / D( p )
717 IF( D( p ).GE.ONE ) THEN
719 IF( D( q ).GE.ONE ) THEN
721 FASTR( 4 ) = -T*AQOAP
724 CALL SROTM( M, A( 1, p ), 1,
727 IF( RSVEC )CALL SROTM( MVL,
728 + V( 1, p ), 1, V( 1, q ),
731 CALL SAXPY( M, -T*AQOAP,
734 CALL SAXPY( M, CS*SN*APOAQ,
738 CALL SAXPY( MVL, -T*AQOAP,
750 IF( D( q ).GE.ONE ) THEN
751 CALL SAXPY( M, T*APOAQ,
754 CALL SAXPY( M, -CS*SN*AQOAP,
758 CALL SAXPY( MVL, T*APOAQ,
769 IF( D( p ).GE.D( q ) ) THEN
770 CALL SAXPY( M, -T*AQOAP,
773 CALL SAXPY( M, CS*SN*APOAQ,
789 CALL SAXPY( M, T*APOAQ,
800 + T*APOAQ, V( 1, p ),
813 IF( AAPP.GT.AAQQ ) THEN
814 CALL SCOPY( M, A( 1, p ), 1, WORK,
816 CALL SLASCL( 'G', 0, 0, AAPP, ONE,
817 + M, 1, WORK, LDA, IERR )
818 CALL SLASCL( 'G', 0, 0, AAQQ, ONE,
819 + M, 1, A( 1, q ), LDA,
821 TEMP1 = -AAPQ*D( p ) / D( q )
822 CALL SAXPY( M, TEMP1, WORK, 1,
824 CALL SLASCL( 'G', 0, 0, ONE, AAQQ,
825 + M, 1, A( 1, q ), LDA,
827 SVA( q ) = AAQQ*SQRT( AMAX1( ZERO,
829 MXSINJ = AMAX1( MXSINJ, SFMIN )
831 CALL SCOPY( M, A( 1, q ), 1, WORK,
833 CALL SLASCL( 'G', 0, 0, AAQQ, ONE,
834 + M, 1, WORK, LDA, IERR )
835 CALL SLASCL( 'G', 0, 0, AAPP, ONE,
836 + M, 1, A( 1, p ), LDA,
838 TEMP1 = -AAPQ*D( q ) / D( p )
839 CALL SAXPY( M, TEMP1, WORK, 1,
841 CALL SLASCL( 'G', 0, 0, ONE, AAPP,
842 + M, 1, A( 1, p ), LDA,
844 SVA( p ) = AAPP*SQRT( AMAX1( ZERO,
846 MXSINJ = AMAX1( MXSINJ, SFMIN )
849 * END IF ROTOK THEN ... ELSE
851 * In the case of cancellation in updating SVA(q)
852 * .. recompute SVA(q)
853 IF( ( SVA( q ) / AAQQ )**2.LE.ROOTEPS )
855 IF( ( AAQQ.LT.ROOTBIG ) .AND.
856 + ( AAQQ.GT.ROOTSFMIN ) ) THEN
857 SVA( q ) = SNRM2( M, A( 1, q ), 1 )*
862 CALL SLASSQ( M, A( 1, q ), 1, T,
864 SVA( q ) = T*SQRT( AAQQ )*D( q )
867 IF( ( AAPP / AAPP0 )**2.LE.ROOTEPS ) THEN
868 IF( ( AAPP.LT.ROOTBIG ) .AND.
869 + ( AAPP.GT.ROOTSFMIN ) ) THEN
870 AAPP = SNRM2( M, A( 1, p ), 1 )*
875 CALL SLASSQ( M, A( 1, p ), 1, T,
877 AAPP = T*SQRT( AAPP )*D( p )
884 PSKIPPED = PSKIPPED + 1
889 PSKIPPED = PSKIPPED + 1
893 IF( ( i.LE.SWBAND ) .AND. ( IJBLSK.GE.BLSKIP ) )
899 IF( ( i.LE.SWBAND ) .AND.
900 + ( PSKIPPED.GT.ROWSKIP ) ) THEN
913 IF( AAPP.EQ.ZERO )NOTROT = NOTROT +
914 + MIN0( jgl+KBL-1, N ) - jgl + 1
915 IF( AAPP.LT.ZERO )NOTROT = 0
921 * end of the jbc-loop
923 *2011 bailed out of the jbc-loop
924 DO 2012 p = igl, MIN0( igl+KBL-1, N )
925 SVA( p ) = ABS( SVA( p ) )
929 *2000 :: end of the ibr-loop
932 IF( ( SVA( N ).LT.ROOTBIG ) .AND. ( SVA( N ).GT.ROOTSFMIN ) )
934 SVA( N ) = SNRM2( M, A( 1, N ), 1 )*D( N )
938 CALL SLASSQ( M, A( 1, N ), 1, T, AAPP )
939 SVA( N ) = T*SQRT( AAPP )*D( N )
942 * Additional steering devices
944 IF( ( i.LT.SWBAND ) .AND. ( ( MXAAPQ.LE.ROOTTOL ) .OR.
945 + ( ISWROT.LE.N ) ) )SWBAND = i
947 IF( ( i.GT.SWBAND+1 ) .AND. ( MXAAPQ.LT.FLOAT( N )*TOL ) .AND.
948 + ( FLOAT( N )*MXAAPQ*MXSINJ.LT.TOL ) ) THEN
952 IF( NOTROT.GE.EMPTSW )GO TO 1994
955 * end i=1:NSWEEP loop
956 * #:) Reaching this point means that the procedure has comleted the given
957 * number of iterations.
961 * #:) Reaching this point means that during the i-th sweep all pivots were
962 * below the given tolerance, causing early exit.
965 * #:) INFO = 0 confirms successful iterations.
970 q = ISAMAX( N-p+1, SVA( p ), 1 ) + p - 1
978 CALL SSWAP( M, A( 1, p ), 1, A( 1, q ), 1 )
979 IF( RSVEC )CALL SSWAP( MVL, V( 1, p ), 1, V( 1, q ), 1 )