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)
514 /* > \brief \b IPARMQ */
516 /* =========== DOCUMENTATION =========== */
518 /* Online html documentation available at */
519 /* http://www.netlib.org/lapack/explore-html/ */
522 /* > Download IPARMQ + dependencies */
523 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/iparmq.
526 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/iparmq.
529 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/iparmq.
537 /* INTEGER FUNCTION IPARMQ( ISPEC, NAME, OPTS, N, ILO, IHI, LWORK ) */
539 /* INTEGER IHI, ILO, ISPEC, LWORK, N */
540 /* CHARACTER NAME*( * ), OPTS*( * ) */
543 /* > \par Purpose: */
548 /* > This program sets problem and machine dependent parameters */
549 /* > useful for xHSEQR and related subroutines for eigenvalue */
550 /* > problems. It is called whenever */
551 /* > IPARMQ is called with 12 <= ISPEC <= 16 */
557 /* > \param[in] ISPEC */
559 /* > ISPEC is INTEGER */
560 /* > ISPEC specifies which tunable parameter IPARMQ should */
563 /* > ISPEC=12: (INMIN) Matrices of order nmin or less */
564 /* > are sent directly to xLAHQR, the implicit */
565 /* > double shift QR algorithm. NMIN must be */
568 /* > ISPEC=13: (INWIN) Size of the deflation window. */
569 /* > This is best set greater than or equal to */
570 /* > the number of simultaneous shifts NS. */
571 /* > Larger matrices benefit from larger deflation */
574 /* > ISPEC=14: (INIBL) Determines when to stop nibbling and */
575 /* > invest in an (expensive) multi-shift QR sweep. */
576 /* > If the aggressive early deflation subroutine */
577 /* > finds LD converged eigenvalues from an order */
578 /* > NW deflation window and LD > (NW*NIBBLE)/100, */
579 /* > then the next QR sweep is skipped and early */
580 /* > deflation is applied immediately to the */
581 /* > remaining active diagonal block. Setting */
582 /* > IPARMQ(ISPEC=14) = 0 causes TTQRE to skip a */
583 /* > multi-shift QR sweep whenever early deflation */
584 /* > finds a converged eigenvalue. Setting */
585 /* > IPARMQ(ISPEC=14) greater than or equal to 100 */
586 /* > prevents TTQRE from skipping a multi-shift */
589 /* > ISPEC=15: (NSHFTS) The number of simultaneous shifts in */
590 /* > a multi-shift QR iteration. */
592 /* > ISPEC=16: (IACC22) IPARMQ is set to 0, 1 or 2 with the */
593 /* > following meanings. */
594 /* > 0: During the multi-shift QR/QZ sweep, */
595 /* > blocked eigenvalue reordering, blocked */
596 /* > Hessenberg-triangular reduction, */
597 /* > reflections and/or rotations are not */
598 /* > accumulated when updating the */
599 /* > far-from-diagonal matrix entries. */
600 /* > 1: During the multi-shift QR/QZ sweep, */
601 /* > blocked eigenvalue reordering, blocked */
602 /* > Hessenberg-triangular reduction, */
603 /* > reflections and/or rotations are */
604 /* > accumulated, and matrix-matrix */
605 /* > multiplication is used to update the */
606 /* > far-from-diagonal matrix entries. */
607 /* > 2: During the multi-shift QR/QZ sweep, */
608 /* > blocked eigenvalue reordering, blocked */
609 /* > Hessenberg-triangular reduction, */
610 /* > reflections and/or rotations are */
611 /* > accumulated, and 2-by-2 block structure */
612 /* > is exploited during matrix-matrix */
614 /* > (If xTRMM is slower than xGEMM, then */
615 /* > IPARMQ(ISPEC=16)=1 may be more efficient than */
616 /* > IPARMQ(ISPEC=16)=2 despite the greater level of */
617 /* > arithmetic work implied by the latter choice.) */
620 /* > \param[in] NAME */
622 /* > NAME is CHARACTER string */
623 /* > Name of the calling subroutine */
626 /* > \param[in] OPTS */
628 /* > OPTS is CHARACTER string */
629 /* > This is a concatenation of the string arguments to */
636 /* > N is the order of the Hessenberg matrix H. */
639 /* > \param[in] ILO */
641 /* > ILO is INTEGER */
644 /* > \param[in] IHI */
646 /* > IHI is INTEGER */
647 /* > It is assumed that H is already upper triangular */
648 /* > in rows and columns 1:ILO-1 and IHI+1:N. */
651 /* > \param[in] LWORK */
653 /* > LWORK is INTEGER */
654 /* > The amount of workspace available. */
660 /* > \author Univ. of Tennessee */
661 /* > \author Univ. of California Berkeley */
662 /* > \author Univ. of Colorado Denver */
663 /* > \author NAG Ltd. */
665 /* > \date June 2017 */
667 /* > \ingroup OTHERauxiliary */
669 /* > \par Further Details: */
670 /* ===================== */
674 /* > Little is known about how best to choose these parameters. */
675 /* > It is possible to use different values of the parameters */
676 /* > for each of CHSEQR, DHSEQR, SHSEQR and ZHSEQR. */
678 /* > It is probably best to choose different parameters for */
679 /* > different matrices and different parameters at different */
680 /* > times during the iteration, but this has not been */
681 /* > implemented --- yet. */
684 /* > The best choices of most of the parameters depend */
685 /* > in an ill-understood way on the relative execution */
686 /* > rate of xLAQR3 and xLAQR5 and on the nature of each */
687 /* > particular eigenvalue problem. Experiment may be the */
688 /* > only practical way to determine which choices are most */
691 /* > Following is a list of default values supplied by IPARMQ. */
692 /* > These defaults may be adjusted in order to attain better */
693 /* > performance in any particular computational environment. */
695 /* > IPARMQ(ISPEC=12) The xLAHQR vs xLAQR0 crossover point. */
696 /* > Default: 75. (Must be at least 11.) */
698 /* > IPARMQ(ISPEC=13) Recommended deflation window size. */
699 /* > This depends on ILO, IHI and NS, the */
700 /* > number of simultaneous shifts returned */
701 /* > by IPARMQ(ISPEC=15). The default for */
702 /* > (IHI-ILO+1) <= 500 is NS. The default */
703 /* > for (IHI-ILO+1) > 500 is 3*NS/2. */
705 /* > IPARMQ(ISPEC=14) Nibble crossover point. Default: 14. */
707 /* > IPARMQ(ISPEC=15) Number of simultaneous shifts, NS. */
708 /* > a multi-shift QR iteration. */
710 /* > If IHI-ILO+1 is ... */
712 /* > greater than ...but less ... the */
713 /* > or equal to ... than default is */
716 /* > 30 60 NS = 4+ */
717 /* > 60 150 NS = 10 */
718 /* > 150 590 NS = ** */
719 /* > 590 3000 NS = 64 */
720 /* > 3000 6000 NS = 128 */
721 /* > 6000 infinity NS = 256 */
723 /* > (+) By default matrices of this order are */
724 /* > passed to the implicit double shift routine */
725 /* > xLAHQR. See IPARMQ(ISPEC=12) above. These */
726 /* > values of NS are used only in case of a rare */
727 /* > xLAHQR failure. */
729 /* > (**) The asterisks (**) indicate an ad-hoc */
730 /* > function increasing from 10 to 64. */
732 /* > IPARMQ(ISPEC=16) Select structured matrix multiply. */
733 /* > (See ISPEC=16 above for details.) */
737 /* ===================================================================== */
738 integer iparmq_(integer *ispec, char *name__, char *opts, integer *n, integer
739 *ilo, integer *ihi, integer *lwork)
741 /* System generated locals */
742 integer ret_val, i__1, i__2;
745 /* Local variables */
746 integer i__, ic, nh, ns, iz;
750 /* -- LAPACK auxiliary routine (version 3.7.1) -- */
751 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
752 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
756 /* ================================================================ */
757 if (*ispec == 15 || *ispec == 13 || *ispec == 16) {
759 /* ==== Set the number simultaneous shifts ==== */
761 nh = *ihi - *ilo + 1;
771 r__1 = log((real) nh) / log(2.f);
772 i__1 = 10, i__2 = nh / i_nint(&r__1);
773 ns = f2cmax(i__1,i__2);
785 i__1 = 2, i__2 = ns - ns % 2;
786 ns = f2cmax(i__1,i__2);
792 /* ===== Matrices of order smaller than NMIN get sent */
793 /* . to xLAHQR, the classic double shift algorithm. */
794 /* . This must be at least 11. ==== */
798 } else if (*ispec == 14) {
800 /* ==== INIBL: skip a multi-shift qr iteration and */
801 /* . whenever aggressive early deflation finds */
802 /* . at least (NIBBLE*(window size)/100) deflations. ==== */
806 } else if (*ispec == 15) {
808 /* ==== NSHFTS: The number of simultaneous shifts ===== */
812 } else if (*ispec == 13) {
814 /* ==== NW: deflation window size. ==== */
819 ret_val = ns * 3 / 2;
822 } else if (*ispec == 16) {
824 /* ==== IACC22: Whether to accumulate reflections */
825 /* . before updating the far-from-diagonal elements */
826 /* . and whether to use 2-by-2 block structure while */
827 /* . doing it. A small amount of work could be saved */
828 /* . by making this choice dependent also upon the */
829 /* . NH=IHI-ILO+1. */
832 /* Convert NAME to upper case if the first character is lower case. */
835 s_copy(subnam, name__, (ftnlen)6, name_len);
836 ic = *(unsigned char *)subnam;
838 if (iz == 90 || iz == 122) {
840 /* ASCII character set */
842 if (ic >= 97 && ic <= 122) {
843 *(unsigned char *)subnam = (char) (ic - 32);
844 for (i__ = 2; i__ <= 6; ++i__) {
845 ic = *(unsigned char *)&subnam[i__ - 1];
846 if (ic >= 97 && ic <= 122) {
847 *(unsigned char *)&subnam[i__ - 1] = (char) (ic - 32);
852 } else if (iz == 233 || iz == 169) {
854 /* EBCDIC character set */
856 if (ic >= 129 && ic <= 137 || ic >= 145 && ic <= 153 || ic >= 162
858 *(unsigned char *)subnam = (char) (ic + 64);
859 for (i__ = 2; i__ <= 6; ++i__) {
860 ic = *(unsigned char *)&subnam[i__ - 1];
861 if (ic >= 129 && ic <= 137 || ic >= 145 && ic <= 153 ||
862 ic >= 162 && ic <= 169) {
863 *(unsigned char *)&subnam[i__ - 1] = (char) (ic + 64);
868 } else if (iz == 218 || iz == 250) {
870 /* Prime machines: ASCII+128 */
872 if (ic >= 225 && ic <= 250) {
873 *(unsigned char *)subnam = (char) (ic - 32);
874 for (i__ = 2; i__ <= 6; ++i__) {
875 ic = *(unsigned char *)&subnam[i__ - 1];
876 if (ic >= 225 && ic <= 250) {
877 *(unsigned char *)&subnam[i__ - 1] = (char) (ic - 32);
883 if (s_cmp(subnam + 1, "GGHRD", (ftnlen)5, (ftnlen)5) == 0 || s_cmp(
884 subnam + 1, "GGHD3", (ftnlen)5, (ftnlen)5) == 0) {
889 } else if (s_cmp(subnam + 3, "EXC", (ftnlen)3, (ftnlen)3) == 0) {
896 } else if (s_cmp(subnam + 1, "HSEQR", (ftnlen)5, (ftnlen)5) == 0 ||
897 s_cmp(subnam + 1, "LAQR", (ftnlen)4, (ftnlen)4) == 0) {
907 /* ===== invalid value of ispec ===== */
912 /* ==== End of IPARMQ ==== */