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)
513 /* Table of constant values */
515 static complex c_b1 = {0.f,0.f};
516 static complex c_b2 = {1.f,0.f};
517 static integer c__1 = 1;
518 static integer c__0 = 0;
520 /* > \brief <b> CGGEVX 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 CGGEVX + dependencies */
530 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/cggevx.
533 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/cggevx.
536 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/cggevx.
544 /* SUBROUTINE CGGEVX( BALANC, JOBVL, JOBVR, SENSE, N, A, LDA, B, LDB, */
545 /* ALPHA, BETA, VL, LDVL, VR, LDVR, ILO, IHI, */
546 /* LSCALE, RSCALE, ABNRM, BBNRM, RCONDE, RCONDV, */
547 /* WORK, LWORK, RWORK, IWORK, BWORK, INFO ) */
549 /* CHARACTER BALANC, JOBVL, JOBVR, SENSE */
550 /* INTEGER IHI, ILO, INFO, LDA, LDB, LDVL, LDVR, LWORK, N */
551 /* REAL ABNRM, BBNRM */
552 /* LOGICAL BWORK( * ) */
553 /* INTEGER IWORK( * ) */
554 /* REAL LSCALE( * ), RCONDE( * ), RCONDV( * ), */
555 /* $ RSCALE( * ), RWORK( * ) */
556 /* COMPLEX A( LDA, * ), ALPHA( * ), B( LDB, * ), */
557 /* $ BETA( * ), VL( LDVL, * ), VR( LDVR, * ), */
561 /* > \par Purpose: */
566 /* > CGGEVX computes for a pair of N-by-N complex nonsymmetric matrices */
567 /* > (A,B) the generalized eigenvalues, and optionally, the left and/or */
568 /* > right generalized eigenvectors. */
570 /* > Optionally, it also computes a balancing transformation to improve */
571 /* > the conditioning of the eigenvalues and eigenvectors (ILO, IHI, */
572 /* > LSCALE, RSCALE, ABNRM, and BBNRM), reciprocal condition numbers for */
573 /* > the eigenvalues (RCONDE), and reciprocal condition numbers for the */
574 /* > right eigenvectors (RCONDV). */
576 /* > A generalized eigenvalue for a pair of matrices (A,B) is a scalar */
577 /* > lambda or a ratio alpha/beta = lambda, such that A - lambda*B is */
578 /* > singular. It is usually represented as the pair (alpha,beta), as */
579 /* > there is a reasonable interpretation for beta=0, and even for both */
582 /* > The right eigenvector v(j) corresponding to the eigenvalue lambda(j) */
583 /* > of (A,B) satisfies */
584 /* > A * v(j) = lambda(j) * B * v(j) . */
585 /* > The left eigenvector u(j) corresponding to the eigenvalue lambda(j) */
586 /* > of (A,B) satisfies */
587 /* > u(j)**H * A = lambda(j) * u(j)**H * B. */
588 /* > where u(j)**H is the conjugate-transpose of u(j). */
595 /* > \param[in] BALANC */
597 /* > BALANC is CHARACTER*1 */
598 /* > Specifies the balance option to be performed: */
599 /* > = 'N': do not diagonally scale or permute; */
600 /* > = 'P': permute only; */
601 /* > = 'S': scale only; */
602 /* > = 'B': both permute and scale. */
603 /* > Computed reciprocal condition numbers will be for the */
604 /* > matrices after permuting and/or balancing. Permuting does */
605 /* > not change condition numbers (in exact arithmetic), but */
606 /* > balancing does. */
609 /* > \param[in] JOBVL */
611 /* > JOBVL is CHARACTER*1 */
612 /* > = 'N': do not compute the left generalized eigenvectors; */
613 /* > = 'V': compute the left generalized eigenvectors. */
616 /* > \param[in] JOBVR */
618 /* > JOBVR is CHARACTER*1 */
619 /* > = 'N': do not compute the right generalized eigenvectors; */
620 /* > = 'V': compute the right generalized eigenvectors. */
623 /* > \param[in] SENSE */
625 /* > SENSE is CHARACTER*1 */
626 /* > Determines which reciprocal condition numbers are computed. */
627 /* > = 'N': none are computed; */
628 /* > = 'E': computed for eigenvalues only; */
629 /* > = 'V': computed for eigenvectors only; */
630 /* > = 'B': computed for eigenvalues and eigenvectors. */
636 /* > The order of the matrices A, B, VL, and VR. N >= 0. */
639 /* > \param[in,out] A */
641 /* > A is COMPLEX array, dimension (LDA, N) */
642 /* > On entry, the matrix A in the pair (A,B). */
643 /* > On exit, A has been overwritten. If JOBVL='V' or JOBVR='V' */
644 /* > or both, then A contains the first part of the complex Schur */
645 /* > form of the "balanced" versions of the input A and B. */
648 /* > \param[in] LDA */
650 /* > LDA is INTEGER */
651 /* > The leading dimension of A. LDA >= f2cmax(1,N). */
654 /* > \param[in,out] B */
656 /* > B is COMPLEX array, dimension (LDB, N) */
657 /* > On entry, the matrix B in the pair (A,B). */
658 /* > On exit, B has been overwritten. If JOBVL='V' or JOBVR='V' */
659 /* > or both, then B contains the second part of the complex */
660 /* > Schur form of the "balanced" versions of the input A and B. */
663 /* > \param[in] LDB */
665 /* > LDB is INTEGER */
666 /* > The leading dimension of B. LDB >= f2cmax(1,N). */
669 /* > \param[out] ALPHA */
671 /* > ALPHA is COMPLEX array, dimension (N) */
674 /* > \param[out] BETA */
676 /* > BETA is COMPLEX array, dimension (N) */
677 /* > On exit, ALPHA(j)/BETA(j), j=1,...,N, will be the generalized */
680 /* > Note: the quotient ALPHA(j)/BETA(j) ) may easily over- or */
681 /* > underflow, and BETA(j) may even be zero. Thus, the user */
682 /* > should avoid naively computing the ratio ALPHA/BETA. */
683 /* > However, ALPHA will be always less than and usually */
684 /* > comparable with norm(A) in magnitude, and BETA always less */
685 /* > than and usually comparable with norm(B). */
688 /* > \param[out] VL */
690 /* > VL is COMPLEX array, dimension (LDVL,N) */
691 /* > If JOBVL = 'V', the left generalized eigenvectors u(j) are */
692 /* > stored one after another in the columns of VL, in the same */
693 /* > order as their eigenvalues. */
694 /* > Each eigenvector will be scaled so the largest component */
695 /* > will have abs(real part) + abs(imag. part) = 1. */
696 /* > Not referenced if JOBVL = 'N'. */
699 /* > \param[in] LDVL */
701 /* > LDVL is INTEGER */
702 /* > The leading dimension of the matrix VL. LDVL >= 1, and */
703 /* > if JOBVL = 'V', LDVL >= N. */
706 /* > \param[out] VR */
708 /* > VR is COMPLEX array, dimension (LDVR,N) */
709 /* > If JOBVR = 'V', the right generalized eigenvectors v(j) are */
710 /* > stored one after another in the columns of VR, in the same */
711 /* > order as their eigenvalues. */
712 /* > Each eigenvector will be scaled so the largest component */
713 /* > will have abs(real part) + abs(imag. part) = 1. */
714 /* > Not referenced if JOBVR = 'N'. */
717 /* > \param[in] LDVR */
719 /* > LDVR is INTEGER */
720 /* > The leading dimension of the matrix VR. LDVR >= 1, and */
721 /* > if JOBVR = 'V', LDVR >= N. */
724 /* > \param[out] ILO */
726 /* > ILO is INTEGER */
729 /* > \param[out] IHI */
731 /* > IHI is INTEGER */
732 /* > ILO and IHI are integer values such that on exit */
733 /* > A(i,j) = 0 and B(i,j) = 0 if i > j and */
734 /* > j = 1,...,ILO-1 or i = IHI+1,...,N. */
735 /* > If BALANC = 'N' or 'S', ILO = 1 and IHI = N. */
738 /* > \param[out] LSCALE */
740 /* > LSCALE is REAL array, dimension (N) */
741 /* > Details of the permutations and scaling factors applied */
742 /* > to the left side of A and B. If PL(j) is the index of the */
743 /* > row interchanged with row j, and DL(j) is the scaling */
744 /* > factor applied to row j, then */
745 /* > LSCALE(j) = PL(j) for j = 1,...,ILO-1 */
746 /* > = DL(j) for j = ILO,...,IHI */
747 /* > = PL(j) for j = IHI+1,...,N. */
748 /* > The order in which the interchanges are made is N to IHI+1, */
749 /* > then 1 to ILO-1. */
752 /* > \param[out] RSCALE */
754 /* > RSCALE is REAL array, dimension (N) */
755 /* > Details of the permutations and scaling factors applied */
756 /* > to the right side of A and B. If PR(j) is the index of the */
757 /* > column interchanged with column j, and DR(j) is the scaling */
758 /* > factor applied to column j, then */
759 /* > RSCALE(j) = PR(j) for j = 1,...,ILO-1 */
760 /* > = DR(j) for j = ILO,...,IHI */
761 /* > = PR(j) for j = IHI+1,...,N */
762 /* > The order in which the interchanges are made is N to IHI+1, */
763 /* > then 1 to ILO-1. */
766 /* > \param[out] ABNRM */
768 /* > ABNRM is REAL */
769 /* > The one-norm of the balanced matrix A. */
772 /* > \param[out] BBNRM */
774 /* > BBNRM is REAL */
775 /* > The one-norm of the balanced matrix B. */
778 /* > \param[out] RCONDE */
780 /* > RCONDE is REAL array, dimension (N) */
781 /* > If SENSE = 'E' or 'B', the reciprocal condition numbers of */
782 /* > the eigenvalues, stored in consecutive elements of the array. */
783 /* > If SENSE = 'N' or 'V', RCONDE is not referenced. */
786 /* > \param[out] RCONDV */
788 /* > RCONDV is REAL array, dimension (N) */
789 /* > If SENSE = 'V' or 'B', the estimated reciprocal condition */
790 /* > numbers of the eigenvectors, stored in consecutive elements */
791 /* > of the array. If the eigenvalues cannot be reordered to */
792 /* > compute RCONDV(j), RCONDV(j) is set to 0; this can only occur */
793 /* > when the true value would be very small anyway. */
794 /* > If SENSE = 'N' or 'E', RCONDV is not referenced. */
797 /* > \param[out] WORK */
799 /* > WORK is COMPLEX array, dimension (MAX(1,LWORK)) */
800 /* > On exit, if INFO = 0, WORK(1) returns the optimal LWORK. */
803 /* > \param[in] LWORK */
805 /* > LWORK is INTEGER */
806 /* > The dimension of the array WORK. LWORK >= f2cmax(1,2*N). */
807 /* > If SENSE = 'E', LWORK >= f2cmax(1,4*N). */
808 /* > If SENSE = 'V' or 'B', LWORK >= f2cmax(1,2*N*N+2*N). */
810 /* > If LWORK = -1, then a workspace query is assumed; the routine */
811 /* > only calculates the optimal size of the WORK array, returns */
812 /* > this value as the first entry of the WORK array, and no error */
813 /* > message related to LWORK is issued by XERBLA. */
816 /* > \param[out] RWORK */
818 /* > RWORK is REAL array, dimension (lrwork) */
819 /* > lrwork must be at least f2cmax(1,6*N) if BALANC = 'S' or 'B', */
820 /* > and at least f2cmax(1,2*N) otherwise. */
821 /* > Real workspace. */
824 /* > \param[out] IWORK */
826 /* > IWORK is INTEGER array, dimension (N+2) */
827 /* > If SENSE = 'E', IWORK is not referenced. */
830 /* > \param[out] BWORK */
832 /* > BWORK is LOGICAL array, dimension (N) */
833 /* > If SENSE = 'N', BWORK is not referenced. */
836 /* > \param[out] INFO */
838 /* > INFO is INTEGER */
839 /* > = 0: successful exit */
840 /* > < 0: if INFO = -i, the i-th argument had an illegal value. */
842 /* > The QZ iteration failed. No eigenvectors have been */
843 /* > calculated, but ALPHA(j) and BETA(j) should be correct */
844 /* > for j=INFO+1,...,N. */
845 /* > > N: =N+1: other than QZ iteration failed in CHGEQZ. */
846 /* > =N+2: error return from CTGEVC. */
852 /* > \author Univ. of Tennessee */
853 /* > \author Univ. of California Berkeley */
854 /* > \author Univ. of Colorado Denver */
855 /* > \author NAG Ltd. */
857 /* > \date April 2012 */
859 /* > \ingroup complexGEeigen */
861 /* > \par Further Details: */
862 /* ===================== */
866 /* > Balancing a matrix pair (A,B) includes, first, permuting rows and */
867 /* > columns to isolate eigenvalues, second, applying diagonal similarity */
868 /* > transformation to the rows and columns to make the rows and columns */
869 /* > as close in norm as possible. The computed reciprocal condition */
870 /* > numbers correspond to the balanced matrix. Permuting rows and columns */
871 /* > will not change the condition numbers (in exact arithmetic) but */
872 /* > diagonal scaling will. For further explanation of balancing, see */
873 /* > section 4.11.1.2 of LAPACK Users' Guide. */
875 /* > An approximate error bound on the chordal distance between the i-th */
876 /* > computed generalized eigenvalue w and the corresponding exact */
877 /* > eigenvalue lambda is */
879 /* > chord(w, lambda) <= EPS * norm(ABNRM, BBNRM) / RCONDE(I) */
881 /* > An approximate error bound for the angle between the i-th computed */
882 /* > eigenvector VL(i) or VR(i) is given by */
884 /* > EPS * norm(ABNRM, BBNRM) / DIF(i). */
886 /* > For further explanation of the reciprocal condition numbers RCONDE */
887 /* > and RCONDV, see section 4.11 of LAPACK User's Guide. */
890 /* ===================================================================== */
891 /* Subroutine */ int cggevx_(char *balanc, char *jobvl, char *jobvr, char *
892 sense, integer *n, complex *a, integer *lda, complex *b, integer *ldb,
893 complex *alpha, complex *beta, complex *vl, integer *ldvl, complex *
894 vr, integer *ldvr, integer *ilo, integer *ihi, real *lscale, real *
895 rscale, real *abnrm, real *bbnrm, real *rconde, real *rcondv, complex
896 *work, integer *lwork, real *rwork, integer *iwork, logical *bwork,
899 /* System generated locals */
900 integer a_dim1, a_offset, b_dim1, b_offset, vl_dim1, vl_offset, vr_dim1,
901 vr_offset, i__1, i__2, i__3, i__4;
902 real r__1, r__2, r__3, r__4;
905 /* Local variables */
910 integer iwrk, iwrk1, i__, j, m;
911 extern logical lsame_(char *, char *);
915 extern /* Subroutine */ int cggbak_(char *, char *, integer *, integer *,
916 integer *, real *, real *, integer *, complex *, integer *,
917 integer *), cggbal_(char *, integer *, complex *,
918 integer *, complex *, integer *, integer *, integer *, real *,
919 real *, real *, integer *), slabad_(real *, real *);
921 extern real clange_(char *, integer *, integer *, complex *, integer *,
924 extern /* Subroutine */ int cgghrd_(char *, char *, integer *, integer *,
925 integer *, complex *, integer *, complex *, integer *, complex *,
926 integer *, complex *, integer *, integer *),
927 clascl_(char *, integer *, integer *, real *, real *, integer *,
928 integer *, complex *, integer *, integer *);
929 logical ilascl, ilbscl;
930 extern /* Subroutine */ int cgeqrf_(integer *, integer *, complex *,
931 integer *, complex *, complex *, integer *, integer *), clacpy_(
932 char *, integer *, integer *, complex *, integer *, complex *,
933 integer *), claset_(char *, integer *, integer *, complex
934 *, complex *, complex *, integer *);
938 extern /* Subroutine */ int chgeqz_(char *, char *, char *, integer *,
939 integer *, integer *, complex *, integer *, complex *, integer *,
940 complex *, complex *, complex *, integer *, complex *, integer *,
941 complex *, integer *, real *, integer *),
942 ctgevc_(char *, char *, logical *, integer *, complex *, integer *
943 , complex *, integer *, complex *, integer *, complex *, integer *
944 , integer *, integer *, complex *, real *, integer *);
946 extern /* Subroutine */ int ctgsna_(char *, char *, logical *, integer *,
947 complex *, integer *, complex *, integer *, complex *, integer *,
948 complex *, integer *, real *, real *, integer *, integer *,
949 complex *, integer *, integer *, integer *),
950 slascl_(char *, integer *, integer *, real *, real *, integer *,
951 integer *, real *, integer *, integer *), xerbla_(char *,
953 extern integer ilaenv_(integer *, char *, char *, integer *, integer *,
954 integer *, integer *, ftnlen, ftnlen);
955 extern real slamch_(char *);
958 extern /* Subroutine */ int cungqr_(integer *, integer *, integer *,
959 complex *, integer *, complex *, complex *, integer *, integer *);
963 extern /* Subroutine */ int cunmqr_(char *, char *, integer *, integer *,
964 integer *, complex *, integer *, complex *, complex *, integer *,
965 complex *, integer *, integer *);
966 integer minwrk, maxwrk;
969 logical lquery, wantsv;
974 /* -- LAPACK driver routine (version 3.7.0) -- */
975 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
976 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
980 /* ===================================================================== */
983 /* Decode the input arguments */
985 /* Parameter adjustments */
987 a_offset = 1 + a_dim1 * 1;
990 b_offset = 1 + b_dim1 * 1;
995 vl_offset = 1 + vl_dim1 * 1;
998 vr_offset = 1 + vr_dim1 * 1;
1010 if (lsame_(jobvl, "N")) {
1013 } else if (lsame_(jobvl, "V")) {
1021 if (lsame_(jobvr, "N")) {
1024 } else if (lsame_(jobvr, "V")) {
1033 noscl = lsame_(balanc, "N") || lsame_(balanc, "P");
1034 wantsn = lsame_(sense, "N");
1035 wantse = lsame_(sense, "E");
1036 wantsv = lsame_(sense, "V");
1037 wantsb = lsame_(sense, "B");
1039 /* Test the input arguments */
1042 lquery = *lwork == -1;
1043 if (! (noscl || lsame_(balanc, "S") || lsame_(
1046 } else if (ijobvl <= 0) {
1048 } else if (ijobvr <= 0) {
1050 } else if (! (wantsn || wantse || wantsb || wantsv)) {
1052 } else if (*n < 0) {
1054 } else if (*lda < f2cmax(1,*n)) {
1056 } else if (*ldb < f2cmax(1,*n)) {
1058 } else if (*ldvl < 1 || ilvl && *ldvl < *n) {
1060 } else if (*ldvr < 1 || ilvr && *ldvr < *n) {
1064 /* Compute workspace */
1065 /* (Note: Comments in the code beginning "Workspace:" describe the */
1066 /* minimal amount of workspace needed at that point in the code, */
1067 /* as well as the preferred amount for good performance. */
1068 /* NB refers to the optimal block size for the immediately */
1069 /* following subroutine, as returned by ILAENV. The workspace is */
1070 /* computed assuming ILO = 1 and IHI = N, the worst case.) */
1080 } else if (wantsv || wantsb) {
1081 minwrk = (*n << 1) * (*n + 1);
1085 i__1 = maxwrk, i__2 = *n + *n * ilaenv_(&c__1, "CGEQRF", " ", n, &
1086 c__1, n, &c__0, (ftnlen)6, (ftnlen)1);
1087 maxwrk = f2cmax(i__1,i__2);
1089 i__1 = maxwrk, i__2 = *n + *n * ilaenv_(&c__1, "CUNMQR", " ", n, &
1090 c__1, n, &c__0, (ftnlen)6, (ftnlen)1);
1091 maxwrk = f2cmax(i__1,i__2);
1094 i__1 = maxwrk, i__2 = *n + *n * ilaenv_(&c__1, "CUNGQR",
1095 " ", n, &c__1, n, &c__0, (ftnlen)6, (ftnlen)1);
1096 maxwrk = f2cmax(i__1,i__2);
1099 work[1].r = (real) maxwrk, work[1].i = 0.f;
1101 if (*lwork < minwrk && ! lquery) {
1108 xerbla_("CGGEVX", &i__1, (ftnlen)6);
1110 } else if (lquery) {
1114 /* Quick return if possible */
1120 /* Get machine constants */
1123 smlnum = slamch_("S");
1124 bignum = 1.f / smlnum;
1125 slabad_(&smlnum, &bignum);
1126 smlnum = sqrt(smlnum) / eps;
1127 bignum = 1.f / smlnum;
1129 /* Scale A if f2cmax element outside range [SMLNUM,BIGNUM] */
1131 anrm = clange_("M", n, n, &a[a_offset], lda, &rwork[1]);
1133 if (anrm > 0.f && anrm < smlnum) {
1136 } else if (anrm > bignum) {
1141 clascl_("G", &c__0, &c__0, &anrm, &anrmto, n, n, &a[a_offset], lda, &
1145 /* Scale B if f2cmax element outside range [SMLNUM,BIGNUM] */
1147 bnrm = clange_("M", n, n, &b[b_offset], ldb, &rwork[1]);
1149 if (bnrm > 0.f && bnrm < smlnum) {
1152 } else if (bnrm > bignum) {
1157 clascl_("G", &c__0, &c__0, &bnrm, &bnrmto, n, n, &b[b_offset], ldb, &
1161 /* Permute and/or balance the matrix pair (A,B) */
1162 /* (Real Workspace: need 6*N if BALANC = 'S' or 'B', 1 otherwise) */
1164 cggbal_(balanc, n, &a[a_offset], lda, &b[b_offset], ldb, ilo, ihi, &
1165 lscale[1], &rscale[1], &rwork[1], &ierr);
1167 /* Compute ABNRM and BBNRM */
1169 *abnrm = clange_("1", n, n, &a[a_offset], lda, &rwork[1]);
1172 slascl_("G", &c__0, &c__0, &anrmto, &anrm, &c__1, &c__1, &rwork[1], &
1177 *bbnrm = clange_("1", n, n, &b[b_offset], ldb, &rwork[1]);
1180 slascl_("G", &c__0, &c__0, &bnrmto, &bnrm, &c__1, &c__1, &rwork[1], &
1185 /* Reduce B to triangular form (QR decomposition of B) */
1186 /* (Complex Workspace: need N, prefer N*NB ) */
1188 irows = *ihi + 1 - *ilo;
1189 if (ilv || ! wantsn) {
1190 icols = *n + 1 - *ilo;
1195 iwrk = itau + irows;
1196 i__1 = *lwork + 1 - iwrk;
1197 cgeqrf_(&irows, &icols, &b[*ilo + *ilo * b_dim1], ldb, &work[itau], &work[
1198 iwrk], &i__1, &ierr);
1200 /* Apply the unitary transformation to A */
1201 /* (Complex Workspace: need N, prefer N*NB) */
1203 i__1 = *lwork + 1 - iwrk;
1204 cunmqr_("L", "C", &irows, &icols, &irows, &b[*ilo + *ilo * b_dim1], ldb, &
1205 work[itau], &a[*ilo + *ilo * a_dim1], lda, &work[iwrk], &i__1, &
1208 /* Initialize VL and/or VR */
1209 /* (Workspace: need N, prefer N*NB) */
1212 claset_("Full", n, n, &c_b1, &c_b2, &vl[vl_offset], ldvl);
1216 clacpy_("L", &i__1, &i__2, &b[*ilo + 1 + *ilo * b_dim1], ldb, &vl[
1217 *ilo + 1 + *ilo * vl_dim1], ldvl);
1219 i__1 = *lwork + 1 - iwrk;
1220 cungqr_(&irows, &irows, &irows, &vl[*ilo + *ilo * vl_dim1], ldvl, &
1221 work[itau], &work[iwrk], &i__1, &ierr);
1225 claset_("Full", n, n, &c_b1, &c_b2, &vr[vr_offset], ldvr);
1228 /* Reduce to generalized Hessenberg form */
1229 /* (Workspace: none needed) */
1231 if (ilv || ! wantsn) {
1233 /* Eigenvectors requested -- work on whole matrix. */
1235 cgghrd_(jobvl, jobvr, n, ilo, ihi, &a[a_offset], lda, &b[b_offset],
1236 ldb, &vl[vl_offset], ldvl, &vr[vr_offset], ldvr, &ierr);
1238 cgghrd_("N", "N", &irows, &c__1, &irows, &a[*ilo + *ilo * a_dim1],
1239 lda, &b[*ilo + *ilo * b_dim1], ldb, &vl[vl_offset], ldvl, &vr[
1240 vr_offset], ldvr, &ierr);
1243 /* Perform QZ algorithm (Compute eigenvalues, and optionally, the */
1244 /* Schur forms and Schur vectors) */
1245 /* (Complex Workspace: need N) */
1246 /* (Real Workspace: need N) */
1249 if (ilv || ! wantsn) {
1250 *(unsigned char *)chtemp = 'S';
1252 *(unsigned char *)chtemp = 'E';
1255 i__1 = *lwork + 1 - iwrk;
1256 chgeqz_(chtemp, jobvl, jobvr, n, ilo, ihi, &a[a_offset], lda, &b[b_offset]
1257 , ldb, &alpha[1], &beta[1], &vl[vl_offset], ldvl, &vr[vr_offset],
1258 ldvr, &work[iwrk], &i__1, &rwork[1], &ierr);
1260 if (ierr > 0 && ierr <= *n) {
1262 } else if (ierr > *n && ierr <= *n << 1) {
1270 /* Compute Eigenvectors and estimate condition numbers if desired */
1271 /* CTGEVC: (Complex Workspace: need 2*N ) */
1272 /* (Real Workspace: need 2*N ) */
1273 /* CTGSNA: (Complex Workspace: need 2*N*N if SENSE='V' or 'B') */
1274 /* (Integer Workspace: need N+2 ) */
1276 if (ilv || ! wantsn) {
1280 *(unsigned char *)chtemp = 'B';
1282 *(unsigned char *)chtemp = 'L';
1285 *(unsigned char *)chtemp = 'R';
1288 ctgevc_(chtemp, "B", ldumma, n, &a[a_offset], lda, &b[b_offset],
1289 ldb, &vl[vl_offset], ldvl, &vr[vr_offset], ldvr, n, &in, &
1290 work[iwrk], &rwork[1], &ierr);
1299 /* compute eigenvectors (STGEVC) and estimate condition */
1300 /* numbers (STGSNA). Note that the definition of the condition */
1301 /* number is not invariant under transformation (u,v) to */
1302 /* (Q*u, Z*v), where (u,v) are eigenvectors of the generalized */
1303 /* Schur form (S,T), Q and Z are orthogonal matrices. In order */
1304 /* to avoid using extra 2*N*N workspace, we have to */
1305 /* re-calculate eigenvectors and estimate the condition numbers */
1306 /* one at a time. */
1309 for (i__ = 1; i__ <= i__1; ++i__) {
1312 for (j = 1; j <= i__2; ++j) {
1321 if (wantse || wantsb) {
1322 ctgevc_("B", "S", &bwork[1], n, &a[a_offset], lda, &b[
1323 b_offset], ldb, &work[1], n, &work[iwrk], n, &
1324 c__1, &m, &work[iwrk1], &rwork[1], &ierr);
1331 i__2 = *lwork - iwrk1 + 1;
1332 ctgsna_(sense, "S", &bwork[1], n, &a[a_offset], lda, &b[
1333 b_offset], ldb, &work[1], n, &work[iwrk], n, &rconde[
1334 i__], &rcondv[i__], &c__1, &m, &work[iwrk1], &i__2, &
1342 /* Undo balancing on VL and VR and normalization */
1343 /* (Workspace: none needed) */
1346 cggbak_(balanc, "L", n, ilo, ihi, &lscale[1], &rscale[1], n, &vl[
1347 vl_offset], ldvl, &ierr);
1350 for (jc = 1; jc <= i__1; ++jc) {
1353 for (jr = 1; jr <= i__2; ++jr) {
1355 i__3 = jr + jc * vl_dim1;
1356 r__3 = temp, r__4 = (r__1 = vl[i__3].r, abs(r__1)) + (r__2 =
1357 r_imag(&vl[jr + jc * vl_dim1]), abs(r__2));
1358 temp = f2cmax(r__3,r__4);
1361 if (temp < smlnum) {
1366 for (jr = 1; jr <= i__2; ++jr) {
1367 i__3 = jr + jc * vl_dim1;
1368 i__4 = jr + jc * vl_dim1;
1369 q__1.r = temp * vl[i__4].r, q__1.i = temp * vl[i__4].i;
1370 vl[i__3].r = q__1.r, vl[i__3].i = q__1.i;
1379 cggbak_(balanc, "R", n, ilo, ihi, &lscale[1], &rscale[1], n, &vr[
1380 vr_offset], ldvr, &ierr);
1382 for (jc = 1; jc <= i__1; ++jc) {
1385 for (jr = 1; jr <= i__2; ++jr) {
1387 i__3 = jr + jc * vr_dim1;
1388 r__3 = temp, r__4 = (r__1 = vr[i__3].r, abs(r__1)) + (r__2 =
1389 r_imag(&vr[jr + jc * vr_dim1]), abs(r__2));
1390 temp = f2cmax(r__3,r__4);
1393 if (temp < smlnum) {
1398 for (jr = 1; jr <= i__2; ++jr) {
1399 i__3 = jr + jc * vr_dim1;
1400 i__4 = jr + jc * vr_dim1;
1401 q__1.r = temp * vr[i__4].r, q__1.i = temp * vr[i__4].i;
1402 vr[i__3].r = q__1.r, vr[i__3].i = q__1.i;
1410 /* Undo scaling if necessary */
1415 clascl_("G", &c__0, &c__0, &anrmto, &anrm, n, &c__1, &alpha[1], n, &
1420 clascl_("G", &c__0, &c__0, &bnrmto, &bnrm, n, &c__1, &beta[1], n, &
1424 work[1].r = (real) maxwrk, work[1].i = 0.f;