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_b1 = {0.,0.};
516 static doublecomplex c_b2 = {1.,0.};
517 static integer c__1 = 1;
518 static integer c_n1 = -1;
519 static integer c__2 = 2;
521 /* > \brief \b ZTREVC3 */
523 /* =========== DOCUMENTATION =========== */
525 /* Online html documentation available at */
526 /* http://www.netlib.org/lapack/explore-html/ */
529 /* > Download ZTREVC3 + dependencies */
530 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/ztrevc3
533 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/ztrevc3
536 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/ztrevc3
544 /* SUBROUTINE ZTREVC3( SIDE, HOWMNY, SELECT, N, T, LDT, VL, LDVL, VR, */
545 /* $ LDVR, MM, M, WORK, LWORK, RWORK, LRWORK, INFO) */
547 /* CHARACTER HOWMNY, SIDE */
548 /* INTEGER INFO, LDT, LDVL, LDVR, LWORK, M, MM, N */
549 /* LOGICAL SELECT( * ) */
550 /* DOUBLE PRECISION RWORK( * ) */
551 /* COMPLEX*16 T( LDT, * ), VL( LDVL, * ), VR( LDVR, * ), */
555 /* > \par Purpose: */
560 /* > ZTREVC3 computes some or all of the right and/or left eigenvectors of */
561 /* > a complex upper triangular matrix T. */
562 /* > Matrices of this type are produced by the Schur factorization of */
563 /* > a complex general matrix: A = Q*T*Q**H, as computed by ZHSEQR. */
565 /* > The right eigenvector x and the left eigenvector y of T corresponding */
566 /* > to an eigenvalue w are defined by: */
568 /* > T*x = w*x, (y**H)*T = w*(y**H) */
570 /* > where y**H denotes the conjugate transpose of the vector y. */
571 /* > The eigenvalues are not input to this routine, but are read directly */
572 /* > from the diagonal of T. */
574 /* > This routine returns the matrices X and/or Y of right and left */
575 /* > eigenvectors of T, or the products Q*X and/or Q*Y, where Q is an */
576 /* > input matrix. If Q is the unitary factor that reduces a matrix A to */
577 /* > Schur form T, then Q*X and Q*Y are the matrices of right and left */
578 /* > eigenvectors of A. */
580 /* > This uses a Level 3 BLAS version of the back transformation. */
586 /* > \param[in] SIDE */
588 /* > SIDE is CHARACTER*1 */
589 /* > = 'R': compute right eigenvectors only; */
590 /* > = 'L': compute left eigenvectors only; */
591 /* > = 'B': compute both right and left eigenvectors. */
594 /* > \param[in] HOWMNY */
596 /* > HOWMNY is CHARACTER*1 */
597 /* > = 'A': compute all right and/or left eigenvectors; */
598 /* > = 'B': compute all right and/or left eigenvectors, */
599 /* > backtransformed using the matrices supplied in */
600 /* > VR and/or VL; */
601 /* > = 'S': compute selected right and/or left eigenvectors, */
602 /* > as indicated by the logical array SELECT. */
605 /* > \param[in] SELECT */
607 /* > SELECT is LOGICAL array, dimension (N) */
608 /* > If HOWMNY = 'S', SELECT specifies the eigenvectors to be */
610 /* > The eigenvector corresponding to the j-th eigenvalue is */
611 /* > computed if SELECT(j) = .TRUE.. */
612 /* > Not referenced if HOWMNY = 'A' or 'B'. */
618 /* > The order of the matrix T. N >= 0. */
621 /* > \param[in,out] T */
623 /* > T is COMPLEX*16 array, dimension (LDT,N) */
624 /* > The upper triangular matrix T. T is modified, but restored */
628 /* > \param[in] LDT */
630 /* > LDT is INTEGER */
631 /* > The leading dimension of the array T. LDT >= f2cmax(1,N). */
634 /* > \param[in,out] VL */
636 /* > VL is COMPLEX*16 array, dimension (LDVL,MM) */
637 /* > On entry, if SIDE = 'L' or 'B' and HOWMNY = 'B', VL must */
638 /* > contain an N-by-N matrix Q (usually the unitary matrix Q of */
639 /* > Schur vectors returned by ZHSEQR). */
640 /* > On exit, if SIDE = 'L' or 'B', VL contains: */
641 /* > if HOWMNY = 'A', the matrix Y of left eigenvectors of T; */
642 /* > if HOWMNY = 'B', the matrix Q*Y; */
643 /* > if HOWMNY = 'S', the left eigenvectors of T specified by */
644 /* > SELECT, stored consecutively in the columns */
645 /* > of VL, in the same order as their */
647 /* > Not referenced if SIDE = 'R'. */
650 /* > \param[in] LDVL */
652 /* > LDVL is INTEGER */
653 /* > The leading dimension of the array VL. */
654 /* > LDVL >= 1, and if SIDE = 'L' or 'B', LDVL >= N. */
657 /* > \param[in,out] VR */
659 /* > VR is COMPLEX*16 array, dimension (LDVR,MM) */
660 /* > On entry, if SIDE = 'R' or 'B' and HOWMNY = 'B', VR must */
661 /* > contain an N-by-N matrix Q (usually the unitary matrix Q of */
662 /* > Schur vectors returned by ZHSEQR). */
663 /* > On exit, if SIDE = 'R' or 'B', VR contains: */
664 /* > if HOWMNY = 'A', the matrix X of right eigenvectors of T; */
665 /* > if HOWMNY = 'B', the matrix Q*X; */
666 /* > if HOWMNY = 'S', the right eigenvectors of T specified by */
667 /* > SELECT, stored consecutively in the columns */
668 /* > of VR, in the same order as their */
670 /* > Not referenced if SIDE = 'L'. */
673 /* > \param[in] LDVR */
675 /* > LDVR is INTEGER */
676 /* > The leading dimension of the array VR. */
677 /* > LDVR >= 1, and if SIDE = 'R' or 'B', LDVR >= N. */
680 /* > \param[in] MM */
682 /* > MM is INTEGER */
683 /* > The number of columns in the arrays VL and/or VR. MM >= M. */
686 /* > \param[out] M */
689 /* > The number of columns in the arrays VL and/or VR actually */
690 /* > used to store the eigenvectors. */
691 /* > If HOWMNY = 'A' or 'B', M is set to N. */
692 /* > Each selected eigenvector occupies one column. */
695 /* > \param[out] WORK */
697 /* > WORK is COMPLEX*16 array, dimension (MAX(1,LWORK)) */
700 /* > \param[in] LWORK */
702 /* > LWORK is INTEGER */
703 /* > The dimension of array WORK. LWORK >= f2cmax(1,2*N). */
704 /* > For optimum performance, LWORK >= N + 2*N*NB, where NB is */
705 /* > the optimal blocksize. */
707 /* > If LWORK = -1, then a workspace query is assumed; the routine */
708 /* > only calculates the optimal size of the WORK array, returns */
709 /* > this value as the first entry of the WORK array, and no error */
710 /* > message related to LWORK is issued by XERBLA. */
713 /* > \param[out] RWORK */
715 /* > RWORK is DOUBLE PRECISION array, dimension (LRWORK) */
718 /* > \param[in] LRWORK */
720 /* > LRWORK is INTEGER */
721 /* > The dimension of array RWORK. LRWORK >= f2cmax(1,N). */
723 /* > If LRWORK = -1, then a workspace query is assumed; the routine */
724 /* > only calculates the optimal size of the RWORK array, returns */
725 /* > this value as the first entry of the RWORK array, and no error */
726 /* > message related to LRWORK is issued by XERBLA. */
729 /* > \param[out] INFO */
731 /* > INFO is INTEGER */
732 /* > = 0: successful exit */
733 /* > < 0: if INFO = -i, the i-th argument had an illegal value */
739 /* > \author Univ. of Tennessee */
740 /* > \author Univ. of California Berkeley */
741 /* > \author Univ. of Colorado Denver */
742 /* > \author NAG Ltd. */
744 /* > \date November 2017 */
746 /* @precisions fortran z -> c */
748 /* > \ingroup complex16OTHERcomputational */
750 /* > \par Further Details: */
751 /* ===================== */
755 /* > The algorithm used in this program is basically backward (forward) */
756 /* > substitution, with scaling to make the the code robust against */
757 /* > possible overflow. */
759 /* > Each eigenvector is normalized so that the element of largest */
760 /* > magnitude has magnitude 1; here the magnitude of a complex number */
761 /* > (x,y) is taken to be |x| + |y|. */
764 /* ===================================================================== */
765 /* Subroutine */ int ztrevc3_(char *side, char *howmny, logical *select,
766 integer *n, doublecomplex *t, integer *ldt, doublecomplex *vl,
767 integer *ldvl, doublecomplex *vr, integer *ldvr, integer *mm, integer
768 *m, doublecomplex *work, integer *lwork, doublereal *rwork, integer *
769 lrwork, integer *info)
771 /* System generated locals */
773 integer t_dim1, t_offset, vl_dim1, vl_offset, vr_dim1, vr_offset, i__1,
774 i__2[2], i__3, i__4, i__5, i__6;
776 doublecomplex z__1, z__2;
779 /* Local variables */
781 doublereal unfl, ovfl, smin;
785 extern logical lsame_(char *, char *);
787 extern /* Subroutine */ int zgemm_(char *, char *, integer *, integer *,
788 integer *, doublecomplex *, doublecomplex *, integer *,
789 doublecomplex *, integer *, doublecomplex *, doublecomplex *,
791 logical leftv, bothv;
792 extern /* Subroutine */ int zgemv_(char *, integer *, integer *,
793 doublecomplex *, doublecomplex *, integer *, doublecomplex *,
794 integer *, doublecomplex *, doublecomplex *, integer *);
796 extern /* Subroutine */ int zcopy_(integer *, doublecomplex *, integer *,
797 doublecomplex *, integer *), dlabad_(doublereal *, doublereal *);
799 extern doublereal dlamch_(char *);
801 extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
802 extern integer ilaenv_(integer *, char *, char *, integer *, integer *,
803 integer *, integer *, ftnlen, ftnlen);
804 extern /* Subroutine */ int zdscal_(integer *, doublereal *,
805 doublecomplex *, integer *);
806 extern integer izamax_(integer *, doublecomplex *, integer *);
807 extern /* Subroutine */ int zlaset_(char *, integer *, integer *,
808 doublecomplex *, doublecomplex *, doublecomplex *, integer *);
810 extern doublereal dzasum_(integer *, doublecomplex *, integer *);
811 extern /* Subroutine */ int zlacpy_(char *, integer *, integer *,
812 doublecomplex *, integer *, doublecomplex *, integer *);
815 extern /* Subroutine */ int zlatrs_(char *, char *, char *, char *,
816 integer *, doublecomplex *, integer *, doublecomplex *,
817 doublereal *, doublereal *, integer *);
822 /* -- LAPACK computational routine (version 3.8.0) -- */
823 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
824 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
828 /* ===================================================================== */
831 /* Decode and test the input parameters */
833 /* Parameter adjustments */
836 t_offset = 1 + t_dim1 * 1;
839 vl_offset = 1 + vl_dim1 * 1;
842 vr_offset = 1 + vr_dim1 * 1;
848 bothv = lsame_(side, "B");
849 rightv = lsame_(side, "R") || bothv;
850 leftv = lsame_(side, "L") || bothv;
852 allv = lsame_(howmny, "A");
853 over = lsame_(howmny, "B");
854 somev = lsame_(howmny, "S");
856 /* Set M to the number of columns required to store the selected */
862 for (j = 1; j <= i__1; ++j) {
873 /* Writing concatenation */
874 i__2[0] = 1, a__1[0] = side;
875 i__2[1] = 1, a__1[1] = howmny;
876 s_cat(ch__1, a__1, i__2, &c__2, (ftnlen)2);
877 nb = ilaenv_(&c__1, "ZTREVC", ch__1, n, &c_n1, &c_n1, &c_n1, (ftnlen)6, (
879 maxwrk = *n + (*n << 1) * nb;
880 work[1].r = (doublereal) maxwrk, work[1].i = 0.;
881 rwork[1] = (doublereal) (*n);
882 lquery = *lwork == -1 || *lrwork == -1;
883 if (! rightv && ! leftv) {
885 } else if (! allv && ! over && ! somev) {
889 } else if (*ldt < f2cmax(1,*n)) {
891 } else if (*ldvl < 1 || leftv && *ldvl < *n) {
893 } else if (*ldvr < 1 || rightv && *ldvr < *n) {
895 } else if (*mm < *m) {
897 } else /* if(complicated condition) */ {
899 i__1 = 1, i__3 = *n << 1;
900 if (*lwork < f2cmax(i__1,i__3) && ! lquery) {
902 } else if (*lrwork < f2cmax(1,*n) && ! lquery) {
908 xerbla_("ZTREVC3", &i__1, (ftnlen)7);
914 /* Quick return if possible. */
920 /* Use blocked version of back-transformation if sufficient workspace. */
921 /* Zero-out the workspace to avoid potential NaN propagation. */
923 if (over && *lwork >= *n + (*n << 4)) {
924 nb = (*lwork - *n) / (*n << 1);
926 i__1 = (nb << 1) + 1;
927 zlaset_("F", n, &i__1, &c_b1, &c_b1, &work[1], n);
932 /* Set the constants to control overflow. */
934 unfl = dlamch_("Safe minimum");
936 dlabad_(&unfl, &ovfl);
937 ulp = dlamch_("Precision");
938 smlnum = unfl * (*n / ulp);
940 /* Store the diagonal elements of T in working array WORK. */
943 for (i__ = 1; i__ <= i__1; ++i__) {
945 i__4 = i__ + i__ * t_dim1;
946 work[i__3].r = t[i__4].r, work[i__3].i = t[i__4].i;
950 /* Compute 1-norm of each column of strictly upper triangular */
951 /* part of T to control overflow in triangular solver. */
955 for (j = 2; j <= i__1; ++j) {
957 rwork[j] = dzasum_(&i__3, &t[j * t_dim1 + 1], &c__1);
963 /* ============================================================ */
964 /* Compute right eigenvectors. */
966 /* IV is index of column in current block. */
967 /* Non-blocked version always uses IV=NB=1; */
968 /* blocked version starts with IV=NB, goes down to 1. */
969 /* (Note the "0-th" column is used to store the original diagonal.) */
972 for (ki = *n; ki >= 1; --ki) {
979 d__1 = ulp * z_abs(&t[ki + ki * t_dim1]);
980 smin = f2cmax(d__1,smlnum);
981 /* SMIN = MAX( ULP*( CABS1( T( KI, KI ) ) ), SMLNUM ) */
983 /* -------------------------------------------------------- */
984 /* Complex right eigenvector */
987 work[i__1].r = 1., work[i__1].i = 0.;
989 /* Form right-hand side. */
992 for (k = 1; k <= i__1; ++k) {
994 i__4 = k + ki * t_dim1;
995 z__1.r = -t[i__4].r, z__1.i = -t[i__4].i;
996 work[i__3].r = z__1.r, work[i__3].i = z__1.i;
1000 /* Solve upper triangular system: */
1001 /* [ T(1:KI-1,1:KI-1) - T(KI,KI) ]*X = SCALE*WORK. */
1004 for (k = 1; k <= i__1; ++k) {
1005 i__3 = k + k * t_dim1;
1006 i__4 = k + k * t_dim1;
1007 i__5 = ki + ki * t_dim1;
1008 z__1.r = t[i__4].r - t[i__5].r, z__1.i = t[i__4].i - t[i__5]
1010 t[i__3].r = z__1.r, t[i__3].i = z__1.i;
1011 /* IF( CABS1( T( K, K ) ).LT.SMIN ) */
1012 if (z_abs(&t[k + k * t_dim1]) < smin) {
1013 i__3 = k + k * t_dim1;
1014 t[i__3].r = smin, t[i__3].i = 0.;
1021 zlatrs_("Upper", "No transpose", "Non-unit", "Y", &i__1, &t[
1022 t_offset], ldt, &work[iv * *n + 1], &scale, &rwork[1],
1024 i__1 = ki + iv * *n;
1025 work[i__1].r = scale, work[i__1].i = 0.;
1028 /* Copy the vector x or Q*x to VR and normalize. */
1031 /* ------------------------------ */
1032 /* no back-transform: copy x to VR and normalize. */
1033 zcopy_(&ki, &work[iv * *n + 1], &c__1, &vr[is * vr_dim1 + 1],
1036 ii = izamax_(&ki, &vr[is * vr_dim1 + 1], &c__1);
1037 /* REMAX = ONE / CABS1( VR( II, IS ) ) */
1038 remax = 1. / z_abs(&vr[ii + is * vr_dim1]);
1039 zdscal_(&ki, &remax, &vr[is * vr_dim1 + 1], &c__1);
1042 for (k = ki + 1; k <= i__1; ++k) {
1043 i__3 = k + is * vr_dim1;
1044 vr[i__3].r = 0., vr[i__3].i = 0.;
1048 } else if (nb == 1) {
1049 /* ------------------------------ */
1050 /* version 1: back-transform each vector with GEMV, Q*x. */
1053 z__1.r = scale, z__1.i = 0.;
1054 zgemv_("N", n, &i__1, &c_b2, &vr[vr_offset], ldvr, &work[
1055 iv * *n + 1], &c__1, &z__1, &vr[ki * vr_dim1 + 1],
1059 ii = izamax_(n, &vr[ki * vr_dim1 + 1], &c__1);
1060 /* REMAX = ONE / CABS1( VR( II, KI ) ) */
1061 remax = 1. / z_abs(&vr[ii + ki * vr_dim1]);
1062 zdscal_(n, &remax, &vr[ki * vr_dim1 + 1], &c__1);
1065 /* ------------------------------ */
1066 /* version 2: back-transform block of vectors with GEMM */
1067 /* zero out below vector */
1069 for (k = ki + 1; k <= i__1; ++k) {
1071 work[i__3].r = 0., work[i__3].i = 0.;
1074 /* Columns IV:NB of work are valid vectors. */
1075 /* When the number of vectors stored reaches NB, */
1076 /* or if this was last vector, do the GEMM */
1077 if (iv == 1 || ki == 1) {
1079 i__3 = ki + nb - iv;
1080 zgemm_("N", "N", n, &i__1, &i__3, &c_b2, &vr[vr_offset],
1081 ldvr, &work[iv * *n + 1], n, &c_b1, &work[(nb +
1083 /* normalize vectors */
1085 for (k = iv; k <= i__1; ++k) {
1086 ii = izamax_(n, &work[(nb + k) * *n + 1], &c__1);
1087 /* REMAX = ONE / CABS1( WORK( II + (NB+K)*N ) ) */
1088 remax = 1. / z_abs(&work[ii + (nb + k) * *n]);
1089 zdscal_(n, &remax, &work[(nb + k) * *n + 1], &c__1);
1092 zlacpy_("F", n, &i__1, &work[(nb + iv) * *n + 1], n, &vr[
1093 ki * vr_dim1 + 1], ldvr);
1100 /* Restore the original diagonal elements of T. */
1103 for (k = 1; k <= i__1; ++k) {
1104 i__3 = k + k * t_dim1;
1106 t[i__3].r = work[i__4].r, t[i__3].i = work[i__4].i;
1118 /* ============================================================ */
1119 /* Compute left eigenvectors. */
1121 /* IV is index of column in current block. */
1122 /* Non-blocked version always uses IV=1; */
1123 /* blocked version starts with IV=1, goes up to NB. */
1124 /* (Note the "0-th" column is used to store the original diagonal.) */
1128 for (ki = 1; ki <= i__1; ++ki) {
1136 d__1 = ulp * z_abs(&t[ki + ki * t_dim1]);
1137 smin = f2cmax(d__1,smlnum);
1138 /* SMIN = MAX( ULP*( CABS1( T( KI, KI ) ) ), SMLNUM ) */
1140 /* -------------------------------------------------------- */
1141 /* Complex left eigenvector */
1143 i__3 = ki + iv * *n;
1144 work[i__3].r = 1., work[i__3].i = 0.;
1146 /* Form right-hand side. */
1149 for (k = ki + 1; k <= i__3; ++k) {
1151 d_cnjg(&z__2, &t[ki + k * t_dim1]);
1152 z__1.r = -z__2.r, z__1.i = -z__2.i;
1153 work[i__4].r = z__1.r, work[i__4].i = z__1.i;
1157 /* Solve conjugate-transposed triangular system: */
1158 /* [ T(KI+1:N,KI+1:N) - T(KI,KI) ]**H * X = SCALE*WORK. */
1161 for (k = ki + 1; k <= i__3; ++k) {
1162 i__4 = k + k * t_dim1;
1163 i__5 = k + k * t_dim1;
1164 i__6 = ki + ki * t_dim1;
1165 z__1.r = t[i__5].r - t[i__6].r, z__1.i = t[i__5].i - t[i__6]
1167 t[i__4].r = z__1.r, t[i__4].i = z__1.i;
1168 /* IF( CABS1( T( K, K ) ).LT.SMIN ) */
1169 if (z_abs(&t[k + k * t_dim1]) < smin) {
1170 i__4 = k + k * t_dim1;
1171 t[i__4].r = smin, t[i__4].i = 0.;
1178 zlatrs_("Upper", "Conjugate transpose", "Non-unit", "Y", &
1179 i__3, &t[ki + 1 + (ki + 1) * t_dim1], ldt, &work[ki +
1180 1 + iv * *n], &scale, &rwork[1], info);
1181 i__3 = ki + iv * *n;
1182 work[i__3].r = scale, work[i__3].i = 0.;
1185 /* Copy the vector x or Q*x to VL and normalize. */
1188 /* ------------------------------ */
1189 /* no back-transform: copy x to VL and normalize. */
1191 zcopy_(&i__3, &work[ki + iv * *n], &c__1, &vl[ki + is *
1195 ii = izamax_(&i__3, &vl[ki + is * vl_dim1], &c__1) + ki - 1;
1196 /* REMAX = ONE / CABS1( VL( II, IS ) ) */
1197 remax = 1. / z_abs(&vl[ii + is * vl_dim1]);
1199 zdscal_(&i__3, &remax, &vl[ki + is * vl_dim1], &c__1);
1202 for (k = 1; k <= i__3; ++k) {
1203 i__4 = k + is * vl_dim1;
1204 vl[i__4].r = 0., vl[i__4].i = 0.;
1208 } else if (nb == 1) {
1209 /* ------------------------------ */
1210 /* version 1: back-transform each vector with GEMV, Q*x. */
1213 z__1.r = scale, z__1.i = 0.;
1214 zgemv_("N", n, &i__3, &c_b2, &vl[(ki + 1) * vl_dim1 + 1],
1215 ldvl, &work[ki + 1 + iv * *n], &c__1, &z__1, &vl[
1216 ki * vl_dim1 + 1], &c__1);
1219 ii = izamax_(n, &vl[ki * vl_dim1 + 1], &c__1);
1220 /* REMAX = ONE / CABS1( VL( II, KI ) ) */
1221 remax = 1. / z_abs(&vl[ii + ki * vl_dim1]);
1222 zdscal_(n, &remax, &vl[ki * vl_dim1 + 1], &c__1);
1225 /* ------------------------------ */
1226 /* version 2: back-transform block of vectors with GEMM */
1227 /* zero out above vector */
1228 /* could go from KI-NV+1 to KI-1 */
1230 for (k = 1; k <= i__3; ++k) {
1232 work[i__4].r = 0., work[i__4].i = 0.;
1235 /* Columns 1:IV of work are valid vectors. */
1236 /* When the number of vectors stored reaches NB, */
1237 /* or if this was last vector, do the GEMM */
1238 if (iv == nb || ki == *n) {
1239 i__3 = *n - ki + iv;
1240 zgemm_("N", "N", n, &iv, &i__3, &c_b2, &vl[(ki - iv + 1) *
1241 vl_dim1 + 1], ldvl, &work[ki - iv + 1 + *n], n, &
1242 c_b1, &work[(nb + 1) * *n + 1], n);
1243 /* normalize vectors */
1245 for (k = 1; k <= i__3; ++k) {
1246 ii = izamax_(n, &work[(nb + k) * *n + 1], &c__1);
1247 /* REMAX = ONE / CABS1( WORK( II + (NB+K)*N ) ) */
1248 remax = 1. / z_abs(&work[ii + (nb + k) * *n]);
1249 zdscal_(n, &remax, &work[(nb + k) * *n + 1], &c__1);
1251 zlacpy_("F", n, &iv, &work[(nb + 1) * *n + 1], n, &vl[(ki
1252 - iv + 1) * vl_dim1 + 1], ldvl);
1259 /* Restore the original diagonal elements of T. */
1262 for (k = ki + 1; k <= i__3; ++k) {
1263 i__4 = k + k * t_dim1;
1265 t[i__4].r = work[i__5].r, t[i__4].i = work[i__5].i;
1277 /* End of ZTREVC3 */