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;
519 static integer c_n1 = -1;
521 /* > \brief <b> CGGEV computes the eigenvalues and, optionally, the left and/or right eigenvectors for GE matr
524 /* =========== DOCUMENTATION =========== */
526 /* Online html documentation available at */
527 /* http://www.netlib.org/lapack/explore-html/ */
530 /* > Download CGGEV + dependencies */
531 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/cggev.f
534 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/cggev.f
537 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/cggev.f
545 /* SUBROUTINE CGGEV( JOBVL, JOBVR, N, A, LDA, B, LDB, ALPHA, BETA, */
546 /* VL, LDVL, VR, LDVR, WORK, LWORK, RWORK, INFO ) */
548 /* CHARACTER JOBVL, JOBVR */
549 /* INTEGER INFO, LDA, LDB, LDVL, LDVR, LWORK, N */
550 /* REAL RWORK( * ) */
551 /* COMPLEX A( LDA, * ), ALPHA( * ), B( LDB, * ), */
552 /* $ BETA( * ), VL( LDVL, * ), VR( LDVR, * ), */
556 /* > \par Purpose: */
561 /* > CGGEV computes for a pair of N-by-N complex nonsymmetric matrices */
562 /* > (A,B), the generalized eigenvalues, and optionally, the left and/or */
563 /* > right generalized eigenvectors. */
565 /* > A generalized eigenvalue for a pair of matrices (A,B) is a scalar */
566 /* > lambda or a ratio alpha/beta = lambda, such that A - lambda*B is */
567 /* > singular. It is usually represented as the pair (alpha,beta), as */
568 /* > there is a reasonable interpretation for beta=0, and even for both */
571 /* > The right generalized eigenvector v(j) corresponding to the */
572 /* > generalized eigenvalue lambda(j) of (A,B) satisfies */
574 /* > A * v(j) = lambda(j) * B * v(j). */
576 /* > The left generalized eigenvector u(j) corresponding to the */
577 /* > generalized eigenvalues lambda(j) of (A,B) satisfies */
579 /* > u(j)**H * A = lambda(j) * u(j)**H * B */
581 /* > where u(j)**H is the conjugate-transpose of u(j). */
587 /* > \param[in] JOBVL */
589 /* > JOBVL is CHARACTER*1 */
590 /* > = 'N': do not compute the left generalized eigenvectors; */
591 /* > = 'V': compute the left generalized eigenvectors. */
594 /* > \param[in] JOBVR */
596 /* > JOBVR is CHARACTER*1 */
597 /* > = 'N': do not compute the right generalized eigenvectors; */
598 /* > = 'V': compute the right generalized eigenvectors. */
604 /* > The order of the matrices A, B, VL, and VR. N >= 0. */
607 /* > \param[in,out] A */
609 /* > A is COMPLEX array, dimension (LDA, N) */
610 /* > On entry, the matrix A in the pair (A,B). */
611 /* > On exit, A has been overwritten. */
614 /* > \param[in] LDA */
616 /* > LDA is INTEGER */
617 /* > The leading dimension of A. LDA >= f2cmax(1,N). */
620 /* > \param[in,out] B */
622 /* > B is COMPLEX array, dimension (LDB, N) */
623 /* > On entry, the matrix B in the pair (A,B). */
624 /* > On exit, B has been overwritten. */
627 /* > \param[in] LDB */
629 /* > LDB is INTEGER */
630 /* > The leading dimension of B. LDB >= f2cmax(1,N). */
633 /* > \param[out] ALPHA */
635 /* > ALPHA is COMPLEX array, dimension (N) */
638 /* > \param[out] BETA */
640 /* > BETA is COMPLEX array, dimension (N) */
641 /* > On exit, ALPHA(j)/BETA(j), j=1,...,N, will be the */
642 /* > generalized eigenvalues. */
644 /* > Note: the quotients ALPHA(j)/BETA(j) may easily over- or */
645 /* > underflow, and BETA(j) may even be zero. Thus, the user */
646 /* > should avoid naively computing the ratio alpha/beta. */
647 /* > However, ALPHA will be always less than and usually */
648 /* > comparable with norm(A) in magnitude, and BETA always less */
649 /* > than and usually comparable with norm(B). */
652 /* > \param[out] VL */
654 /* > VL is COMPLEX array, dimension (LDVL,N) */
655 /* > If JOBVL = 'V', the left generalized eigenvectors u(j) are */
656 /* > stored one after another in the columns of VL, in the same */
657 /* > order as their eigenvalues. */
658 /* > Each eigenvector is scaled so the largest component has */
659 /* > abs(real part) + abs(imag. part) = 1. */
660 /* > Not referenced if JOBVL = 'N'. */
663 /* > \param[in] LDVL */
665 /* > LDVL is INTEGER */
666 /* > The leading dimension of the matrix VL. LDVL >= 1, and */
667 /* > if JOBVL = 'V', LDVL >= N. */
670 /* > \param[out] VR */
672 /* > VR is COMPLEX array, dimension (LDVR,N) */
673 /* > If JOBVR = 'V', the right generalized eigenvectors v(j) are */
674 /* > stored one after another in the columns of VR, in the same */
675 /* > order as their eigenvalues. */
676 /* > Each eigenvector is scaled so the largest component has */
677 /* > abs(real part) + abs(imag. part) = 1. */
678 /* > Not referenced if JOBVR = 'N'. */
681 /* > \param[in] LDVR */
683 /* > LDVR is INTEGER */
684 /* > The leading dimension of the matrix VR. LDVR >= 1, and */
685 /* > if JOBVR = 'V', LDVR >= N. */
688 /* > \param[out] WORK */
690 /* > WORK is COMPLEX array, dimension (MAX(1,LWORK)) */
691 /* > On exit, if INFO = 0, WORK(1) returns the optimal LWORK. */
694 /* > \param[in] LWORK */
696 /* > LWORK is INTEGER */
697 /* > The dimension of the array WORK. LWORK >= f2cmax(1,2*N). */
698 /* > For good performance, LWORK must generally be larger. */
700 /* > If LWORK = -1, then a workspace query is assumed; the routine */
701 /* > only calculates the optimal size of the WORK array, returns */
702 /* > this value as the first entry of the WORK array, and no error */
703 /* > message related to LWORK is issued by XERBLA. */
706 /* > \param[out] RWORK */
708 /* > RWORK is REAL array, dimension (8*N) */
711 /* > \param[out] INFO */
713 /* > INFO is INTEGER */
714 /* > = 0: successful exit */
715 /* > < 0: if INFO = -i, the i-th argument had an illegal value. */
717 /* > The QZ iteration failed. No eigenvectors have been */
718 /* > calculated, but ALPHA(j) and BETA(j) should be */
719 /* > correct for j=INFO+1,...,N. */
720 /* > > N: =N+1: other then QZ iteration failed in SHGEQZ, */
721 /* > =N+2: error return from STGEVC. */
727 /* > \author Univ. of Tennessee */
728 /* > \author Univ. of California Berkeley */
729 /* > \author Univ. of Colorado Denver */
730 /* > \author NAG Ltd. */
732 /* > \date April 2012 */
734 /* > \ingroup complexGEeigen */
736 /* ===================================================================== */
737 /* Subroutine */ int cggev_(char *jobvl, char *jobvr, integer *n, complex *a,
738 integer *lda, complex *b, integer *ldb, complex *alpha, complex *beta,
739 complex *vl, integer *ldvl, complex *vr, integer *ldvr, complex *
740 work, integer *lwork, real *rwork, integer *info)
742 /* System generated locals */
743 integer a_dim1, a_offset, b_dim1, b_offset, vl_dim1, vl_offset, vr_dim1,
744 vr_offset, i__1, i__2, i__3, i__4;
745 real r__1, r__2, r__3, r__4;
748 /* Local variables */
754 extern logical lsame_(char *, char *);
755 integer ileft, icols, irwrk, irows, jc;
756 extern /* Subroutine */ int cggbak_(char *, char *, integer *, integer *,
757 integer *, real *, real *, integer *, complex *, integer *,
758 integer *), cggbal_(char *, integer *, complex *,
759 integer *, complex *, integer *, integer *, integer *, real *,
760 real *, real *, integer *), slabad_(real *, real *);
762 extern real clange_(char *, integer *, integer *, complex *, integer *,
765 extern /* Subroutine */ int cgghrd_(char *, char *, integer *, integer *,
766 integer *, complex *, integer *, complex *, integer *, complex *,
767 integer *, complex *, integer *, integer *),
768 clascl_(char *, integer *, integer *, real *, real *, integer *,
769 integer *, complex *, integer *, integer *);
770 logical ilascl, ilbscl;
771 extern /* Subroutine */ int cgeqrf_(integer *, integer *, complex *,
772 integer *, complex *, complex *, integer *, integer *), clacpy_(
773 char *, integer *, integer *, complex *, integer *, complex *,
774 integer *), claset_(char *, integer *, integer *, complex
775 *, complex *, complex *, integer *), ctgevc_(char *, char
776 *, logical *, integer *, complex *, integer *, complex *, integer
777 *, complex *, integer *, complex *, integer *, integer *, integer
778 *, complex *, real *, integer *), xerbla_(char *,
783 extern /* Subroutine */ int chgeqz_(char *, char *, char *, integer *,
784 integer *, integer *, complex *, integer *, complex *, integer *,
785 complex *, complex *, complex *, integer *, complex *, integer *,
786 complex *, integer *, real *, integer *);
787 extern integer ilaenv_(integer *, char *, char *, integer *, integer *,
788 integer *, integer *, ftnlen, ftnlen);
789 extern real slamch_(char *);
790 integer ijobvl, iright, ijobvr;
791 extern /* Subroutine */ int cungqr_(integer *, integer *, integer *,
792 complex *, integer *, complex *, complex *, integer *, integer *);
796 extern /* Subroutine */ int cunmqr_(char *, char *, integer *, integer *,
797 integer *, complex *, integer *, complex *, complex *, integer *,
798 complex *, integer *, integer *);
807 /* -- LAPACK driver routine (version 3.7.0) -- */
808 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
809 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
813 /* ===================================================================== */
816 /* Decode the input arguments */
818 /* Parameter adjustments */
820 a_offset = 1 + a_dim1 * 1;
823 b_offset = 1 + b_dim1 * 1;
828 vl_offset = 1 + vl_dim1 * 1;
831 vr_offset = 1 + vr_dim1 * 1;
837 if (lsame_(jobvl, "N")) {
840 } else if (lsame_(jobvl, "V")) {
848 if (lsame_(jobvr, "N")) {
851 } else if (lsame_(jobvr, "V")) {
860 /* Test the input arguments */
863 lquery = *lwork == -1;
866 } else if (ijobvr <= 0) {
870 } else if (*lda < f2cmax(1,*n)) {
872 } else if (*ldb < f2cmax(1,*n)) {
874 } else if (*ldvl < 1 || ilvl && *ldvl < *n) {
876 } else if (*ldvr < 1 || ilvr && *ldvr < *n) {
880 /* Compute workspace */
881 /* (Note: Comments in the code beginning "Workspace:" describe the */
882 /* minimal amount of workspace needed at that point in the code, */
883 /* as well as the preferred amount for good performance. */
884 /* NB refers to the optimal block size for the immediately */
885 /* following subroutine, as returned by ILAENV. The workspace is */
886 /* computed assuming ILO = 1 and IHI = N, the worst case.) */
890 i__1 = 1, i__2 = *n << 1;
891 lwkmin = f2cmax(i__1,i__2);
893 i__1 = 1, i__2 = *n + *n * ilaenv_(&c__1, "CGEQRF", " ", n, &c__1, n,
894 &c__0, (ftnlen)6, (ftnlen)1);
895 lwkopt = f2cmax(i__1,i__2);
897 i__1 = lwkopt, i__2 = *n + *n * ilaenv_(&c__1, "CUNMQR", " ", n, &
898 c__1, n, &c__0, (ftnlen)6, (ftnlen)1);
899 lwkopt = f2cmax(i__1,i__2);
902 i__1 = lwkopt, i__2 = *n + *n * ilaenv_(&c__1, "CUNGQR", " ", n, &
903 c__1, n, &c_n1, (ftnlen)6, (ftnlen)1);
904 lwkopt = f2cmax(i__1,i__2);
906 work[1].r = (real) lwkopt, work[1].i = 0.f;
908 if (*lwork < lwkmin && ! lquery) {
915 xerbla_("CGGEV ", &i__1, (ftnlen)6);
921 /* Quick return if possible */
927 /* Get machine constants */
929 eps = slamch_("E") * slamch_("B");
930 smlnum = slamch_("S");
931 bignum = 1.f / smlnum;
932 slabad_(&smlnum, &bignum);
933 smlnum = sqrt(smlnum) / eps;
934 bignum = 1.f / smlnum;
936 /* Scale A if f2cmax element outside range [SMLNUM,BIGNUM] */
938 anrm = clange_("M", n, n, &a[a_offset], lda, &rwork[1]);
940 if (anrm > 0.f && anrm < smlnum) {
943 } else if (anrm > bignum) {
948 clascl_("G", &c__0, &c__0, &anrm, &anrmto, n, n, &a[a_offset], lda, &
952 /* Scale B if f2cmax element outside range [SMLNUM,BIGNUM] */
954 bnrm = clange_("M", n, n, &b[b_offset], ldb, &rwork[1]);
956 if (bnrm > 0.f && bnrm < smlnum) {
959 } else if (bnrm > bignum) {
964 clascl_("G", &c__0, &c__0, &bnrm, &bnrmto, n, n, &b[b_offset], ldb, &
968 /* Permute the matrices A, B to isolate eigenvalues if possible */
969 /* (Real Workspace: need 6*N) */
974 cggbal_("P", n, &a[a_offset], lda, &b[b_offset], ldb, &ilo, &ihi, &rwork[
975 ileft], &rwork[iright], &rwork[irwrk], &ierr);
977 /* Reduce B to triangular form (QR decomposition of B) */
978 /* (Complex Workspace: need N, prefer N*NB) */
980 irows = ihi + 1 - ilo;
982 icols = *n + 1 - ilo;
988 i__1 = *lwork + 1 - iwrk;
989 cgeqrf_(&irows, &icols, &b[ilo + ilo * b_dim1], ldb, &work[itau], &work[
990 iwrk], &i__1, &ierr);
992 /* Apply the orthogonal transformation to matrix A */
993 /* (Complex Workspace: need N, prefer N*NB) */
995 i__1 = *lwork + 1 - iwrk;
996 cunmqr_("L", "C", &irows, &icols, &irows, &b[ilo + ilo * b_dim1], ldb, &
997 work[itau], &a[ilo + ilo * a_dim1], lda, &work[iwrk], &i__1, &
1001 /* (Complex Workspace: need N, prefer N*NB) */
1004 claset_("Full", n, n, &c_b1, &c_b2, &vl[vl_offset], ldvl);
1008 clacpy_("L", &i__1, &i__2, &b[ilo + 1 + ilo * b_dim1], ldb, &vl[
1009 ilo + 1 + ilo * vl_dim1], ldvl);
1011 i__1 = *lwork + 1 - iwrk;
1012 cungqr_(&irows, &irows, &irows, &vl[ilo + ilo * vl_dim1], ldvl, &work[
1013 itau], &work[iwrk], &i__1, &ierr);
1019 claset_("Full", n, n, &c_b1, &c_b2, &vr[vr_offset], ldvr);
1022 /* Reduce to generalized Hessenberg form */
1026 /* Eigenvectors requested -- work on whole matrix. */
1028 cgghrd_(jobvl, jobvr, n, &ilo, &ihi, &a[a_offset], lda, &b[b_offset],
1029 ldb, &vl[vl_offset], ldvl, &vr[vr_offset], ldvr, &ierr);
1031 cgghrd_("N", "N", &irows, &c__1, &irows, &a[ilo + ilo * a_dim1], lda,
1032 &b[ilo + ilo * b_dim1], ldb, &vl[vl_offset], ldvl, &vr[
1033 vr_offset], ldvr, &ierr);
1036 /* Perform QZ algorithm (Compute eigenvalues, and optionally, the */
1037 /* Schur form and Schur vectors) */
1038 /* (Complex Workspace: need N) */
1039 /* (Real Workspace: need N) */
1043 *(unsigned char *)chtemp = 'S';
1045 *(unsigned char *)chtemp = 'E';
1047 i__1 = *lwork + 1 - iwrk;
1048 chgeqz_(chtemp, jobvl, jobvr, n, &ilo, &ihi, &a[a_offset], lda, &b[
1049 b_offset], ldb, &alpha[1], &beta[1], &vl[vl_offset], ldvl, &vr[
1050 vr_offset], ldvr, &work[iwrk], &i__1, &rwork[irwrk], &ierr);
1052 if (ierr > 0 && ierr <= *n) {
1054 } else if (ierr > *n && ierr <= *n << 1) {
1062 /* Compute Eigenvectors */
1063 /* (Real Workspace: need 2*N) */
1064 /* (Complex Workspace: need 2*N) */
1069 *(unsigned char *)chtemp = 'B';
1071 *(unsigned char *)chtemp = 'L';
1074 *(unsigned char *)chtemp = 'R';
1077 ctgevc_(chtemp, "B", ldumma, n, &a[a_offset], lda, &b[b_offset], ldb,
1078 &vl[vl_offset], ldvl, &vr[vr_offset], ldvr, n, &in, &work[
1079 iwrk], &rwork[irwrk], &ierr);
1085 /* Undo balancing on VL and VR and normalization */
1086 /* (Workspace: none needed) */
1089 cggbak_("P", "L", n, &ilo, &ihi, &rwork[ileft], &rwork[iright], n,
1090 &vl[vl_offset], ldvl, &ierr);
1092 for (jc = 1; jc <= i__1; ++jc) {
1095 for (jr = 1; jr <= i__2; ++jr) {
1097 i__3 = jr + jc * vl_dim1;
1098 r__3 = temp, r__4 = (r__1 = vl[i__3].r, abs(r__1)) + (
1099 r__2 = r_imag(&vl[jr + jc * vl_dim1]), abs(r__2));
1100 temp = f2cmax(r__3,r__4);
1103 if (temp < smlnum) {
1108 for (jr = 1; jr <= i__2; ++jr) {
1109 i__3 = jr + jc * vl_dim1;
1110 i__4 = jr + jc * vl_dim1;
1111 q__1.r = temp * vl[i__4].r, q__1.i = temp * vl[i__4].i;
1112 vl[i__3].r = q__1.r, vl[i__3].i = q__1.i;
1120 cggbak_("P", "R", n, &ilo, &ihi, &rwork[ileft], &rwork[iright], n,
1121 &vr[vr_offset], ldvr, &ierr);
1123 for (jc = 1; jc <= i__1; ++jc) {
1126 for (jr = 1; jr <= i__2; ++jr) {
1128 i__3 = jr + jc * vr_dim1;
1129 r__3 = temp, r__4 = (r__1 = vr[i__3].r, abs(r__1)) + (
1130 r__2 = r_imag(&vr[jr + jc * vr_dim1]), abs(r__2));
1131 temp = f2cmax(r__3,r__4);
1134 if (temp < smlnum) {
1139 for (jr = 1; jr <= i__2; ++jr) {
1140 i__3 = jr + jc * vr_dim1;
1141 i__4 = jr + jc * vr_dim1;
1142 q__1.r = temp * vr[i__4].r, q__1.i = temp * vr[i__4].i;
1143 vr[i__3].r = q__1.r, vr[i__3].i = q__1.i;
1152 /* Undo scaling if necessary */
1157 clascl_("G", &c__0, &c__0, &anrmto, &anrm, n, &c__1, &alpha[1], n, &
1162 clascl_("G", &c__0, &c__0, &bnrmto, &bnrm, n, &c__1, &beta[1], n, &
1166 work[1].r = (real) lwkopt, work[1].i = 0.f;