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]/Cd(b)._Val[1]);}
196 #define c_div(c, a, b) {pCf(c) = Cf(a)/Cf(b);}
197 #define z_div(c, a, b) {pCd(c) = Cd(a)/Cd(b);}
199 #define c_exp(R, Z) {pCf(R) = cexpf(Cf(Z));}
200 #define c_log(R, Z) {pCf(R) = clogf(Cf(Z));}
201 #define c_sin(R, Z) {pCf(R) = csinf(Cf(Z));}
202 //#define c_sqrt(R, Z) {*(R) = csqrtf(Cf(Z));}
203 #define c_sqrt(R, Z) {pCf(R) = csqrtf(Cf(Z));}
204 #define d_abs(x) (fabs(*(x)))
205 #define d_acos(x) (acos(*(x)))
206 #define d_asin(x) (asin(*(x)))
207 #define d_atan(x) (atan(*(x)))
208 #define d_atn2(x, y) (atan2(*(x),*(y)))
209 #define d_cnjg(R, Z) { pCd(R) = conj(Cd(Z)); }
210 #define r_cnjg(R, Z) { pCf(R) = conjf(Cf(Z)); }
211 #define d_cos(x) (cos(*(x)))
212 #define d_cosh(x) (cosh(*(x)))
213 #define d_dim(__a, __b) ( *(__a) > *(__b) ? *(__a) - *(__b) : 0.0 )
214 #define d_exp(x) (exp(*(x)))
215 #define d_imag(z) (cimag(Cd(z)))
216 #define r_imag(z) (cimagf(Cf(z)))
217 #define d_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
218 #define r_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
219 #define d_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
220 #define r_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
221 #define d_log(x) (log(*(x)))
222 #define d_mod(x, y) (fmod(*(x), *(y)))
223 #define u_nint(__x) ((__x)>=0 ? floor((__x) + .5) : -floor(.5 - (__x)))
224 #define d_nint(x) u_nint(*(x))
225 #define u_sign(__a,__b) ((__b) >= 0 ? ((__a) >= 0 ? (__a) : -(__a)) : -((__a) >= 0 ? (__a) : -(__a)))
226 #define d_sign(a,b) u_sign(*(a),*(b))
227 #define r_sign(a,b) u_sign(*(a),*(b))
228 #define d_sin(x) (sin(*(x)))
229 #define d_sinh(x) (sinh(*(x)))
230 #define d_sqrt(x) (sqrt(*(x)))
231 #define d_tan(x) (tan(*(x)))
232 #define d_tanh(x) (tanh(*(x)))
233 #define i_abs(x) abs(*(x))
234 #define i_dnnt(x) ((integer)u_nint(*(x)))
235 #define i_len(s, n) (n)
236 #define i_nint(x) ((integer)u_nint(*(x)))
237 #define i_sign(a,b) ((integer)u_sign((integer)*(a),(integer)*(b)))
238 #define pow_dd(ap, bp) ( pow(*(ap), *(bp)))
239 #define pow_si(B,E) spow_ui(*(B),*(E))
240 #define pow_ri(B,E) spow_ui(*(B),*(E))
241 #define pow_di(B,E) dpow_ui(*(B),*(E))
242 #define pow_zi(p, a, b) {pCd(p) = zpow_ui(Cd(a), *(b));}
243 #define pow_ci(p, a, b) {pCf(p) = cpow_ui(Cf(a), *(b));}
244 #define pow_zz(R,A,B) {pCd(R) = cpow(Cd(A),*(B));}
245 #define s_cat(lpp, rpp, rnp, np, llp) { ftnlen i, nc, ll; char *f__rp, *lp; ll = (llp); lp = (lpp); for(i=0; i < (int)*(np); ++i) { nc = ll; if((rnp)[i] < nc) nc = (rnp)[i]; ll -= nc; f__rp = (rpp)[i]; while(--nc >= 0) *lp++ = *(f__rp)++; } while(--ll >= 0) *lp++ = ' '; }
246 #define s_cmp(a,b,c,d) ((integer)strncmp((a),(b),f2cmin((c),(d))))
247 #define s_copy(A,B,C,D) { int __i,__m; for (__i=0, __m=f2cmin((C),(D)); __i<__m && (B)[__i] != 0; ++__i) (A)[__i] = (B)[__i]; }
248 #define sig_die(s, kill) { exit(1); }
249 #define s_stop(s, n) {exit(0);}
250 static char junk[] = "\n@(#)LIBF77 VERSION 19990503\n";
251 #define z_abs(z) (cabs(Cd(z)))
252 #define z_exp(R, Z) {pCd(R) = cexp(Cd(Z));}
253 #define z_sqrt(R, Z) {pCd(R) = csqrt(Cd(Z));}
254 #define myexit_() break;
255 #define mycycle() continue;
256 #define myceiling(w) {ceil(w)}
257 #define myhuge(w) {HUGE_VAL}
258 //#define mymaxloc_(w,s,e,n) {if (sizeof(*(w)) == sizeof(double)) dmaxloc_((w),*(s),*(e),n); else dmaxloc_((w),*(s),*(e),n);}
259 #define mymaxloc(w,s,e,n) {dmaxloc_(w,*(s),*(e),n)}
261 /* procedure parameter types for -A and -C++ */
263 #define F2C_proc_par_types 1
265 typedef logical (*L_fp)(...);
267 typedef logical (*L_fp)();
270 static float spow_ui(float x, integer n) {
271 float pow=1.0; unsigned long int u;
273 if(n < 0) n = -n, x = 1/x;
282 static double dpow_ui(double x, integer n) {
283 double pow=1.0; unsigned long int u;
285 if(n < 0) n = -n, x = 1/x;
295 static _Fcomplex cpow_ui(complex x, integer n) {
296 complex pow={1.0,0.0}; unsigned long int u;
298 if(n < 0) n = -n, x.r = 1/x.r, x.i=1/x.i;
300 if(u & 01) pow.r *= x.r, pow.i *= x.i;
301 if(u >>= 1) x.r *= x.r, x.i *= x.i;
305 _Fcomplex p={pow.r, pow.i};
309 static _Complex float cpow_ui(_Complex float x, integer n) {
310 _Complex float pow=1.0; unsigned long int u;
312 if(n < 0) n = -n, x = 1/x;
323 static _Dcomplex zpow_ui(_Dcomplex x, integer n) {
324 _Dcomplex pow={1.0,0.0}; unsigned long int u;
326 if(n < 0) n = -n, x._Val[0] = 1/x._Val[0], x._Val[1] =1/x._Val[1];
328 if(u & 01) pow._Val[0] *= x._Val[0], pow._Val[1] *= x._Val[1];
329 if(u >>= 1) x._Val[0] *= x._Val[0], x._Val[1] *= x._Val[1];
333 _Dcomplex p = {pow._Val[0], pow._Val[1]};
337 static _Complex double zpow_ui(_Complex double x, integer n) {
338 _Complex double pow=1.0; unsigned long int u;
340 if(n < 0) n = -n, x = 1/x;
350 static integer pow_ii(integer x, integer n) {
351 integer pow; unsigned long int u;
353 if (n == 0 || x == 1) pow = 1;
354 else if (x != -1) pow = x == 0 ? 1/x : 0;
357 if ((n > 0) || !(n == 0 || x == 1 || x != -1)) {
367 static integer dmaxloc_(double *w, integer s, integer e, integer *n)
369 double m; integer i, mi;
370 for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
371 if (w[i-1]>m) mi=i ,m=w[i-1];
374 static integer smaxloc_(float *w, integer s, integer e, integer *n)
376 float m; integer i, mi;
377 for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
378 if (w[i-1]>m) mi=i ,m=w[i-1];
381 static inline void cdotc_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
382 integer n = *n_, incx = *incx_, incy = *incy_, i;
384 _Fcomplex zdotc = {0.0, 0.0};
385 if (incx == 1 && incy == 1) {
386 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
387 zdotc._Val[0] += conjf(Cf(&x[i]))._Val[0] * Cf(&y[i])._Val[0];
388 zdotc._Val[1] += conjf(Cf(&x[i]))._Val[1] * Cf(&y[i])._Val[1];
391 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
392 zdotc._Val[0] += conjf(Cf(&x[i*incx]))._Val[0] * Cf(&y[i*incy])._Val[0];
393 zdotc._Val[1] += conjf(Cf(&x[i*incx]))._Val[1] * Cf(&y[i*incy])._Val[1];
399 _Complex float zdotc = 0.0;
400 if (incx == 1 && incy == 1) {
401 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
402 zdotc += conjf(Cf(&x[i])) * Cf(&y[i]);
405 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
406 zdotc += conjf(Cf(&x[i*incx])) * Cf(&y[i*incy]);
412 static inline void zdotc_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
413 integer n = *n_, incx = *incx_, incy = *incy_, i;
415 _Dcomplex zdotc = {0.0, 0.0};
416 if (incx == 1 && incy == 1) {
417 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
418 zdotc._Val[0] += conj(Cd(&x[i]))._Val[0] * Cd(&y[i])._Val[0];
419 zdotc._Val[1] += conj(Cd(&x[i]))._Val[1] * Cd(&y[i])._Val[1];
422 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
423 zdotc._Val[0] += conj(Cd(&x[i*incx]))._Val[0] * Cd(&y[i*incy])._Val[0];
424 zdotc._Val[1] += conj(Cd(&x[i*incx]))._Val[1] * Cd(&y[i*incy])._Val[1];
430 _Complex double zdotc = 0.0;
431 if (incx == 1 && incy == 1) {
432 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
433 zdotc += conj(Cd(&x[i])) * Cd(&y[i]);
436 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
437 zdotc += conj(Cd(&x[i*incx])) * Cd(&y[i*incy]);
443 static inline void cdotu_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
444 integer n = *n_, incx = *incx_, incy = *incy_, i;
446 _Fcomplex zdotc = {0.0, 0.0};
447 if (incx == 1 && incy == 1) {
448 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
449 zdotc._Val[0] += Cf(&x[i])._Val[0] * Cf(&y[i])._Val[0];
450 zdotc._Val[1] += Cf(&x[i])._Val[1] * Cf(&y[i])._Val[1];
453 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
454 zdotc._Val[0] += Cf(&x[i*incx])._Val[0] * Cf(&y[i*incy])._Val[0];
455 zdotc._Val[1] += Cf(&x[i*incx])._Val[1] * Cf(&y[i*incy])._Val[1];
461 _Complex float zdotc = 0.0;
462 if (incx == 1 && incy == 1) {
463 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
464 zdotc += Cf(&x[i]) * Cf(&y[i]);
467 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
468 zdotc += Cf(&x[i*incx]) * Cf(&y[i*incy]);
474 static inline void zdotu_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
475 integer n = *n_, incx = *incx_, incy = *incy_, i;
477 _Dcomplex zdotc = {0.0, 0.0};
478 if (incx == 1 && incy == 1) {
479 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
480 zdotc._Val[0] += Cd(&x[i])._Val[0] * Cd(&y[i])._Val[0];
481 zdotc._Val[1] += Cd(&x[i])._Val[1] * Cd(&y[i])._Val[1];
484 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
485 zdotc._Val[0] += Cd(&x[i*incx])._Val[0] * Cd(&y[i*incy])._Val[0];
486 zdotc._Val[1] += Cd(&x[i*incx])._Val[1] * Cd(&y[i*incy])._Val[1];
492 _Complex double zdotc = 0.0;
493 if (incx == 1 && incy == 1) {
494 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
495 zdotc += Cd(&x[i]) * Cd(&y[i]);
498 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
499 zdotc += Cd(&x[i*incx]) * Cd(&y[i*incy]);
505 /* -- translated by f2c (version 20000121).
506 You must link the resulting object file with the libraries:
507 -lf2c -lm (in that order)
513 /* Table of constant values */
515 static integer c__13 = 13;
516 static integer c__15 = 15;
517 static integer c_n1 = -1;
518 static integer c__12 = 12;
519 static integer c__14 = 14;
520 static integer c__16 = 16;
521 static logical c_false = FALSE_;
522 static integer c__1 = 1;
523 static integer c__3 = 3;
525 /* > \brief \b ZLAQR0 computes the eigenvalues of a Hessenberg matrix, and optionally the matrices from the Sc
526 hur decomposition. */
528 /* =========== DOCUMENTATION =========== */
530 /* Online html documentation available at */
531 /* http://www.netlib.org/lapack/explore-html/ */
534 /* > Download ZLAQR0 + dependencies */
535 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zlaqr0.
538 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zlaqr0.
541 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zlaqr0.
549 /* SUBROUTINE ZLAQR0( WANTT, WANTZ, N, ILO, IHI, H, LDH, W, ILOZ, */
550 /* IHIZ, Z, LDZ, WORK, LWORK, INFO ) */
552 /* INTEGER IHI, IHIZ, ILO, ILOZ, INFO, LDH, LDZ, LWORK, N */
553 /* LOGICAL WANTT, WANTZ */
554 /* COMPLEX*16 H( LDH, * ), W( * ), WORK( * ), Z( LDZ, * ) */
557 /* > \par Purpose: */
562 /* > ZLAQR0 computes the eigenvalues of a Hessenberg matrix H */
563 /* > and, optionally, the matrices T and Z from the Schur decomposition */
564 /* > H = Z T Z**H, where T is an upper triangular matrix (the */
565 /* > Schur form), and Z is the unitary matrix of Schur vectors. */
567 /* > Optionally Z may be postmultiplied into an input unitary */
568 /* > matrix Q so that this routine can give the Schur factorization */
569 /* > of a matrix A which has been reduced to the Hessenberg form H */
570 /* > by the unitary matrix Q: A = Q*H*Q**H = (QZ)*H*(QZ)**H. */
576 /* > \param[in] WANTT */
578 /* > WANTT is LOGICAL */
579 /* > = .TRUE. : the full Schur form T is required; */
580 /* > = .FALSE.: only eigenvalues are required. */
583 /* > \param[in] WANTZ */
585 /* > WANTZ is LOGICAL */
586 /* > = .TRUE. : the matrix of Schur vectors Z is required; */
587 /* > = .FALSE.: Schur vectors are not required. */
593 /* > The order of the matrix H. N >= 0. */
596 /* > \param[in] ILO */
598 /* > ILO is INTEGER */
601 /* > \param[in] IHI */
603 /* > IHI is INTEGER */
605 /* > It is assumed that H is already upper triangular in rows */
606 /* > and columns 1:ILO-1 and IHI+1:N and, if ILO > 1, */
607 /* > H(ILO,ILO-1) is zero. ILO and IHI are normally set by a */
608 /* > previous call to ZGEBAL, and then passed to ZGEHRD when the */
609 /* > matrix output by ZGEBAL is reduced to Hessenberg form. */
610 /* > Otherwise, ILO and IHI should be set to 1 and N, */
611 /* > respectively. If N > 0, then 1 <= ILO <= IHI <= N. */
612 /* > If N = 0, then ILO = 1 and IHI = 0. */
615 /* > \param[in,out] H */
617 /* > H is COMPLEX*16 array, dimension (LDH,N) */
618 /* > On entry, the upper Hessenberg matrix H. */
619 /* > On exit, if INFO = 0 and WANTT is .TRUE., then H */
620 /* > contains the upper triangular matrix T from the Schur */
621 /* > decomposition (the Schur form). If INFO = 0 and WANT is */
622 /* > .FALSE., then the contents of H are unspecified on exit. */
623 /* > (The output value of H when INFO > 0 is given under the */
624 /* > description of INFO below.) */
626 /* > This subroutine may explicitly set H(i,j) = 0 for i > j and */
627 /* > j = 1, 2, ... ILO-1 or j = IHI+1, IHI+2, ... N. */
630 /* > \param[in] LDH */
632 /* > LDH is INTEGER */
633 /* > The leading dimension of the array H. LDH >= f2cmax(1,N). */
636 /* > \param[out] W */
638 /* > W is COMPLEX*16 array, dimension (N) */
639 /* > The computed eigenvalues of H(ILO:IHI,ILO:IHI) are stored */
640 /* > in W(ILO:IHI). If WANTT is .TRUE., then the eigenvalues are */
641 /* > stored in the same order as on the diagonal of the Schur */
642 /* > form returned in H, with W(i) = H(i,i). */
645 /* > \param[in] ILOZ */
647 /* > ILOZ is INTEGER */
650 /* > \param[in] IHIZ */
652 /* > IHIZ is INTEGER */
653 /* > Specify the rows of Z to which transformations must be */
654 /* > applied if WANTZ is .TRUE.. */
655 /* > 1 <= ILOZ <= ILO; IHI <= IHIZ <= N. */
658 /* > \param[in,out] Z */
660 /* > Z is COMPLEX*16 array, dimension (LDZ,IHI) */
661 /* > If WANTZ is .FALSE., then Z is not referenced. */
662 /* > If WANTZ is .TRUE., then Z(ILO:IHI,ILOZ:IHIZ) is */
663 /* > replaced by Z(ILO:IHI,ILOZ:IHIZ)*U where U is the */
664 /* > orthogonal Schur factor of H(ILO:IHI,ILO:IHI). */
665 /* > (The output value of Z when INFO > 0 is given under */
666 /* > the description of INFO below.) */
669 /* > \param[in] LDZ */
671 /* > LDZ is INTEGER */
672 /* > The leading dimension of the array Z. if WANTZ is .TRUE. */
673 /* > then LDZ >= MAX(1,IHIZ). Otherwise, LDZ >= 1. */
676 /* > \param[out] WORK */
678 /* > WORK is COMPLEX*16 array, dimension LWORK */
679 /* > On exit, if LWORK = -1, WORK(1) returns an estimate of */
680 /* > the optimal value for LWORK. */
683 /* > \param[in] LWORK */
685 /* > LWORK is INTEGER */
686 /* > The dimension of the array WORK. LWORK >= f2cmax(1,N) */
687 /* > is sufficient, but LWORK typically as large as 6*N may */
688 /* > be required for optimal performance. A workspace query */
689 /* > to determine the optimal workspace size is recommended. */
691 /* > If LWORK = -1, then ZLAQR0 does a workspace query. */
692 /* > In this case, ZLAQR0 checks the input parameters and */
693 /* > estimates the optimal workspace size for the given */
694 /* > values of N, ILO and IHI. The estimate is returned */
695 /* > in WORK(1). No error message related to LWORK is */
696 /* > issued by XERBLA. Neither H nor Z are accessed. */
699 /* > \param[out] INFO */
701 /* > INFO is INTEGER */
702 /* > = 0: successful exit */
703 /* > > 0: if INFO = i, ZLAQR0 failed to compute all of */
704 /* > the eigenvalues. Elements 1:ilo-1 and i+1:n of WR */
705 /* > and WI contain those eigenvalues which have been */
706 /* > successfully computed. (Failures are rare.) */
708 /* > If INFO > 0 and WANT is .FALSE., then on exit, */
709 /* > the remaining unconverged eigenvalues are the eigen- */
710 /* > values of the upper Hessenberg matrix rows and */
711 /* > columns ILO through INFO of the final, output */
714 /* > If INFO > 0 and WANTT is .TRUE., then on exit */
716 /* > (*) (initial value of H)*U = U*(final value of H) */
718 /* > where U is a unitary matrix. The final */
719 /* > value of H is upper Hessenberg and triangular in */
720 /* > rows and columns INFO+1 through IHI. */
722 /* > If INFO > 0 and WANTZ is .TRUE., then on exit */
724 /* > (final value of Z(ILO:IHI,ILOZ:IHIZ) */
725 /* > = (initial value of Z(ILO:IHI,ILOZ:IHIZ)*U */
727 /* > where U is the unitary matrix in (*) (regard- */
728 /* > less of the value of WANTT.) */
730 /* > If INFO > 0 and WANTZ is .FALSE., then Z is not */
737 /* > \author Univ. of Tennessee */
738 /* > \author Univ. of California Berkeley */
739 /* > \author Univ. of Colorado Denver */
740 /* > \author NAG Ltd. */
742 /* > \date December 2016 */
744 /* > \ingroup complex16OTHERauxiliary */
746 /* > \par Contributors: */
747 /* ================== */
749 /* > Karen Braman and Ralph Byers, Department of Mathematics, */
750 /* > University of Kansas, USA */
752 /* > \par References: */
753 /* ================ */
755 /* > K. Braman, R. Byers and R. Mathias, The Multi-Shift QR */
756 /* > Algorithm Part I: Maintaining Well Focused Shifts, and Level 3 */
757 /* > Performance, SIAM Journal of Matrix Analysis, volume 23, pages */
758 /* > 929--947, 2002. */
760 /* > K. Braman, R. Byers and R. Mathias, The Multi-Shift QR */
761 /* > Algorithm Part II: Aggressive Early Deflation, SIAM Journal */
762 /* > of Matrix Analysis, volume 23, pages 948--973, 2002. */
764 /* ===================================================================== */
765 /* Subroutine */ int zlaqr0_(logical *wantt, logical *wantz, integer *n,
766 integer *ilo, integer *ihi, doublecomplex *h__, integer *ldh,
767 doublecomplex *w, integer *iloz, integer *ihiz, doublecomplex *z__,
768 integer *ldz, doublecomplex *work, integer *lwork, integer *info)
770 /* System generated locals */
771 integer h_dim1, h_offset, z_dim1, z_offset, i__1, i__2, i__3, i__4, i__5;
772 doublereal d__1, d__2, d__3, d__4, d__5, d__6, d__7, d__8;
773 doublecomplex z__1, z__2, z__3, z__4, z__5;
775 /* Local variables */
776 integer ndec, ndfl, kbot, nmin;
779 doublecomplex zdum[1] /* was [1][1] */;
780 integer kacc22, i__, k;
782 integer itmax, nsmax, nwmax, kwtop;
783 doublecomplex aa, bb, cc, dd;
784 extern /* Subroutine */ int zlaqr3_(logical *, logical *, integer *,
785 integer *, integer *, integer *, doublecomplex *, integer *,
786 integer *, integer *, doublecomplex *, integer *, integer *,
787 integer *, doublecomplex *, doublecomplex *, integer *, integer *,
788 doublecomplex *, integer *, integer *, doublecomplex *, integer *
789 , doublecomplex *, integer *), zlaqr4_(logical *, logical *,
790 integer *, integer *, integer *, doublecomplex *, integer *,
791 doublecomplex *, integer *, integer *, doublecomplex *, integer *,
792 doublecomplex *, integer *, integer *), zlaqr5_(logical *,
793 logical *, integer *, integer *, integer *, integer *, integer *,
794 doublecomplex *, doublecomplex *, integer *, integer *, integer *,
795 doublecomplex *, integer *, doublecomplex *, integer *,
796 doublecomplex *, integer *, integer *, doublecomplex *, integer *,
797 integer *, doublecomplex *, integer *);
798 integer ld, nh, nibble, it, ks, kt, ku, kv, ls, ns, nw;
799 extern integer ilaenv_(integer *, char *, char *, integer *, integer *,
800 integer *, integer *, ftnlen, ftnlen);
802 doublecomplex rtdisc;
805 extern /* Subroutine */ int zlahqr_(logical *, logical *, integer *,
806 integer *, integer *, doublecomplex *, integer *, doublecomplex *,
807 integer *, integer *, doublecomplex *, integer *, integer *),
808 zlacpy_(char *, integer *, integer *, doublecomplex *, integer *,
809 doublecomplex *, integer *);
811 doublecomplex tr2, det;
812 integer inf, kdu, nho, nve, kwh, nsr, nwr, kwv;
815 /* -- LAPACK auxiliary routine (version 3.7.0) -- */
816 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
817 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
821 /* ================================================================ */
824 /* ==== Matrices of order NTINY or smaller must be processed by */
825 /* . ZLAHQR because of insufficient subdiagonal scratch space. */
826 /* . (This is a hard limit.) ==== */
828 /* ==== Exceptional deflation windows: try to cure rare */
829 /* . slow convergence by varying the size of the */
830 /* . deflation window after KEXNW iterations. ==== */
832 /* ==== Exceptional shifts: try to cure rare slow convergence */
833 /* . with ad-hoc exceptional shifts every KEXSH iterations. */
836 /* ==== The constant WILK1 is used to form the exceptional */
838 /* Parameter adjustments */
840 h_offset = 1 + h_dim1 * 1;
844 z_offset = 1 + z_dim1 * 1;
851 /* ==== Quick return for N = 0: nothing to do. ==== */
854 work[1].r = 1., work[1].i = 0.;
860 /* ==== Tiny matrices must use ZLAHQR. ==== */
864 zlahqr_(wantt, wantz, n, ilo, ihi, &h__[h_offset], ldh, &w[1],
865 iloz, ihiz, &z__[z_offset], ldz, info);
869 /* ==== Use small bulge multi-shift QR with aggressive early */
870 /* . deflation on larger-than-tiny matrices. ==== */
872 /* ==== Hope for the best. ==== */
876 /* ==== Set up job flags for ILAENV. ==== */
879 *(unsigned char *)jbcmpz = 'S';
881 *(unsigned char *)jbcmpz = 'E';
884 *(unsigned char *)&jbcmpz[1] = 'V';
886 *(unsigned char *)&jbcmpz[1] = 'N';
889 /* ==== NWR = recommended deflation window size. At this */
890 /* . point, N .GT. NTINY = 15, so there is enough */
891 /* . subdiagonal workspace for NWR.GE.2 as required. */
892 /* . (In fact, there is enough subdiagonal space for */
893 /* . NWR.GE.4.) ==== */
895 nwr = ilaenv_(&c__13, "ZLAQR0", jbcmpz, n, ilo, ihi, lwork, (ftnlen)6,
899 i__1 = *ihi - *ilo + 1, i__2 = (*n - 1) / 3, i__1 = f2cmin(i__1,i__2);
900 nwr = f2cmin(i__1,nwr);
902 /* ==== NSR = recommended number of simultaneous shifts. */
903 /* . At this point N .GT. NTINY = 15, so there is at */
904 /* . enough subdiagonal workspace for NSR to be even */
905 /* . and greater than or equal to two as required. ==== */
907 nsr = ilaenv_(&c__15, "ZLAQR0", jbcmpz, n, ilo, ihi, lwork, (ftnlen)6,
910 i__1 = nsr, i__2 = (*n - 3) / 6, i__1 = f2cmin(i__1,i__2), i__2 = *ihi -
912 nsr = f2cmin(i__1,i__2);
914 i__1 = 2, i__2 = nsr - nsr % 2;
915 nsr = f2cmax(i__1,i__2);
917 /* ==== Estimate optimal workspace ==== */
919 /* ==== Workspace query call to ZLAQR3 ==== */
922 zlaqr3_(wantt, wantz, n, ilo, ihi, &i__1, &h__[h_offset], ldh, iloz,
923 ihiz, &z__[z_offset], ldz, &ls, &ld, &w[1], &h__[h_offset],
924 ldh, n, &h__[h_offset], ldh, n, &h__[h_offset], ldh, &work[1],
927 /* ==== Optimal workspace = MAX(ZLAQR5, ZLAQR3) ==== */
930 i__1 = nsr * 3 / 2, i__2 = (integer) work[1].r;
931 lwkopt = f2cmax(i__1,i__2);
933 /* ==== Quick return in case of workspace query. ==== */
936 d__1 = (doublereal) lwkopt;
937 z__1.r = d__1, z__1.i = 0.;
938 work[1].r = z__1.r, work[1].i = z__1.i;
942 /* ==== ZLAHQR/ZLAQR0 crossover point ==== */
944 nmin = ilaenv_(&c__12, "ZLAQR0", jbcmpz, n, ilo, ihi, lwork, (ftnlen)
946 nmin = f2cmax(15,nmin);
948 /* ==== Nibble crossover point ==== */
950 nibble = ilaenv_(&c__14, "ZLAQR0", jbcmpz, n, ilo, ihi, lwork, (
951 ftnlen)6, (ftnlen)2);
952 nibble = f2cmax(0,nibble);
954 /* ==== Accumulate reflections during ttswp? Use block */
955 /* . 2-by-2 structure during matrix-matrix multiply? ==== */
957 kacc22 = ilaenv_(&c__16, "ZLAQR0", jbcmpz, n, ilo, ihi, lwork, (
958 ftnlen)6, (ftnlen)2);
959 kacc22 = f2cmax(0,kacc22);
960 kacc22 = f2cmin(2,kacc22);
962 /* ==== NWMAX = the largest possible deflation window for */
963 /* . which there is sufficient workspace. ==== */
966 i__1 = (*n - 1) / 3, i__2 = *lwork / 2;
967 nwmax = f2cmin(i__1,i__2);
970 /* ==== NSMAX = the Largest number of simultaneous shifts */
971 /* . for which there is sufficient workspace. ==== */
974 i__1 = (*n - 3) / 6, i__2 = (*lwork << 1) / 3;
975 nsmax = f2cmin(i__1,i__2);
978 /* ==== NDFL: an iteration count restarted at deflation. ==== */
982 /* ==== ITMAX = iteration limit ==== */
985 i__1 = 10, i__2 = *ihi - *ilo + 1;
986 itmax = 30 * f2cmax(i__1,i__2);
988 /* ==== Last row and column in the active block ==== */
992 /* ==== Main Loop ==== */
995 for (it = 1; it <= i__1; ++it) {
997 /* ==== Done when KBOT falls below ILO ==== */
1003 /* ==== Locate active block ==== */
1006 for (k = kbot; k >= i__2; --k) {
1007 i__3 = k + (k - 1) * h_dim1;
1008 if (h__[i__3].r == 0. && h__[i__3].i == 0.) {
1017 /* ==== Select deflation window size: */
1018 /* . Typical Case: */
1019 /* . If possible and advisable, nibble the entire */
1020 /* . active block. If not, use size MIN(NWR,NWMAX) */
1021 /* . or MIN(NWR+1,NWMAX) depending upon which has */
1022 /* . the smaller corresponding subdiagonal entry */
1023 /* . (a heuristic). */
1025 /* . Exceptional Case: */
1026 /* . If there have been no deflations in KEXNW or */
1027 /* . more iterations, then vary the deflation window */
1028 /* . size. At first, because, larger windows are, */
1029 /* . in general, more powerful than smaller ones, */
1030 /* . rapidly increase the window to the maximum possible. */
1031 /* . Then, gradually reduce the window size. ==== */
1033 nh = kbot - ktop + 1;
1034 nwupbd = f2cmin(nh,nwmax);
1036 nw = f2cmin(nwupbd,nwr);
1039 i__2 = nwupbd, i__3 = nw << 1;
1040 nw = f2cmin(i__2,i__3);
1046 kwtop = kbot - nw + 1;
1047 i__2 = kwtop + (kwtop - 1) * h_dim1;
1048 i__3 = kwtop - 1 + (kwtop - 2) * h_dim1;
1049 if ((d__1 = h__[i__2].r, abs(d__1)) + (d__2 = d_imag(&h__[
1050 kwtop + (kwtop - 1) * h_dim1]), abs(d__2)) > (
1051 d__3 = h__[i__3].r, abs(d__3)) + (d__4 = d_imag(&
1052 h__[kwtop - 1 + (kwtop - 2) * h_dim1]), abs(d__4))
1060 } else if (ndec >= 0 || nw >= nwupbd) {
1062 if (nw - ndec < 2) {
1068 /* ==== Aggressive early deflation: */
1069 /* . split workspace under the subdiagonal into */
1070 /* . - an nw-by-nw work array V in the lower */
1071 /* . left-hand-corner, */
1072 /* . - an NW-by-at-least-NW-but-more-is-better */
1073 /* . (NW-by-NHO) horizontal work array along */
1074 /* . the bottom edge, */
1075 /* . - an at-least-NW-but-more-is-better (NHV-by-NW) */
1076 /* . vertical work array along the left-hand-edge. */
1081 nho = *n - nw - 1 - kt + 1;
1083 nve = *n - nw - kwv + 1;
1085 /* ==== Aggressive early deflation ==== */
1087 zlaqr3_(wantt, wantz, n, &ktop, &kbot, &nw, &h__[h_offset], ldh,
1088 iloz, ihiz, &z__[z_offset], ldz, &ls, &ld, &w[1], &h__[kv
1089 + h_dim1], ldh, &nho, &h__[kv + kt * h_dim1], ldh, &nve, &
1090 h__[kwv + h_dim1], ldh, &work[1], lwork);
1092 /* ==== Adjust KBOT accounting for new deflations. ==== */
1096 /* ==== KS points to the shifts. ==== */
1100 /* ==== Skip an expensive QR sweep if there is a (partly */
1101 /* . heuristic) reason to expect that many eigenvalues */
1102 /* . will deflate without it. Here, the QR sweep is */
1103 /* . skipped if many eigenvalues have just been deflated */
1104 /* . or if the remaining active block is small. */
1106 if (ld == 0 || ld * 100 <= nw * nibble && kbot - ktop + 1 > f2cmin(
1109 /* ==== NS = nominal number of simultaneous shifts. */
1110 /* . This may be lowered (slightly) if ZLAQR3 */
1111 /* . did not provide that many shifts. ==== */
1115 i__4 = 2, i__5 = kbot - ktop;
1116 i__2 = f2cmin(nsmax,nsr), i__3 = f2cmax(i__4,i__5);
1117 ns = f2cmin(i__2,i__3);
1120 /* ==== If there have been no deflations */
1121 /* . in a multiple of KEXSH iterations, */
1122 /* . then try exceptional shifts. */
1123 /* . Otherwise use shifts provided by */
1124 /* . ZLAQR3 above or from the eigenvalues */
1125 /* . of a trailing principal submatrix. ==== */
1127 if (ndfl % 6 == 0) {
1130 for (i__ = kbot; i__ >= i__2; i__ += -2) {
1132 i__4 = i__ + i__ * h_dim1;
1133 i__5 = i__ + (i__ - 1) * h_dim1;
1134 d__3 = ((d__1 = h__[i__5].r, abs(d__1)) + (d__2 =
1135 d_imag(&h__[i__ + (i__ - 1) * h_dim1]), abs(
1137 z__1.r = h__[i__4].r + d__3, z__1.i = h__[i__4].i;
1138 w[i__3].r = z__1.r, w[i__3].i = z__1.i;
1141 w[i__3].r = w[i__4].r, w[i__3].i = w[i__4].i;
1146 /* ==== Got NS/2 or fewer shifts? Use ZLAQR4 or */
1147 /* . ZLAHQR on a trailing principal submatrix to */
1148 /* . get more. (Since NS.LE.NSMAX.LE.(N-3)/6, */
1149 /* . there is enough space below the subdiagonal */
1150 /* . to fit an NS-by-NS scratch array.) ==== */
1152 if (kbot - ks + 1 <= ns / 2) {
1155 zlacpy_("A", &ns, &ns, &h__[ks + ks * h_dim1], ldh, &
1156 h__[kt + h_dim1], ldh);
1158 zlaqr4_(&c_false, &c_false, &ns, &c__1, &ns, &h__[
1159 kt + h_dim1], ldh, &w[ks], &c__1, &c__1,
1160 zdum, &c__1, &work[1], lwork, &inf);
1162 zlahqr_(&c_false, &c_false, &ns, &c__1, &ns, &h__[
1163 kt + h_dim1], ldh, &w[ks], &c__1, &c__1,
1168 /* ==== In case of a rare QR failure use */
1169 /* . eigenvalues of the trailing 2-by-2 */
1170 /* . principal submatrix. Scale to avoid */
1171 /* . overflows, underflows and subnormals. */
1172 /* . (The scale factor S can not be zero, */
1173 /* . because H(KBOT,KBOT-1) is nonzero.) ==== */
1176 i__2 = kbot - 1 + (kbot - 1) * h_dim1;
1177 i__3 = kbot + (kbot - 1) * h_dim1;
1178 i__4 = kbot - 1 + kbot * h_dim1;
1179 i__5 = kbot + kbot * h_dim1;
1180 s = (d__1 = h__[i__2].r, abs(d__1)) + (d__2 =
1181 d_imag(&h__[kbot - 1 + (kbot - 1) *
1182 h_dim1]), abs(d__2)) + ((d__3 = h__[i__3]
1183 .r, abs(d__3)) + (d__4 = d_imag(&h__[kbot
1184 + (kbot - 1) * h_dim1]), abs(d__4))) + ((
1185 d__5 = h__[i__4].r, abs(d__5)) + (d__6 =
1186 d_imag(&h__[kbot - 1 + kbot * h_dim1]),
1187 abs(d__6))) + ((d__7 = h__[i__5].r, abs(
1188 d__7)) + (d__8 = d_imag(&h__[kbot + kbot *
1189 h_dim1]), abs(d__8)));
1190 i__2 = kbot - 1 + (kbot - 1) * h_dim1;
1191 z__1.r = h__[i__2].r / s, z__1.i = h__[i__2].i /
1193 aa.r = z__1.r, aa.i = z__1.i;
1194 i__2 = kbot + (kbot - 1) * h_dim1;
1195 z__1.r = h__[i__2].r / s, z__1.i = h__[i__2].i /
1197 cc.r = z__1.r, cc.i = z__1.i;
1198 i__2 = kbot - 1 + kbot * h_dim1;
1199 z__1.r = h__[i__2].r / s, z__1.i = h__[i__2].i /
1201 bb.r = z__1.r, bb.i = z__1.i;
1202 i__2 = kbot + kbot * h_dim1;
1203 z__1.r = h__[i__2].r / s, z__1.i = h__[i__2].i /
1205 dd.r = z__1.r, dd.i = z__1.i;
1206 z__2.r = aa.r + dd.r, z__2.i = aa.i + dd.i;
1207 z__1.r = z__2.r / 2., z__1.i = z__2.i / 2.;
1208 tr2.r = z__1.r, tr2.i = z__1.i;
1209 z__3.r = aa.r - tr2.r, z__3.i = aa.i - tr2.i;
1210 z__4.r = dd.r - tr2.r, z__4.i = dd.i - tr2.i;
1211 z__2.r = z__3.r * z__4.r - z__3.i * z__4.i,
1212 z__2.i = z__3.r * z__4.i + z__3.i *
1214 z__5.r = bb.r * cc.r - bb.i * cc.i, z__5.i = bb.r
1215 * cc.i + bb.i * cc.r;
1216 z__1.r = z__2.r - z__5.r, z__1.i = z__2.i -
1218 det.r = z__1.r, det.i = z__1.i;
1219 z__2.r = -det.r, z__2.i = -det.i;
1220 z_sqrt(&z__1, &z__2);
1221 rtdisc.r = z__1.r, rtdisc.i = z__1.i;
1223 z__2.r = tr2.r + rtdisc.r, z__2.i = tr2.i +
1225 z__1.r = s * z__2.r, z__1.i = s * z__2.i;
1226 w[i__2].r = z__1.r, w[i__2].i = z__1.i;
1228 z__2.r = tr2.r - rtdisc.r, z__2.i = tr2.i -
1230 z__1.r = s * z__2.r, z__1.i = s * z__2.i;
1231 w[i__2].r = z__1.r, w[i__2].i = z__1.i;
1237 if (kbot - ks + 1 > ns) {
1239 /* ==== Sort the shifts (Helps a little) ==== */
1243 for (k = kbot; k >= i__2; --k) {
1249 for (i__ = ks; i__ <= i__3; ++i__) {
1252 if ((d__1 = w[i__4].r, abs(d__1)) + (d__2 =
1253 d_imag(&w[i__]), abs(d__2)) < (d__3 =
1254 w[i__5].r, abs(d__3)) + (d__4 =
1255 d_imag(&w[i__ + 1]), abs(d__4))) {
1258 swap.r = w[i__4].r, swap.i = w[i__4].i;
1261 w[i__4].r = w[i__5].r, w[i__4].i = w[i__5]
1264 w[i__4].r = swap.r, w[i__4].i = swap.i;
1275 /* ==== If there are only two shifts, then use */
1276 /* . only one. ==== */
1278 if (kbot - ks + 1 == 2) {
1280 i__3 = kbot + kbot * h_dim1;
1281 z__2.r = w[i__2].r - h__[i__3].r, z__2.i = w[i__2].i -
1283 z__1.r = z__2.r, z__1.i = z__2.i;
1285 i__5 = kbot + kbot * h_dim1;
1286 z__4.r = w[i__4].r - h__[i__5].r, z__4.i = w[i__4].i -
1288 z__3.r = z__4.r, z__3.i = z__4.i;
1289 if ((d__1 = z__1.r, abs(d__1)) + (d__2 = d_imag(&z__1),
1290 abs(d__2)) < (d__3 = z__3.r, abs(d__3)) + (d__4 =
1291 d_imag(&z__3), abs(d__4))) {
1294 w[i__2].r = w[i__3].r, w[i__2].i = w[i__3].i;
1298 w[i__2].r = w[i__3].r, w[i__2].i = w[i__3].i;
1302 /* ==== Use up to NS of the the smallest magnitude */
1303 /* . shifts. If there aren't NS shifts available, */
1304 /* . then use them all, possibly dropping one to */
1305 /* . make the number of shifts even. ==== */
1308 i__2 = ns, i__3 = kbot - ks + 1;
1309 ns = f2cmin(i__2,i__3);
1313 /* ==== Small-bulge multi-shift QR sweep: */
1314 /* . split workspace under the subdiagonal into */
1315 /* . - a KDU-by-KDU work array U in the lower */
1316 /* . left-hand-corner, */
1317 /* . - a KDU-by-at-least-KDU-but-more-is-better */
1318 /* . (KDU-by-NHo) horizontal work array WH along */
1319 /* . the bottom edge, */
1320 /* . - and an at-least-KDU-but-more-is-better-by-KDU */
1321 /* . (NVE-by-KDU) vertical work WV arrow along */
1322 /* . the left-hand-edge. ==== */
1327 nho = *n - kdu - 3 - (kdu + 1) + 1;
1329 nve = *n - kdu - kwv + 1;
1331 /* ==== Small-bulge multi-shift QR sweep ==== */
1333 zlaqr5_(wantt, wantz, &kacc22, n, &ktop, &kbot, &ns, &w[ks], &
1334 h__[h_offset], ldh, iloz, ihiz, &z__[z_offset], ldz, &
1335 work[1], &c__3, &h__[ku + h_dim1], ldh, &nve, &h__[
1336 kwv + h_dim1], ldh, &nho, &h__[ku + kwh * h_dim1],
1340 /* ==== Note progress (or the lack of it). ==== */
1348 /* ==== End of main loop ==== */
1352 /* ==== Iteration limit exceeded. Set INFO to show where */
1353 /* . the problem occurred and exit. ==== */
1360 /* ==== Return the optimal value of LWORK. ==== */
1362 d__1 = (doublereal) lwkopt;
1363 z__1.r = d__1, z__1.i = 0.;
1364 work[1].r = z__1.r, work[1].i = z__1.i;
1366 /* ==== End of ZLAQR0 ==== */