lapack-netlib/SRC/dgsvj0.c

   1 #include <math.h>
   2 #include <stdlib.h>
   3 #include <string.h>
   4 #include <stdio.h>
   5 #include <complex.h>
   6 #ifdef complex
   7 #undef complex
   8 #endif
   9 #ifdef I
  10 #undef I
  11 #endif
  12
  13 #if defined(_WIN64)
  14 typedef long long BLASLONG;
  15 typedef unsigned long long BLASULONG;
  16 #else
  17 typedef long BLASLONG;
  18 typedef unsigned long BLASULONG;
  19 #endif
  20
  21 #ifdef LAPACK_ILP64
  22 typedef BLASLONG blasint;
  23 #if defined(_WIN64)
  24 #define blasabs(x) llabs(x)
  25 #else
  26 #define blasabs(x) labs(x)
  27 #endif
  28 #else
  29 typedef int blasint;
  30 #define blasabs(x) abs(x)
  31 #endif
  32
  33 typedef blasint integer;
  34
  35 typedef unsigned int uinteger;
  36 typedef char *address;
  37 typedef short int shortint;
  38 typedef float real;
  39 typedef double doublereal;
  40 typedef struct { real r, i; } complex;
  41 typedef struct { doublereal r, i; } doublecomplex;
  42 #ifdef _MSC_VER
  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;}
  47 #else
  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;}
  52 #endif
  53 #define pCf(z) (*_pCf(z))
  54 #define pCd(z) (*_pCd(z))
  55 typedef int logical;
  56 typedef short int shortlogical;
  57 typedef char logical1;
  58 typedef char integer1;
  59
  60 #define TRUE_ (1)
  61 #define FALSE_ (0)
  62
  63 /* Extern is for use with -E */
  64 #ifndef Extern
  65 #define Extern extern
  66 #endif
  67
  68 /* I/O stuff */
  69
  70 typedef int flag;
  71 typedef int ftnlen;
  72 typedef int ftnint;
  73
  74 /*external read, write*/
  75 typedef struct
  76 {       flag cierr;
  77         ftnint ciunit;
  78         flag ciend;
  79         char *cifmt;
  80         ftnint cirec;
  81 } cilist;
  82
  83 /*internal read, write*/
  84 typedef struct
  85 {       flag icierr;
  86         char *iciunit;
  87         flag iciend;
  88         char *icifmt;
  89         ftnint icirlen;
  90         ftnint icirnum;
  91 } icilist;
  92
  93 /*open*/
  94 typedef struct
  95 {       flag oerr;
  96         ftnint ounit;
  97         char *ofnm;
  98         ftnlen ofnmlen;
  99         char *osta;
 100         char *oacc;
 101         char *ofm;
 102         ftnint orl;
 103         char *oblnk;
 104 } olist;
 105
 106 /*close*/
 107 typedef struct
 108 {       flag cerr;
 109         ftnint cunit;
 110         char *csta;
 111 } cllist;
 112
 113 /*rewind, backspace, endfile*/
 114 typedef struct
 115 {       flag aerr;
 116         ftnint aunit;
 117 } alist;
 118
 119 /* inquire */
 120 typedef struct
 121 {       flag inerr;
 122         ftnint inunit;
 123         char *infile;
 124         ftnlen infilen;
 125         ftnint  *inex;  /*parameters in standard's order*/
 126         ftnint  *inopen;
 127         ftnint  *innum;
 128         ftnint  *innamed;
 129         char    *inname;
 130         ftnlen  innamlen;
 131         char    *inacc;
 132         ftnlen  inacclen;
 133         char    *inseq;
 134         ftnlen  inseqlen;
 135         char    *indir;
 136         ftnlen  indirlen;
 137         char    *infmt;
 138         ftnlen  infmtlen;
 139         char    *inform;
 140         ftnint  informlen;
 141         char    *inunf;
 142         ftnlen  inunflen;
 143         ftnint  *inrecl;
 144         ftnint  *innrec;
 145         char    *inblank;
 146         ftnlen  inblanklen;
 147 } inlist;
 148
 149 #define VOID void
 150
 151 union Multitype {       /* for multiple entry points */
 152         integer1 g;
 153         shortint h;
 154         integer i;
 155         /* longint j; */
 156         real r;
 157         doublereal d;
 158         complex c;
 159         doublecomplex z;
 160         };
 161
 162 typedef union Multitype Multitype;
 163
 164 struct Vardesc {        /* for Namelist */
 165         char *name;
 166         char *addr;
 167         ftnlen *dims;
 168         int  type;
 169         };
 170 typedef struct Vardesc Vardesc;
 171
 172 struct Namelist {
 173         char *name;
 174         Vardesc **vars;
 175         int nvars;
 176         };
 177 typedef struct Namelist Namelist;
 178
 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)))
 188
 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)); }
 192 #ifdef _MSC_VER
 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]);}
 195 #else
 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);}
 198 #endif
 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)}
 260
 261 /* procedure parameter types for -A and -C++ */
 262
 263 #define F2C_proc_par_types 1
 264 #ifdef __cplusplus
 265 typedef logical (*L_fp)(...);
 266 #else
 267 typedef logical (*L_fp)();
 268 #endif
 269
 270 static float spow_ui(float x, integer n) {
 271         float pow=1.0; unsigned long int u;
 272         if(n != 0) {
 273                 if(n < 0) n = -n, x = 1/x;
 274                 for(u = n; ; ) {
 275                         if(u & 01) pow *= x;
 276                         if(u >>= 1) x *= x;
 277                         else break;
 278                 }
 279         }
 280         return pow;
 281 }
 282 static double dpow_ui(double x, integer n) {
 283         double pow=1.0; unsigned long int u;
 284         if(n != 0) {
 285                 if(n < 0) n = -n, x = 1/x;
 286                 for(u = n; ; ) {
 287                         if(u & 01) pow *= x;
 288                         if(u >>= 1) x *= x;
 289                         else break;
 290                 }
 291         }
 292         return pow;
 293 }
 294 #ifdef _MSC_VER
 295 static _Fcomplex cpow_ui(complex x, integer n) {
 296         complex pow={1.0,0.0}; unsigned long int u;
 297                 if(n != 0) {
 298                 if(n < 0) n = -n, x.r = 1/x.r, x.i=1/x.i;
 299                 for(u = n; ; ) {
 300                         if(u & 01) pow.r *= x.r, pow.i *= x.i;
 301                         if(u >>= 1) x.r *= x.r, x.i *= x.i;
 302                         else break;
 303                 }
 304         }
 305         _Fcomplex p={pow.r, pow.i};
 306         return p;
 307 }
 308 #else
 309 static _Complex float cpow_ui(_Complex float x, integer n) {
 310         _Complex float pow=1.0; unsigned long int u;
 311         if(n != 0) {
 312                 if(n < 0) n = -n, x = 1/x;
 313                 for(u = n; ; ) {
 314                         if(u & 01) pow *= x;
 315                         if(u >>= 1) x *= x;
 316                         else break;
 317                 }
 318         }
 319         return pow;
 320 }
 321 #endif
 322 #ifdef _MSC_VER
 323 static _Dcomplex zpow_ui(_Dcomplex x, integer n) {
 324         _Dcomplex pow={1.0,0.0}; unsigned long int u;
 325         if(n != 0) {
 326                 if(n < 0) n = -n, x._Val[0] = 1/x._Val[0], x._Val[1] =1/x._Val[1];
 327                 for(u = n; ; ) {
 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];
 330                         else break;
 331                 }
 332         }
 333         _Dcomplex p = {pow._Val[0], pow._Val[1]};
 334         return p;
 335 }
 336 #else
 337 static _Complex double zpow_ui(_Complex double x, integer n) {
 338         _Complex double pow=1.0; unsigned long int u;
 339         if(n != 0) {
 340                 if(n < 0) n = -n, x = 1/x;
 341                 for(u = n; ; ) {
 342                         if(u & 01) pow *= x;
 343                         if(u >>= 1) x *= x;
 344                         else break;
 345                 }
 346         }
 347         return pow;
 348 }
 349 #endif
 350 static integer pow_ii(integer x, integer n) {
 351         integer pow; unsigned long int u;
 352         if (n <= 0) {
 353                 if (n == 0 || x == 1) pow = 1;
 354                 else if (x != -1) pow = x == 0 ? 1/x : 0;
 355                 else n = -n;
 356         }
 357         if ((n > 0) || !(n == 0 || x == 1 || x != -1)) {
 358                 u = n;
 359                 for(pow = 1; ; ) {
 360                         if(u & 01) pow *= x;
 361                         if(u >>= 1) x *= x;
 362                         else break;
 363                 }
 364         }
 365         return pow;
 366 }
 367 static integer dmaxloc_(double *w, integer s, integer e, integer *n)
 368 {
 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];
 372         return mi-s+1;
 373 }
 374 static integer smaxloc_(float *w, integer s, integer e, integer *n)
 375 {
 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];
 379         return mi-s+1;
 380 }
 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;
 383 #ifdef _MSC_VER
 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];
 389                 }
 390         } else {
 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];
 394                 }
 395         }
 396         pCf(z) = zdotc;
 397 }
 398 #else
 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]);
 403                 }
 404         } else {
 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]);
 407                 }
 408         }
 409         pCf(z) = zdotc;
 410 }
 411 #endif
 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;
 414 #ifdef _MSC_VER
 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];
 420                 }
 421         } else {
 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];
 425                 }
 426         }
 427         pCd(z) = zdotc;
 428 }
 429 #else
 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]);
 434                 }
 435         } else {
 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]);
 438                 }
 439         }
 440         pCd(z) = zdotc;
 441 }
 442 #endif
 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;
 445 #ifdef _MSC_VER
 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];
 451                 }
 452         } else {
 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];
 456                 }
 457         }
 458         pCf(z) = zdotc;
 459 }
 460 #else
 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]);
 465                 }
 466         } else {
 467                 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
 468                         zdotc += Cf(&x[i*incx]) * Cf(&y[i*incy]);
 469                 }
 470         }
 471         pCf(z) = zdotc;
 472 }
 473 #endif
 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;
 476 #ifdef _MSC_VER
 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];
 482                 }
 483         } else {
 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];
 487                 }
 488         }
 489         pCd(z) = zdotc;
 490 }
 491 #else
 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]);
 496                 }
 497         } else {
 498                 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
 499                         zdotc += Cd(&x[i*incx]) * Cd(&y[i*incy]);
 500                 }
 501         }
 502         pCd(z) = zdotc;
 503 }
 504 #endif
 505 /*  -- translated by f2c (version 20000121).
 506    You must link the resulting object file with the libraries:
 507         -lf2c -lm   (in that order)
 508 */
 509
 510
 511
 512
 513 /* Table of constant values */
 514
 515 static integer c__1 = 1;
 516 static integer c__0 = 0;
 517 static doublereal c_b42 = 1.;
 518
 519 /* > \brief \b DGSVJ0 pre-processor for the routine dgesvj. */
 520
 521 /*  =========== DOCUMENTATION =========== */
 522
 523 /* Online html documentation available at */
 524 /*            http://www.netlib.org/lapack/explore-html/ */
 525
 526 /* > \htmlonly */
 527 /* > Download DGSVJ0 + dependencies */
 528 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/dgsvj0.
 529 f"> */
 530 /* > [TGZ]</a> */
 531 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/dgsvj0.
 532 f"> */
 533 /* > [ZIP]</a> */
 534 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/dgsvj0.
 535 f"> */
 536 /* > [TXT]</a> */
 537 /* > \endhtmlonly */
 538
 539 /*  Definition: */
 540 /*  =========== */
 541
 542 /*       SUBROUTINE DGSVJ0( JOBV, M, N, A, LDA, D, SVA, MV, V, LDV, EPS, */
 543 /*                          SFMIN, TOL, NSWEEP, WORK, LWORK, INFO ) */
 544
 545 /*       INTEGER            INFO, LDA, LDV, LWORK, M, MV, N, NSWEEP */
 546 /*       DOUBLE PRECISION   EPS, SFMIN, TOL */
 547 /*       CHARACTER*1        JOBV */
 548 /*       DOUBLE PRECISION   A( LDA, * ), SVA( N ), D( N ), V( LDV, * ), */
 549 /*      $                   WORK( LWORK ) */
 550
 551
 552 /* > \par Purpose: */
 553 /*  ============= */
 554 /* > */
 555 /* > \verbatim */
 556 /* > */
 557 /* > DGSVJ0 is called from DGESVJ as a pre-processor and that is its main */
 558 /* > purpose. It applies Jacobi rotations in the same way as DGESVJ does, but */
 559 /* > it does not check convergence (stopping criterion). Few tuning */
 560 /* > parameters (marked by [TP]) are available for the implementer. */
 561 /* > \endverbatim */
 562
 563 /*  Arguments: */
 564 /*  ========== */
 565
 566 /* > \param[in] JOBV */
 567 /* > \verbatim */
 568 /* >          JOBV is CHARACTER*1 */
 569 /* >          Specifies whether the output from this procedure is used */
 570 /* >          to compute the matrix V: */
 571 /* >          = 'V': the product of the Jacobi rotations is accumulated */
 572 /* >                 by postmulyiplying the N-by-N array V. */
 573 /* >                (See the description of V.) */
 574 /* >          = 'A': the product of the Jacobi rotations is accumulated */
 575 /* >                 by postmulyiplying the MV-by-N array V. */
 576 /* >                (See the descriptions of MV and V.) */
 577 /* >          = 'N': the Jacobi rotations are not accumulated. */
 578 /* > \endverbatim */
 579 /* > */
 580 /* > \param[in] M */
 581 /* > \verbatim */
 582 /* >          M is INTEGER */
 583 /* >          The number of rows of the input matrix A.  M >= 0. */
 584 /* > \endverbatim */
 585 /* > */
 586 /* > \param[in] N */
 587 /* > \verbatim */
 588 /* >          N is INTEGER */
 589 /* >          The number of columns of the input matrix A. */
 590 /* >          M >= N >= 0. */
 591 /* > \endverbatim */
 592 /* > */
 593 /* > \param[in,out] A */
 594 /* > \verbatim */
 595 /* >          A is DOUBLE PRECISION array, dimension (LDA,N) */
 596 /* >          On entry, M-by-N matrix A, such that A*diag(D) represents */
 597 /* >          the input matrix. */
 598 /* >          On exit, */
 599 /* >          A_onexit * D_onexit represents the input matrix A*diag(D) */
 600 /* >          post-multiplied by a sequence of Jacobi rotations, where the */
 601 /* >          rotation threshold and the total number of sweeps are given in */
 602 /* >          TOL and NSWEEP, respectively. */
 603 /* >          (See the descriptions of D, TOL and NSWEEP.) */
 604 /* > \endverbatim */
 605 /* > */
 606 /* > \param[in] LDA */
 607 /* > \verbatim */
 608 /* >          LDA is INTEGER */
 609 /* >          The leading dimension of the array A.  LDA >= f2cmax(1,M). */
 610 /* > \endverbatim */
 611 /* > */
 612 /* > \param[in,out] D */
 613 /* > \verbatim */
 614 /* >          D is DOUBLE PRECISION array, dimension (N) */
 615 /* >          The array D accumulates the scaling factors from the fast scaled */
 616 /* >          Jacobi rotations. */
 617 /* >          On entry, A*diag(D) represents the input matrix. */
 618 /* >          On exit, A_onexit*diag(D_onexit) represents the input matrix */
 619 /* >          post-multiplied by a sequence of Jacobi rotations, where the */
 620 /* >          rotation threshold and the total number of sweeps are given in */
 621 /* >          TOL and NSWEEP, respectively. */
 622 /* >          (See the descriptions of A, TOL and NSWEEP.) */
 623 /* > \endverbatim */
 624 /* > */
 625 /* > \param[in,out] SVA */
 626 /* > \verbatim */
 627 /* >          SVA is DOUBLE PRECISION array, dimension (N) */
 628 /* >          On entry, SVA contains the Euclidean norms of the columns of */
 629 /* >          the matrix A*diag(D). */
 630 /* >          On exit, SVA contains the Euclidean norms of the columns of */
 631 /* >          the matrix onexit*diag(D_onexit). */
 632 /* > \endverbatim */
 633 /* > */
 634 /* > \param[in] MV */
 635 /* > \verbatim */
 636 /* >          MV is INTEGER */
 637 /* >          If JOBV = 'A', then MV rows of V are post-multipled by a */
 638 /* >                           sequence of Jacobi rotations. */
 639 /* >          If JOBV = 'N',   then MV is not referenced. */
 640 /* > \endverbatim */
 641 /* > */
 642 /* > \param[in,out] V */
 643 /* > \verbatim */
 644 /* >          V is DOUBLE PRECISION array, dimension (LDV,N) */
 645 /* >          If JOBV = 'V' then N rows of V are post-multipled by a */
 646 /* >                           sequence of Jacobi rotations. */
 647 /* >          If JOBV = 'A' then MV rows of V are post-multipled by a */
 648 /* >                           sequence of Jacobi rotations. */
 649 /* >          If JOBV = 'N',   then V is not referenced. */
 650 /* > \endverbatim */
 651 /* > */
 652 /* > \param[in] LDV */
 653 /* > \verbatim */
 654 /* >          LDV is INTEGER */
 655 /* >          The leading dimension of the array V,  LDV >= 1. */
 656 /* >          If JOBV = 'V', LDV >= N. */
 657 /* >          If JOBV = 'A', LDV >= MV. */
 658 /* > \endverbatim */
 659 /* > */
 660 /* > \param[in] EPS */
 661 /* > \verbatim */
 662 /* >          EPS is DOUBLE PRECISION */
 663 /* >          EPS = DLAMCH('Epsilon') */
 664 /* > \endverbatim */
 665 /* > */
 666 /* > \param[in] SFMIN */
 667 /* > \verbatim */
 668 /* >          SFMIN is DOUBLE PRECISION */
 669 /* >          SFMIN = DLAMCH('Safe Minimum') */
 670 /* > \endverbatim */
 671 /* > */
 672 /* > \param[in] TOL */
 673 /* > \verbatim */
 674 /* >          TOL is DOUBLE PRECISION */
 675 /* >          TOL is the threshold for Jacobi rotations. For a pair */
 676 /* >          A(:,p), A(:,q) of pivot columns, the Jacobi rotation is */
 677 /* >          applied only if DABS(COS(angle(A(:,p),A(:,q)))) > TOL. */
 678 /* > \endverbatim */
 679 /* > */
 680 /* > \param[in] NSWEEP */
 681 /* > \verbatim */
 682 /* >          NSWEEP is INTEGER */
 683 /* >          NSWEEP is the number of sweeps of Jacobi rotations to be */
 684 /* >          performed. */
 685 /* > \endverbatim */
 686 /* > */
 687 /* > \param[out] WORK */
 688 /* > \verbatim */
 689 /* >          WORK is DOUBLE PRECISION array, dimension (LWORK) */
 690 /* > \endverbatim */
 691 /* > */
 692 /* > \param[in] LWORK */
 693 /* > \verbatim */
 694 /* >          LWORK is INTEGER */
 695 /* >          LWORK is the dimension of WORK. LWORK >= M. */
 696 /* > \endverbatim */
 697 /* > */
 698 /* > \param[out] INFO */
 699 /* > \verbatim */
 700 /* >          INFO is INTEGER */
 701 /* >          = 0:  successful exit. */
 702 /* >          < 0:  if INFO = -i, then the i-th argument had an illegal value */
 703 /* > \endverbatim */
 704
 705 /*  Authors: */
 706 /*  ======== */
 707
 708 /* > \author Univ. of Tennessee */
 709 /* > \author Univ. of California Berkeley */
 710 /* > \author Univ. of Colorado Denver */
 711 /* > \author NAG Ltd. */
 712
 713 /* > \date November 2017 */
 714
 715 /* > \ingroup doubleOTHERcomputational */
 716
 717 /* > \par Further Details: */
 718 /*  ===================== */
 719 /* > */
 720 /* > DGSVJ0 is used just to enable DGESVJ to call a simplified version of */
 721 /* > itself to work on a submatrix of the original matrix. */
 722 /* > */
 723 /* > \par Contributors: */
 724 /*  ================== */
 725 /* > */
 726 /* > Zlatko Drmac (Zagreb, Croatia) and Kresimir Veselic (Hagen, Germany) */
 727 /* > */
 728 /* > \par Bugs, Examples and Comments: */
 729 /*  ================================= */
 730 /* > */
 731 /* > Please report all bugs and send interesting test examples and comments to */
 732 /* > drmac@math.hr. Thank you. */
 733
 734 /*  ===================================================================== */
 735 /* Subroutine */ int dgsvj0_(char *jobv, integer *m, integer *n, doublereal *
 736         a, integer *lda, doublereal *d__, doublereal *sva, integer *mv,
 737         doublereal *v, integer *ldv, doublereal *eps, doublereal *sfmin,
 738         doublereal *tol, integer *nsweep, doublereal *work, integer *lwork,
 739         integer *info)
 740 {
 741     /* System generated locals */
 742     integer a_dim1, a_offset, v_dim1, v_offset, i__1, i__2, i__3, i__4, i__5,
 743             i__6;
 744     doublereal d__1, d__2;
 745
 746     /* Local variables */
 747     doublereal aapp, aapq, aaqq;
 748     extern doublereal ddot_(integer *, doublereal *, integer *, doublereal *,
 749             integer *);
 750     integer ierr;
 751     doublereal bigtheta;
 752     integer pskipped;
 753     doublereal aapp0;
 754     extern doublereal dnrm2_(integer *, doublereal *, integer *);
 755     doublereal temp1;
 756     integer i__, p, q;
 757     doublereal t, apoaq, aqoap;
 758     extern logical lsame_(char *, char *);
 759     doublereal theta, small;
 760     extern /* Subroutine */ int dcopy_(integer *, doublereal *, integer *,
 761             doublereal *, integer *);
 762     doublereal fastr[5];
 763     extern /* Subroutine */ int dswap_(integer *, doublereal *, integer *,
 764             doublereal *, integer *);
 765     logical applv, rsvec;
 766     extern /* Subroutine */ int daxpy_(integer *, doublereal *, doublereal *,
 767             integer *, doublereal *, integer *), drotm_(integer *, doublereal
 768             *, integer *, doublereal *, integer *, doublereal *);
 769     logical rotok;
 770     doublereal rootsfmin, cs, sn;
 771     extern /* Subroutine */ int dlascl_(char *, integer *, integer *,
 772             doublereal *, doublereal *, integer *, integer *, doublereal *,
 773             integer *, integer *);
 774     extern integer idamax_(integer *, doublereal *, integer *);
 775     extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
 776     integer ijblsk, swband, blskip;
 777     doublereal mxaapq;
 778     extern /* Subroutine */ int dlassq_(integer *, doublereal *, integer *,
 779             doublereal *, doublereal *);
 780     doublereal thsign, mxsinj;
 781     integer ir1, emptsw, notrot, iswrot, jbc;
 782     doublereal big;
 783     integer kbl, lkahead, igl, ibr, jgl, nbl, mvl;
 784     doublereal rootbig, rooteps;
 785     integer rowskip;
 786     doublereal roottol;
 787
 788
 789 /*  -- LAPACK computational routine (version 3.8.0) -- */
 790 /*  -- LAPACK is a software package provided by Univ. of Tennessee,    -- */
 791 /*  -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
 792 /*     November 2017 */
 793
 794
 795 /*  ===================================================================== */
 796
 797
 798 /*     Test the input parameters. */
 799
 800     /* Parameter adjustments */
 801     --sva;
 802     --d__;
 803     a_dim1 = *lda;
 804     a_offset = 1 + a_dim1 * 1;
 805     a -= a_offset;
 806     v_dim1 = *ldv;
 807     v_offset = 1 + v_dim1 * 1;
 808     v -= v_offset;
 809     --work;
 810
 811     /* Function Body */
 812     applv = lsame_(jobv, "A");
 813     rsvec = lsame_(jobv, "V");
 814     if (! (rsvec || applv || lsame_(jobv, "N"))) {
 815         *info = -1;
 816     } else if (*m < 0) {
 817         *info = -2;
 818     } else if (*n < 0 || *n > *m) {
 819         *info = -3;
 820     } else if (*lda < *m) {
 821         *info = -5;
 822     } else if ((rsvec || applv) && *mv < 0) {
 823         *info = -8;
 824     } else if (rsvec && *ldv < *n || applv && *ldv < *mv) {
 825         *info = -10;
 826     } else if (*tol <= *eps) {
 827         *info = -13;
 828     } else if (*nsweep < 0) {
 829         *info = -14;
 830     } else if (*lwork < *m) {
 831         *info = -16;
 832     } else {
 833         *info = 0;
 834     }
 835
 836 /*     #:( */
 837     if (*info != 0) {
 838         i__1 = -(*info);
 839         xerbla_("DGSVJ0", &i__1, (ftnlen)6);
 840         return 0;
 841     }
 842
 843     if (rsvec) {
 844         mvl = *n;
 845     } else if (applv) {
 846         mvl = *mv;
 847     }
 848     rsvec = rsvec || applv;
 849     rooteps = sqrt(*eps);
 850     rootsfmin = sqrt(*sfmin);
 851     small = *sfmin / *eps;
 852     big = 1. / *sfmin;
 853     rootbig = 1. / rootsfmin;
 854     bigtheta = 1. / rooteps;
 855     roottol = sqrt(*tol);
 856
 857 /*     -#- Row-cyclic Jacobi SVD algorithm with column pivoting -#- */
 858
 859     emptsw = *n * (*n - 1) / 2;
 860     notrot = 0;
 861     fastr[0] = 0.;
 862
 863 /*     -#- Row-cyclic pivot strategy with de Rijk's pivoting -#- */
 864
 865     swband = 0;
 866 /* [TP] SWBAND is a tuning parameter. It is meaningful and effective */
 867 /*     if SGESVJ is used as a computational routine in the preconditioned */
 868 /*     Jacobi SVD algorithm SGESVJ. For sweeps i=1:SWBAND the procedure */
 869 /*     ...... */
 870     kbl = f2cmin(8,*n);
 871 /* [TP] KBL is a tuning parameter that defines the tile size in the */
 872 /*     tiling of the p-q loops of pivot pairs. In general, an optimal */
 873 /*     value of KBL depends on the matrix dimensions and on the */
 874 /*     parameters of the computer's memory. */
 875
 876     nbl = *n / kbl;
 877     if (nbl * kbl != *n) {
 878         ++nbl;
 879     }
 880 /* Computing 2nd power */
 881     i__1 = kbl;
 882     blskip = i__1 * i__1 + 1;
 883 /* [TP] BLKSKIP is a tuning parameter that depends on SWBAND and KBL. */
 884     rowskip = f2cmin(5,kbl);
 885 /* [TP] ROWSKIP is a tuning parameter. */
 886     lkahead = 1;
 887 /* [TP] LKAHEAD is a tuning parameter. */
 888     swband = 0;
 889     pskipped = 0;
 890
 891     i__1 = *nsweep;
 892     for (i__ = 1; i__ <= i__1; ++i__) {
 893
 894         mxaapq = 0.;
 895         mxsinj = 0.;
 896         iswrot = 0;
 897
 898         notrot = 0;
 899         pskipped = 0;
 900
 901         i__2 = nbl;
 902         for (ibr = 1; ibr <= i__2; ++ibr) {
 903             igl = (ibr - 1) * kbl + 1;
 904
 905 /* Computing MIN */
 906             i__4 = lkahead, i__5 = nbl - ibr;
 907             i__3 = f2cmin(i__4,i__5);
 908             for (ir1 = 0; ir1 <= i__3; ++ir1) {
 909
 910                 igl += ir1 * kbl;
 911
 912 /* Computing MIN */
 913                 i__5 = igl + kbl - 1, i__6 = *n - 1;
 914                 i__4 = f2cmin(i__5,i__6);
 915                 for (p = igl; p <= i__4; ++p) {
 916                     i__5 = *n - p + 1;
 917                     q = idamax_(&i__5, &sva[p], &c__1) + p - 1;
 918                     if (p != q) {
 919                         dswap_(m, &a[p * a_dim1 + 1], &c__1, &a[q * a_dim1 +
 920                                 1], &c__1);
 921                         if (rsvec) {
 922                             dswap_(&mvl, &v[p * v_dim1 + 1], &c__1, &v[q *
 923                                     v_dim1 + 1], &c__1);
 924                         }
 925                         temp1 = sva[p];
 926                         sva[p] = sva[q];
 927                         sva[q] = temp1;
 928                         temp1 = d__[p];
 929                         d__[p] = d__[q];
 930                         d__[q] = temp1;
 931                     }
 932
 933                     if (ir1 == 0) {
 934
 935 /*        Column norms are periodically updated by explicit */
 936 /*        norm computation. */
 937 /*        Caveat: */
 938 /*        Some BLAS implementations compute DNRM2(M,A(1,p),1) */
 939 /*        as DSQRT(DDOT(M,A(1,p),1,A(1,p),1)), which may result in */
 940 /*        overflow for ||A(:,p)||_2 > DSQRT(overflow_threshold), and */
 941 /*        undeflow for ||A(:,p)||_2 < DSQRT(underflow_threshold). */
 942 /*        Hence, DNRM2 cannot be trusted, not even in the case when */
 943 /*        the true norm is far from the under(over)flow boundaries. */
 944 /*        If properly implemented DNRM2 is available, the IF-THEN-ELSE */
 945 /*        below should read "AAPP = DNRM2( M, A(1,p), 1 ) * D(p)". */
 946
 947                         if (sva[p] < rootbig && sva[p] > rootsfmin) {
 948                             sva[p] = dnrm2_(m, &a[p * a_dim1 + 1], &c__1) *
 949                                     d__[p];
 950                         } else {
 951                             temp1 = 0.;
 952                             aapp = 1.;
 953                             dlassq_(m, &a[p * a_dim1 + 1], &c__1, &temp1, &
 954                                     aapp);
 955                             sva[p] = temp1 * sqrt(aapp) * d__[p];
 956                         }
 957                         aapp = sva[p];
 958                     } else {
 959                         aapp = sva[p];
 960                     }
 961
 962                     if (aapp > 0.) {
 963
 964                         pskipped = 0;
 965
 966 /* Computing MIN */
 967                         i__6 = igl + kbl - 1;
 968                         i__5 = f2cmin(i__6,*n);
 969                         for (q = p + 1; q <= i__5; ++q) {
 970
 971                             aaqq = sva[q];
 972                             if (aaqq > 0.) {
 973
 974                                 aapp0 = aapp;
 975                                 if (aaqq >= 1.) {
 976                                     rotok = small * aapp <= aaqq;
 977                                     if (aapp < big / aaqq) {
 978                                         aapq = ddot_(m, &a[p * a_dim1 + 1], &
 979                                                 c__1, &a[q * a_dim1 + 1], &
 980                                                 c__1) * d__[p] * d__[q] /
 981                                                 aaqq / aapp;
 982                                     } else {
 983                                         dcopy_(m, &a[p * a_dim1 + 1], &c__1, &
 984                                                 work[1], &c__1);
 985                                         dlascl_("G", &c__0, &c__0, &aapp, &
 986                                                 d__[p], m, &c__1, &work[1],
 987                                                 lda, &ierr);
 988                                         aapq = ddot_(m, &work[1], &c__1, &a[q
 989                                                 * a_dim1 + 1], &c__1) * d__[q]
 990                                                  / aaqq;
 991                                     }
 992                                 } else {
 993                                     rotok = aapp <= aaqq / small;
 994                                     if (aapp > small / aaqq) {
 995                                         aapq = ddot_(m, &a[p * a_dim1 + 1], &
 996                                                 c__1, &a[q * a_dim1 + 1], &
 997                                                 c__1) * d__[p] * d__[q] /
 998                                                 aaqq / aapp;
 999                                     } else {
1000                                         dcopy_(m, &a[q * a_dim1 + 1], &c__1, &
1001                                                 work[1], &c__1);
1002                                         dlascl_("G", &c__0, &c__0, &aaqq, &
1003                                                 d__[q], m, &c__1, &work[1],
1004                                                 lda, &ierr);
1005                                         aapq = ddot_(m, &work[1], &c__1, &a[p
1006                                                 * a_dim1 + 1], &c__1) * d__[p]
1007                                                  / aapp;
1008                                     }
1009                                 }
1010
1011 /* Computing MAX */
1012                                 d__1 = mxaapq, d__2 = abs(aapq);
1013                                 mxaapq = f2cmax(d__1,d__2);
1014
1015 /*        TO rotate or NOT to rotate, THAT is the question ... */
1016
1017                                 if (abs(aapq) > *tol) {
1018
1019 /*           ROTATED = ROTATED + ONE */
1020
1021                                     if (ir1 == 0) {
1022                                         notrot = 0;
1023                                         pskipped = 0;
1024                                         ++iswrot;
1025                                     }
1026
1027                                     if (rotok) {
1028
1029                                         aqoap = aaqq / aapp;
1030                                         apoaq = aapp / aaqq;
1031                                         theta = (d__1 = aqoap - apoaq, abs(
1032                                                 d__1)) * -.5 / aapq;
1033
1034                                         if (abs(theta) > bigtheta) {
1035
1036                                             t = .5 / theta;
1037                                             fastr[2] = t * d__[p] / d__[q];
1038                                             fastr[3] = -t * d__[q] / d__[p];
1039                                             drotm_(m, &a[p * a_dim1 + 1], &
1040                                                     c__1, &a[q * a_dim1 + 1],
1041                                                     &c__1, fastr);
1042                                             if (rsvec) {
1043                           drotm_(&mvl, &v[p * v_dim1 + 1], &c__1, &v[q *
1044                                   v_dim1 + 1], &c__1, fastr);
1045                                             }
1046 /* Computing MAX */
1047                                             d__1 = 0., d__2 = t * apoaq *
1048                                                     aapq + 1.;
1049                                             sva[q] = aaqq * sqrt((f2cmax(d__1,
1050                                                     d__2)));
1051 /* Computing MAX */
1052                                             d__1 = 0., d__2 = 1. - t * aqoap *
1053                                                      aapq;
1054                                             aapp *= sqrt((f2cmax(d__1,d__2)));
1055 /* Computing MAX */
1056                                             d__1 = mxsinj, d__2 = abs(t);
1057                                             mxsinj = f2cmax(d__1,d__2);
1058
1059                                         } else {
1060
1061
1062                                             thsign = -d_sign(&c_b42, &aapq);
1063                                             t = 1. / (theta + thsign * sqrt(
1064                                                     theta * theta + 1.));
1065                                             cs = sqrt(1. / (t * t + 1.));
1066                                             sn = t * cs;
1067
1068 /* Computing MAX */
1069                                             d__1 = mxsinj, d__2 = abs(sn);
1070                                             mxsinj = f2cmax(d__1,d__2);
1071 /* Computing MAX */
1072                                             d__1 = 0., d__2 = t * apoaq *
1073                                                     aapq + 1.;
1074                                             sva[q] = aaqq * sqrt((f2cmax(d__1,
1075                                                     d__2)));
1076 /* Computing MAX */
1077                                             d__1 = 0., d__2 = 1. - t * aqoap *
1078                                                      aapq;
1079                                             aapp *= sqrt((f2cmax(d__1,d__2)));
1080
1081                                             apoaq = d__[p] / d__[q];
1082                                             aqoap = d__[q] / d__[p];
1083                                             if (d__[p] >= 1.) {
1084                           if (d__[q] >= 1.) {
1085                               fastr[2] = t * apoaq;
1086                               fastr[3] = -t * aqoap;
1087                               d__[p] *= cs;
1088                               d__[q] *= cs;
1089                               drotm_(m, &a[p * a_dim1 + 1], &c__1, &a[q *
1090                                       a_dim1 + 1], &c__1, fastr);
1091                               if (rsvec) {
1092                                   drotm_(&mvl, &v[p * v_dim1 + 1], &c__1, &v[
1093                                           q * v_dim1 + 1], &c__1, fastr);
1094                               }
1095                           } else {
1096                               d__1 = -t * aqoap;
1097                               daxpy_(m, &d__1, &a[q * a_dim1 + 1], &c__1, &a[
1098                                       p * a_dim1 + 1], &c__1);
1099                               d__1 = cs * sn * apoaq;
1100                               daxpy_(m, &d__1, &a[p * a_dim1 + 1], &c__1, &a[
1101                                       q * a_dim1 + 1], &c__1);
1102                               d__[p] *= cs;
1103                               d__[q] /= cs;
1104                               if (rsvec) {
1105                                   d__1 = -t * aqoap;
1106                                   daxpy_(&mvl, &d__1, &v[q * v_dim1 + 1], &
1107                                           c__1, &v[p * v_dim1 + 1], &c__1);
1108                                   d__1 = cs * sn * apoaq;
1109                                   daxpy_(&mvl, &d__1, &v[p * v_dim1 + 1], &
1110                                           c__1, &v[q * v_dim1 + 1], &c__1);
1111                               }
1112                           }
1113                                             } else {
1114                           if (d__[q] >= 1.) {
1115                               d__1 = t * apoaq;
1116                               daxpy_(m, &d__1, &a[p * a_dim1 + 1], &c__1, &a[
1117                                       q * a_dim1 + 1], &c__1);
1118                               d__1 = -cs * sn * aqoap;
1119                               daxpy_(m, &d__1, &a[q * a_dim1 + 1], &c__1, &a[
1120                                       p * a_dim1 + 1], &c__1);
1121                               d__[p] /= cs;
1122                               d__[q] *= cs;
1123                               if (rsvec) {
1124                                   d__1 = t * apoaq;
1125                                   daxpy_(&mvl, &d__1, &v[p * v_dim1 + 1], &
1126                                           c__1, &v[q * v_dim1 + 1], &c__1);
1127                                   d__1 = -cs * sn * aqoap;
1128                                   daxpy_(&mvl, &d__1, &v[q * v_dim1 + 1], &
1129                                           c__1, &v[p * v_dim1 + 1], &c__1);
1130                               }
1131                           } else {
1132                               if (d__[p] >= d__[q]) {
1133                                   d__1 = -t * aqoap;
1134                                   daxpy_(m, &d__1, &a[q * a_dim1 + 1], &c__1,
1135                                           &a[p * a_dim1 + 1], &c__1);
1136                                   d__1 = cs * sn * apoaq;
1137                                   daxpy_(m, &d__1, &a[p * a_dim1 + 1], &c__1,
1138                                           &a[q * a_dim1 + 1], &c__1);
1139                                   d__[p] *= cs;
1140                                   d__[q] /= cs;
1141                                   if (rsvec) {
1142                                       d__1 = -t * aqoap;
1143                                       daxpy_(&mvl, &d__1, &v[q * v_dim1 + 1],
1144                                               &c__1, &v[p * v_dim1 + 1], &
1145                                               c__1);
1146                                       d__1 = cs * sn * apoaq;
1147                                       daxpy_(&mvl, &d__1, &v[p * v_dim1 + 1],
1148                                               &c__1, &v[q * v_dim1 + 1], &
1149                                               c__1);
1150                                   }
1151                               } else {
1152                                   d__1 = t * apoaq;
1153                                   daxpy_(m, &d__1, &a[p * a_dim1 + 1], &c__1,
1154                                           &a[q * a_dim1 + 1], &c__1);
1155                                   d__1 = -cs * sn * aqoap;
1156                                   daxpy_(m, &d__1, &a[q * a_dim1 + 1], &c__1,
1157                                           &a[p * a_dim1 + 1], &c__1);
1158                                   d__[p] /= cs;
1159                                   d__[q] *= cs;
1160                                   if (rsvec) {
1161                                       d__1 = t * apoaq;
1162                                       daxpy_(&mvl, &d__1, &v[p * v_dim1 + 1],
1163                                               &c__1, &v[q * v_dim1 + 1], &
1164                                               c__1);
1165                                       d__1 = -cs * sn * aqoap;
1166                                       daxpy_(&mvl, &d__1, &v[q * v_dim1 + 1],
1167                                               &c__1, &v[p * v_dim1 + 1], &
1168                                               c__1);
1169                                   }
1170                               }
1171                           }
1172                                             }
1173                                         }
1174
1175                                     } else {
1176                                         dcopy_(m, &a[p * a_dim1 + 1], &c__1, &
1177                                                 work[1], &c__1);
1178                                         dlascl_("G", &c__0, &c__0, &aapp, &
1179                                                 c_b42, m, &c__1, &work[1],
1180                                                 lda, &ierr);
1181                                         dlascl_("G", &c__0, &c__0, &aaqq, &
1182                                                 c_b42, m, &c__1, &a[q *
1183                                                 a_dim1 + 1], lda, &ierr);
1184                                         temp1 = -aapq * d__[p] / d__[q];
1185                                         daxpy_(m, &temp1, &work[1], &c__1, &a[
1186                                                 q * a_dim1 + 1], &c__1);
1187                                         dlascl_("G", &c__0, &c__0, &c_b42, &
1188                                                 aaqq, m, &c__1, &a[q * a_dim1
1189                                                 + 1], lda, &ierr);
1190 /* Computing MAX */
1191                                         d__1 = 0., d__2 = 1. - aapq * aapq;
1192                                         sva[q] = aaqq * sqrt((f2cmax(d__1,d__2)))
1193                                                 ;
1194                                         mxsinj = f2cmax(mxsinj,*sfmin);
1195                                     }
1196 /*           END IF ROTOK THEN ... ELSE */
1197
1198 /*           In the case of cancellation in updating SVA(q), SVA(p) */
1199 /*           recompute SVA(q), SVA(p). */
1200 /* Computing 2nd power */
1201                                     d__1 = sva[q] / aaqq;
1202                                     if (d__1 * d__1 <= rooteps) {
1203                                         if (aaqq < rootbig && aaqq >
1204                                                 rootsfmin) {
1205                                             sva[q] = dnrm2_(m, &a[q * a_dim1
1206                                                     + 1], &c__1) * d__[q];
1207                                         } else {
1208                                             t = 0.;
1209                                             aaqq = 1.;
1210                                             dlassq_(m, &a[q * a_dim1 + 1], &
1211                                                     c__1, &t, &aaqq);
1212                                             sva[q] = t * sqrt(aaqq) * d__[q];
1213                                         }
1214                                     }
1215                                     if (aapp / aapp0 <= rooteps) {
1216                                         if (aapp < rootbig && aapp >
1217                                                 rootsfmin) {
1218                                             aapp = dnrm2_(m, &a[p * a_dim1 +
1219                                                     1], &c__1) * d__[p];
1220                                         } else {
1221                                             t = 0.;
1222                                             aapp = 1.;
1223                                             dlassq_(m, &a[p * a_dim1 + 1], &
1224                                                     c__1, &t, &aapp);
1225                                             aapp = t * sqrt(aapp) * d__[p];
1226                                         }
1227                                         sva[p] = aapp;
1228                                     }
1229
1230                                 } else {
1231 /*        A(:,p) and A(:,q) already numerically orthogonal */
1232                                     if (ir1 == 0) {
1233                                         ++notrot;
1234                                     }
1235                                     ++pskipped;
1236                                 }
1237                             } else {
1238 /*        A(:,q) is zero column */
1239                                 if (ir1 == 0) {
1240                                     ++notrot;
1241                                 }
1242                                 ++pskipped;
1243                             }
1244
1245                             if (i__ <= swband && pskipped > rowskip) {
1246                                 if (ir1 == 0) {
1247                                     aapp = -aapp;
1248                                 }
1249                                 notrot = 0;
1250                                 goto L2103;
1251                             }
1252
1253 /* L2002: */
1254                         }
1255 /*     END q-LOOP */
1256
1257 L2103:
1258 /*     bailed out of q-loop */
1259                         sva[p] = aapp;
1260                     } else {
1261                         sva[p] = aapp;
1262                         if (ir1 == 0 && aapp == 0.) {
1263 /* Computing MIN */
1264                             i__5 = igl + kbl - 1;
1265                             notrot = notrot + f2cmin(i__5,*n) - p;
1266                         }
1267                     }
1268
1269 /* L2001: */
1270                 }
1271 /*     end of the p-loop */
1272 /*     end of doing the block ( ibr, ibr ) */
1273 /* L1002: */
1274             }
1275 /*     end of ir1-loop */
1276
1277 /* ........................................................ */
1278 /* ... go to the off diagonal blocks */
1279
1280             igl = (ibr - 1) * kbl + 1;
1281
1282             i__3 = nbl;
1283             for (jbc = ibr + 1; jbc <= i__3; ++jbc) {
1284
1285                 jgl = (jbc - 1) * kbl + 1;
1286
1287 /*        doing the block at ( ibr, jbc ) */
1288
1289                 ijblsk = 0;
1290 /* Computing MIN */
1291                 i__5 = igl + kbl - 1;
1292                 i__4 = f2cmin(i__5,*n);
1293                 for (p = igl; p <= i__4; ++p) {
1294
1295                     aapp = sva[p];
1296
1297                     if (aapp > 0.) {
1298
1299                         pskipped = 0;
1300
1301 /* Computing MIN */
1302                         i__6 = jgl + kbl - 1;
1303                         i__5 = f2cmin(i__6,*n);
1304                         for (q = jgl; q <= i__5; ++q) {
1305
1306                             aaqq = sva[q];
1307
1308                             if (aaqq > 0.) {
1309                                 aapp0 = aapp;
1310
1311 /*     -#- M x 2 Jacobi SVD -#- */
1312
1313 /*        -#- Safe Gram matrix computation -#- */
1314
1315                                 if (aaqq >= 1.) {
1316                                     if (aapp >= aaqq) {
1317                                         rotok = small * aapp <= aaqq;
1318                                     } else {
1319                                         rotok = small * aaqq <= aapp;
1320                                     }
1321                                     if (aapp < big / aaqq) {
1322                                         aapq = ddot_(m, &a[p * a_dim1 + 1], &
1323                                                 c__1, &a[q * a_dim1 + 1], &
1324                                                 c__1) * d__[p] * d__[q] /
1325                                                 aaqq / aapp;
1326                                     } else {
1327                                         dcopy_(m, &a[p * a_dim1 + 1], &c__1, &
1328                                                 work[1], &c__1);
1329                                         dlascl_("G", &c__0, &c__0, &aapp, &
1330                                                 d__[p], m, &c__1, &work[1],
1331                                                 lda, &ierr);
1332                                         aapq = ddot_(m, &work[1], &c__1, &a[q
1333                                                 * a_dim1 + 1], &c__1) * d__[q]
1334                                                  / aaqq;
1335                                     }
1336                                 } else {
1337                                     if (aapp >= aaqq) {
1338                                         rotok = aapp <= aaqq / small;
1339                                     } else {
1340                                         rotok = aaqq <= aapp / small;
1341                                     }
1342                                     if (aapp > small / aaqq) {
1343                                         aapq = ddot_(m, &a[p * a_dim1 + 1], &
1344                                                 c__1, &a[q * a_dim1 + 1], &
1345                                                 c__1) * d__[p] * d__[q] /
1346                                                 aaqq / aapp;
1347                                     } else {
1348                                         dcopy_(m, &a[q * a_dim1 + 1], &c__1, &
1349                                                 work[1], &c__1);
1350                                         dlascl_("G", &c__0, &c__0, &aaqq, &
1351                                                 d__[q], m, &c__1, &work[1],
1352                                                 lda, &ierr);
1353                                         aapq = ddot_(m, &work[1], &c__1, &a[p
1354                                                 * a_dim1 + 1], &c__1) * d__[p]
1355                                                  / aapp;
1356                                     }
1357                                 }
1358
1359 /* Computing MAX */
1360                                 d__1 = mxaapq, d__2 = abs(aapq);
1361                                 mxaapq = f2cmax(d__1,d__2);
1362
1363 /*        TO rotate or NOT to rotate, THAT is the question ... */
1364
1365                                 if (abs(aapq) > *tol) {
1366                                     notrot = 0;
1367 /*           ROTATED  = ROTATED + 1 */
1368                                     pskipped = 0;
1369                                     ++iswrot;
1370
1371                                     if (rotok) {
1372
1373                                         aqoap = aaqq / aapp;
1374                                         apoaq = aapp / aaqq;
1375                                         theta = (d__1 = aqoap - apoaq, abs(
1376                                                 d__1)) * -.5 / aapq;
1377                                         if (aaqq > aapp0) {
1378                                             theta = -theta;
1379                                         }
1380
1381                                         if (abs(theta) > bigtheta) {
1382                                             t = .5 / theta;
1383                                             fastr[2] = t * d__[p] / d__[q];
1384                                             fastr[3] = -t * d__[q] / d__[p];
1385                                             drotm_(m, &a[p * a_dim1 + 1], &
1386                                                     c__1, &a[q * a_dim1 + 1],
1387                                                     &c__1, fastr);
1388                                             if (rsvec) {
1389                           drotm_(&mvl, &v[p * v_dim1 + 1], &c__1, &v[q *
1390                                   v_dim1 + 1], &c__1, fastr);
1391                                             }
1392 /* Computing MAX */
1393                                             d__1 = 0., d__2 = t * apoaq *
1394                                                     aapq + 1.;
1395                                             sva[q] = aaqq * sqrt((f2cmax(d__1,
1396                                                     d__2)));
1397 /* Computing MAX */
1398                                             d__1 = 0., d__2 = 1. - t * aqoap *
1399                                                      aapq;
1400                                             aapp *= sqrt((f2cmax(d__1,d__2)));
1401 /* Computing MAX */
1402                                             d__1 = mxsinj, d__2 = abs(t);
1403                                             mxsinj = f2cmax(d__1,d__2);
1404                                         } else {
1405
1406
1407                                             thsign = -d_sign(&c_b42, &aapq);
1408                                             if (aaqq > aapp0) {
1409                           thsign = -thsign;
1410                                             }
1411                                             t = 1. / (theta + thsign * sqrt(
1412                                                     theta * theta + 1.));
1413                                             cs = sqrt(1. / (t * t + 1.));
1414                                             sn = t * cs;
1415 /* Computing MAX */
1416                                             d__1 = mxsinj, d__2 = abs(sn);
1417                                             mxsinj = f2cmax(d__1,d__2);
1418 /* Computing MAX */
1419                                             d__1 = 0., d__2 = t * apoaq *
1420                                                     aapq + 1.;
1421                                             sva[q] = aaqq * sqrt((f2cmax(d__1,
1422                                                     d__2)));
1423 /* Computing MAX */
1424                                             d__1 = 0., d__2 = 1. - t * aqoap *
1425                                                      aapq;
1426                                             aapp *= sqrt((f2cmax(d__1,d__2)));
1427
1428                                             apoaq = d__[p] / d__[q];
1429                                             aqoap = d__[q] / d__[p];
1430                                             if (d__[p] >= 1.) {
1431
1432                           if (d__[q] >= 1.) {
1433                               fastr[2] = t * apoaq;
1434                               fastr[3] = -t * aqoap;
1435                               d__[p] *= cs;
1436                               d__[q] *= cs;
1437                               drotm_(m, &a[p * a_dim1 + 1], &c__1, &a[q *
1438                                       a_dim1 + 1], &c__1, fastr);
1439                               if (rsvec) {
1440                                   drotm_(&mvl, &v[p * v_dim1 + 1], &c__1, &v[
1441                                           q * v_dim1 + 1], &c__1, fastr);
1442                               }
1443                           } else {
1444                               d__1 = -t * aqoap;
1445                               daxpy_(m, &d__1, &a[q * a_dim1 + 1], &c__1, &a[
1446                                       p * a_dim1 + 1], &c__1);
1447                               d__1 = cs * sn * apoaq;
1448                               daxpy_(m, &d__1, &a[p * a_dim1 + 1], &c__1, &a[
1449                                       q * a_dim1 + 1], &c__1);
1450                               if (rsvec) {
1451                                   d__1 = -t * aqoap;
1452                                   daxpy_(&mvl, &d__1, &v[q * v_dim1 + 1], &
1453                                           c__1, &v[p * v_dim1 + 1], &c__1);
1454                                   d__1 = cs * sn * apoaq;
1455                                   daxpy_(&mvl, &d__1, &v[p * v_dim1 + 1], &
1456                                           c__1, &v[q * v_dim1 + 1], &c__1);
1457                               }
1458                               d__[p] *= cs;
1459                               d__[q] /= cs;
1460                           }
1461                                             } else {
1462                           if (d__[q] >= 1.) {
1463                               d__1 = t * apoaq;
1464                               daxpy_(m, &d__1, &a[p * a_dim1 + 1], &c__1, &a[
1465                                       q * a_dim1 + 1], &c__1);
1466                               d__1 = -cs * sn * aqoap;
1467                               daxpy_(m, &d__1, &a[q * a_dim1 + 1], &c__1, &a[
1468                                       p * a_dim1 + 1], &c__1);
1469                               if (rsvec) {
1470                                   d__1 = t * apoaq;
1471                                   daxpy_(&mvl, &d__1, &v[p * v_dim1 + 1], &
1472                                           c__1, &v[q * v_dim1 + 1], &c__1);
1473                                   d__1 = -cs * sn * aqoap;
1474                                   daxpy_(&mvl, &d__1, &v[q * v_dim1 + 1], &
1475                                           c__1, &v[p * v_dim1 + 1], &c__1);
1476                               }
1477                               d__[p] /= cs;
1478                               d__[q] *= cs;
1479                           } else {
1480                               if (d__[p] >= d__[q]) {
1481                                   d__1 = -t * aqoap;
1482                                   daxpy_(m, &d__1, &a[q * a_dim1 + 1], &c__1,
1483                                           &a[p * a_dim1 + 1], &c__1);
1484                                   d__1 = cs * sn * apoaq;
1485                                   daxpy_(m, &d__1, &a[p * a_dim1 + 1], &c__1,
1486                                           &a[q * a_dim1 + 1], &c__1);
1487                                   d__[p] *= cs;
1488                                   d__[q] /= cs;
1489                                   if (rsvec) {
1490                                       d__1 = -t * aqoap;
1491                                       daxpy_(&mvl, &d__1, &v[q * v_dim1 + 1],
1492                                               &c__1, &v[p * v_dim1 + 1], &
1493                                               c__1);
1494                                       d__1 = cs * sn * apoaq;
1495                                       daxpy_(&mvl, &d__1, &v[p * v_dim1 + 1],
1496                                               &c__1, &v[q * v_dim1 + 1], &
1497                                               c__1);
1498                                   }
1499                               } else {
1500                                   d__1 = t * apoaq;
1501                                   daxpy_(m, &d__1, &a[p * a_dim1 + 1], &c__1,
1502                                           &a[q * a_dim1 + 1], &c__1);
1503                                   d__1 = -cs * sn * aqoap;
1504                                   daxpy_(m, &d__1, &a[q * a_dim1 + 1], &c__1,
1505                                           &a[p * a_dim1 + 1], &c__1);
1506                                   d__[p] /= cs;
1507                                   d__[q] *= cs;
1508                                   if (rsvec) {
1509                                       d__1 = t * apoaq;
1510                                       daxpy_(&mvl, &d__1, &v[p * v_dim1 + 1],
1511                                               &c__1, &v[q * v_dim1 + 1], &
1512                                               c__1);
1513                                       d__1 = -cs * sn * aqoap;
1514                                       daxpy_(&mvl, &d__1, &v[q * v_dim1 + 1],
1515                                               &c__1, &v[p * v_dim1 + 1], &
1516                                               c__1);
1517                                   }
1518                               }
1519                           }
1520                                             }
1521                                         }
1522
1523                                     } else {
1524                                         if (aapp > aaqq) {
1525                                             dcopy_(m, &a[p * a_dim1 + 1], &
1526                                                     c__1, &work[1], &c__1);
1527                                             dlascl_("G", &c__0, &c__0, &aapp,
1528                                                     &c_b42, m, &c__1, &work[1]
1529                                                     , lda, &ierr);
1530                                             dlascl_("G", &c__0, &c__0, &aaqq,
1531                                                     &c_b42, m, &c__1, &a[q *
1532                                                     a_dim1 + 1], lda, &ierr);
1533                                             temp1 = -aapq * d__[p] / d__[q];
1534                                             daxpy_(m, &temp1, &work[1], &c__1,
1535                                                      &a[q * a_dim1 + 1], &
1536                                                     c__1);
1537                                             dlascl_("G", &c__0, &c__0, &c_b42,
1538                                                      &aaqq, m, &c__1, &a[q *
1539                                                     a_dim1 + 1], lda, &ierr);
1540 /* Computing MAX */
1541                                             d__1 = 0., d__2 = 1. - aapq *
1542                                                     aapq;
1543                                             sva[q] = aaqq * sqrt((f2cmax(d__1,
1544                                                     d__2)));
1545                                             mxsinj = f2cmax(mxsinj,*sfmin);
1546                                         } else {
1547                                             dcopy_(m, &a[q * a_dim1 + 1], &
1548                                                     c__1, &work[1], &c__1);
1549                                             dlascl_("G", &c__0, &c__0, &aaqq,
1550                                                     &c_b42, m, &c__1, &work[1]
1551                                                     , lda, &ierr);
1552                                             dlascl_("G", &c__0, &c__0, &aapp,
1553                                                     &c_b42, m, &c__1, &a[p *
1554                                                     a_dim1 + 1], lda, &ierr);
1555                                             temp1 = -aapq * d__[q] / d__[p];
1556                                             daxpy_(m, &temp1, &work[1], &c__1,
1557                                                      &a[p * a_dim1 + 1], &
1558                                                     c__1);
1559                                             dlascl_("G", &c__0, &c__0, &c_b42,
1560                                                      &aapp, m, &c__1, &a[p *
1561                                                     a_dim1 + 1], lda, &ierr);
1562 /* Computing MAX */
1563                                             d__1 = 0., d__2 = 1. - aapq *
1564                                                     aapq;
1565                                             sva[p] = aapp * sqrt((f2cmax(d__1,
1566                                                     d__2)));
1567                                             mxsinj = f2cmax(mxsinj,*sfmin);
1568                                         }
1569                                     }
1570 /*           END IF ROTOK THEN ... ELSE */
1571
1572 /*           In the case of cancellation in updating SVA(q) */
1573 /* Computing 2nd power */
1574                                     d__1 = sva[q] / aaqq;
1575                                     if (d__1 * d__1 <= rooteps) {
1576                                         if (aaqq < rootbig && aaqq >
1577                                                 rootsfmin) {
1578                                             sva[q] = dnrm2_(m, &a[q * a_dim1
1579                                                     + 1], &c__1) * d__[q];
1580                                         } else {
1581                                             t = 0.;
1582                                             aaqq = 1.;
1583                                             dlassq_(m, &a[q * a_dim1 + 1], &
1584                                                     c__1, &t, &aaqq);
1585                                             sva[q] = t * sqrt(aaqq) * d__[q];
1586                                         }
1587                                     }
1588 /* Computing 2nd power */
1589                                     d__1 = aapp / aapp0;
1590                                     if (d__1 * d__1 <= rooteps) {
1591                                         if (aapp < rootbig && aapp >
1592                                                 rootsfmin) {
1593                                             aapp = dnrm2_(m, &a[p * a_dim1 +
1594                                                     1], &c__1) * d__[p];
1595                                         } else {
1596                                             t = 0.;
1597                                             aapp = 1.;
1598                                             dlassq_(m, &a[p * a_dim1 + 1], &
1599                                                     c__1, &t, &aapp);
1600                                             aapp = t * sqrt(aapp) * d__[p];
1601                                         }
1602                                         sva[p] = aapp;
1603                                     }
1604 /*              end of OK rotation */
1605                                 } else {
1606                                     ++notrot;
1607                                     ++pskipped;
1608                                     ++ijblsk;
1609                                 }
1610                             } else {
1611                                 ++notrot;
1612                                 ++pskipped;
1613                                 ++ijblsk;
1614                             }
1615
1616                             if (i__ <= swband && ijblsk >= blskip) {
1617                                 sva[p] = aapp;
1618                                 notrot = 0;
1619                                 goto L2011;
1620                             }
1621                             if (i__ <= swband && pskipped > rowskip) {
1622                                 aapp = -aapp;
1623                                 notrot = 0;
1624                                 goto L2203;
1625                             }
1626
1627 /* L2200: */
1628                         }
1629 /*        end of the q-loop */
1630 L2203:
1631
1632                         sva[p] = aapp;
1633
1634                     } else {
1635                         if (aapp == 0.) {
1636 /* Computing MIN */
1637                             i__5 = jgl + kbl - 1;
1638                             notrot = notrot + f2cmin(i__5,*n) - jgl + 1;
1639                         }
1640                         if (aapp < 0.) {
1641                             notrot = 0;
1642                         }
1643                     }
1644 /* L2100: */
1645                 }
1646 /*     end of the p-loop */
1647 /* L2010: */
1648             }
1649 /*     end of the jbc-loop */
1650 L2011:
1651 /* 2011 bailed out of the jbc-loop */
1652 /* Computing MIN */
1653             i__4 = igl + kbl - 1;
1654             i__3 = f2cmin(i__4,*n);
1655             for (p = igl; p <= i__3; ++p) {
1656                 sva[p] = (d__1 = sva[p], abs(d__1));
1657 /* L2012: */
1658             }
1659
1660 /* L2000: */
1661         }
1662 /* 2000 :: end of the ibr-loop */
1663
1664         if (sva[*n] < rootbig && sva[*n] > rootsfmin) {
1665             sva[*n] = dnrm2_(m, &a[*n * a_dim1 + 1], &c__1) * d__[*n];
1666         } else {
1667             t = 0.;
1668             aapp = 1.;
1669             dlassq_(m, &a[*n * a_dim1 + 1], &c__1, &t, &aapp);
1670             sva[*n] = t * sqrt(aapp) * d__[*n];
1671         }
1672
1673 /*     Additional steering devices */
1674
1675         if (i__ < swband && (mxaapq <= roottol || iswrot <= *n)) {
1676             swband = i__;
1677         }
1678
1679         if (i__ > swband + 1 && mxaapq < (doublereal) (*n) * *tol && (
1680                 doublereal) (*n) * mxaapq * mxsinj < *tol) {
1681             goto L1994;
1682         }
1683
1684         if (notrot >= emptsw) {
1685             goto L1994;
1686         }
1687 /* L1993: */
1688     }
1689 /*     end i=1:NSWEEP loop */
1690 /* #:) Reaching this point means that the procedure has completed the given */
1691 /*     number of iterations. */
1692     *info = *nsweep - 1;
1693     goto L1995;
1694 L1994:
1695 /* #:) Reaching this point means that during the i-th sweep all pivots were */
1696 /*     below the given tolerance, causing early exit. */
1697
1698     *info = 0;
1699 /* #:) INFO = 0 confirms successful iterations. */
1700 L1995:
1701
1702 /*     Sort the vector D. */
1703     i__1 = *n - 1;
1704     for (p = 1; p <= i__1; ++p) {
1705         i__2 = *n - p + 1;
1706         q = idamax_(&i__2, &sva[p], &c__1) + p - 1;
1707         if (p != q) {
1708             temp1 = sva[p];
1709             sva[p] = sva[q];
1710             sva[q] = temp1;
1711             temp1 = d__[p];
1712             d__[p] = d__[q];
1713             d__[q] = temp1;
1714             dswap_(m, &a[p * a_dim1 + 1], &c__1, &a[q * a_dim1 + 1], &c__1);
1715             if (rsvec) {
1716                 dswap_(&mvl, &v[p * v_dim1 + 1], &c__1, &v[q * v_dim1 + 1], &
1717                         c__1);
1718             }
1719         }
1720 /* L5991: */
1721     }
1722
1723     return 0;
1724 } /* dgsvj0_ */
1725