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)
511 /* -- translated by f2c (version 20000121).
512 You must link the resulting object file with the libraries:
513 -lf2c -lm (in that order)
518 /* -- translated by f2c (version 20000121).
519 You must link the resulting object file with the libraries:
520 -lf2c -lm (in that order)
525 /* > \brief \b CGBEQUB */
527 /* =========== DOCUMENTATION =========== */
529 /* Online html documentation available at */
530 /* http://www.netlib.org/lapack/explore-html/ */
533 /* > Download CGBEQUB + dependencies */
534 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/cgbequb
537 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/cgbequb
540 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/cgbequb
548 /* SUBROUTINE CGBEQUB( M, N, KL, KU, AB, LDAB, R, C, ROWCND, COLCND, */
551 /* INTEGER INFO, KL, KU, LDAB, M, N */
552 /* REAL AMAX, COLCND, ROWCND */
553 /* REAL C( * ), R( * ) */
554 /* COMPLEX AB( LDAB, * ) */
557 /* > \par Purpose: */
562 /* > CGBEQUB computes row and column scalings intended to equilibrate an */
563 /* > M-by-N matrix A and reduce its condition number. R returns the row */
564 /* > scale factors and C the column scale factors, chosen to try to make */
565 /* > the largest element in each row and column of the matrix B with */
566 /* > elements B(i,j)=R(i)*A(i,j)*C(j) have an absolute value of at most */
569 /* > R(i) and C(j) are restricted to be a power of the radix between */
570 /* > SMLNUM = smallest safe number and BIGNUM = largest safe number. Use */
571 /* > of these scaling factors is not guaranteed to reduce the condition */
572 /* > number of A but works well in practice. */
574 /* > This routine differs from CGEEQU by restricting the scaling factors */
575 /* > to a power of the radix. Barring over- and underflow, scaling by */
576 /* > these factors introduces no additional rounding errors. However, the */
577 /* > scaled entries' magnitudes are no longer approximately 1 but lie */
578 /* > between sqrt(radix) and 1/sqrt(radix). */
587 /* > The number of rows of the matrix A. M >= 0. */
593 /* > The number of columns of the matrix A. N >= 0. */
596 /* > \param[in] KL */
598 /* > KL is INTEGER */
599 /* > The number of subdiagonals within the band of A. KL >= 0. */
602 /* > \param[in] KU */
604 /* > KU is INTEGER */
605 /* > The number of superdiagonals within the band of A. KU >= 0. */
608 /* > \param[in] AB */
610 /* > AB is COMPLEX array, dimension (LDAB,N) */
611 /* > On entry, the matrix A in band storage, in rows 1 to KL+KU+1. */
612 /* > The j-th column of A is stored in the j-th column of the */
613 /* > array AB as follows: */
614 /* > AB(KU+1+i-j,j) = A(i,j) for f2cmax(1,j-KU)<=i<=f2cmin(N,j+kl) */
617 /* > \param[in] LDAB */
619 /* > LDAB is INTEGER */
620 /* > The leading dimension of the array A. LDAB >= f2cmax(1,M). */
623 /* > \param[out] R */
625 /* > R is REAL array, dimension (M) */
626 /* > If INFO = 0 or INFO > M, R contains the row scale factors */
630 /* > \param[out] C */
632 /* > C is REAL array, dimension (N) */
633 /* > If INFO = 0, C contains the column scale factors for A. */
636 /* > \param[out] ROWCND */
638 /* > ROWCND is REAL */
639 /* > If INFO = 0 or INFO > M, ROWCND contains the ratio of the */
640 /* > smallest R(i) to the largest R(i). If ROWCND >= 0.1 and */
641 /* > AMAX is neither too large nor too small, it is not worth */
642 /* > scaling by R. */
645 /* > \param[out] COLCND */
647 /* > COLCND is REAL */
648 /* > If INFO = 0, COLCND contains the ratio of the smallest */
649 /* > C(i) to the largest C(i). If COLCND >= 0.1, it is not */
650 /* > worth scaling by C. */
653 /* > \param[out] AMAX */
656 /* > Absolute value of largest matrix element. If AMAX is very */
657 /* > close to overflow or very close to underflow, the matrix */
658 /* > should be scaled. */
661 /* > \param[out] INFO */
663 /* > INFO is INTEGER */
664 /* > = 0: successful exit */
665 /* > < 0: if INFO = -i, the i-th argument had an illegal value */
666 /* > > 0: if INFO = i, and i is */
667 /* > <= M: the i-th row of A is exactly zero */
668 /* > > M: the (i-M)-th column of A is exactly zero */
674 /* > \author Univ. of Tennessee */
675 /* > \author Univ. of California Berkeley */
676 /* > \author Univ. of Colorado Denver */
677 /* > \author NAG Ltd. */
679 /* > \date June 2016 */
681 /* > \ingroup complexGBcomputational */
683 /* ===================================================================== */
684 /* Subroutine */ int cgbequb_(integer *m, integer *n, integer *kl, integer *
685 ku, complex *ab, integer *ldab, real *r__, real *c__, real *rowcnd,
686 real *colcnd, real *amax, integer *info)
688 /* System generated locals */
689 integer ab_dim1, ab_offset, i__1, i__2, i__3, i__4;
690 real r__1, r__2, r__3, r__4;
692 /* Local variables */
694 real radix, rcmin, rcmax;
696 extern real slamch_(char *);
697 extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
698 real bignum, logrdx, smlnum;
701 /* -- LAPACK computational routine (version 3.7.0) -- */
702 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
703 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
707 /* ===================================================================== */
710 /* Test the input parameters. */
712 /* Parameter adjustments */
714 ab_offset = 1 + ab_dim1 * 1;
725 } else if (*kl < 0) {
727 } else if (*ku < 0) {
729 } else if (*ldab < *kl + *ku + 1) {
734 xerbla_("CGBEQUB", &i__1, (ftnlen)7);
738 /* Quick return if possible. */
740 if (*m == 0 || *n == 0) {
747 /* Get machine constants. Assume SMLNUM is a power of the radix. */
749 smlnum = slamch_("S");
750 bignum = 1.f / smlnum;
751 radix = slamch_("B");
754 /* Compute row scale factors. */
757 for (i__ = 1; i__ <= i__1; ++i__) {
762 /* Find the maximum element in each row. */
766 for (j = 1; j <= i__1; ++j) {
771 i__3 = f2cmin(i__4,*m);
772 for (i__ = f2cmax(i__2,1); i__ <= i__3; ++i__) {
774 i__2 = kd + i__ - j + j * ab_dim1;
775 r__3 = r__[i__], r__4 = (r__1 = ab[i__2].r, abs(r__1)) + (r__2 =
776 r_imag(&ab[kd + i__ - j + j * ab_dim1]), abs(r__2));
777 r__[i__] = f2cmax(r__3,r__4);
783 for (i__ = 1; i__ <= i__1; ++i__) {
784 if (r__[i__] > 0.f) {
785 i__3 = (integer) (log(r__[i__]) / logrdx);
786 r__[i__] = pow_ri(&radix, &i__3);
790 /* Find the maximum and minimum scale factors. */
795 for (i__ = 1; i__ <= i__1; ++i__) {
797 r__1 = rcmax, r__2 = r__[i__];
798 rcmax = f2cmax(r__1,r__2);
800 r__1 = rcmin, r__2 = r__[i__];
801 rcmin = f2cmin(r__1,r__2);
808 /* Find the first zero scale factor and return an error code. */
811 for (i__ = 1; i__ <= i__1; ++i__) {
812 if (r__[i__] == 0.f) {
820 /* Invert the scale factors. */
823 for (i__ = 1; i__ <= i__1; ++i__) {
827 r__1 = f2cmax(r__2,smlnum);
828 r__[i__] = 1.f / f2cmin(r__1,bignum);
832 /* Compute ROWCND = f2cmin(R(I)) / f2cmax(R(I)). */
834 *rowcnd = f2cmax(rcmin,smlnum) / f2cmin(rcmax,bignum);
837 /* Compute column scale factors. */
840 for (j = 1; j <= i__1; ++j) {
845 /* Find the maximum element in each column, */
846 /* assuming the row scaling computed above. */
849 for (j = 1; j <= i__1; ++j) {
854 i__2 = f2cmin(i__4,*m);
855 for (i__ = f2cmax(i__3,1); i__ <= i__2; ++i__) {
857 i__3 = kd + i__ - j + j * ab_dim1;
858 r__3 = c__[j], r__4 = ((r__1 = ab[i__3].r, abs(r__1)) + (r__2 =
859 r_imag(&ab[kd + i__ - j + j * ab_dim1]), abs(r__2))) *
861 c__[j] = f2cmax(r__3,r__4);
865 i__2 = (integer) (log(c__[j]) / logrdx);
866 c__[j] = pow_ri(&radix, &i__2);
871 /* Find the maximum and minimum scale factors. */
876 for (j = 1; j <= i__1; ++j) {
878 r__1 = rcmin, r__2 = c__[j];
879 rcmin = f2cmin(r__1,r__2);
881 r__1 = rcmax, r__2 = c__[j];
882 rcmax = f2cmax(r__1,r__2);
888 /* Find the first zero scale factor and return an error code. */
891 for (j = 1; j <= i__1; ++j) {
900 /* Invert the scale factors. */
903 for (j = 1; j <= i__1; ++j) {
907 r__1 = f2cmax(r__2,smlnum);
908 c__[j] = 1.f / f2cmin(r__1,bignum);
912 /* Compute COLCND = f2cmin(C(J)) / f2cmax(C(J)). */
914 *colcnd = f2cmax(rcmin,smlnum) / f2cmin(rcmax,bignum);