14 typedef long long BLASLONG;
15 typedef unsigned long long BLASULONG;
17 typedef long BLASLONG;
18 typedef unsigned long BLASULONG;
22 typedef BLASLONG blasint;
24 #define blasabs(x) llabs(x)
26 #define blasabs(x) labs(x)
30 #define blasabs(x) abs(x)
33 typedef blasint integer;
35 typedef unsigned int uinteger;
36 typedef char *address;
37 typedef short int shortint;
39 typedef double doublereal;
40 typedef struct { real r, i; } complex;
41 typedef struct { doublereal r, i; } doublecomplex;
43 static inline _Fcomplex Cf(complex *z) {_Fcomplex zz={z->r , z->i}; return zz;}
44 static inline _Dcomplex Cd(doublecomplex *z) {_Dcomplex zz={z->r , z->i};return zz;}
45 static inline _Fcomplex * _pCf(complex *z) {return (_Fcomplex*)z;}
46 static inline _Dcomplex * _pCd(doublecomplex *z) {return (_Dcomplex*)z;}
48 static inline _Complex float Cf(complex *z) {return z->r + z->i*_Complex_I;}
49 static inline _Complex double Cd(doublecomplex *z) {return z->r + z->i*_Complex_I;}
50 static inline _Complex float * _pCf(complex *z) {return (_Complex float*)z;}
51 static inline _Complex double * _pCd(doublecomplex *z) {return (_Complex double*)z;}
53 #define pCf(z) (*_pCf(z))
54 #define pCd(z) (*_pCd(z))
56 typedef short int shortlogical;
57 typedef char logical1;
58 typedef char integer1;
63 /* Extern is for use with -E */
74 /*external read, write*/
83 /*internal read, write*/
113 /*rewind, backspace, endfile*/
125 ftnint *inex; /*parameters in standard's order*/
151 union Multitype { /* for multiple entry points */
162 typedef union Multitype Multitype;
164 struct Vardesc { /* for Namelist */
170 typedef struct Vardesc Vardesc;
177 typedef struct Namelist Namelist;
179 #define abs(x) ((x) >= 0 ? (x) : -(x))
180 #define dabs(x) (fabs(x))
181 #define f2cmin(a,b) ((a) <= (b) ? (a) : (b))
182 #define f2cmax(a,b) ((a) >= (b) ? (a) : (b))
183 #define dmin(a,b) (f2cmin(a,b))
184 #define dmax(a,b) (f2cmax(a,b))
185 #define bit_test(a,b) ((a) >> (b) & 1)
186 #define bit_clear(a,b) ((a) & ~((uinteger)1 << (b)))
187 #define bit_set(a,b) ((a) | ((uinteger)1 << (b)))
189 #define abort_() { sig_die("Fortran abort routine called", 1); }
190 #define c_abs(z) (cabsf(Cf(z)))
191 #define c_cos(R,Z) { pCf(R)=ccos(Cf(Z)); }
193 #define c_div(c, a, b) {Cf(c)._Val[0] = (Cf(a)._Val[0]/Cf(b)._Val[0]); Cf(c)._Val[1]=(Cf(a)._Val[1]/Cf(b)._Val[1]);}
194 #define z_div(c, a, b) {Cd(c)._Val[0] = (Cd(a)._Val[0]/Cd(b)._Val[0]); Cd(c)._Val[1]=(Cd(a)._Val[1]/df(b)._Val[1]);}
196 #define c_div(c, a, b) {pCf(c) = Cf(a)/Cf(b);}
197 #define z_div(c, a, b) {pCd(c) = Cd(a)/Cd(b);}
199 #define c_exp(R, Z) {pCf(R) = cexpf(Cf(Z));}
200 #define c_log(R, Z) {pCf(R) = clogf(Cf(Z));}
201 #define c_sin(R, Z) {pCf(R) = csinf(Cf(Z));}
202 //#define c_sqrt(R, Z) {*(R) = csqrtf(Cf(Z));}
203 #define c_sqrt(R, Z) {pCf(R) = csqrtf(Cf(Z));}
204 #define d_abs(x) (fabs(*(x)))
205 #define d_acos(x) (acos(*(x)))
206 #define d_asin(x) (asin(*(x)))
207 #define d_atan(x) (atan(*(x)))
208 #define d_atn2(x, y) (atan2(*(x),*(y)))
209 #define d_cnjg(R, Z) { pCd(R) = conj(Cd(Z)); }
210 #define r_cnjg(R, Z) { pCf(R) = conjf(Cf(Z)); }
211 #define d_cos(x) (cos(*(x)))
212 #define d_cosh(x) (cosh(*(x)))
213 #define d_dim(__a, __b) ( *(__a) > *(__b) ? *(__a) - *(__b) : 0.0 )
214 #define d_exp(x) (exp(*(x)))
215 #define d_imag(z) (cimag(Cd(z)))
216 #define r_imag(z) (cimagf(Cf(z)))
217 #define d_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
218 #define r_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
219 #define d_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
220 #define r_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
221 #define d_log(x) (log(*(x)))
222 #define d_mod(x, y) (fmod(*(x), *(y)))
223 #define u_nint(__x) ((__x)>=0 ? floor((__x) + .5) : -floor(.5 - (__x)))
224 #define d_nint(x) u_nint(*(x))
225 #define u_sign(__a,__b) ((__b) >= 0 ? ((__a) >= 0 ? (__a) : -(__a)) : -((__a) >= 0 ? (__a) : -(__a)))
226 #define d_sign(a,b) u_sign(*(a),*(b))
227 #define r_sign(a,b) u_sign(*(a),*(b))
228 #define d_sin(x) (sin(*(x)))
229 #define d_sinh(x) (sinh(*(x)))
230 #define d_sqrt(x) (sqrt(*(x)))
231 #define d_tan(x) (tan(*(x)))
232 #define d_tanh(x) (tanh(*(x)))
233 #define i_abs(x) abs(*(x))
234 #define i_dnnt(x) ((integer)u_nint(*(x)))
235 #define i_len(s, n) (n)
236 #define i_nint(x) ((integer)u_nint(*(x)))
237 #define i_sign(a,b) ((integer)u_sign((integer)*(a),(integer)*(b)))
238 #define pow_dd(ap, bp) ( pow(*(ap), *(bp)))
239 #define pow_si(B,E) spow_ui(*(B),*(E))
240 #define pow_ri(B,E) spow_ui(*(B),*(E))
241 #define pow_di(B,E) dpow_ui(*(B),*(E))
242 #define pow_zi(p, a, b) {pCd(p) = zpow_ui(Cd(a), *(b));}
243 #define pow_ci(p, a, b) {pCf(p) = cpow_ui(Cf(a), *(b));}
244 #define pow_zz(R,A,B) {pCd(R) = cpow(Cd(A),*(B));}
245 #define s_cat(lpp, rpp, rnp, np, llp) { ftnlen i, nc, ll; char *f__rp, *lp; ll = (llp); lp = (lpp); for(i=0; i < (int)*(np); ++i) { nc = ll; if((rnp)[i] < nc) nc = (rnp)[i]; ll -= nc; f__rp = (rpp)[i]; while(--nc >= 0) *lp++ = *(f__rp)++; } while(--ll >= 0) *lp++ = ' '; }
246 #define s_cmp(a,b,c,d) ((integer)strncmp((a),(b),f2cmin((c),(d))))
247 #define s_copy(A,B,C,D) { int __i,__m; for (__i=0, __m=f2cmin((C),(D)); __i<__m && (B)[__i] != 0; ++__i) (A)[__i] = (B)[__i]; }
248 #define sig_die(s, kill) { exit(1); }
249 #define s_stop(s, n) {exit(0);}
250 static char junk[] = "\n@(#)LIBF77 VERSION 19990503\n";
251 #define z_abs(z) (cabs(Cd(z)))
252 #define z_exp(R, Z) {pCd(R) = cexp(Cd(Z));}
253 #define z_sqrt(R, Z) {pCd(R) = csqrt(Cd(Z));}
254 #define myexit_() break;
255 #define mycycle() continue;
256 #define myceiling(w) {ceil(w)}
257 #define myhuge(w) {HUGE_VAL}
258 //#define mymaxloc_(w,s,e,n) {if (sizeof(*(w)) == sizeof(double)) dmaxloc_((w),*(s),*(e),n); else dmaxloc_((w),*(s),*(e),n);}
259 #define mymaxloc(w,s,e,n) {dmaxloc_(w,*(s),*(e),n)}
261 /* procedure parameter types for -A and -C++ */
263 #define F2C_proc_par_types 1
265 typedef logical (*L_fp)(...);
267 typedef logical (*L_fp)();
270 static float spow_ui(float x, integer n) {
271 float pow=1.0; unsigned long int u;
273 if(n < 0) n = -n, x = 1/x;
282 static double dpow_ui(double x, integer n) {
283 double pow=1.0; unsigned long int u;
285 if(n < 0) n = -n, x = 1/x;
295 static _Fcomplex cpow_ui(complex x, integer n) {
296 complex pow={1.0,0.0}; unsigned long int u;
298 if(n < 0) n = -n, x.r = 1/x.r, x.i=1/x.i;
300 if(u & 01) pow.r *= x.r, pow.i *= x.i;
301 if(u >>= 1) x.r *= x.r, x.i *= x.i;
305 _Fcomplex p={pow.r, pow.i};
309 static _Complex float cpow_ui(_Complex float x, integer n) {
310 _Complex float pow=1.0; unsigned long int u;
312 if(n < 0) n = -n, x = 1/x;
323 static _Dcomplex zpow_ui(_Dcomplex x, integer n) {
324 _Dcomplex pow={1.0,0.0}; unsigned long int u;
326 if(n < 0) n = -n, x._Val[0] = 1/x._Val[0], x._Val[1] =1/x._Val[1];
328 if(u & 01) pow._Val[0] *= x._Val[0], pow._Val[1] *= x._Val[1];
329 if(u >>= 1) x._Val[0] *= x._Val[0], x._Val[1] *= x._Val[1];
333 _Dcomplex p = {pow._Val[0], pow._Val[1]};
337 static _Complex double zpow_ui(_Complex double x, integer n) {
338 _Complex double pow=1.0; unsigned long int u;
340 if(n < 0) n = -n, x = 1/x;
350 static integer pow_ii(integer x, integer n) {
351 integer pow; unsigned long int u;
353 if (n == 0 || x == 1) pow = 1;
354 else if (x != -1) pow = x == 0 ? 1/x : 0;
357 if ((n > 0) || !(n == 0 || x == 1 || x != -1)) {
367 static integer dmaxloc_(double *w, integer s, integer e, integer *n)
369 double m; integer i, mi;
370 for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
371 if (w[i-1]>m) mi=i ,m=w[i-1];
374 static integer smaxloc_(float *w, integer s, integer e, integer *n)
376 float m; integer i, mi;
377 for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
378 if (w[i-1]>m) mi=i ,m=w[i-1];
381 static inline void cdotc_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
382 integer n = *n_, incx = *incx_, incy = *incy_, i;
384 _Fcomplex zdotc = {0.0, 0.0};
385 if (incx == 1 && incy == 1) {
386 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
387 zdotc._Val[0] += conjf(Cf(&x[i]))._Val[0] * Cf(&y[i])._Val[0];
388 zdotc._Val[1] += conjf(Cf(&x[i]))._Val[1] * Cf(&y[i])._Val[1];
391 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
392 zdotc._Val[0] += conjf(Cf(&x[i*incx]))._Val[0] * Cf(&y[i*incy])._Val[0];
393 zdotc._Val[1] += conjf(Cf(&x[i*incx]))._Val[1] * Cf(&y[i*incy])._Val[1];
399 _Complex float zdotc = 0.0;
400 if (incx == 1 && incy == 1) {
401 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
402 zdotc += conjf(Cf(&x[i])) * Cf(&y[i]);
405 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
406 zdotc += conjf(Cf(&x[i*incx])) * Cf(&y[i*incy]);
412 static inline void zdotc_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
413 integer n = *n_, incx = *incx_, incy = *incy_, i;
415 _Dcomplex zdotc = {0.0, 0.0};
416 if (incx == 1 && incy == 1) {
417 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
418 zdotc._Val[0] += conj(Cd(&x[i]))._Val[0] * Cd(&y[i])._Val[0];
419 zdotc._Val[1] += conj(Cd(&x[i]))._Val[1] * Cd(&y[i])._Val[1];
422 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
423 zdotc._Val[0] += conj(Cd(&x[i*incx]))._Val[0] * Cd(&y[i*incy])._Val[0];
424 zdotc._Val[1] += conj(Cd(&x[i*incx]))._Val[1] * Cd(&y[i*incy])._Val[1];
430 _Complex double zdotc = 0.0;
431 if (incx == 1 && incy == 1) {
432 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
433 zdotc += conj(Cd(&x[i])) * Cd(&y[i]);
436 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
437 zdotc += conj(Cd(&x[i*incx])) * Cd(&y[i*incy]);
443 static inline void cdotu_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
444 integer n = *n_, incx = *incx_, incy = *incy_, i;
446 _Fcomplex zdotc = {0.0, 0.0};
447 if (incx == 1 && incy == 1) {
448 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
449 zdotc._Val[0] += Cf(&x[i])._Val[0] * Cf(&y[i])._Val[0];
450 zdotc._Val[1] += Cf(&x[i])._Val[1] * Cf(&y[i])._Val[1];
453 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
454 zdotc._Val[0] += Cf(&x[i*incx])._Val[0] * Cf(&y[i*incy])._Val[0];
455 zdotc._Val[1] += Cf(&x[i*incx])._Val[1] * Cf(&y[i*incy])._Val[1];
461 _Complex float zdotc = 0.0;
462 if (incx == 1 && incy == 1) {
463 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
464 zdotc += Cf(&x[i]) * Cf(&y[i]);
467 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
468 zdotc += Cf(&x[i*incx]) * Cf(&y[i*incy]);
474 static inline void zdotu_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
475 integer n = *n_, incx = *incx_, incy = *incy_, i;
477 _Dcomplex zdotc = {0.0, 0.0};
478 if (incx == 1 && incy == 1) {
479 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
480 zdotc._Val[0] += Cd(&x[i])._Val[0] * Cd(&y[i])._Val[0];
481 zdotc._Val[1] += Cd(&x[i])._Val[1] * Cd(&y[i])._Val[1];
484 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
485 zdotc._Val[0] += Cd(&x[i*incx])._Val[0] * Cd(&y[i*incy])._Val[0];
486 zdotc._Val[1] += Cd(&x[i*incx])._Val[1] * Cd(&y[i*incy])._Val[1];
492 _Complex double zdotc = 0.0;
493 if (incx == 1 && incy == 1) {
494 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
495 zdotc += Cd(&x[i]) * Cd(&y[i]);
498 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
499 zdotc += Cd(&x[i*incx]) * Cd(&y[i*incy]);
505 /* -- translated by f2c (version 20000121).
506 You must link the resulting object file with the libraries:
507 -lf2c -lm (in that order)
514 /* Table of constant values */
516 static integer c__1 = 1;
517 static integer c__0 = 0;
518 static integer c_n1 = -1;
520 /* > \brief <b> CGEEVX computes the eigenvalues and, optionally, the left and/or right eigenvectors for GE mat
523 /* =========== DOCUMENTATION =========== */
525 /* Online html documentation available at */
526 /* http://www.netlib.org/lapack/explore-html/ */
529 /* > Download CGEEVX + dependencies */
530 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/cgeevx.
533 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/cgeevx.
536 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/cgeevx.
544 /* SUBROUTINE CGEEVX( BALANC, JOBVL, JOBVR, SENSE, N, A, LDA, W, VL, */
545 /* LDVL, VR, LDVR, ILO, IHI, SCALE, ABNRM, RCONDE, */
546 /* RCONDV, WORK, LWORK, RWORK, INFO ) */
548 /* CHARACTER BALANC, JOBVL, JOBVR, SENSE */
549 /* INTEGER IHI, ILO, INFO, LDA, LDVL, LDVR, LWORK, N */
551 /* REAL RCONDE( * ), RCONDV( * ), RWORK( * ), */
553 /* COMPLEX A( LDA, * ), VL( LDVL, * ), VR( LDVR, * ), */
554 /* $ W( * ), WORK( * ) */
557 /* > \par Purpose: */
562 /* > CGEEVX computes for an N-by-N complex nonsymmetric matrix A, the */
563 /* > eigenvalues and, optionally, the left and/or right eigenvectors. */
565 /* > Optionally also, it computes a balancing transformation to improve */
566 /* > the conditioning of the eigenvalues and eigenvectors (ILO, IHI, */
567 /* > SCALE, and ABNRM), reciprocal condition numbers for the eigenvalues */
568 /* > (RCONDE), and reciprocal condition numbers for the right */
569 /* > eigenvectors (RCONDV). */
571 /* > The right eigenvector v(j) of A satisfies */
572 /* > A * v(j) = lambda(j) * v(j) */
573 /* > where lambda(j) is its eigenvalue. */
574 /* > The left eigenvector u(j) of A satisfies */
575 /* > u(j)**H * A = lambda(j) * u(j)**H */
576 /* > where u(j)**H denotes the conjugate transpose of u(j). */
578 /* > The computed eigenvectors are normalized to have Euclidean norm */
579 /* > equal to 1 and largest component real. */
581 /* > Balancing a matrix means permuting the rows and columns to make it */
582 /* > more nearly upper triangular, and applying a diagonal similarity */
583 /* > transformation D * A * D**(-1), where D is a diagonal matrix, to */
584 /* > make its rows and columns closer in norm and the condition numbers */
585 /* > of its eigenvalues and eigenvectors smaller. The computed */
586 /* > reciprocal condition numbers correspond to the balanced matrix. */
587 /* > Permuting rows and columns will not change the condition numbers */
588 /* > (in exact arithmetic) but diagonal scaling will. For further */
589 /* > explanation of balancing, see section 4.10.2 of the LAPACK */
590 /* > Users' Guide. */
596 /* > \param[in] BALANC */
598 /* > BALANC is CHARACTER*1 */
599 /* > Indicates how the input matrix should be diagonally scaled */
600 /* > and/or permuted to improve the conditioning of its */
602 /* > = 'N': Do not diagonally scale or permute; */
603 /* > = 'P': Perform permutations to make the matrix more nearly */
604 /* > upper triangular. Do not diagonally scale; */
605 /* > = 'S': Diagonally scale the matrix, ie. replace A by */
606 /* > D*A*D**(-1), where D is a diagonal matrix chosen */
607 /* > to make the rows and columns of A more equal in */
608 /* > norm. Do not permute; */
609 /* > = 'B': Both diagonally scale and permute A. */
611 /* > Computed reciprocal condition numbers will be for the matrix */
612 /* > after balancing and/or permuting. Permuting does not change */
613 /* > condition numbers (in exact arithmetic), but balancing does. */
616 /* > \param[in] JOBVL */
618 /* > JOBVL is CHARACTER*1 */
619 /* > = 'N': left eigenvectors of A are not computed; */
620 /* > = 'V': left eigenvectors of A are computed. */
621 /* > If SENSE = 'E' or 'B', JOBVL must = 'V'. */
624 /* > \param[in] JOBVR */
626 /* > JOBVR is CHARACTER*1 */
627 /* > = 'N': right eigenvectors of A are not computed; */
628 /* > = 'V': right eigenvectors of A are computed. */
629 /* > If SENSE = 'E' or 'B', JOBVR must = 'V'. */
632 /* > \param[in] SENSE */
634 /* > SENSE is CHARACTER*1 */
635 /* > Determines which reciprocal condition numbers are computed. */
636 /* > = 'N': None are computed; */
637 /* > = 'E': Computed for eigenvalues only; */
638 /* > = 'V': Computed for right eigenvectors only; */
639 /* > = 'B': Computed for eigenvalues and right eigenvectors. */
641 /* > If SENSE = 'E' or 'B', both left and right eigenvectors */
642 /* > must also be computed (JOBVL = 'V' and JOBVR = 'V'). */
648 /* > The order of the matrix A. N >= 0. */
651 /* > \param[in,out] A */
653 /* > A is COMPLEX array, dimension (LDA,N) */
654 /* > On entry, the N-by-N matrix A. */
655 /* > On exit, A has been overwritten. If JOBVL = 'V' or */
656 /* > JOBVR = 'V', A contains the Schur form of the balanced */
657 /* > version of the matrix A. */
660 /* > \param[in] LDA */
662 /* > LDA is INTEGER */
663 /* > The leading dimension of the array A. LDA >= f2cmax(1,N). */
666 /* > \param[out] W */
668 /* > W is COMPLEX array, dimension (N) */
669 /* > W contains the computed eigenvalues. */
672 /* > \param[out] VL */
674 /* > VL is COMPLEX array, dimension (LDVL,N) */
675 /* > If JOBVL = 'V', the left eigenvectors u(j) are stored one */
676 /* > after another in the columns of VL, in the same order */
677 /* > as their eigenvalues. */
678 /* > If JOBVL = 'N', VL is not referenced. */
679 /* > u(j) = VL(:,j), the j-th column of VL. */
682 /* > \param[in] LDVL */
684 /* > LDVL is INTEGER */
685 /* > The leading dimension of the array VL. LDVL >= 1; if */
686 /* > JOBVL = 'V', LDVL >= N. */
689 /* > \param[out] VR */
691 /* > VR is COMPLEX array, dimension (LDVR,N) */
692 /* > If JOBVR = 'V', the right eigenvectors v(j) are stored one */
693 /* > after another in the columns of VR, in the same order */
694 /* > as their eigenvalues. */
695 /* > If JOBVR = 'N', VR is not referenced. */
696 /* > v(j) = VR(:,j), the j-th column of VR. */
699 /* > \param[in] LDVR */
701 /* > LDVR is INTEGER */
702 /* > The leading dimension of the array VR. LDVR >= 1; if */
703 /* > JOBVR = 'V', LDVR >= N. */
706 /* > \param[out] ILO */
708 /* > ILO is INTEGER */
711 /* > \param[out] IHI */
713 /* > IHI is INTEGER */
714 /* > ILO and IHI are integer values determined when A was */
715 /* > balanced. The balanced A(i,j) = 0 if I > J and */
716 /* > J = 1,...,ILO-1 or I = IHI+1,...,N. */
719 /* > \param[out] SCALE */
721 /* > SCALE is REAL array, dimension (N) */
722 /* > Details of the permutations and scaling factors applied */
723 /* > when balancing A. If P(j) is the index of the row and column */
724 /* > interchanged with row and column j, and D(j) is the scaling */
725 /* > factor applied to row and column j, then */
726 /* > SCALE(J) = P(J), for J = 1,...,ILO-1 */
727 /* > = D(J), for J = ILO,...,IHI */
728 /* > = P(J) for J = IHI+1,...,N. */
729 /* > The order in which the interchanges are made is N to IHI+1, */
730 /* > then 1 to ILO-1. */
733 /* > \param[out] ABNRM */
735 /* > ABNRM is REAL */
736 /* > The one-norm of the balanced matrix (the maximum */
737 /* > of the sum of absolute values of elements of any column). */
740 /* > \param[out] RCONDE */
742 /* > RCONDE is REAL array, dimension (N) */
743 /* > RCONDE(j) is the reciprocal condition number of the j-th */
747 /* > \param[out] RCONDV */
749 /* > RCONDV is REAL array, dimension (N) */
750 /* > RCONDV(j) is the reciprocal condition number of the j-th */
751 /* > right eigenvector. */
754 /* > \param[out] WORK */
756 /* > WORK is COMPLEX array, dimension (MAX(1,LWORK)) */
757 /* > On exit, if INFO = 0, WORK(1) returns the optimal LWORK. */
760 /* > \param[in] LWORK */
762 /* > LWORK is INTEGER */
763 /* > The dimension of the array WORK. If SENSE = 'N' or 'E', */
764 /* > LWORK >= f2cmax(1,2*N), and if SENSE = 'V' or 'B', */
765 /* > LWORK >= N*N+2*N. */
766 /* > For good performance, LWORK must generally be larger. */
768 /* > If LWORK = -1, then a workspace query is assumed; the routine */
769 /* > only calculates the optimal size of the WORK array, returns */
770 /* > this value as the first entry of the WORK array, and no error */
771 /* > message related to LWORK is issued by XERBLA. */
774 /* > \param[out] RWORK */
776 /* > RWORK is REAL array, dimension (2*N) */
779 /* > \param[out] INFO */
781 /* > INFO is INTEGER */
782 /* > = 0: successful exit */
783 /* > < 0: if INFO = -i, the i-th argument had an illegal value. */
784 /* > > 0: if INFO = i, the QR algorithm failed to compute all the */
785 /* > eigenvalues, and no eigenvectors or condition numbers */
786 /* > have been computed; elements 1:ILO-1 and i+1:N of W */
787 /* > contain eigenvalues which have converged. */
793 /* > \author Univ. of Tennessee */
794 /* > \author Univ. of California Berkeley */
795 /* > \author Univ. of Colorado Denver */
796 /* > \author NAG Ltd. */
798 /* > \date June 2016 */
800 /* @generated from zgeevx.f, fortran z -> c, Tue Apr 19 01:47:44 2016 */
802 /* > \ingroup complexGEeigen */
804 /* ===================================================================== */
805 /* Subroutine */ int cgeevx_(char *balanc, char *jobvl, char *jobvr, char *
806 sense, integer *n, complex *a, integer *lda, complex *w, complex *vl,
807 integer *ldvl, complex *vr, integer *ldvr, integer *ilo, integer *ihi,
808 real *scale, real *abnrm, real *rconde, real *rcondv, complex *work,
809 integer *lwork, real *rwork, integer *info)
811 /* System generated locals */
812 integer a_dim1, a_offset, vl_dim1, vl_offset, vr_dim1, vr_offset, i__1,
817 /* Local variables */
820 integer ierr, itau, iwrk, nout, i__, k;
821 extern /* Subroutine */ int cscal_(integer *, complex *, complex *,
824 extern logical lsame_(char *, char *);
825 extern real scnrm2_(integer *, complex *, integer *);
826 extern /* Subroutine */ int cgebak_(char *, char *, integer *, integer *,
827 integer *, real *, integer *, complex *, integer *, integer *), cgebal_(char *, integer *, complex *, integer *,
828 integer *, integer *, real *, integer *), slabad_(real *,
831 extern real clange_(char *, integer *, integer *, complex *, integer *,
834 extern /* Subroutine */ int cgehrd_(integer *, integer *, integer *,
835 complex *, integer *, complex *, complex *, integer *, integer *),
836 clascl_(char *, integer *, integer *, real *, real *, integer *,
837 integer *, complex *, integer *, integer *);
838 extern real slamch_(char *);
839 extern /* Subroutine */ int csscal_(integer *, real *, complex *, integer
840 *), clacpy_(char *, integer *, integer *, complex *, integer *,
841 complex *, integer *), xerbla_(char *, integer *, ftnlen);
842 extern integer ilaenv_(integer *, char *, char *, integer *, integer *,
843 integer *, integer *, ftnlen, ftnlen);
846 extern /* Subroutine */ int slascl_(char *, integer *, integer *, real *,
847 real *, integer *, integer *, real *, integer *, integer *);
848 extern integer isamax_(integer *, real *, integer *);
849 extern /* Subroutine */ int chseqr_(char *, char *, integer *, integer *,
850 integer *, complex *, integer *, complex *, complex *, integer *,
851 complex *, integer *, integer *), cunghr_(integer
852 *, integer *, integer *, complex *, integer *, complex *, complex
853 *, integer *, integer *), ctrsna_(char *, char *, logical *,
854 integer *, complex *, integer *, complex *, integer *, complex *,
855 integer *, real *, real *, integer *, integer *, complex *,
856 integer *, real *, integer *);
857 integer minwrk, maxwrk;
858 logical wantvl, wntsnb;
862 logical lquery, wantvr, wntsnn, wntsnv;
863 extern /* Subroutine */ int ctrevc3_(char *, char *, logical *, integer *,
864 complex *, integer *, complex *, integer *, complex *, integer *,
865 integer *, integer *, complex *, integer *, real *, integer *,
868 real scl, dum[1], eps;
870 integer lwork_trevc__;
873 /* -- LAPACK driver routine (version 3.7.1) -- */
874 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
875 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
879 /* ===================================================================== */
882 /* Test the input arguments */
884 /* Parameter adjustments */
886 a_offset = 1 + a_dim1 * 1;
890 vl_offset = 1 + vl_dim1 * 1;
893 vr_offset = 1 + vr_dim1 * 1;
903 lquery = *lwork == -1;
904 wantvl = lsame_(jobvl, "V");
905 wantvr = lsame_(jobvr, "V");
906 wntsnn = lsame_(sense, "N");
907 wntsne = lsame_(sense, "E");
908 wntsnv = lsame_(sense, "V");
909 wntsnb = lsame_(sense, "B");
910 if (! (lsame_(balanc, "N") || lsame_(balanc, "S") || lsame_(balanc, "P")
911 || lsame_(balanc, "B"))) {
913 } else if (! wantvl && ! lsame_(jobvl, "N")) {
915 } else if (! wantvr && ! lsame_(jobvr, "N")) {
917 } else if (! (wntsnn || wntsne || wntsnb || wntsnv) || (wntsne || wntsnb)
918 && ! (wantvl && wantvr)) {
922 } else if (*lda < f2cmax(1,*n)) {
924 } else if (*ldvl < 1 || wantvl && *ldvl < *n) {
926 } else if (*ldvr < 1 || wantvr && *ldvr < *n) {
930 /* Compute workspace */
931 /* (Note: Comments in the code beginning "Workspace:" describe the */
932 /* minimal amount of workspace needed at that point in the code, */
933 /* as well as the preferred amount for good performance. */
934 /* CWorkspace refers to complex workspace, and RWorkspace to real */
935 /* workspace. NB refers to the optimal block size for the */
936 /* immediately following subroutine, as returned by ILAENV. */
937 /* HSWORK refers to the workspace preferred by CHSEQR, as */
938 /* calculated below. HSWORK is computed assuming ILO=1 and IHI=N, */
939 /* the worst case.) */
946 maxwrk = *n + *n * ilaenv_(&c__1, "CGEHRD", " ", n, &c__1, n, &
947 c__0, (ftnlen)6, (ftnlen)1);
950 ctrevc3_("L", "B", select, n, &a[a_offset], lda, &vl[
951 vl_offset], ldvl, &vr[vr_offset], ldvr, n, &nout, &
952 work[1], &c_n1, &rwork[1], &c_n1, &ierr);
953 lwork_trevc__ = (integer) work[1].r;
954 maxwrk = f2cmax(maxwrk,lwork_trevc__);
955 chseqr_("S", "V", n, &c__1, n, &a[a_offset], lda, &w[1], &vl[
956 vl_offset], ldvl, &work[1], &c_n1, info);
958 ctrevc3_("R", "B", select, n, &a[a_offset], lda, &vl[
959 vl_offset], ldvl, &vr[vr_offset], ldvr, n, &nout, &
960 work[1], &c_n1, &rwork[1], &c_n1, &ierr);
961 lwork_trevc__ = (integer) work[1].r;
962 maxwrk = f2cmax(maxwrk,lwork_trevc__);
963 chseqr_("S", "V", n, &c__1, n, &a[a_offset], lda, &w[1], &vr[
964 vr_offset], ldvr, &work[1], &c_n1, info);
967 chseqr_("E", "N", n, &c__1, n, &a[a_offset], lda, &w[1], &
968 vr[vr_offset], ldvr, &work[1], &c_n1, info);
970 chseqr_("S", "N", n, &c__1, n, &a[a_offset], lda, &w[1], &
971 vr[vr_offset], ldvr, &work[1], &c_n1, info);
974 hswork = (integer) work[1].r;
976 if (! wantvl && ! wantvr) {
978 if (! (wntsnn || wntsne)) {
980 i__1 = minwrk, i__2 = *n * *n + (*n << 1);
981 minwrk = f2cmax(i__1,i__2);
983 maxwrk = f2cmax(maxwrk,hswork);
984 if (! (wntsnn || wntsne)) {
986 i__1 = maxwrk, i__2 = *n * *n + (*n << 1);
987 maxwrk = f2cmax(i__1,i__2);
991 if (! (wntsnn || wntsne)) {
993 i__1 = minwrk, i__2 = *n * *n + (*n << 1);
994 minwrk = f2cmax(i__1,i__2);
996 maxwrk = f2cmax(maxwrk,hswork);
998 i__1 = maxwrk, i__2 = *n + (*n - 1) * ilaenv_(&c__1, "CUNGHR",
999 " ", n, &c__1, n, &c_n1, (ftnlen)6, (ftnlen)1);
1000 maxwrk = f2cmax(i__1,i__2);
1001 if (! (wntsnn || wntsne)) {
1003 i__1 = maxwrk, i__2 = *n * *n + (*n << 1);
1004 maxwrk = f2cmax(i__1,i__2);
1007 i__1 = maxwrk, i__2 = *n << 1;
1008 maxwrk = f2cmax(i__1,i__2);
1010 maxwrk = f2cmax(maxwrk,minwrk);
1012 work[1].r = (real) maxwrk, work[1].i = 0.f;
1014 if (*lwork < minwrk && ! lquery) {
1021 xerbla_("CGEEVX", &i__1, (ftnlen)6);
1023 } else if (lquery) {
1027 /* Quick return if possible */
1033 /* Get machine constants */
1036 smlnum = slamch_("S");
1037 bignum = 1.f / smlnum;
1038 slabad_(&smlnum, &bignum);
1039 smlnum = sqrt(smlnum) / eps;
1040 bignum = 1.f / smlnum;
1042 /* Scale A if f2cmax element outside range [SMLNUM,BIGNUM] */
1045 anrm = clange_("M", n, n, &a[a_offset], lda, dum);
1047 if (anrm > 0.f && anrm < smlnum) {
1050 } else if (anrm > bignum) {
1055 clascl_("G", &c__0, &c__0, &anrm, &cscale, n, n, &a[a_offset], lda, &
1059 /* Balance the matrix and compute ABNRM */
1061 cgebal_(balanc, n, &a[a_offset], lda, ilo, ihi, &scale[1], &ierr);
1062 *abnrm = clange_("1", n, n, &a[a_offset], lda, dum);
1065 slascl_("G", &c__0, &c__0, &cscale, &anrm, &c__1, &c__1, dum, &c__1, &
1070 /* Reduce to upper Hessenberg form */
1071 /* (CWorkspace: need 2*N, prefer N+N*NB) */
1072 /* (RWorkspace: none) */
1076 i__1 = *lwork - iwrk + 1;
1077 cgehrd_(n, ilo, ihi, &a[a_offset], lda, &work[itau], &work[iwrk], &i__1, &
1082 /* Want left eigenvectors */
1083 /* Copy Householder vectors to VL */
1085 *(unsigned char *)side = 'L';
1086 clacpy_("L", n, n, &a[a_offset], lda, &vl[vl_offset], ldvl)
1089 /* Generate unitary matrix in VL */
1090 /* (CWorkspace: need 2*N-1, prefer N+(N-1)*NB) */
1091 /* (RWorkspace: none) */
1093 i__1 = *lwork - iwrk + 1;
1094 cunghr_(n, ilo, ihi, &vl[vl_offset], ldvl, &work[itau], &work[iwrk], &
1097 /* Perform QR iteration, accumulating Schur vectors in VL */
1098 /* (CWorkspace: need 1, prefer HSWORK (see comments) ) */
1099 /* (RWorkspace: none) */
1102 i__1 = *lwork - iwrk + 1;
1103 chseqr_("S", "V", n, ilo, ihi, &a[a_offset], lda, &w[1], &vl[
1104 vl_offset], ldvl, &work[iwrk], &i__1, info);
1108 /* Want left and right eigenvectors */
1109 /* Copy Schur vectors to VR */
1111 *(unsigned char *)side = 'B';
1112 clacpy_("F", n, n, &vl[vl_offset], ldvl, &vr[vr_offset], ldvr);
1115 } else if (wantvr) {
1117 /* Want right eigenvectors */
1118 /* Copy Householder vectors to VR */
1120 *(unsigned char *)side = 'R';
1121 clacpy_("L", n, n, &a[a_offset], lda, &vr[vr_offset], ldvr)
1124 /* Generate unitary matrix in VR */
1125 /* (CWorkspace: need 2*N-1, prefer N+(N-1)*NB) */
1126 /* (RWorkspace: none) */
1128 i__1 = *lwork - iwrk + 1;
1129 cunghr_(n, ilo, ihi, &vr[vr_offset], ldvr, &work[itau], &work[iwrk], &
1132 /* Perform QR iteration, accumulating Schur vectors in VR */
1133 /* (CWorkspace: need 1, prefer HSWORK (see comments) ) */
1134 /* (RWorkspace: none) */
1137 i__1 = *lwork - iwrk + 1;
1138 chseqr_("S", "V", n, ilo, ihi, &a[a_offset], lda, &w[1], &vr[
1139 vr_offset], ldvr, &work[iwrk], &i__1, info);
1143 /* Compute eigenvalues only */
1144 /* If condition numbers desired, compute Schur form */
1147 *(unsigned char *)job = 'E';
1149 *(unsigned char *)job = 'S';
1152 /* (CWorkspace: need 1, prefer HSWORK (see comments) ) */
1153 /* (RWorkspace: none) */
1156 i__1 = *lwork - iwrk + 1;
1157 chseqr_(job, "N", n, ilo, ihi, &a[a_offset], lda, &w[1], &vr[
1158 vr_offset], ldvr, &work[iwrk], &i__1, info);
1161 /* If INFO .NE. 0 from CHSEQR, then quit */
1167 if (wantvl || wantvr) {
1169 /* Compute left and/or right eigenvectors */
1170 /* (CWorkspace: need 2*N, prefer N + 2*N*NB) */
1171 /* (RWorkspace: need N) */
1173 i__1 = *lwork - iwrk + 1;
1174 ctrevc3_(side, "B", select, n, &a[a_offset], lda, &vl[vl_offset],
1175 ldvl, &vr[vr_offset], ldvr, n, &nout, &work[iwrk], &i__1, &
1176 rwork[1], n, &ierr);
1179 /* Compute condition numbers if desired */
1180 /* (CWorkspace: need N*N+2*N unless SENSE = 'E') */
1181 /* (RWorkspace: need 2*N unless SENSE = 'E') */
1184 ctrsna_(sense, "A", select, n, &a[a_offset], lda, &vl[vl_offset],
1185 ldvl, &vr[vr_offset], ldvr, &rconde[1], &rcondv[1], n, &nout,
1186 &work[iwrk], n, &rwork[1], &icond);
1191 /* Undo balancing of left eigenvectors */
1193 cgebak_(balanc, "L", n, ilo, ihi, &scale[1], n, &vl[vl_offset], ldvl,
1196 /* Normalize left eigenvectors and make largest component real */
1199 for (i__ = 1; i__ <= i__1; ++i__) {
1200 scl = 1.f / scnrm2_(n, &vl[i__ * vl_dim1 + 1], &c__1);
1201 csscal_(n, &scl, &vl[i__ * vl_dim1 + 1], &c__1);
1203 for (k = 1; k <= i__2; ++k) {
1204 i__3 = k + i__ * vl_dim1;
1205 /* Computing 2nd power */
1207 /* Computing 2nd power */
1208 r__2 = r_imag(&vl[k + i__ * vl_dim1]);
1209 rwork[k] = r__1 * r__1 + r__2 * r__2;
1212 k = isamax_(n, &rwork[1], &c__1);
1213 r_cnjg(&q__2, &vl[k + i__ * vl_dim1]);
1214 r__1 = sqrt(rwork[k]);
1215 q__1.r = q__2.r / r__1, q__1.i = q__2.i / r__1;
1216 tmp.r = q__1.r, tmp.i = q__1.i;
1217 cscal_(n, &tmp, &vl[i__ * vl_dim1 + 1], &c__1);
1218 i__2 = k + i__ * vl_dim1;
1219 i__3 = k + i__ * vl_dim1;
1221 q__1.r = r__1, q__1.i = 0.f;
1222 vl[i__2].r = q__1.r, vl[i__2].i = q__1.i;
1229 /* Undo balancing of right eigenvectors */
1231 cgebak_(balanc, "R", n, ilo, ihi, &scale[1], n, &vr[vr_offset], ldvr,
1234 /* Normalize right eigenvectors and make largest component real */
1237 for (i__ = 1; i__ <= i__1; ++i__) {
1238 scl = 1.f / scnrm2_(n, &vr[i__ * vr_dim1 + 1], &c__1);
1239 csscal_(n, &scl, &vr[i__ * vr_dim1 + 1], &c__1);
1241 for (k = 1; k <= i__2; ++k) {
1242 i__3 = k + i__ * vr_dim1;
1243 /* Computing 2nd power */
1245 /* Computing 2nd power */
1246 r__2 = r_imag(&vr[k + i__ * vr_dim1]);
1247 rwork[k] = r__1 * r__1 + r__2 * r__2;
1250 k = isamax_(n, &rwork[1], &c__1);
1251 r_cnjg(&q__2, &vr[k + i__ * vr_dim1]);
1252 r__1 = sqrt(rwork[k]);
1253 q__1.r = q__2.r / r__1, q__1.i = q__2.i / r__1;
1254 tmp.r = q__1.r, tmp.i = q__1.i;
1255 cscal_(n, &tmp, &vr[i__ * vr_dim1 + 1], &c__1);
1256 i__2 = k + i__ * vr_dim1;
1257 i__3 = k + i__ * vr_dim1;
1259 q__1.r = r__1, q__1.i = 0.f;
1260 vr[i__2].r = q__1.r, vr[i__2].i = q__1.i;
1265 /* Undo scaling if necessary */
1272 i__2 = f2cmax(i__3,1);
1273 clascl_("G", &c__0, &c__0, &cscale, &anrm, &i__1, &c__1, &w[*info + 1]
1276 if ((wntsnv || wntsnb) && icond == 0) {
1277 slascl_("G", &c__0, &c__0, &cscale, &anrm, n, &c__1, &rcondv[
1282 clascl_("G", &c__0, &c__0, &cscale, &anrm, &i__1, &c__1, &w[1], n,
1287 work[1].r = (real) maxwrk, work[1].i = 0.f;