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_n1 = -1;
519 static real c_b29 = 1.f;
521 /* > \brief <b> CGEEVX computes the eigenvalues and, optionally, the left and/or right eigenvectors for GE mat
524 /* =========== DOCUMENTATION =========== */
526 /* Online html documentation available at */
527 /* http://www.netlib.org/lapack/explore-html/ */
530 /* > Download CGEGV + dependencies */
531 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/cgegv.f
534 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/cgegv.f
537 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/cgegv.f
545 /* SUBROUTINE CGEGV( 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 /* > This routine is deprecated and has been replaced by routine CGGEV. */
563 /* > CGEGV computes the eigenvalues and, optionally, the left and/or right */
564 /* > eigenvectors of a complex matrix pair (A,B). */
565 /* > Given two square matrices A and B, */
566 /* > the generalized nonsymmetric eigenvalue problem (GNEP) is to find the */
567 /* > eigenvalues lambda and corresponding (non-zero) eigenvectors x such */
569 /* > A*x = lambda*B*x. */
571 /* > An alternate form is to find the eigenvalues mu and corresponding */
572 /* > eigenvectors y such that */
573 /* > mu*A*y = B*y. */
575 /* > These two forms are equivalent with mu = 1/lambda and x = y if */
576 /* > neither lambda nor mu is zero. In order to deal with the case that */
577 /* > lambda or mu is zero or small, two values alpha and beta are returned */
578 /* > for each eigenvalue, such that lambda = alpha/beta and */
579 /* > mu = beta/alpha. */
581 /* > The vectors x and y in the above equations are right eigenvectors of */
582 /* > the matrix pair (A,B). Vectors u and v satisfying */
583 /* > u**H*A = lambda*u**H*B or mu*v**H*A = v**H*B */
584 /* > are left eigenvectors of (A,B). */
586 /* > Note: this routine performs "full balancing" on A and B */
592 /* > \param[in] JOBVL */
594 /* > JOBVL is CHARACTER*1 */
595 /* > = 'N': do not compute the left generalized eigenvectors; */
596 /* > = 'V': compute the left generalized eigenvectors (returned */
600 /* > \param[in] JOBVR */
602 /* > JOBVR is CHARACTER*1 */
603 /* > = 'N': do not compute the right generalized eigenvectors; */
604 /* > = 'V': compute the right generalized eigenvectors (returned */
611 /* > The order of the matrices A, B, VL, and VR. N >= 0. */
614 /* > \param[in,out] A */
616 /* > A is COMPLEX array, dimension (LDA, N) */
617 /* > On entry, the matrix A. */
618 /* > If JOBVL = 'V' or JOBVR = 'V', then on exit A */
619 /* > contains the Schur form of A from the generalized Schur */
620 /* > factorization of the pair (A,B) after balancing. If no */
621 /* > eigenvectors were computed, then only the diagonal elements */
622 /* > of the Schur form will be correct. See CGGHRD and CHGEQZ */
626 /* > \param[in] LDA */
628 /* > LDA is INTEGER */
629 /* > The leading dimension of A. LDA >= f2cmax(1,N). */
632 /* > \param[in,out] B */
634 /* > B is COMPLEX array, dimension (LDB, N) */
635 /* > On entry, the matrix B. */
636 /* > If JOBVL = 'V' or JOBVR = 'V', then on exit B contains the */
637 /* > upper triangular matrix obtained from B in the generalized */
638 /* > Schur factorization of the pair (A,B) after balancing. */
639 /* > If no eigenvectors were computed, then only the diagonal */
640 /* > elements of B will be correct. See CGGHRD and CHGEQZ for */
644 /* > \param[in] LDB */
646 /* > LDB is INTEGER */
647 /* > The leading dimension of B. LDB >= f2cmax(1,N). */
650 /* > \param[out] ALPHA */
652 /* > ALPHA is COMPLEX array, dimension (N) */
653 /* > The complex scalars alpha that define the eigenvalues of */
657 /* > \param[out] BETA */
659 /* > BETA is COMPLEX array, dimension (N) */
660 /* > The complex scalars beta that define the eigenvalues of GNEP. */
662 /* > Together, the quantities alpha = ALPHA(j) and beta = BETA(j) */
663 /* > represent the j-th eigenvalue of the matrix pair (A,B), in */
664 /* > one of the forms lambda = alpha/beta or mu = beta/alpha. */
665 /* > Since either lambda or mu may overflow, they should not, */
666 /* > in general, be computed. */
669 /* > \param[out] VL */
671 /* > VL is COMPLEX array, dimension (LDVL,N) */
672 /* > If JOBVL = 'V', the left eigenvectors u(j) are stored */
673 /* > in the columns of VL, in the same order as their eigenvalues. */
674 /* > Each eigenvector is scaled so that its largest component has */
675 /* > abs(real part) + abs(imag. part) = 1, except for eigenvectors */
676 /* > corresponding to an eigenvalue with alpha = beta = 0, which */
677 /* > are set to zero. */
678 /* > Not referenced if JOBVL = 'N'. */
681 /* > \param[in] LDVL */
683 /* > LDVL is INTEGER */
684 /* > The leading dimension of the matrix VL. LDVL >= 1, and */
685 /* > if JOBVL = 'V', LDVL >= N. */
688 /* > \param[out] VR */
690 /* > VR is COMPLEX array, dimension (LDVR,N) */
691 /* > If JOBVR = 'V', the right eigenvectors x(j) are stored */
692 /* > in the columns of VR, in the same order as their eigenvalues. */
693 /* > Each eigenvector is scaled so that its largest component has */
694 /* > abs(real part) + abs(imag. part) = 1, except for eigenvectors */
695 /* > corresponding to an eigenvalue with alpha = beta = 0, which */
696 /* > are set to zero. */
697 /* > Not referenced if JOBVR = 'N'. */
700 /* > \param[in] LDVR */
702 /* > LDVR is INTEGER */
703 /* > The leading dimension of the matrix VR. LDVR >= 1, and */
704 /* > if JOBVR = 'V', LDVR >= N. */
707 /* > \param[out] WORK */
709 /* > WORK is COMPLEX array, dimension (MAX(1,LWORK)) */
710 /* > On exit, if INFO = 0, WORK(1) returns the optimal LWORK. */
713 /* > \param[in] LWORK */
715 /* > LWORK is INTEGER */
716 /* > The dimension of the array WORK. LWORK >= f2cmax(1,2*N). */
717 /* > For good performance, LWORK must generally be larger. */
718 /* > To compute the optimal value of LWORK, call ILAENV to get */
719 /* > blocksizes (for CGEQRF, CUNMQR, and CUNGQR.) Then compute: */
720 /* > NB -- MAX of the blocksizes for CGEQRF, CUNMQR, and CUNGQR; */
721 /* > The optimal LWORK is MAX( 2*N, N*(NB+1) ). */
723 /* > If LWORK = -1, then a workspace query is assumed; the routine */
724 /* > only calculates the optimal size of the WORK array, returns */
725 /* > this value as the first entry of the WORK array, and no error */
726 /* > message related to LWORK is issued by XERBLA. */
729 /* > \param[out] RWORK */
731 /* > RWORK is REAL array, dimension (8*N) */
734 /* > \param[out] INFO */
736 /* > INFO is INTEGER */
737 /* > = 0: successful exit */
738 /* > < 0: if INFO = -i, the i-th argument had an illegal value. */
740 /* > The QZ iteration failed. No eigenvectors have been */
741 /* > calculated, but ALPHA(j) and BETA(j) should be */
742 /* > correct for j=INFO+1,...,N. */
743 /* > > N: errors that usually indicate LAPACK problems: */
744 /* > =N+1: error return from CGGBAL */
745 /* > =N+2: error return from CGEQRF */
746 /* > =N+3: error return from CUNMQR */
747 /* > =N+4: error return from CUNGQR */
748 /* > =N+5: error return from CGGHRD */
749 /* > =N+6: error return from CHGEQZ (other than failed */
751 /* > =N+7: error return from CTGEVC */
752 /* > =N+8: error return from CGGBAK (computing VL) */
753 /* > =N+9: error return from CGGBAK (computing VR) */
754 /* > =N+10: error return from CLASCL (various calls) */
760 /* > \author Univ. of Tennessee */
761 /* > \author Univ. of California Berkeley */
762 /* > \author Univ. of Colorado Denver */
763 /* > \author NAG Ltd. */
765 /* > \date December 2016 */
767 /* > \ingroup complexGEeigen */
769 /* > \par Further Details: */
770 /* ===================== */
777 /* > This driver calls CGGBAL to both permute and scale rows and columns */
778 /* > of A and B. The permutations PL and PR are chosen so that PL*A*PR */
779 /* > and PL*B*R will be upper triangular except for the diagonal blocks */
780 /* > A(i:j,i:j) and B(i:j,i:j), with i and j as close together as */
781 /* > possible. The diagonal scaling matrices DL and DR are chosen so */
782 /* > that the pair DL*PL*A*PR*DR, DL*PL*B*PR*DR have elements close to */
783 /* > one (except for the elements that start out zero.) */
785 /* > After the eigenvalues and eigenvectors of the balanced matrices */
786 /* > have been computed, CGGBAK transforms the eigenvectors back to what */
787 /* > they would have been (in perfect arithmetic) if they had not been */
790 /* > Contents of A and B on Exit */
791 /* > -------- -- - --- - -- ---- */
793 /* > If any eigenvectors are computed (either JOBVL='V' or JOBVR='V' or */
794 /* > both), then on exit the arrays A and B will contain the complex Schur */
795 /* > form[*] of the "balanced" versions of A and B. If no eigenvectors */
796 /* > are computed, then only the diagonal blocks will be correct. */
798 /* > [*] In other words, upper triangular form. */
801 /* ===================================================================== */
802 /* Subroutine */ int cgegv_(char *jobvl, char *jobvr, integer *n, complex *a,
803 integer *lda, complex *b, integer *ldb, complex *alpha, complex *beta,
804 complex *vl, integer *ldvl, complex *vr, integer *ldvr, complex *
805 work, integer *lwork, real *rwork, integer *info)
807 /* System generated locals */
808 integer a_dim1, a_offset, b_dim1, b_offset, vl_dim1, vl_offset, vr_dim1,
809 vr_offset, i__1, i__2, i__3, i__4;
810 real r__1, r__2, r__3, r__4;
813 /* Local variables */
814 real absb, anrm, bnrm;
819 real anrm1, anrm2, bnrm1, bnrm2, absai, scale, absar, sbeta;
820 extern logical lsame_(char *, char *);
821 integer ileft, iinfo, icols, iwork, irows, jc;
822 extern /* Subroutine */ int cggbak_(char *, char *, integer *, integer *,
823 integer *, real *, real *, integer *, complex *, integer *,
824 integer *), cggbal_(char *, integer *, complex *,
825 integer *, complex *, integer *, integer *, integer *, real *,
826 real *, real *, integer *);
828 extern real clange_(char *, integer *, integer *, complex *, integer *,
831 extern /* Subroutine */ int cgghrd_(char *, char *, integer *, integer *,
832 integer *, complex *, integer *, complex *, integer *, complex *,
833 integer *, complex *, integer *, integer *);
835 extern /* Subroutine */ int clascl_(char *, integer *, integer *, real *,
836 real *, integer *, integer *, complex *, integer *, integer *), cgeqrf_(integer *, integer *, complex *, integer *,
837 complex *, complex *, integer *, integer *);
839 extern real slamch_(char *);
840 extern /* Subroutine */ int clacpy_(char *, integer *, integer *, complex
841 *, integer *, complex *, integer *), claset_(char *,
842 integer *, integer *, complex *, complex *, complex *, integer *);
844 extern /* Subroutine */ int ctgevc_(char *, char *, logical *, integer *,
845 complex *, integer *, complex *, integer *, complex *, integer *,
846 complex *, integer *, integer *, integer *, complex *, real *,
851 extern /* Subroutine */ int chgeqz_(char *, char *, char *, integer *,
852 integer *, integer *, complex *, integer *, complex *, integer *,
853 complex *, complex *, complex *, integer *, complex *, integer *,
854 complex *, integer *, real *, integer *),
855 xerbla_(char *, integer *);
856 extern integer ilaenv_(integer *, char *, char *, integer *, integer *,
857 integer *, integer *, ftnlen, ftnlen);
858 integer ijobvl, iright;
861 extern /* Subroutine */ int cungqr_(integer *, integer *, integer *,
862 complex *, integer *, complex *, complex *, integer *, integer *);
863 integer lwkmin, nb1, nb2, nb3;
864 extern /* Subroutine */ int cunmqr_(char *, char *, integer *, integer *,
865 integer *, complex *, integer *, complex *, complex *, integer *,
866 complex *, integer *, integer *);
867 integer irwork, lwkopt;
874 /* -- LAPACK driver routine (version 3.7.0) -- */
875 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
876 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
880 /* ===================================================================== */
883 /* Decode the input arguments */
885 /* Parameter adjustments */
887 a_offset = 1 + a_dim1 * 1;
890 b_offset = 1 + b_dim1 * 1;
895 vl_offset = 1 + vl_dim1 * 1;
898 vr_offset = 1 + vr_dim1 * 1;
904 if (lsame_(jobvl, "N")) {
907 } else if (lsame_(jobvl, "V")) {
915 if (lsame_(jobvr, "N")) {
918 } else if (lsame_(jobvr, "V")) {
927 /* Test the input arguments */
931 lwkmin = f2cmax(i__1,1);
933 work[1].r = (real) lwkopt, work[1].i = 0.f;
934 lquery = *lwork == -1;
938 } else if (ijobvr <= 0) {
942 } else if (*lda < f2cmax(1,*n)) {
944 } else if (*ldb < f2cmax(1,*n)) {
946 } else if (*ldvl < 1 || ilvl && *ldvl < *n) {
948 } else if (*ldvr < 1 || ilvr && *ldvr < *n) {
950 } else if (*lwork < lwkmin && ! lquery) {
955 nb1 = ilaenv_(&c__1, "CGEQRF", " ", n, n, &c_n1, &c_n1, (ftnlen)6, (
957 nb2 = ilaenv_(&c__1, "CUNMQR", " ", n, n, n, &c_n1, (ftnlen)6, (
959 nb3 = ilaenv_(&c__1, "CUNGQR", " ", n, n, n, &c_n1, (ftnlen)6, (
962 i__1 = f2cmax(nb1,nb2);
963 nb = f2cmax(i__1,nb3);
965 i__1 = *n << 1, i__2 = *n * (nb + 1);
966 lopt = f2cmax(i__1,i__2);
967 work[1].r = (real) lopt, work[1].i = 0.f;
972 xerbla_("CGEGV ", &i__1);
978 /* Quick return if possible */
984 /* Get machine constants */
986 eps = slamch_("E") * slamch_("B");
987 safmin = slamch_("S");
989 safmax = 1.f / safmin;
993 anrm = clange_("M", n, n, &a[a_offset], lda, &rwork[1]);
997 if (safmax * anrm < 1.f) {
999 anrm2 = safmax * anrm;
1004 clascl_("G", &c_n1, &c_n1, &anrm, &c_b29, n, n, &a[a_offset], lda, &
1014 bnrm = clange_("M", n, n, &b[b_offset], ldb, &rwork[1]);
1018 if (safmax * bnrm < 1.f) {
1020 bnrm2 = safmax * bnrm;
1025 clascl_("G", &c_n1, &c_n1, &bnrm, &c_b29, n, n, &b[b_offset], ldb, &
1033 /* Permute the matrix to make it more nearly triangular */
1034 /* Also "balance" the matrix. */
1038 irwork = iright + *n;
1039 cggbal_("P", n, &a[a_offset], lda, &b[b_offset], ldb, &ilo, &ihi, &rwork[
1040 ileft], &rwork[iright], &rwork[irwork], &iinfo);
1046 /* Reduce B to triangular form, and initialize VL and/or VR */
1048 irows = ihi + 1 - ilo;
1050 icols = *n + 1 - ilo;
1055 iwork = itau + irows;
1056 i__1 = *lwork + 1 - iwork;
1057 cgeqrf_(&irows, &icols, &b[ilo + ilo * b_dim1], ldb, &work[itau], &work[
1058 iwork], &i__1, &iinfo);
1062 i__1 = lwkopt, i__2 = (integer) work[i__3].r + iwork - 1;
1063 lwkopt = f2cmax(i__1,i__2);
1070 i__1 = *lwork + 1 - iwork;
1071 cunmqr_("L", "C", &irows, &icols, &irows, &b[ilo + ilo * b_dim1], ldb, &
1072 work[itau], &a[ilo + ilo * a_dim1], lda, &work[iwork], &i__1, &
1077 i__1 = lwkopt, i__2 = (integer) work[i__3].r + iwork - 1;
1078 lwkopt = f2cmax(i__1,i__2);
1086 claset_("Full", n, n, &c_b1, &c_b2, &vl[vl_offset], ldvl);
1089 clacpy_("L", &i__1, &i__2, &b[ilo + 1 + ilo * b_dim1], ldb, &vl[ilo +
1090 1 + ilo * vl_dim1], ldvl);
1091 i__1 = *lwork + 1 - iwork;
1092 cungqr_(&irows, &irows, &irows, &vl[ilo + ilo * vl_dim1], ldvl, &work[
1093 itau], &work[iwork], &i__1, &iinfo);
1097 i__1 = lwkopt, i__2 = (integer) work[i__3].r + iwork - 1;
1098 lwkopt = f2cmax(i__1,i__2);
1107 claset_("Full", n, n, &c_b1, &c_b2, &vr[vr_offset], ldvr);
1110 /* Reduce to generalized Hessenberg form */
1114 /* Eigenvectors requested -- work on whole matrix. */
1116 cgghrd_(jobvl, jobvr, n, &ilo, &ihi, &a[a_offset], lda, &b[b_offset],
1117 ldb, &vl[vl_offset], ldvl, &vr[vr_offset], ldvr, &iinfo);
1119 cgghrd_("N", "N", &irows, &c__1, &irows, &a[ilo + ilo * a_dim1], lda,
1120 &b[ilo + ilo * b_dim1], ldb, &vl[vl_offset], ldvl, &vr[
1121 vr_offset], ldvr, &iinfo);
1128 /* Perform QZ algorithm */
1132 *(unsigned char *)chtemp = 'S';
1134 *(unsigned char *)chtemp = 'E';
1136 i__1 = *lwork + 1 - iwork;
1137 chgeqz_(chtemp, jobvl, jobvr, n, &ilo, &ihi, &a[a_offset], lda, &b[
1138 b_offset], ldb, &alpha[1], &beta[1], &vl[vl_offset], ldvl, &vr[
1139 vr_offset], ldvr, &work[iwork], &i__1, &rwork[irwork], &iinfo);
1143 i__1 = lwkopt, i__2 = (integer) work[i__3].r + iwork - 1;
1144 lwkopt = f2cmax(i__1,i__2);
1147 if (iinfo > 0 && iinfo <= *n) {
1149 } else if (iinfo > *n && iinfo <= *n << 1) {
1159 /* Compute Eigenvectors */
1163 *(unsigned char *)chtemp = 'B';
1165 *(unsigned char *)chtemp = 'L';
1168 *(unsigned char *)chtemp = 'R';
1171 ctgevc_(chtemp, "B", ldumma, n, &a[a_offset], lda, &b[b_offset], ldb,
1172 &vl[vl_offset], ldvl, &vr[vr_offset], ldvr, n, &in, &work[
1173 iwork], &rwork[irwork], &iinfo);
1179 /* Undo balancing on VL and VR, rescale */
1182 cggbak_("P", "L", n, &ilo, &ihi, &rwork[ileft], &rwork[iright], n,
1183 &vl[vl_offset], ldvl, &iinfo);
1189 for (jc = 1; jc <= i__1; ++jc) {
1192 for (jr = 1; jr <= i__2; ++jr) {
1194 i__3 = jr + jc * vl_dim1;
1195 r__3 = temp, r__4 = (r__1 = vl[i__3].r, abs(r__1)) + (
1196 r__2 = r_imag(&vl[jr + jc * vl_dim1]), abs(r__2));
1197 temp = f2cmax(r__3,r__4);
1200 if (temp < safmin) {
1205 for (jr = 1; jr <= i__2; ++jr) {
1206 i__3 = jr + jc * vl_dim1;
1207 i__4 = jr + jc * vl_dim1;
1208 q__1.r = temp * vl[i__4].r, q__1.i = temp * vl[i__4].i;
1209 vl[i__3].r = q__1.r, vl[i__3].i = q__1.i;
1217 cggbak_("P", "R", n, &ilo, &ihi, &rwork[ileft], &rwork[iright], n,
1218 &vr[vr_offset], ldvr, &iinfo);
1224 for (jc = 1; jc <= i__1; ++jc) {
1227 for (jr = 1; jr <= i__2; ++jr) {
1229 i__3 = jr + jc * vr_dim1;
1230 r__3 = temp, r__4 = (r__1 = vr[i__3].r, abs(r__1)) + (
1231 r__2 = r_imag(&vr[jr + jc * vr_dim1]), abs(r__2));
1232 temp = f2cmax(r__3,r__4);
1235 if (temp < safmin) {
1240 for (jr = 1; jr <= i__2; ++jr) {
1241 i__3 = jr + jc * vr_dim1;
1242 i__4 = jr + jc * vr_dim1;
1243 q__1.r = temp * vr[i__4].r, q__1.i = temp * vr[i__4].i;
1244 vr[i__3].r = q__1.r, vr[i__3].i = q__1.i;
1252 /* End of eigenvector calculation */
1256 /* Undo scaling in alpha, beta */
1258 /* Note: this does not give the alpha and beta for the unscaled */
1261 /* Un-scaling is limited to avoid underflow in alpha and beta */
1262 /* if they are significant. */
1265 for (jc = 1; jc <= i__1; ++jc) {
1267 absar = (r__1 = alpha[i__2].r, abs(r__1));
1268 absai = (r__1 = r_imag(&alpha[jc]), abs(r__1));
1270 absb = (r__1 = beta[i__2].r, abs(r__1));
1272 salfar = anrm * alpha[i__2].r;
1273 salfai = anrm * r_imag(&alpha[jc]);
1275 sbeta = bnrm * beta[i__2].r;
1279 /* Check for significant underflow in imaginary part of ALPHA */
1282 r__1 = safmin, r__2 = eps * absar, r__1 = f2cmax(r__1,r__2), r__2 = eps *
1284 if (abs(salfai) < safmin && absai >= f2cmax(r__1,r__2)) {
1287 r__1 = safmin, r__2 = anrm2 * absai;
1288 scale = safmin / anrm1 / f2cmax(r__1,r__2);
1291 /* Check for significant underflow in real part of ALPHA */
1294 r__1 = safmin, r__2 = eps * absai, r__1 = f2cmax(r__1,r__2), r__2 = eps *
1296 if (abs(salfar) < safmin && absar >= f2cmax(r__1,r__2)) {
1300 r__3 = safmin, r__4 = anrm2 * absar;
1301 r__1 = scale, r__2 = safmin / anrm1 / f2cmax(r__3,r__4);
1302 scale = f2cmax(r__1,r__2);
1305 /* Check for significant underflow in BETA */
1308 r__1 = safmin, r__2 = eps * absar, r__1 = f2cmax(r__1,r__2), r__2 = eps *
1310 if (abs(sbeta) < safmin && absb >= f2cmax(r__1,r__2)) {
1314 r__3 = safmin, r__4 = bnrm2 * absb;
1315 r__1 = scale, r__2 = safmin / bnrm1 / f2cmax(r__3,r__4);
1316 scale = f2cmax(r__1,r__2);
1319 /* Check for possible overflow when limiting scaling */
1323 r__1 = abs(salfar), r__2 = abs(salfai), r__1 = f2cmax(r__1,r__2),
1325 temp = scale * safmin * f2cmax(r__1,r__2);
1334 /* Recompute un-scaled ALPHA, BETA if necessary. */
1338 salfar = scale * alpha[i__2].r * anrm;
1339 salfai = scale * r_imag(&alpha[jc]) * anrm;
1341 q__2.r = scale * beta[i__2].r, q__2.i = scale * beta[i__2].i;
1342 q__1.r = bnrm * q__2.r, q__1.i = bnrm * q__2.i;
1346 q__1.r = salfar, q__1.i = salfai;
1347 alpha[i__2].r = q__1.r, alpha[i__2].i = q__1.i;
1349 beta[i__2].r = sbeta, beta[i__2].i = 0.f;
1354 work[1].r = (real) lwkopt, work[1].i = 0.f;