14 typedef long long BLASLONG;
15 typedef unsigned long long BLASULONG;
17 typedef long BLASLONG;
18 typedef unsigned long BLASULONG;
22 typedef BLASLONG blasint;
24 #define blasabs(x) llabs(x)
26 #define blasabs(x) labs(x)
30 #define blasabs(x) abs(x)
33 typedef blasint integer;
35 typedef unsigned int uinteger;
36 typedef char *address;
37 typedef short int shortint;
39 typedef double doublereal;
40 typedef struct { real r, i; } complex;
41 typedef struct { doublereal r, i; } doublecomplex;
43 static inline _Fcomplex Cf(complex *z) {_Fcomplex zz={z->r , z->i}; return zz;}
44 static inline _Dcomplex Cd(doublecomplex *z) {_Dcomplex zz={z->r , z->i};return zz;}
45 static inline _Fcomplex * _pCf(complex *z) {return (_Fcomplex*)z;}
46 static inline _Dcomplex * _pCd(doublecomplex *z) {return (_Dcomplex*)z;}
48 static inline _Complex float Cf(complex *z) {return z->r + z->i*_Complex_I;}
49 static inline _Complex double Cd(doublecomplex *z) {return z->r + z->i*_Complex_I;}
50 static inline _Complex float * _pCf(complex *z) {return (_Complex float*)z;}
51 static inline _Complex double * _pCd(doublecomplex *z) {return (_Complex double*)z;}
53 #define pCf(z) (*_pCf(z))
54 #define pCd(z) (*_pCd(z))
56 typedef short int shortlogical;
57 typedef char logical1;
58 typedef char integer1;
63 /* Extern is for use with -E */
74 /*external read, write*/
83 /*internal read, write*/
113 /*rewind, backspace, endfile*/
125 ftnint *inex; /*parameters in standard's order*/
151 union Multitype { /* for multiple entry points */
162 typedef union Multitype Multitype;
164 struct Vardesc { /* for Namelist */
170 typedef struct Vardesc Vardesc;
177 typedef struct Namelist Namelist;
179 #define abs(x) ((x) >= 0 ? (x) : -(x))
180 #define dabs(x) (fabs(x))
181 #define f2cmin(a,b) ((a) <= (b) ? (a) : (b))
182 #define f2cmax(a,b) ((a) >= (b) ? (a) : (b))
183 #define dmin(a,b) (f2cmin(a,b))
184 #define dmax(a,b) (f2cmax(a,b))
185 #define bit_test(a,b) ((a) >> (b) & 1)
186 #define bit_clear(a,b) ((a) & ~((uinteger)1 << (b)))
187 #define bit_set(a,b) ((a) | ((uinteger)1 << (b)))
189 #define abort_() { sig_die("Fortran abort routine called", 1); }
190 #define c_abs(z) (cabsf(Cf(z)))
191 #define c_cos(R,Z) { pCf(R)=ccos(Cf(Z)); }
193 #define c_div(c, a, b) {Cf(c)._Val[0] = (Cf(a)._Val[0]/Cf(b)._Val[0]); Cf(c)._Val[1]=(Cf(a)._Val[1]/Cf(b)._Val[1]);}
194 #define z_div(c, a, b) {Cd(c)._Val[0] = (Cd(a)._Val[0]/Cd(b)._Val[0]); Cd(c)._Val[1]=(Cd(a)._Val[1]/df(b)._Val[1]);}
196 #define c_div(c, a, b) {pCf(c) = Cf(a)/Cf(b);}
197 #define z_div(c, a, b) {pCd(c) = Cd(a)/Cd(b);}
199 #define c_exp(R, Z) {pCf(R) = cexpf(Cf(Z));}
200 #define c_log(R, Z) {pCf(R) = clogf(Cf(Z));}
201 #define c_sin(R, Z) {pCf(R) = csinf(Cf(Z));}
202 //#define c_sqrt(R, Z) {*(R) = csqrtf(Cf(Z));}
203 #define c_sqrt(R, Z) {pCf(R) = csqrtf(Cf(Z));}
204 #define d_abs(x) (fabs(*(x)))
205 #define d_acos(x) (acos(*(x)))
206 #define d_asin(x) (asin(*(x)))
207 #define d_atan(x) (atan(*(x)))
208 #define d_atn2(x, y) (atan2(*(x),*(y)))
209 #define d_cnjg(R, Z) { pCd(R) = conj(Cd(Z)); }
210 #define r_cnjg(R, Z) { pCf(R) = conjf(Cf(Z)); }
211 #define d_cos(x) (cos(*(x)))
212 #define d_cosh(x) (cosh(*(x)))
213 #define d_dim(__a, __b) ( *(__a) > *(__b) ? *(__a) - *(__b) : 0.0 )
214 #define d_exp(x) (exp(*(x)))
215 #define d_imag(z) (cimag(Cd(z)))
216 #define r_imag(z) (cimagf(Cf(z)))
217 #define d_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
218 #define r_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
219 #define d_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
220 #define r_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
221 #define d_log(x) (log(*(x)))
222 #define d_mod(x, y) (fmod(*(x), *(y)))
223 #define u_nint(__x) ((__x)>=0 ? floor((__x) + .5) : -floor(.5 - (__x)))
224 #define d_nint(x) u_nint(*(x))
225 #define u_sign(__a,__b) ((__b) >= 0 ? ((__a) >= 0 ? (__a) : -(__a)) : -((__a) >= 0 ? (__a) : -(__a)))
226 #define d_sign(a,b) u_sign(*(a),*(b))
227 #define r_sign(a,b) u_sign(*(a),*(b))
228 #define d_sin(x) (sin(*(x)))
229 #define d_sinh(x) (sinh(*(x)))
230 #define d_sqrt(x) (sqrt(*(x)))
231 #define d_tan(x) (tan(*(x)))
232 #define d_tanh(x) (tanh(*(x)))
233 #define i_abs(x) abs(*(x))
234 #define i_dnnt(x) ((integer)u_nint(*(x)))
235 #define i_len(s, n) (n)
236 #define i_nint(x) ((integer)u_nint(*(x)))
237 #define i_sign(a,b) ((integer)u_sign((integer)*(a),(integer)*(b)))
238 #define pow_dd(ap, bp) ( pow(*(ap), *(bp)))
239 #define pow_si(B,E) spow_ui(*(B),*(E))
240 #define pow_ri(B,E) spow_ui(*(B),*(E))
241 #define pow_di(B,E) dpow_ui(*(B),*(E))
242 #define pow_zi(p, a, b) {pCd(p) = zpow_ui(Cd(a), *(b));}
243 #define pow_ci(p, a, b) {pCf(p) = cpow_ui(Cf(a), *(b));}
244 #define pow_zz(R,A,B) {pCd(R) = cpow(Cd(A),*(B));}
245 #define s_cat(lpp, rpp, rnp, np, llp) { ftnlen i, nc, ll; char *f__rp, *lp; ll = (llp); lp = (lpp); for(i=0; i < (int)*(np); ++i) { nc = ll; if((rnp)[i] < nc) nc = (rnp)[i]; ll -= nc; f__rp = (rpp)[i]; while(--nc >= 0) *lp++ = *(f__rp)++; } while(--ll >= 0) *lp++ = ' '; }
246 #define s_cmp(a,b,c,d) ((integer)strncmp((a),(b),f2cmin((c),(d))))
247 #define s_copy(A,B,C,D) { int __i,__m; for (__i=0, __m=f2cmin((C),(D)); __i<__m && (B)[__i] != 0; ++__i) (A)[__i] = (B)[__i]; }
248 #define sig_die(s, kill) { exit(1); }
249 #define s_stop(s, n) {exit(0);}
250 static char junk[] = "\n@(#)LIBF77 VERSION 19990503\n";
251 #define z_abs(z) (cabs(Cd(z)))
252 #define z_exp(R, Z) {pCd(R) = cexp(Cd(Z));}
253 #define z_sqrt(R, Z) {pCd(R) = csqrt(Cd(Z));}
254 #define myexit_() break;
255 #define mycycle() continue;
256 #define myceiling(w) {ceil(w)}
257 #define myhuge(w) {HUGE_VAL}
258 //#define mymaxloc_(w,s,e,n) {if (sizeof(*(w)) == sizeof(double)) dmaxloc_((w),*(s),*(e),n); else dmaxloc_((w),*(s),*(e),n);}
259 #define mymaxloc(w,s,e,n) {dmaxloc_(w,*(s),*(e),n)}
261 /* procedure parameter types for -A and -C++ */
263 #define F2C_proc_par_types 1
265 typedef logical (*L_fp)(...);
267 typedef logical (*L_fp)();
270 static float spow_ui(float x, integer n) {
271 float pow=1.0; unsigned long int u;
273 if(n < 0) n = -n, x = 1/x;
282 static double dpow_ui(double x, integer n) {
283 double pow=1.0; unsigned long int u;
285 if(n < 0) n = -n, x = 1/x;
295 static _Fcomplex cpow_ui(complex x, integer n) {
296 complex pow={1.0,0.0}; unsigned long int u;
298 if(n < 0) n = -n, x.r = 1/x.r, x.i=1/x.i;
300 if(u & 01) pow.r *= x.r, pow.i *= x.i;
301 if(u >>= 1) x.r *= x.r, x.i *= x.i;
305 _Fcomplex p={pow.r, pow.i};
309 static _Complex float cpow_ui(_Complex float x, integer n) {
310 _Complex float pow=1.0; unsigned long int u;
312 if(n < 0) n = -n, x = 1/x;
323 static _Dcomplex zpow_ui(_Dcomplex x, integer n) {
324 _Dcomplex pow={1.0,0.0}; unsigned long int u;
326 if(n < 0) n = -n, x._Val[0] = 1/x._Val[0], x._Val[1] =1/x._Val[1];
328 if(u & 01) pow._Val[0] *= x._Val[0], pow._Val[1] *= x._Val[1];
329 if(u >>= 1) x._Val[0] *= x._Val[0], x._Val[1] *= x._Val[1];
333 _Dcomplex p = {pow._Val[0], pow._Val[1]};
337 static _Complex double zpow_ui(_Complex double x, integer n) {
338 _Complex double pow=1.0; unsigned long int u;
340 if(n < 0) n = -n, x = 1/x;
350 static integer pow_ii(integer x, integer n) {
351 integer pow; unsigned long int u;
353 if (n == 0 || x == 1) pow = 1;
354 else if (x != -1) pow = x == 0 ? 1/x : 0;
357 if ((n > 0) || !(n == 0 || x == 1 || x != -1)) {
367 static integer dmaxloc_(double *w, integer s, integer e, integer *n)
369 double m; integer i, mi;
370 for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
371 if (w[i-1]>m) mi=i ,m=w[i-1];
374 static integer smaxloc_(float *w, integer s, integer e, integer *n)
376 float m; integer i, mi;
377 for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
378 if (w[i-1]>m) mi=i ,m=w[i-1];
381 static inline void cdotc_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
382 integer n = *n_, incx = *incx_, incy = *incy_, i;
384 _Fcomplex zdotc = {0.0, 0.0};
385 if (incx == 1 && incy == 1) {
386 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
387 zdotc._Val[0] += conjf(Cf(&x[i]))._Val[0] * Cf(&y[i])._Val[0];
388 zdotc._Val[1] += conjf(Cf(&x[i]))._Val[1] * Cf(&y[i])._Val[1];
391 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
392 zdotc._Val[0] += conjf(Cf(&x[i*incx]))._Val[0] * Cf(&y[i*incy])._Val[0];
393 zdotc._Val[1] += conjf(Cf(&x[i*incx]))._Val[1] * Cf(&y[i*incy])._Val[1];
399 _Complex float zdotc = 0.0;
400 if (incx == 1 && incy == 1) {
401 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
402 zdotc += conjf(Cf(&x[i])) * Cf(&y[i]);
405 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
406 zdotc += conjf(Cf(&x[i*incx])) * Cf(&y[i*incy]);
412 static inline void zdotc_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
413 integer n = *n_, incx = *incx_, incy = *incy_, i;
415 _Dcomplex zdotc = {0.0, 0.0};
416 if (incx == 1 && incy == 1) {
417 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
418 zdotc._Val[0] += conj(Cd(&x[i]))._Val[0] * Cd(&y[i])._Val[0];
419 zdotc._Val[1] += conj(Cd(&x[i]))._Val[1] * Cd(&y[i])._Val[1];
422 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
423 zdotc._Val[0] += conj(Cd(&x[i*incx]))._Val[0] * Cd(&y[i*incy])._Val[0];
424 zdotc._Val[1] += conj(Cd(&x[i*incx]))._Val[1] * Cd(&y[i*incy])._Val[1];
430 _Complex double zdotc = 0.0;
431 if (incx == 1 && incy == 1) {
432 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
433 zdotc += conj(Cd(&x[i])) * Cd(&y[i]);
436 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
437 zdotc += conj(Cd(&x[i*incx])) * Cd(&y[i*incy]);
443 static inline void cdotu_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
444 integer n = *n_, incx = *incx_, incy = *incy_, i;
446 _Fcomplex zdotc = {0.0, 0.0};
447 if (incx == 1 && incy == 1) {
448 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
449 zdotc._Val[0] += Cf(&x[i])._Val[0] * Cf(&y[i])._Val[0];
450 zdotc._Val[1] += Cf(&x[i])._Val[1] * Cf(&y[i])._Val[1];
453 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
454 zdotc._Val[0] += Cf(&x[i*incx])._Val[0] * Cf(&y[i*incy])._Val[0];
455 zdotc._Val[1] += Cf(&x[i*incx])._Val[1] * Cf(&y[i*incy])._Val[1];
461 _Complex float zdotc = 0.0;
462 if (incx == 1 && incy == 1) {
463 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
464 zdotc += Cf(&x[i]) * Cf(&y[i]);
467 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
468 zdotc += Cf(&x[i*incx]) * Cf(&y[i*incy]);
474 static inline void zdotu_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
475 integer n = *n_, incx = *incx_, incy = *incy_, i;
477 _Dcomplex zdotc = {0.0, 0.0};
478 if (incx == 1 && incy == 1) {
479 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
480 zdotc._Val[0] += Cd(&x[i])._Val[0] * Cd(&y[i])._Val[0];
481 zdotc._Val[1] += Cd(&x[i])._Val[1] * Cd(&y[i])._Val[1];
484 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
485 zdotc._Val[0] += Cd(&x[i*incx])._Val[0] * Cd(&y[i*incy])._Val[0];
486 zdotc._Val[1] += Cd(&x[i*incx])._Val[1] * Cd(&y[i*incy])._Val[1];
492 _Complex double zdotc = 0.0;
493 if (incx == 1 && incy == 1) {
494 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
495 zdotc += Cd(&x[i]) * Cd(&y[i]);
498 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
499 zdotc += Cd(&x[i*incx]) * Cd(&y[i*incy]);
505 /* -- translated by f2c (version 20000121).
506 You must link the resulting object file with the libraries:
507 -lf2c -lm (in that order)
513 /* > \brief \b SLASQ4 computes an approximation to the smallest eigenvalue using values of d from the previous
514 transform. Used by sbdsqr. */
516 /* =========== DOCUMENTATION =========== */
518 /* Online html documentation available at */
519 /* http://www.netlib.org/lapack/explore-html/ */
522 /* > Download SLASQ4 + dependencies */
523 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/slasq4.
526 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/slasq4.
529 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/slasq4.
537 /* SUBROUTINE SLASQ4( I0, N0, Z, PP, N0IN, DMIN, DMIN1, DMIN2, DN, */
538 /* DN1, DN2, TAU, TTYPE, G ) */
540 /* INTEGER I0, N0, N0IN, PP, TTYPE */
541 /* REAL DMIN, DMIN1, DMIN2, DN, DN1, DN2, G, TAU */
545 /* > \par Purpose: */
550 /* > SLASQ4 computes an approximation TAU to the smallest eigenvalue */
551 /* > using values of d from the previous transform. */
557 /* > \param[in] I0 */
559 /* > I0 is INTEGER */
563 /* > \param[in] N0 */
565 /* > N0 is INTEGER */
571 /* > Z is REAL array, dimension ( 4*N0 ) */
572 /* > Z holds the qd array. */
575 /* > \param[in] PP */
577 /* > PP is INTEGER */
578 /* > PP=0 for ping, PP=1 for pong. */
581 /* > \param[in] N0IN */
583 /* > N0IN is INTEGER */
584 /* > The value of N0 at start of EIGTEST. */
587 /* > \param[in] DMIN */
590 /* > Minimum value of d. */
593 /* > \param[in] DMIN1 */
595 /* > DMIN1 is REAL */
596 /* > Minimum value of d, excluding D( N0 ). */
599 /* > \param[in] DMIN2 */
601 /* > DMIN2 is REAL */
602 /* > Minimum value of d, excluding D( N0 ) and D( N0-1 ). */
605 /* > \param[in] DN */
611 /* > \param[in] DN1 */
617 /* > \param[in] DN2 */
623 /* > \param[out] TAU */
626 /* > This is the shift. */
629 /* > \param[out] TTYPE */
631 /* > TTYPE is INTEGER */
635 /* > \param[in,out] G */
638 /* > G is passed as an argument in order to save its value between */
639 /* > calls to SLASQ4. */
645 /* > \author Univ. of Tennessee */
646 /* > \author Univ. of California Berkeley */
647 /* > \author Univ. of Colorado Denver */
648 /* > \author NAG Ltd. */
650 /* > \date June 2016 */
652 /* > \ingroup auxOTHERcomputational */
654 /* > \par Further Details: */
655 /* ===================== */
662 /* ===================================================================== */
663 /* Subroutine */ int slasq4_(integer *i0, integer *n0, real *z__, integer *pp,
664 integer *n0in, real *dmin__, real *dmin1, real *dmin2, real *dn,
665 real *dn1, real *dn2, real *tau, integer *ttype, real *g)
667 /* System generated locals */
671 /* Local variables */
674 real gam, gap1, gap2;
677 /* -- LAPACK computational routine (version 3.7.1) -- */
678 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
679 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
683 /* ===================================================================== */
686 /* A negative DMIN forces the shift to take that absolute value */
687 /* TTYPE records the type of shift. */
689 /* Parameter adjustments */
693 if (*dmin__ <= 0.f) {
699 nn = (*n0 << 2) + *pp;
702 /* No eigenvalues deflated. */
704 if (*dmin__ == *dn || *dmin__ == *dn1) {
706 b1 = sqrt(z__[nn - 3]) * sqrt(z__[nn - 5]);
707 b2 = sqrt(z__[nn - 7]) * sqrt(z__[nn - 9]);
708 a2 = z__[nn - 7] + z__[nn - 5];
712 if (*dmin__ == *dn && *dmin1 == *dn1) {
713 gap2 = *dmin2 - a2 - *dmin2 * .25f;
714 if (gap2 > 0.f && gap2 > b2) {
715 gap1 = a2 - *dn - b2 / gap2 * b2;
717 gap1 = a2 - *dn - (b1 + b2);
719 if (gap1 > 0.f && gap1 > b1) {
721 r__1 = *dn - b1 / gap1 * b1, r__2 = *dmin__ * .5f;
722 s = f2cmax(r__1,r__2);
731 r__1 = s, r__2 = a2 - (b1 + b2);
732 s = f2cmin(r__1,r__2);
735 r__1 = s, r__2 = *dmin__ * .333f;
736 s = f2cmax(r__1,r__2);
745 if (*dmin__ == *dn) {
748 if (z__[nn - 5] > z__[nn - 7]) {
751 b2 = z__[nn - 5] / z__[nn - 7];
754 np = nn - (*pp << 1);
756 if (z__[np - 4] > z__[np - 2]) {
759 a2 = z__[np - 4] / z__[np - 2];
760 if (z__[nn - 9] > z__[nn - 11]) {
763 b2 = z__[nn - 9] / z__[nn - 11];
767 /* Approximate contribution to norm squared from I < NN-1. */
770 i__1 = (*i0 << 2) - 1 + *pp;
771 for (i4 = np; i4 >= i__1; i4 += -4) {
776 if (z__[i4] > z__[i4 - 2]) {
779 b2 *= z__[i4] / z__[i4 - 2];
781 if (f2cmax(b2,b1) * 100.f < a2 || .563f < a2) {
789 /* Rayleigh quotient residual bound. */
792 s = gam * (1.f - sqrt(a2)) / (a2 + 1.f);
795 } else if (*dmin__ == *dn2) {
802 /* Compute contribution to norm squared from I > NN-2. */
804 np = nn - (*pp << 1);
808 if (z__[np - 8] > b2 || z__[np - 4] > b1) {
811 a2 = z__[np - 8] / b2 * (z__[np - 4] / b1 + 1.f);
813 /* Approximate contribution to norm squared from I < NN-2. */
816 b2 = z__[nn - 13] / z__[nn - 15];
818 i__1 = (*i0 << 2) - 1 + *pp;
819 for (i4 = nn - 17; i4 >= i__1; i4 += -4) {
824 if (z__[i4] > z__[i4 - 2]) {
827 b2 *= z__[i4] / z__[i4 - 2];
829 if (f2cmax(b2,b1) * 100.f < a2 || .563f < a2) {
839 s = gam * (1.f - sqrt(a2)) / (a2 + 1.f);
843 /* Case 6, no information to guide us. */
846 *g += (1.f - *g) * .333f;
847 } else if (*ttype == -18) {
848 *g = .083250000000000005f;
856 } else if (*n0in == *n0 + 1) {
858 /* One eigenvalue just deflated. Use DMIN1, DN1 for DMIN and DN. */
860 if (*dmin1 == *dn1 && *dmin2 == *dn2) {
866 if (z__[nn - 5] > z__[nn - 7]) {
869 b1 = z__[nn - 5] / z__[nn - 7];
874 i__1 = (*i0 << 2) - 1 + *pp;
875 for (i4 = (*n0 << 2) - 9 + *pp; i4 >= i__1; i4 += -4) {
877 if (z__[i4] > z__[i4 - 2]) {
880 b1 *= z__[i4] / z__[i4 - 2];
882 if (f2cmax(b1,a2) * 100.f < b2) {
888 b2 = sqrt(b2 * 1.05f);
889 /* Computing 2nd power */
891 a2 = *dmin1 / (r__1 * r__1 + 1.f);
892 gap2 = *dmin2 * .5f - a2;
893 if (gap2 > 0.f && gap2 > b2 * a2) {
895 r__1 = s, r__2 = a2 * (1.f - a2 * 1.01f * (b2 / gap2) * b2);
896 s = f2cmax(r__1,r__2);
899 r__1 = s, r__2 = a2 * (1.f - b2 * 1.01f);
900 s = f2cmax(r__1,r__2);
908 if (*dmin1 == *dn1) {
914 } else if (*n0in == *n0 + 2) {
916 /* Two eigenvalues deflated. Use DMIN2, DN2 for DMIN and DN. */
918 /* Cases 10 and 11. */
920 if (*dmin2 == *dn2 && z__[nn - 5] * 2.f < z__[nn - 7]) {
923 if (z__[nn - 5] > z__[nn - 7]) {
926 b1 = z__[nn - 5] / z__[nn - 7];
931 i__1 = (*i0 << 2) - 1 + *pp;
932 for (i4 = (*n0 << 2) - 9 + *pp; i4 >= i__1; i4 += -4) {
933 if (z__[i4] > z__[i4 - 2]) {
936 b1 *= z__[i4] / z__[i4 - 2];
938 if (b1 * 100.f < b2) {
944 b2 = sqrt(b2 * 1.05f);
945 /* Computing 2nd power */
947 a2 = *dmin2 / (r__1 * r__1 + 1.f);
948 gap2 = z__[nn - 7] + z__[nn - 9] - sqrt(z__[nn - 11]) * sqrt(z__[
950 if (gap2 > 0.f && gap2 > b2 * a2) {
952 r__1 = s, r__2 = a2 * (1.f - a2 * 1.01f * (b2 / gap2) * b2);
953 s = f2cmax(r__1,r__2);
956 r__1 = s, r__2 = a2 * (1.f - b2 * 1.01f);
957 s = f2cmax(r__1,r__2);
963 } else if (*n0in > *n0 + 2) {
965 /* Case 12, more than two eigenvalues deflated. No information. */