*
EPS = DLAMCH( 'Epsilon' )
RHOINV = ONE / RHO
+ TAU2= ZERO
*
* The case I = N
*
ELSE
TAU2 = ( A+SQRT( A*A+FOUR*B*C ) ) / ( TWO*C )
END IF
+ TAU = TAU2 / ( D( N )+SQRT( D( N )*D( N )+TAU2 ) )
END IF
*
* It can be proved that
ELSE
TAU2 = ( A+SQRT( A*A+FOUR*B*C ) ) / ( TWO*C )
END IF
+ TAU = TAU2 / ( D( N )+SQRT( D( N )*D( N )+TAU2 ) )
+
*
* It can be proved that
* D(N)^2 < D(N)^2+TAU2 < SIGMA(N)^2 < D(N)^2+RHO/2
*
* The following TAU is to approximate SIGMA_n - D( N )
*
- TAU = TAU2 / ( D( N )+SQRT( D( N )*D( N )+TAU2 ) )
+* TAU = TAU2 / ( D( N )+SQRT( D( N )*D( N )+TAU2 ) )
*
SIGMA = D( N ) + TAU
DO 30 J = 1, N
*
EPS = SLAMCH( 'Epsilon' )
RHOINV = ONE / RHO
+ TAU2= ZERO
*
* The case I = N
*
ELSE
TAU2 = ( A+SQRT( A*A+FOUR*B*C ) ) / ( TWO*C )
END IF
+ TAU = TAU2 / ( D( N )+SQRT( D( N )*D( N )+TAU2 ) )
END IF
*
* It can be proved that
ELSE
TAU2 = ( A+SQRT( A*A+FOUR*B*C ) ) / ( TWO*C )
END IF
+ TAU = TAU2 / ( D( N )+SQRT( D( N )*D( N )+TAU2 ) )
+
*
* It can be proved that
* D(N)^2 < D(N)^2+TAU2 < SIGMA(N)^2 < D(N)^2+RHO/2
*
* The following TAU is to approximate SIGMA_n - D( N )
*
- TAU = TAU2 / ( D( N )+SQRT( D( N )*D( N )+TAU2 ) )
+* TAU = TAU2 / ( D( N )+SQRT( D( N )*D( N )+TAU2 ) )
*
SIGMA = D( N ) + TAU
DO 30 J = 1, N