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 /* Table of constant values */
515 static integer c__1 = 1;
517 /* > \brief \b CLAIC1 applies one step of incremental condition estimation. */
519 /* =========== DOCUMENTATION =========== */
521 /* Online html documentation available at */
522 /* http://www.netlib.org/lapack/explore-html/ */
525 /* > Download CLAIC1 + dependencies */
526 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/claic1.
529 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/claic1.
532 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/claic1.
540 /* SUBROUTINE CLAIC1( JOB, J, X, SEST, W, GAMMA, SESTPR, S, C ) */
543 /* REAL SEST, SESTPR */
544 /* COMPLEX C, GAMMA, S */
545 /* COMPLEX W( J ), X( J ) */
548 /* > \par Purpose: */
553 /* > CLAIC1 applies one step of incremental condition estimation in */
554 /* > its simplest version: */
556 /* > Let x, twonorm(x) = 1, be an approximate singular vector of an j-by-j */
557 /* > lower triangular matrix L, such that */
558 /* > twonorm(L*x) = sest */
559 /* > Then CLAIC1 computes sestpr, s, c such that */
563 /* > is an approximate singular vector of */
565 /* > Lhat = [ w**H gamma ] */
566 /* > in the sense that */
567 /* > twonorm(Lhat*xhat) = sestpr. */
569 /* > Depending on JOB, an estimate for the largest or smallest singular */
570 /* > value is computed. */
572 /* > Note that [s c]**H and sestpr**2 is an eigenpair of the system */
574 /* > diag(sest*sest, 0) + [alpha gamma] * [ conjg(alpha) ] */
575 /* > [ conjg(gamma) ] */
577 /* > where alpha = x**H*w. */
583 /* > \param[in] JOB */
585 /* > JOB is INTEGER */
586 /* > = 1: an estimate for the largest singular value is computed. */
587 /* > = 2: an estimate for the smallest singular value is computed. */
593 /* > Length of X and W */
598 /* > X is COMPLEX array, dimension (J) */
599 /* > The j-vector x. */
602 /* > \param[in] SEST */
605 /* > Estimated singular value of j by j matrix L */
610 /* > W is COMPLEX array, dimension (J) */
611 /* > The j-vector w. */
614 /* > \param[in] GAMMA */
616 /* > GAMMA is COMPLEX */
617 /* > The diagonal element gamma. */
620 /* > \param[out] SESTPR */
622 /* > SESTPR is REAL */
623 /* > Estimated singular value of (j+1) by (j+1) matrix Lhat. */
626 /* > \param[out] S */
629 /* > Sine needed in forming xhat. */
632 /* > \param[out] C */
635 /* > Cosine needed in forming xhat. */
641 /* > \author Univ. of Tennessee */
642 /* > \author Univ. of California Berkeley */
643 /* > \author Univ. of Colorado Denver */
644 /* > \author NAG Ltd. */
646 /* > \date December 2016 */
648 /* > \ingroup complexOTHERauxiliary */
650 /* ===================================================================== */
651 /* Subroutine */ int claic1_(integer *job, integer *j, complex *x, real *sest,
652 complex *w, complex *gamma, real *sestpr, complex *s, complex *c__)
654 /* System generated locals */
656 complex q__1, q__2, q__3, q__4, q__5, q__6;
658 /* Local variables */
660 real test, zeta1, zeta2, b, t;
662 extern /* Complex */ VOID cdotc_(complex *, integer *, complex *, integer
663 *, complex *, integer *);
664 real norma, s1, s2, absgam, absalp;
665 extern real slamch_(char *);
667 real absest, scl, eps, tmp;
670 /* -- LAPACK auxiliary routine (version 3.7.0) -- */
671 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
672 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
676 /* ===================================================================== */
679 /* Parameter adjustments */
684 eps = slamch_("Epsilon");
685 cdotc_(&q__1, j, &x[1], &c__1, &w[1], &c__1);
686 alpha.r = q__1.r, alpha.i = q__1.i;
688 absalp = c_abs(&alpha);
689 absgam = c_abs(gamma);
694 /* Estimating largest singular value */
699 s1 = f2cmax(absgam,absalp);
701 s->r = 0.f, s->i = 0.f;
702 c__->r = 1.f, c__->i = 0.f;
705 q__1.r = alpha.r / s1, q__1.i = alpha.i / s1;
706 s->r = q__1.r, s->i = q__1.i;
707 q__1.r = gamma->r / s1, q__1.i = gamma->i / s1;
708 c__->r = q__1.r, c__->i = q__1.i;
710 q__3.r = s->r * q__4.r - s->i * q__4.i, q__3.i = s->r *
711 q__4.i + s->i * q__4.r;
713 q__5.r = c__->r * q__6.r - c__->i * q__6.i, q__5.i = c__->r *
714 q__6.i + c__->i * q__6.r;
715 q__2.r = q__3.r + q__5.r, q__2.i = q__3.i + q__5.i;
716 c_sqrt(&q__1, &q__2);
718 q__1.r = s->r / tmp, q__1.i = s->i / tmp;
719 s->r = q__1.r, s->i = q__1.i;
720 q__1.r = c__->r / tmp, q__1.i = c__->i / tmp;
721 c__->r = q__1.r, c__->i = q__1.i;
725 } else if (absgam <= eps * absest) {
726 s->r = 1.f, s->i = 0.f;
727 c__->r = 0.f, c__->i = 0.f;
728 tmp = f2cmax(absest,absalp);
731 *sestpr = tmp * sqrt(s1 * s1 + s2 * s2);
733 } else if (absalp <= eps * absest) {
737 s->r = 1.f, s->i = 0.f;
738 c__->r = 0.f, c__->i = 0.f;
741 s->r = 0.f, s->i = 0.f;
742 c__->r = 1.f, c__->i = 0.f;
746 } else if (absest <= eps * absalp || absest <= eps * absgam) {
751 scl = sqrt(tmp * tmp + 1.f);
753 q__2.r = alpha.r / s2, q__2.i = alpha.i / s2;
754 q__1.r = q__2.r / scl, q__1.i = q__2.i / scl;
755 s->r = q__1.r, s->i = q__1.i;
756 q__2.r = gamma->r / s2, q__2.i = gamma->i / s2;
757 q__1.r = q__2.r / scl, q__1.i = q__2.i / scl;
758 c__->r = q__1.r, c__->i = q__1.i;
761 scl = sqrt(tmp * tmp + 1.f);
763 q__2.r = alpha.r / s1, q__2.i = alpha.i / s1;
764 q__1.r = q__2.r / scl, q__1.i = q__2.i / scl;
765 s->r = q__1.r, s->i = q__1.i;
766 q__2.r = gamma->r / s1, q__2.i = gamma->i / s1;
767 q__1.r = q__2.r / scl, q__1.i = q__2.i / scl;
768 c__->r = q__1.r, c__->i = q__1.i;
775 zeta1 = absalp / absest;
776 zeta2 = absgam / absest;
778 b = (1.f - zeta1 * zeta1 - zeta2 * zeta2) * .5f;
779 r__1 = zeta1 * zeta1;
780 c__->r = r__1, c__->i = 0.f;
783 q__4.r = r__1 + c__->r, q__4.i = c__->i;
784 c_sqrt(&q__3, &q__4);
785 q__2.r = b + q__3.r, q__2.i = q__3.i;
786 c_div(&q__1, c__, &q__2);
790 q__3.r = r__1 + c__->r, q__3.i = c__->i;
791 c_sqrt(&q__2, &q__3);
792 q__1.r = q__2.r - b, q__1.i = q__2.i;
796 q__3.r = alpha.r / absest, q__3.i = alpha.i / absest;
797 q__2.r = -q__3.r, q__2.i = -q__3.i;
798 q__1.r = q__2.r / t, q__1.i = q__2.i / t;
799 sine.r = q__1.r, sine.i = q__1.i;
800 q__3.r = gamma->r / absest, q__3.i = gamma->i / absest;
801 q__2.r = -q__3.r, q__2.i = -q__3.i;
803 q__1.r = q__2.r / r__1, q__1.i = q__2.i / r__1;
804 cosine.r = q__1.r, cosine.i = q__1.i;
805 r_cnjg(&q__4, &sine);
806 q__3.r = sine.r * q__4.r - sine.i * q__4.i, q__3.i = sine.r *
807 q__4.i + sine.i * q__4.r;
808 r_cnjg(&q__6, &cosine);
809 q__5.r = cosine.r * q__6.r - cosine.i * q__6.i, q__5.i = cosine.r
810 * q__6.i + cosine.i * q__6.r;
811 q__2.r = q__3.r + q__5.r, q__2.i = q__3.i + q__5.i;
812 c_sqrt(&q__1, &q__2);
814 q__1.r = sine.r / tmp, q__1.i = sine.i / tmp;
815 s->r = q__1.r, s->i = q__1.i;
816 q__1.r = cosine.r / tmp, q__1.i = cosine.i / tmp;
817 c__->r = q__1.r, c__->i = q__1.i;
818 *sestpr = sqrt(t + 1.f) * absest;
822 } else if (*job == 2) {
824 /* Estimating smallest singular value */
830 if (f2cmax(absgam,absalp) == 0.f) {
831 sine.r = 1.f, sine.i = 0.f;
832 cosine.r = 0.f, cosine.i = 0.f;
834 r_cnjg(&q__2, gamma);
835 q__1.r = -q__2.r, q__1.i = -q__2.i;
836 sine.r = q__1.r, sine.i = q__1.i;
837 r_cnjg(&q__1, &alpha);
838 cosine.r = q__1.r, cosine.i = q__1.i;
841 r__1 = c_abs(&sine), r__2 = c_abs(&cosine);
842 s1 = f2cmax(r__1,r__2);
843 q__1.r = sine.r / s1, q__1.i = sine.i / s1;
844 s->r = q__1.r, s->i = q__1.i;
845 q__1.r = cosine.r / s1, q__1.i = cosine.i / s1;
846 c__->r = q__1.r, c__->i = q__1.i;
848 q__3.r = s->r * q__4.r - s->i * q__4.i, q__3.i = s->r * q__4.i +
851 q__5.r = c__->r * q__6.r - c__->i * q__6.i, q__5.i = c__->r *
852 q__6.i + c__->i * q__6.r;
853 q__2.r = q__3.r + q__5.r, q__2.i = q__3.i + q__5.i;
854 c_sqrt(&q__1, &q__2);
856 q__1.r = s->r / tmp, q__1.i = s->i / tmp;
857 s->r = q__1.r, s->i = q__1.i;
858 q__1.r = c__->r / tmp, q__1.i = c__->i / tmp;
859 c__->r = q__1.r, c__->i = q__1.i;
861 } else if (absgam <= eps * absest) {
862 s->r = 0.f, s->i = 0.f;
863 c__->r = 1.f, c__->i = 0.f;
866 } else if (absalp <= eps * absest) {
870 s->r = 0.f, s->i = 0.f;
871 c__->r = 1.f, c__->i = 0.f;
874 s->r = 1.f, s->i = 0.f;
875 c__->r = 0.f, c__->i = 0.f;
879 } else if (absest <= eps * absalp || absest <= eps * absgam) {
884 scl = sqrt(tmp * tmp + 1.f);
885 *sestpr = absest * (tmp / scl);
886 r_cnjg(&q__4, gamma);
887 q__3.r = q__4.r / s2, q__3.i = q__4.i / s2;
888 q__2.r = -q__3.r, q__2.i = -q__3.i;
889 q__1.r = q__2.r / scl, q__1.i = q__2.i / scl;
890 s->r = q__1.r, s->i = q__1.i;
891 r_cnjg(&q__3, &alpha);
892 q__2.r = q__3.r / s2, q__2.i = q__3.i / s2;
893 q__1.r = q__2.r / scl, q__1.i = q__2.i / scl;
894 c__->r = q__1.r, c__->i = q__1.i;
897 scl = sqrt(tmp * tmp + 1.f);
898 *sestpr = absest / scl;
899 r_cnjg(&q__4, gamma);
900 q__3.r = q__4.r / s1, q__3.i = q__4.i / s1;
901 q__2.r = -q__3.r, q__2.i = -q__3.i;
902 q__1.r = q__2.r / scl, q__1.i = q__2.i / scl;
903 s->r = q__1.r, s->i = q__1.i;
904 r_cnjg(&q__3, &alpha);
905 q__2.r = q__3.r / s1, q__2.i = q__3.i / s1;
906 q__1.r = q__2.r / scl, q__1.i = q__2.i / scl;
907 c__->r = q__1.r, c__->i = q__1.i;
914 zeta1 = absalp / absest;
915 zeta2 = absgam / absest;
918 r__1 = zeta1 * zeta1 + 1.f + zeta1 * zeta2, r__2 = zeta1 * zeta2
920 norma = f2cmax(r__1,r__2);
922 /* See if root is closer to zero or to ONE */
924 test = (zeta1 - zeta2) * 2.f * (zeta1 + zeta2) + 1.f;
927 /* root is close to zero, compute directly */
929 b = (zeta1 * zeta1 + zeta2 * zeta2 + 1.f) * .5f;
930 r__1 = zeta2 * zeta2;
931 c__->r = r__1, c__->i = 0.f;
933 q__2.r = r__2 - c__->r, q__2.i = -c__->i;
934 r__1 = b + sqrt(c_abs(&q__2));
935 q__1.r = c__->r / r__1, q__1.i = c__->i / r__1;
937 q__2.r = alpha.r / absest, q__2.i = alpha.i / absest;
939 q__1.r = q__2.r / r__1, q__1.i = q__2.i / r__1;
940 sine.r = q__1.r, sine.i = q__1.i;
941 q__3.r = gamma->r / absest, q__3.i = gamma->i / absest;
942 q__2.r = -q__3.r, q__2.i = -q__3.i;
943 q__1.r = q__2.r / t, q__1.i = q__2.i / t;
944 cosine.r = q__1.r, cosine.i = q__1.i;
945 *sestpr = sqrt(t + eps * 4.f * eps * norma) * absest;
948 /* root is closer to ONE, shift by that amount */
950 b = (zeta2 * zeta2 + zeta1 * zeta1 - 1.f) * .5f;
951 r__1 = zeta1 * zeta1;
952 c__->r = r__1, c__->i = 0.f;
954 q__2.r = -c__->r, q__2.i = -c__->i;
956 q__5.r = r__1 + c__->r, q__5.i = c__->i;
957 c_sqrt(&q__4, &q__5);
958 q__3.r = b + q__4.r, q__3.i = q__4.i;
959 c_div(&q__1, &q__2, &q__3);
963 q__3.r = r__1 + c__->r, q__3.i = c__->i;
964 c_sqrt(&q__2, &q__3);
965 q__1.r = b - q__2.r, q__1.i = -q__2.i;
968 q__3.r = alpha.r / absest, q__3.i = alpha.i / absest;
969 q__2.r = -q__3.r, q__2.i = -q__3.i;
970 q__1.r = q__2.r / t, q__1.i = q__2.i / t;
971 sine.r = q__1.r, sine.i = q__1.i;
972 q__3.r = gamma->r / absest, q__3.i = gamma->i / absest;
973 q__2.r = -q__3.r, q__2.i = -q__3.i;
975 q__1.r = q__2.r / r__1, q__1.i = q__2.i / r__1;
976 cosine.r = q__1.r, cosine.i = q__1.i;
977 *sestpr = sqrt(t + 1.f + eps * 4.f * eps * norma) * absest;
979 r_cnjg(&q__4, &sine);
980 q__3.r = sine.r * q__4.r - sine.i * q__4.i, q__3.i = sine.r *
981 q__4.i + sine.i * q__4.r;
982 r_cnjg(&q__6, &cosine);
983 q__5.r = cosine.r * q__6.r - cosine.i * q__6.i, q__5.i = cosine.r
984 * q__6.i + cosine.i * q__6.r;
985 q__2.r = q__3.r + q__5.r, q__2.i = q__3.i + q__5.i;
986 c_sqrt(&q__1, &q__2);
988 q__1.r = sine.r / tmp, q__1.i = sine.i / tmp;
989 s->r = q__1.r, s->i = q__1.i;
990 q__1.r = cosine.r / tmp, q__1.i = cosine.i / tmp;
991 c__->r = q__1.r, c__->i = q__1.i;