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 doublecomplex c_b2 = {1.,0.};
516 static integer c__1 = 1;
518 /* > \brief \b ZTREVC */
520 /* =========== DOCUMENTATION =========== */
522 /* Online html documentation available at */
523 /* http://www.netlib.org/lapack/explore-html/ */
526 /* > Download ZTREVC + dependencies */
527 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/ztrevc.
530 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/ztrevc.
533 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/ztrevc.
541 /* SUBROUTINE ZTREVC( SIDE, HOWMNY, SELECT, N, T, LDT, VL, LDVL, VR, */
542 /* LDVR, MM, M, WORK, RWORK, INFO ) */
544 /* CHARACTER HOWMNY, SIDE */
545 /* INTEGER INFO, LDT, LDVL, LDVR, M, MM, N */
546 /* LOGICAL SELECT( * ) */
547 /* DOUBLE PRECISION RWORK( * ) */
548 /* COMPLEX*16 T( LDT, * ), VL( LDVL, * ), VR( LDVR, * ), */
552 /* > \par Purpose: */
557 /* > ZTREVC computes some or all of the right and/or left eigenvectors of */
558 /* > a complex upper triangular matrix T. */
559 /* > Matrices of this type are produced by the Schur factorization of */
560 /* > a complex general matrix: A = Q*T*Q**H, as computed by ZHSEQR. */
562 /* > The right eigenvector x and the left eigenvector y of T corresponding */
563 /* > to an eigenvalue w are defined by: */
565 /* > T*x = w*x, (y**H)*T = w*(y**H) */
567 /* > where y**H denotes the conjugate transpose of the vector y. */
568 /* > The eigenvalues are not input to this routine, but are read directly */
569 /* > from the diagonal of T. */
571 /* > This routine returns the matrices X and/or Y of right and left */
572 /* > eigenvectors of T, or the products Q*X and/or Q*Y, where Q is an */
573 /* > input matrix. If Q is the unitary factor that reduces a matrix A to */
574 /* > Schur form T, then Q*X and Q*Y are the matrices of right and left */
575 /* > eigenvectors of A. */
581 /* > \param[in] SIDE */
583 /* > SIDE is CHARACTER*1 */
584 /* > = 'R': compute right eigenvectors only; */
585 /* > = 'L': compute left eigenvectors only; */
586 /* > = 'B': compute both right and left eigenvectors. */
589 /* > \param[in] HOWMNY */
591 /* > HOWMNY is CHARACTER*1 */
592 /* > = 'A': compute all right and/or left eigenvectors; */
593 /* > = 'B': compute all right and/or left eigenvectors, */
594 /* > backtransformed using the matrices supplied in */
595 /* > VR and/or VL; */
596 /* > = 'S': compute selected right and/or left eigenvectors, */
597 /* > as indicated by the logical array SELECT. */
600 /* > \param[in] SELECT */
602 /* > SELECT is LOGICAL array, dimension (N) */
603 /* > If HOWMNY = 'S', SELECT specifies the eigenvectors to be */
605 /* > The eigenvector corresponding to the j-th eigenvalue is */
606 /* > computed if SELECT(j) = .TRUE.. */
607 /* > Not referenced if HOWMNY = 'A' or 'B'. */
613 /* > The order of the matrix T. N >= 0. */
616 /* > \param[in,out] T */
618 /* > T is COMPLEX*16 array, dimension (LDT,N) */
619 /* > The upper triangular matrix T. T is modified, but restored */
623 /* > \param[in] LDT */
625 /* > LDT is INTEGER */
626 /* > The leading dimension of the array T. LDT >= f2cmax(1,N). */
629 /* > \param[in,out] VL */
631 /* > VL is COMPLEX*16 array, dimension (LDVL,MM) */
632 /* > On entry, if SIDE = 'L' or 'B' and HOWMNY = 'B', VL must */
633 /* > contain an N-by-N matrix Q (usually the unitary matrix Q of */
634 /* > Schur vectors returned by ZHSEQR). */
635 /* > On exit, if SIDE = 'L' or 'B', VL contains: */
636 /* > if HOWMNY = 'A', the matrix Y of left eigenvectors of T; */
637 /* > if HOWMNY = 'B', the matrix Q*Y; */
638 /* > if HOWMNY = 'S', the left eigenvectors of T specified by */
639 /* > SELECT, stored consecutively in the columns */
640 /* > of VL, in the same order as their */
642 /* > Not referenced if SIDE = 'R'. */
645 /* > \param[in] LDVL */
647 /* > LDVL is INTEGER */
648 /* > The leading dimension of the array VL. LDVL >= 1, and if */
649 /* > SIDE = 'L' or 'B', LDVL >= N. */
652 /* > \param[in,out] VR */
654 /* > VR is COMPLEX*16 array, dimension (LDVR,MM) */
655 /* > On entry, if SIDE = 'R' or 'B' and HOWMNY = 'B', VR must */
656 /* > contain an N-by-N matrix Q (usually the unitary matrix Q of */
657 /* > Schur vectors returned by ZHSEQR). */
658 /* > On exit, if SIDE = 'R' or 'B', VR contains: */
659 /* > if HOWMNY = 'A', the matrix X of right eigenvectors of T; */
660 /* > if HOWMNY = 'B', the matrix Q*X; */
661 /* > if HOWMNY = 'S', the right eigenvectors of T specified by */
662 /* > SELECT, stored consecutively in the columns */
663 /* > of VR, in the same order as their */
665 /* > Not referenced if SIDE = 'L'. */
668 /* > \param[in] LDVR */
670 /* > LDVR is INTEGER */
671 /* > The leading dimension of the array VR. LDVR >= 1, and if */
672 /* > SIDE = 'R' or 'B'; LDVR >= N. */
675 /* > \param[in] MM */
677 /* > MM is INTEGER */
678 /* > The number of columns in the arrays VL and/or VR. MM >= M. */
681 /* > \param[out] M */
684 /* > The number of columns in the arrays VL and/or VR actually */
685 /* > used to store the eigenvectors. If HOWMNY = 'A' or 'B', M */
686 /* > is set to N. Each selected eigenvector occupies one */
690 /* > \param[out] WORK */
692 /* > WORK is COMPLEX*16 array, dimension (2*N) */
695 /* > \param[out] RWORK */
697 /* > RWORK is DOUBLE PRECISION array, dimension (N) */
700 /* > \param[out] INFO */
702 /* > INFO is INTEGER */
703 /* > = 0: successful exit */
704 /* > < 0: if INFO = -i, the i-th argument had an illegal value */
710 /* > \author Univ. of Tennessee */
711 /* > \author Univ. of California Berkeley */
712 /* > \author Univ. of Colorado Denver */
713 /* > \author NAG Ltd. */
715 /* > \date November 2017 */
717 /* > \ingroup complex16OTHERcomputational */
719 /* > \par Further Details: */
720 /* ===================== */
724 /* > The algorithm used in this program is basically backward (forward) */
725 /* > substitution, with scaling to make the the code robust against */
726 /* > possible overflow. */
728 /* > Each eigenvector is normalized so that the element of largest */
729 /* > magnitude has magnitude 1; here the magnitude of a complex number */
730 /* > (x,y) is taken to be |x| + |y|. */
733 /* ===================================================================== */
734 /* Subroutine */ int ztrevc_(char *side, char *howmny, logical *select,
735 integer *n, doublecomplex *t, integer *ldt, doublecomplex *vl,
736 integer *ldvl, doublecomplex *vr, integer *ldvr, integer *mm, integer
737 *m, doublecomplex *work, doublereal *rwork, integer *info)
739 /* System generated locals */
740 integer t_dim1, t_offset, vl_dim1, vl_offset, vr_dim1, vr_offset, i__1,
741 i__2, i__3, i__4, i__5;
742 doublereal d__1, d__2, d__3;
743 doublecomplex z__1, z__2;
745 /* Local variables */
747 doublereal unfl, ovfl, smin;
751 extern logical lsame_(char *, char *);
753 logical leftv, bothv;
754 extern /* Subroutine */ int zgemv_(char *, integer *, integer *,
755 doublecomplex *, doublecomplex *, integer *, doublecomplex *,
756 integer *, doublecomplex *, doublecomplex *, integer *);
758 extern /* Subroutine */ int zcopy_(integer *, doublecomplex *, integer *,
759 doublecomplex *, integer *), dlabad_(doublereal *, doublereal *);
761 extern doublereal dlamch_(char *);
763 extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen), zdscal_(
764 integer *, doublereal *, doublecomplex *, integer *);
765 extern integer izamax_(integer *, doublecomplex *, integer *);
767 extern doublereal dzasum_(integer *, doublecomplex *, integer *);
769 extern /* Subroutine */ int zlatrs_(char *, char *, char *, char *,
770 integer *, doublecomplex *, integer *, doublecomplex *,
771 doublereal *, doublereal *, integer *);
775 /* -- LAPACK computational routine (version 3.8.0) -- */
776 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
777 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
781 /* ===================================================================== */
784 /* Decode and test the input parameters */
786 /* Parameter adjustments */
789 t_offset = 1 + t_dim1 * 1;
792 vl_offset = 1 + vl_dim1 * 1;
795 vr_offset = 1 + vr_dim1 * 1;
801 bothv = lsame_(side, "B");
802 rightv = lsame_(side, "R") || bothv;
803 leftv = lsame_(side, "L") || bothv;
805 allv = lsame_(howmny, "A");
806 over = lsame_(howmny, "B");
807 somev = lsame_(howmny, "S");
809 /* Set M to the number of columns required to store the selected */
815 for (j = 1; j <= i__1; ++j) {
826 if (! rightv && ! leftv) {
828 } else if (! allv && ! over && ! somev) {
832 } else if (*ldt < f2cmax(1,*n)) {
834 } else if (*ldvl < 1 || leftv && *ldvl < *n) {
836 } else if (*ldvr < 1 || rightv && *ldvr < *n) {
838 } else if (*mm < *m) {
843 xerbla_("ZTREVC", &i__1, (ftnlen)6);
847 /* Quick return if possible. */
853 /* Set the constants to control overflow. */
855 unfl = dlamch_("Safe minimum");
857 dlabad_(&unfl, &ovfl);
858 ulp = dlamch_("Precision");
859 smlnum = unfl * (*n / ulp);
861 /* Store the diagonal elements of T in working array WORK. */
864 for (i__ = 1; i__ <= i__1; ++i__) {
866 i__3 = i__ + i__ * t_dim1;
867 work[i__2].r = t[i__3].r, work[i__2].i = t[i__3].i;
871 /* Compute 1-norm of each column of strictly upper triangular */
872 /* part of T to control overflow in triangular solver. */
876 for (j = 2; j <= i__1; ++j) {
878 rwork[j] = dzasum_(&i__2, &t[j * t_dim1 + 1], &c__1);
884 /* Compute right eigenvectors. */
887 for (ki = *n; ki >= 1; --ki) {
895 i__1 = ki + ki * t_dim1;
896 d__3 = ulp * ((d__1 = t[i__1].r, abs(d__1)) + (d__2 = d_imag(&t[
897 ki + ki * t_dim1]), abs(d__2)));
898 smin = f2cmax(d__3,smlnum);
900 work[1].r = 1., work[1].i = 0.;
902 /* Form right-hand side. */
905 for (k = 1; k <= i__1; ++k) {
907 i__3 = k + ki * t_dim1;
908 z__1.r = -t[i__3].r, z__1.i = -t[i__3].i;
909 work[i__2].r = z__1.r, work[i__2].i = z__1.i;
913 /* Solve the triangular system: */
914 /* (T(1:KI-1,1:KI-1) - T(KI,KI))*X = SCALE*WORK. */
917 for (k = 1; k <= i__1; ++k) {
918 i__2 = k + k * t_dim1;
919 i__3 = k + k * t_dim1;
920 i__4 = ki + ki * t_dim1;
921 z__1.r = t[i__3].r - t[i__4].r, z__1.i = t[i__3].i - t[i__4]
923 t[i__2].r = z__1.r, t[i__2].i = z__1.i;
924 i__2 = k + k * t_dim1;
925 if ((d__1 = t[i__2].r, abs(d__1)) + (d__2 = d_imag(&t[k + k *
926 t_dim1]), abs(d__2)) < smin) {
927 i__3 = k + k * t_dim1;
928 t[i__3].r = smin, t[i__3].i = 0.;
935 zlatrs_("Upper", "No transpose", "Non-unit", "Y", &i__1, &t[
936 t_offset], ldt, &work[1], &scale, &rwork[1], info);
938 work[i__1].r = scale, work[i__1].i = 0.;
941 /* Copy the vector x or Q*x to VR and normalize. */
944 zcopy_(&ki, &work[1], &c__1, &vr[is * vr_dim1 + 1], &c__1);
946 ii = izamax_(&ki, &vr[is * vr_dim1 + 1], &c__1);
947 i__1 = ii + is * vr_dim1;
948 remax = 1. / ((d__1 = vr[i__1].r, abs(d__1)) + (d__2 = d_imag(
949 &vr[ii + is * vr_dim1]), abs(d__2)));
950 zdscal_(&ki, &remax, &vr[is * vr_dim1 + 1], &c__1);
953 for (k = ki + 1; k <= i__1; ++k) {
954 i__2 = k + is * vr_dim1;
955 vr[i__2].r = 0., vr[i__2].i = 0.;
961 z__1.r = scale, z__1.i = 0.;
962 zgemv_("N", n, &i__1, &c_b2, &vr[vr_offset], ldvr, &work[
963 1], &c__1, &z__1, &vr[ki * vr_dim1 + 1], &c__1);
966 ii = izamax_(n, &vr[ki * vr_dim1 + 1], &c__1);
967 i__1 = ii + ki * vr_dim1;
968 remax = 1. / ((d__1 = vr[i__1].r, abs(d__1)) + (d__2 = d_imag(
969 &vr[ii + ki * vr_dim1]), abs(d__2)));
970 zdscal_(n, &remax, &vr[ki * vr_dim1 + 1], &c__1);
973 /* Set back the original diagonal elements of T. */
976 for (k = 1; k <= i__1; ++k) {
977 i__2 = k + k * t_dim1;
979 t[i__2].r = work[i__3].r, t[i__2].i = work[i__3].i;
991 /* Compute left eigenvectors. */
995 for (ki = 1; ki <= i__1; ++ki) {
1003 i__2 = ki + ki * t_dim1;
1004 d__3 = ulp * ((d__1 = t[i__2].r, abs(d__1)) + (d__2 = d_imag(&t[
1005 ki + ki * t_dim1]), abs(d__2)));
1006 smin = f2cmax(d__3,smlnum);
1009 work[i__2].r = 1., work[i__2].i = 0.;
1011 /* Form right-hand side. */
1014 for (k = ki + 1; k <= i__2; ++k) {
1016 d_cnjg(&z__2, &t[ki + k * t_dim1]);
1017 z__1.r = -z__2.r, z__1.i = -z__2.i;
1018 work[i__3].r = z__1.r, work[i__3].i = z__1.i;
1022 /* Solve the triangular system: */
1023 /* (T(KI+1:N,KI+1:N) - T(KI,KI))**H * X = SCALE*WORK. */
1026 for (k = ki + 1; k <= i__2; ++k) {
1027 i__3 = k + k * t_dim1;
1028 i__4 = k + k * t_dim1;
1029 i__5 = ki + ki * t_dim1;
1030 z__1.r = t[i__4].r - t[i__5].r, z__1.i = t[i__4].i - t[i__5]
1032 t[i__3].r = z__1.r, t[i__3].i = z__1.i;
1033 i__3 = k + k * t_dim1;
1034 if ((d__1 = t[i__3].r, abs(d__1)) + (d__2 = d_imag(&t[k + k *
1035 t_dim1]), abs(d__2)) < smin) {
1036 i__4 = k + k * t_dim1;
1037 t[i__4].r = smin, t[i__4].i = 0.;
1044 zlatrs_("Upper", "Conjugate transpose", "Non-unit", "Y", &
1045 i__2, &t[ki + 1 + (ki + 1) * t_dim1], ldt, &work[ki +
1046 1], &scale, &rwork[1], info);
1048 work[i__2].r = scale, work[i__2].i = 0.;
1051 /* Copy the vector x or Q*x to VL and normalize. */
1055 zcopy_(&i__2, &work[ki], &c__1, &vl[ki + is * vl_dim1], &c__1)
1059 ii = izamax_(&i__2, &vl[ki + is * vl_dim1], &c__1) + ki - 1;
1060 i__2 = ii + is * vl_dim1;
1061 remax = 1. / ((d__1 = vl[i__2].r, abs(d__1)) + (d__2 = d_imag(
1062 &vl[ii + is * vl_dim1]), abs(d__2)));
1064 zdscal_(&i__2, &remax, &vl[ki + is * vl_dim1], &c__1);
1067 for (k = 1; k <= i__2; ++k) {
1068 i__3 = k + is * vl_dim1;
1069 vl[i__3].r = 0., vl[i__3].i = 0.;
1075 z__1.r = scale, z__1.i = 0.;
1076 zgemv_("N", n, &i__2, &c_b2, &vl[(ki + 1) * vl_dim1 + 1],
1077 ldvl, &work[ki + 1], &c__1, &z__1, &vl[ki *
1078 vl_dim1 + 1], &c__1);
1081 ii = izamax_(n, &vl[ki * vl_dim1 + 1], &c__1);
1082 i__2 = ii + ki * vl_dim1;
1083 remax = 1. / ((d__1 = vl[i__2].r, abs(d__1)) + (d__2 = d_imag(
1084 &vl[ii + ki * vl_dim1]), abs(d__2)));
1085 zdscal_(n, &remax, &vl[ki * vl_dim1 + 1], &c__1);
1088 /* Set back the original diagonal elements of T. */
1091 for (k = ki + 1; k <= i__2; ++k) {
1092 i__3 = k + k * t_dim1;
1094 t[i__3].r = work[i__4].r, t[i__3].i = work[i__4].i;