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.2.1) --
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( MV.LT.0 ) THEN
191 ELSE IF( LDV.LT.M ) THEN
193 ELSE IF( TOL.LE.EPS ) THEN
195 ELSE IF( NSWEEP.LT.0 ) THEN
197 ELSE IF( LWORK.LT.M ) THEN
205 CALL XERBLA( 'SGSVJ0', -INFO )
211 ELSE IF( APPLV ) THEN
214 RSVEC = RSVEC .OR. APPLV
216 ROOTEPS = SQRT( EPS )
217 ROOTSFMIN = SQRT( SFMIN )
220 ROOTBIG = ONE / ROOTSFMIN
221 BIGTHETA = ONE / ROOTEPS
222 ROOTTOL = SQRT( TOL )
225 * .. Row-cyclic Jacobi SVD algorithm with column pivoting ..
227 EMPTSW = ( N*( N-1 ) ) / 2
231 * .. Row-cyclic pivot strategy with de Rijk's pivoting ..
235 *[TP] SWBAND is a tuning parameter. It is meaningful and effective
236 * if SGESVJ is used as a computational routine in the preconditioned
237 * Jacobi SVD algorithm SGESVJ. For sweeps i=1:SWBAND the procedure
241 *[TP] KBL is a tuning parameter that defines the tile size in the
242 * tiling of the p-q loops of pivot pairs. In general, an optimal
243 * value of KBL depends on the matrix dimensions and on the
244 * parameters of the computer's memory.
247 IF( ( NBL*KBL ).NE.N )NBL = NBL + 1
249 BLSKIP = ( KBL**2 ) + 1
250 *[TP] BLKSKIP is a tuning parameter that depends on SWBAND and KBL.
252 ROWSKIP = MIN0( 5, KBL )
253 *[TP] ROWSKIP is a tuning parameter.
256 *[TP] LKAHEAD is a tuning parameter.
260 DO 1993 i = 1, NSWEEP
272 igl = ( ibr-1 )*KBL + 1
274 DO 1002 ir1 = 0, MIN0( LKAHEAD, NBL-ibr )
278 DO 2001 p = igl, MIN0( igl+KBL-1, N-1 )
280 * .. de Rijk's pivoting
281 q = ISAMAX( N-p+1, SVA( p ), 1 ) + p - 1
283 CALL SSWAP( M, A( 1, p ), 1, A( 1, q ), 1 )
284 IF( RSVEC )CALL SSWAP( MVL, V( 1, p ), 1,
296 * Column norms are periodically updated by explicit
299 * Some BLAS implementations compute SNRM2(M,A(1,p),1)
300 * as SQRT(SDOT(M,A(1,p),1,A(1,p),1)), which may result in
301 * overflow for ||A(:,p)||_2 > SQRT(overflow_threshold), and
302 * undeflow for ||A(:,p)||_2 < SQRT(underflow_threshold).
303 * Hence, SNRM2 cannot be trusted, not even in the case when
304 * the true norm is far from the under(over)flow boundaries.
305 * If properly implemented SNRM2 is available, the IF-THEN-ELSE
306 * below should read "AAPP = SNRM2( M, A(1,p), 1 ) * D(p)".
308 IF( ( SVA( p ).LT.ROOTBIG ) .AND.
309 + ( SVA( p ).GT.ROOTSFMIN ) ) THEN
310 SVA( p ) = SNRM2( M, A( 1, p ), 1 )*D( p )
314 CALL SLASSQ( M, A( 1, p ), 1, TEMP1, AAPP )
315 SVA( p ) = TEMP1*SQRT( AAPP )*D( p )
323 IF( AAPP.GT.ZERO ) THEN
327 DO 2002 q = p + 1, MIN0( igl+KBL-1, N )
331 IF( AAQQ.GT.ZERO ) THEN
334 IF( AAQQ.GE.ONE ) THEN
335 ROTOK = ( SMALL*AAPP ).LE.AAQQ
336 IF( AAPP.LT.( BIG / AAQQ ) ) THEN
337 AAPQ = ( SDOT( M, A( 1, p ), 1, A( 1,
338 + q ), 1 )*D( p )*D( q ) / AAQQ )
341 CALL SCOPY( M, A( 1, p ), 1, WORK, 1 )
342 CALL SLASCL( 'G', 0, 0, AAPP, D( p ),
343 + M, 1, WORK, LDA, IERR )
344 AAPQ = SDOT( M, WORK, 1, A( 1, q ),
348 ROTOK = AAPP.LE.( AAQQ / SMALL )
349 IF( AAPP.GT.( SMALL / AAQQ ) ) THEN
350 AAPQ = ( SDOT( M, A( 1, p ), 1, A( 1,
351 + q ), 1 )*D( p )*D( q ) / AAQQ )
354 CALL SCOPY( M, A( 1, q ), 1, WORK, 1 )
355 CALL SLASCL( 'G', 0, 0, AAQQ, D( q ),
356 + M, 1, WORK, LDA, IERR )
357 AAPQ = SDOT( M, WORK, 1, A( 1, p ),
362 MXAAPQ = AMAX1( MXAAPQ, ABS( AAPQ ) )
364 * TO rotate or NOT to rotate, THAT is the question ...
366 IF( ABS( AAPQ ).GT.TOL ) THEN
369 * ROTATED = ROTATED + ONE
381 THETA = -HALF*ABS( AQOAP-APOAQ ) / AAPQ
383 IF( ABS( THETA ).GT.BIGTHETA ) THEN
386 FASTR( 3 ) = T*D( p ) / D( q )
387 FASTR( 4 ) = -T*D( q ) / D( p )
388 CALL SROTM( M, A( 1, p ), 1,
389 + A( 1, q ), 1, FASTR )
390 IF( RSVEC )CALL SROTM( MVL,
394 SVA( q ) = AAQQ*SQRT( AMAX1( ZERO,
395 + ONE+T*APOAQ*AAPQ ) )
396 AAPP = AAPP*SQRT( ONE-T*AQOAP*AAPQ )
397 MXSINJ = AMAX1( MXSINJ, ABS( T ) )
401 * .. choose correct signum for THETA and rotate
403 THSIGN = -SIGN( ONE, AAPQ )
404 T = ONE / ( THETA+THSIGN*
405 + SQRT( ONE+THETA*THETA ) )
406 CS = SQRT( ONE / ( ONE+T*T ) )
409 MXSINJ = AMAX1( MXSINJ, ABS( SN ) )
410 SVA( q ) = AAQQ*SQRT( AMAX1( ZERO,
411 + ONE+T*APOAQ*AAPQ ) )
412 AAPP = AAPP*SQRT( AMAX1( ZERO,
413 + ONE-T*AQOAP*AAPQ ) )
415 APOAQ = D( p ) / D( q )
416 AQOAP = D( q ) / D( p )
417 IF( D( p ).GE.ONE ) THEN
418 IF( D( q ).GE.ONE ) THEN
420 FASTR( 4 ) = -T*AQOAP
423 CALL SROTM( M, A( 1, p ), 1,
426 IF( RSVEC )CALL SROTM( MVL,
427 + V( 1, p ), 1, V( 1, q ),
430 CALL SAXPY( M, -T*AQOAP,
433 CALL SAXPY( M, CS*SN*APOAQ,
439 CALL SAXPY( MVL, -T*AQOAP,
449 IF( D( q ).GE.ONE ) THEN
450 CALL SAXPY( M, T*APOAQ,
453 CALL SAXPY( M, -CS*SN*AQOAP,
459 CALL SAXPY( MVL, T*APOAQ,
468 IF( D( p ).GE.D( q ) ) THEN
469 CALL SAXPY( M, -T*AQOAP,
472 CALL SAXPY( M, CS*SN*APOAQ,
488 CALL SAXPY( M, T*APOAQ,
499 + T*APOAQ, V( 1, p ),
512 * .. have to use modified Gram-Schmidt like transformation
513 CALL SCOPY( M, A( 1, p ), 1, WORK, 1 )
514 CALL SLASCL( 'G', 0, 0, AAPP, ONE, M,
515 + 1, WORK, LDA, IERR )
516 CALL SLASCL( 'G', 0, 0, AAQQ, ONE, M,
517 + 1, A( 1, q ), LDA, IERR )
518 TEMP1 = -AAPQ*D( p ) / D( q )
519 CALL SAXPY( M, TEMP1, WORK, 1,
521 CALL SLASCL( 'G', 0, 0, ONE, AAQQ, M,
522 + 1, A( 1, q ), LDA, IERR )
523 SVA( q ) = AAQQ*SQRT( AMAX1( ZERO,
525 MXSINJ = AMAX1( MXSINJ, SFMIN )
527 * END IF ROTOK THEN ... ELSE
529 * In the case of cancellation in updating SVA(q), SVA(p)
530 * recompute SVA(q), SVA(p).
531 IF( ( SVA( q ) / AAQQ )**2.LE.ROOTEPS )
533 IF( ( AAQQ.LT.ROOTBIG ) .AND.
534 + ( AAQQ.GT.ROOTSFMIN ) ) THEN
535 SVA( q ) = SNRM2( M, A( 1, q ), 1 )*
540 CALL SLASSQ( M, A( 1, q ), 1, T,
542 SVA( q ) = T*SQRT( AAQQ )*D( q )
545 IF( ( AAPP / AAPP0 ).LE.ROOTEPS ) THEN
546 IF( ( AAPP.LT.ROOTBIG ) .AND.
547 + ( AAPP.GT.ROOTSFMIN ) ) THEN
548 AAPP = SNRM2( M, A( 1, p ), 1 )*
553 CALL SLASSQ( M, A( 1, p ), 1, T,
555 AAPP = T*SQRT( AAPP )*D( p )
561 * A(:,p) and A(:,q) already numerically orthogonal
562 IF( ir1.EQ.0 )NOTROT = NOTROT + 1
563 PSKIPPED = PSKIPPED + 1
566 * A(:,q) is zero column
567 IF( ir1.EQ.0 )NOTROT = NOTROT + 1
568 PSKIPPED = PSKIPPED + 1
571 IF( ( i.LE.SWBAND ) .AND.
572 + ( PSKIPPED.GT.ROWSKIP ) ) THEN
573 IF( ir1.EQ.0 )AAPP = -AAPP
582 * bailed out of q-loop
588 IF( ( ir1.EQ.0 ) .AND. ( AAPP.EQ.ZERO ) )
589 + NOTROT = NOTROT + MIN0( igl+KBL-1, N ) - p
594 * end of doing the block ( ibr, ibr )
598 *........................................................
599 * ... go to the off diagonal blocks
601 igl = ( ibr-1 )*KBL + 1
603 DO 2010 jbc = ibr + 1, NBL
605 jgl = ( jbc-1 )*KBL + 1
607 * doing the block at ( ibr, jbc )
610 DO 2100 p = igl, MIN0( igl+KBL-1, N )
614 IF( AAPP.GT.ZERO ) THEN
618 DO 2200 q = jgl, MIN0( jgl+KBL-1, N )
622 IF( AAQQ.GT.ZERO ) THEN
625 * .. M x 2 Jacobi SVD ..
627 * .. Safe Gram matrix computation ..
629 IF( AAQQ.GE.ONE ) THEN
630 IF( AAPP.GE.AAQQ ) THEN
631 ROTOK = ( SMALL*AAPP ).LE.AAQQ
633 ROTOK = ( SMALL*AAQQ ).LE.AAPP
635 IF( AAPP.LT.( BIG / AAQQ ) ) THEN
636 AAPQ = ( SDOT( M, A( 1, p ), 1, A( 1,
637 + q ), 1 )*D( p )*D( q ) / AAQQ )
640 CALL SCOPY( M, A( 1, p ), 1, WORK, 1 )
641 CALL SLASCL( 'G', 0, 0, AAPP, D( p ),
642 + M, 1, WORK, LDA, IERR )
643 AAPQ = SDOT( M, WORK, 1, A( 1, q ),
647 IF( AAPP.GE.AAQQ ) THEN
648 ROTOK = AAPP.LE.( AAQQ / SMALL )
650 ROTOK = AAQQ.LE.( AAPP / SMALL )
652 IF( AAPP.GT.( SMALL / AAQQ ) ) THEN
653 AAPQ = ( SDOT( M, A( 1, p ), 1, A( 1,
654 + q ), 1 )*D( p )*D( q ) / AAQQ )
657 CALL SCOPY( M, A( 1, q ), 1, WORK, 1 )
658 CALL SLASCL( 'G', 0, 0, AAQQ, D( q ),
659 + M, 1, WORK, LDA, IERR )
660 AAPQ = SDOT( M, WORK, 1, A( 1, p ),
665 MXAAPQ = AMAX1( MXAAPQ, ABS( AAPQ ) )
667 * TO rotate or NOT to rotate, THAT is the question ...
669 IF( ABS( AAPQ ).GT.TOL ) THEN
671 * ROTATED = ROTATED + 1
679 THETA = -HALF*ABS( AQOAP-APOAQ ) / AAPQ
680 IF( AAQQ.GT.AAPP0 )THETA = -THETA
682 IF( ABS( THETA ).GT.BIGTHETA ) THEN
684 FASTR( 3 ) = T*D( p ) / D( q )
685 FASTR( 4 ) = -T*D( q ) / D( p )
686 CALL SROTM( M, A( 1, p ), 1,
687 + A( 1, q ), 1, FASTR )
688 IF( RSVEC )CALL SROTM( MVL,
692 SVA( q ) = AAQQ*SQRT( AMAX1( ZERO,
693 + ONE+T*APOAQ*AAPQ ) )
694 AAPP = AAPP*SQRT( AMAX1( ZERO,
695 + ONE-T*AQOAP*AAPQ ) )
696 MXSINJ = AMAX1( MXSINJ, ABS( T ) )
699 * .. choose correct signum for THETA and rotate
701 THSIGN = -SIGN( ONE, AAPQ )
702 IF( AAQQ.GT.AAPP0 )THSIGN = -THSIGN
703 T = ONE / ( THETA+THSIGN*
704 + SQRT( ONE+THETA*THETA ) )
705 CS = SQRT( ONE / ( ONE+T*T ) )
707 MXSINJ = AMAX1( MXSINJ, ABS( SN ) )
708 SVA( q ) = AAQQ*SQRT( AMAX1( ZERO,
709 + ONE+T*APOAQ*AAPQ ) )
710 AAPP = AAPP*SQRT( ONE-T*AQOAP*AAPQ )
712 APOAQ = D( p ) / D( q )
713 AQOAP = D( q ) / D( p )
714 IF( D( p ).GE.ONE ) THEN
716 IF( D( q ).GE.ONE ) THEN
718 FASTR( 4 ) = -T*AQOAP
721 CALL SROTM( M, A( 1, p ), 1,
724 IF( RSVEC )CALL SROTM( MVL,
725 + V( 1, p ), 1, V( 1, q ),
728 CALL SAXPY( M, -T*AQOAP,
731 CALL SAXPY( M, CS*SN*APOAQ,
735 CALL SAXPY( MVL, -T*AQOAP,
747 IF( D( q ).GE.ONE ) THEN
748 CALL SAXPY( M, T*APOAQ,
751 CALL SAXPY( M, -CS*SN*AQOAP,
755 CALL SAXPY( MVL, T*APOAQ,
766 IF( D( p ).GE.D( q ) ) THEN
767 CALL SAXPY( M, -T*AQOAP,
770 CALL SAXPY( M, CS*SN*APOAQ,
786 CALL SAXPY( M, T*APOAQ,
797 + T*APOAQ, V( 1, p ),
810 IF( AAPP.GT.AAQQ ) THEN
811 CALL SCOPY( M, A( 1, p ), 1, WORK,
813 CALL SLASCL( 'G', 0, 0, AAPP, ONE,
814 + M, 1, WORK, LDA, IERR )
815 CALL SLASCL( 'G', 0, 0, AAQQ, ONE,
816 + M, 1, A( 1, q ), LDA,
818 TEMP1 = -AAPQ*D( p ) / D( q )
819 CALL SAXPY( M, TEMP1, WORK, 1,
821 CALL SLASCL( 'G', 0, 0, ONE, AAQQ,
822 + M, 1, A( 1, q ), LDA,
824 SVA( q ) = AAQQ*SQRT( AMAX1( ZERO,
826 MXSINJ = AMAX1( MXSINJ, SFMIN )
828 CALL SCOPY( M, A( 1, q ), 1, WORK,
830 CALL SLASCL( 'G', 0, 0, AAQQ, ONE,
831 + M, 1, WORK, LDA, IERR )
832 CALL SLASCL( 'G', 0, 0, AAPP, ONE,
833 + M, 1, A( 1, p ), LDA,
835 TEMP1 = -AAPQ*D( q ) / D( p )
836 CALL SAXPY( M, TEMP1, WORK, 1,
838 CALL SLASCL( 'G', 0, 0, ONE, AAPP,
839 + M, 1, A( 1, p ), LDA,
841 SVA( p ) = AAPP*SQRT( AMAX1( ZERO,
843 MXSINJ = AMAX1( MXSINJ, SFMIN )
846 * END IF ROTOK THEN ... ELSE
848 * In the case of cancellation in updating SVA(q)
849 * .. recompute SVA(q)
850 IF( ( SVA( q ) / AAQQ )**2.LE.ROOTEPS )
852 IF( ( AAQQ.LT.ROOTBIG ) .AND.
853 + ( AAQQ.GT.ROOTSFMIN ) ) THEN
854 SVA( q ) = SNRM2( M, A( 1, q ), 1 )*
859 CALL SLASSQ( M, A( 1, q ), 1, T,
861 SVA( q ) = T*SQRT( AAQQ )*D( q )
864 IF( ( AAPP / AAPP0 )**2.LE.ROOTEPS ) THEN
865 IF( ( AAPP.LT.ROOTBIG ) .AND.
866 + ( AAPP.GT.ROOTSFMIN ) ) THEN
867 AAPP = SNRM2( M, A( 1, p ), 1 )*
872 CALL SLASSQ( M, A( 1, p ), 1, T,
874 AAPP = T*SQRT( AAPP )*D( p )
881 PSKIPPED = PSKIPPED + 1
886 PSKIPPED = PSKIPPED + 1
890 IF( ( i.LE.SWBAND ) .AND. ( IJBLSK.GE.BLSKIP ) )
896 IF( ( i.LE.SWBAND ) .AND.
897 + ( PSKIPPED.GT.ROWSKIP ) ) THEN
910 IF( AAPP.EQ.ZERO )NOTROT = NOTROT +
911 + MIN0( jgl+KBL-1, N ) - jgl + 1
912 IF( AAPP.LT.ZERO )NOTROT = 0
918 * end of the jbc-loop
920 *2011 bailed out of the jbc-loop
921 DO 2012 p = igl, MIN0( igl+KBL-1, N )
922 SVA( p ) = ABS( SVA( p ) )
926 *2000 :: end of the ibr-loop
929 IF( ( SVA( N ).LT.ROOTBIG ) .AND. ( SVA( N ).GT.ROOTSFMIN ) )
931 SVA( N ) = SNRM2( M, A( 1, N ), 1 )*D( N )
935 CALL SLASSQ( M, A( 1, N ), 1, T, AAPP )
936 SVA( N ) = T*SQRT( AAPP )*D( N )
939 * Additional steering devices
941 IF( ( i.LT.SWBAND ) .AND. ( ( MXAAPQ.LE.ROOTTOL ) .OR.
942 + ( ISWROT.LE.N ) ) )SWBAND = i
944 IF( ( i.GT.SWBAND+1 ) .AND. ( MXAAPQ.LT.FLOAT( N )*TOL ) .AND.
945 + ( FLOAT( N )*MXAAPQ*MXSINJ.LT.TOL ) ) THEN
949 IF( NOTROT.GE.EMPTSW )GO TO 1994
952 * end i=1:NSWEEP loop
953 * #:) Reaching this point means that the procedure has comleted the given
954 * number of iterations.
958 * #:) Reaching this point means that during the i-th sweep all pivots were
959 * below the given tolerance, causing early exit.
962 * #:) INFO = 0 confirms successful iterations.
967 q = ISAMAX( N-p+1, SVA( p ), 1 ) + p - 1
975 CALL SSWAP( M, A( 1, p ), 1, A( 1, q ), 1 )
976 IF( RSVEC )CALL SSWAP( MVL, V( 1, p ), 1, V( 1, q ), 1 )