cgeev.c

#include<math.h>
#include<stdlib.h>
#include<string.h>
#include<stdio.h>
#include<complex.h>
#ifdefcomplex
#undef complex
#endif
#ifdefI
#undef I
#endif

#if defined(_WIN64)
typedeflong longBLASLONG;
typedefunsigned long longBLASULONG;
#else
typedeflongBLASLONG;
typedefunsigned longBLASULONG;
#endif

#ifdefLAPACK_ILP64
typedefBLASLONGblasint;
#if defined(_WIN64)
#defineblasabs(x) llabs(x)
#else
#defineblasabs(x) labs(x)
#endif
#else
typedefintblasint;
#defineblasabs(x) abs(x)
#endif

typedefblasintinteger;

typedefunsigned intuinteger;
typedefchar*address;
typedefshort intshortint;
typedeffloatreal;
typedefdoubledoublereal;
typedefstruct { realr, i; } complex;
typedefstruct { doublerealr, i; } doublecomplex;
#ifdef_MSC_VER
staticinline_FcomplexCf(complex*z) {_Fcomplexzz={z->r , z->i}; returnzz;}
staticinline_DcomplexCd(doublecomplex*z) {_Dcomplexzz={z->r , z->i};returnzz;}
staticinline_Fcomplex*_pCf(complex*z) {return (_Fcomplex*)z;}
staticinline_Dcomplex*_pCd(doublecomplex*z) {return (_Dcomplex*)z;}
#else
staticinline_ComplexfloatCf(complex*z) {returnz->r+z->i*_Complex_I;}
staticinline_ComplexdoubleCd(doublecomplex*z) {returnz->r+z->i*_Complex_I;}
staticinline_Complexfloat*_pCf(complex*z) {return (_Complexfloat*)z;}
staticinline_Complexdouble*_pCd(doublecomplex*z) {return (_Complexdouble*)z;}
#endif
#definepCf(z) (*_pCf(z))
#definepCd(z) (*_pCd(z))
typedefintlogical;
typedefshort intshortlogical;
typedefcharlogical1;
typedefcharinteger1;

#defineTRUE_ (1)
#defineFALSE_ (0)

/* Extern is for use with -E */
#ifndefExtern
#defineExtern extern
#endif

/* I/O stuff */

typedefintflag;
typedefintftnlen;
typedefintftnint;

/*external read, write*/
typedefstruct
{ flagcierr;
ftnintciunit;
flagciend;
char*cifmt;
ftnintcirec;
} cilist;

/*internal read, write*/
typedefstruct
{ flagicierr;
char*iciunit;
flagiciend;
char*icifmt;
ftninticirlen;
ftninticirnum;
} icilist;

/*open*/
typedefstruct
{ flagoerr;
ftnintounit;
char*ofnm;
ftnlenofnmlen;
char*osta;
char*oacc;
char*ofm;
ftnintorl;
char*oblnk;
} olist;

/*close*/
typedefstruct
{ flagcerr;
ftnintcunit;
char*csta;
} cllist;

/*rewind, backspace, endfile*/
typedefstruct
{ flagaerr;
ftnintaunit;
} alist;

/* inquire */
typedefstruct
{ flaginerr;
ftnintinunit;
char*infile;
ftnleninfilen;
ftnint*inex; /*parameters in standard's order*/
ftnint*inopen;
ftnint*innum;
ftnint*innamed;
char*inname;
ftnleninnamlen;
char*inacc;
ftnleninacclen;
char*inseq;
ftnleninseqlen;
char*indir;
ftnlenindirlen;
char*infmt;
ftnleninfmtlen;
char*inform;
ftnintinformlen;
char*inunf;
ftnleninunflen;
ftnint*inrecl;
ftnint*innrec;
char*inblank;
ftnleninblanklen;
} inlist;

#defineVOID void

unionMultitype { /* for multiple entry points */
integer1g;
shortinth;
integeri;
/* longint j; */
realr;
doublereald;
complexc;
doublecomplexz;
 };

typedefunionMultitypeMultitype;

structVardesc { /* for Namelist */
char*name;
char*addr;
ftnlen*dims;
inttype;
 };
typedefstructVardescVardesc;

structNamelist {
char*name;
Vardesc**vars;
intnvars;
 };
typedefstructNamelistNamelist;

#defineabs(x) ((x) >= 0 ? (x) : -(x))
#definedabs(x) (fabs(x))
#definef2cmin(a,b) ((a) <= (b) ? (a) : (b))
#definef2cmax(a,b) ((a) >= (b) ? (a) : (b))
#definedmin(a,b) (f2cmin(a,b))
#definedmax(a,b) (f2cmax(a,b))
#definebit_test(a,b) ((a) >> (b) & 1)
#definebit_clear(a,b) ((a) & ~((uinteger)1 << (b)))
#definebit_set(a,b) ((a) | ((uinteger)1 << (b)))

#defineabort_() { sig_die("Fortran abort routine called", 1); }
#definec_abs(z) (cabsf(Cf(z)))
#definec_cos(R,Z) { pCf(R)=ccos(Cf(Z)); }
#ifdef_MSC_VER
#definec_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]);}
#definez_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]);}
#else
#definec_div(c, a, b) {pCf(c) = Cf(a)/Cf(b);}
#definez_div(c, a, b) {pCd(c) = Cd(a)/Cd(b);}
#endif
#definec_exp(R, Z) {pCf(R) = cexpf(Cf(Z));}
#definec_log(R, Z) {pCf(R) = clogf(Cf(Z));}
#definec_sin(R, Z) {pCf(R) = csinf(Cf(Z));}
//#define c_sqrt(R, Z) {*(R) = csqrtf(Cf(Z));}
#definec_sqrt(R, Z) {pCf(R) = csqrtf(Cf(Z));}
#defined_abs(x) (fabs(*(x)))
#defined_acos(x) (acos(*(x)))
#defined_asin(x) (asin(*(x)))
#defined_atan(x) (atan(*(x)))
#defined_atn2(x, y) (atan2(*(x),*(y)))
#defined_cnjg(R, Z) { pCd(R) = conj(Cd(Z)); }
#definer_cnjg(R, Z) { pCf(R) = conjf(Cf(Z)); }
#defined_cos(x) (cos(*(x)))
#defined_cosh(x) (cosh(*(x)))
#defined_dim(__a, __b) ( *(__a) > *(__b) ? *(__a) - *(__b) : 0.0 )
#defined_exp(x) (exp(*(x)))
#defined_imag(z) (cimag(Cd(z)))
#definer_imag(z) (cimagf(Cf(z)))
#defined_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
#definer_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
#defined_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
#definer_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
#defined_log(x) (log(*(x)))
#defined_mod(x, y) (fmod(*(x), *(y)))
#defineu_nint(__x) ((__x)>=0 ? floor((__x) + .5) : -floor(.5 - (__x)))
#defined_nint(x) u_nint(*(x))
#defineu_sign(__a,__b) ((__b) >= 0 ? ((__a) >= 0 ? (__a) : -(__a)) : -((__a) >= 0 ? (__a) : -(__a)))
#defined_sign(a,b) u_sign(*(a),*(b))
#definer_sign(a,b) u_sign(*(a),*(b))
#defined_sin(x) (sin(*(x)))
#defined_sinh(x) (sinh(*(x)))
#defined_sqrt(x) (sqrt(*(x)))
#defined_tan(x) (tan(*(x)))
#defined_tanh(x) (tanh(*(x)))
#definei_abs(x) abs(*(x))
#definei_dnnt(x) ((integer)u_nint(*(x)))
#definei_len(s, n) (n)
#definei_nint(x) ((integer)u_nint(*(x)))
#definei_sign(a,b) ((integer)u_sign((integer)*(a),(integer)*(b)))
#definepow_dd(ap, bp) ( pow(*(ap), *(bp)))
#definepow_si(B,E) spow_ui(*(B),*(E))
#definepow_ri(B,E) spow_ui(*(B),*(E))
#definepow_di(B,E) dpow_ui(*(B),*(E))
#definepow_zi(p, a, b) {pCd(p) = zpow_ui(Cd(a), *(b));}
#definepow_ci(p, a, b) {pCf(p) = cpow_ui(Cf(a), *(b));}
#definepow_zz(R,A,B) {pCd(R) = cpow(Cd(A),*(B));}
#defines_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++ = ' '; }
#defines_cmp(a,b,c,d) ((integer)strncmp((a),(b),f2cmin((c),(d))))
#defines_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]; }
#definesig_die(s, kill) { exit(1); }
#defines_stop(s, n) {exit(0);}
staticcharjunk[] ="\n@(#)LIBF77 VERSION 19990503\n";
#definez_abs(z) (cabs(Cd(z)))
#definez_exp(R, Z) {pCd(R) = cexp(Cd(Z));}
#definez_sqrt(R, Z) {pCd(R) = csqrt(Cd(Z));}
#definemyexit_() break;
#definemycycle() continue;
#definemyceiling(w) {ceil(w)}
#definemyhuge(w) {HUGE_VAL}
//#define mymaxloc_(w,s,e,n) {if (sizeof(*(w)) == sizeof(double)) dmaxloc_((w),*(s),*(e),n); else dmaxloc_((w),*(s),*(e),n);}
#definemymaxloc(w,s,e,n) {dmaxloc_(w,*(s),*(e),n)}

/* procedure parameter types for -A and -C++ */

#defineF2C_proc_par_types 1
#ifdef__cplusplus
typedeflogical (*L_fp)(...);
#else
typedeflogical (*L_fp)();
#endif

staticfloatspow_ui(floatx, integern) {
floatpow=1.0; unsigned long intu;
if(n!=0) {
if(n<0) n=-n, x=1/x;
for(u=n; ; ) {
if(u&01) pow *= x;
if(u >>= 1) x *= x;
elsebreak;
 }
 }
returnpow;
}
staticdoubledpow_ui(doublex, integern) {
doublepow=1.0; unsigned long intu;
if(n!=0) {
if(n<0) n=-n, x=1/x;
for(u=n; ; ) {
if(u&01) pow *= x;
if(u >>= 1) x *= x;
elsebreak;
 }
 }
returnpow;
}
#ifdef_MSC_VER
static_Fcomplexcpow_ui(complexx, integern) {
complexpow={1.0,0.0}; unsigned long intu;
if(n!=0) {
if(n<0) n=-n, x.r=1/x.r, x.i=1/x.i;
for(u=n; ; ) {
if(u&01) pow.r *= x.r, pow.i *= x.i;
if(u >>= 1) x.r *= x.r, x.i *= x.i;
elsebreak;
 }
 }
_Fcomplexp={pow.r, pow.i};
returnp;
}
#else
static_Complexfloatcpow_ui(_Complexfloatx, integern) {
_Complexfloatpow=1.0; unsigned long intu;
if(n!=0) {
if(n<0) n=-n, x=1/x;
for(u=n; ; ) {
if(u&01) pow *= x;
if(u >>= 1) x *= x;
elsebreak;
 }
 }
returnpow;
}
#endif
#ifdef_MSC_VER
static_Dcomplexzpow_ui(_Dcomplexx, integern) {
_Dcomplexpow={1.0,0.0}; unsigned long intu;
if(n!=0) {
if(n<0) n=-n, x._Val[0] =1/x._Val[0], x._Val[1] =1/x._Val[1];
for(u=n; ; ) {
if(u&01) pow._Val[0] *= x._Val[0], pow._Val[1] *= x._Val[1];
if(u >>= 1) x._Val[0] *= x._Val[0], x._Val[1] *= x._Val[1];
elsebreak;
 }
 }
_Dcomplexp= {pow._Val[0], pow._Val[1]};
returnp;
}
#else
static_Complexdoublezpow_ui(_Complexdoublex, integern) {
_Complexdoublepow=1.0; unsigned long intu;
if(n!=0) {
if(n<0) n=-n, x=1/x;
for(u=n; ; ) {
if(u&01) pow *= x;
if(u >>= 1) x *= x;
elsebreak;
 }
 }
returnpow;
}
#endif
staticintegerpow_ii(integerx, integern) {
integerpow; unsigned long intu;
if (n <= 0) {
if (n==0||x==1) pow=1;
elseif (x!=-1) pow=x==0 ? 1/x : 0;
elsen=-n;
 }
if ((n>0) || !(n==0||x==1||x!=-1)) {
u=n;
for(pow=1; ; ) {
if(u&01) pow *= x;
if(u >>= 1) x *= x;
elsebreak;
 }
 }
returnpow;
}
staticintegerdmaxloc_(double*w, integers, integere, integer*n)
{
doublem; integeri, mi;
for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
if (w[i-1]>m) mi=i ,m=w[i-1];
returnmi-s+1;
}
staticintegersmaxloc_(float*w, integers, integere, integer*n)
{
floatm; integeri, mi;
for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
if (w[i-1]>m) mi=i ,m=w[i-1];
returnmi-s+1;
}
staticinlinevoidcdotc_(complex*z, integer*n_, complex*x, integer*incx_, complex*y, integer*incy_) {
integern=*n_, incx=*incx_, incy=*incy_, i;
#ifdef_MSC_VER
_Fcomplexzdotc= {0.0, 0.0};
if (incx==1&&incy==1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] +=conjf(Cf(&x[i]))._Val[0] *Cf(&y[i])._Val[0];
zdotc._Val[1] +=conjf(Cf(&x[i]))._Val[1] *Cf(&y[i])._Val[1];
 }
 } else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] +=conjf(Cf(&x[i*incx]))._Val[0] *Cf(&y[i*incy])._Val[0];
zdotc._Val[1] +=conjf(Cf(&x[i*incx]))._Val[1] *Cf(&y[i*incy])._Val[1];
 }
 }
pCf(z) =zdotc;
}
#else
_Complexfloatzdotc=0.0;
if (incx==1&&incy==1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc+=conjf(Cf(&x[i])) *Cf(&y[i]);
 }
 } else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc+=conjf(Cf(&x[i*incx])) *Cf(&y[i*incy]);
 }
 }
pCf(z) =zdotc;
}
#endif
staticinlinevoidzdotc_(doublecomplex*z, integer*n_, doublecomplex*x, integer*incx_, doublecomplex*y, integer*incy_) {
integern=*n_, incx=*incx_, incy=*incy_, i;
#ifdef_MSC_VER
_Dcomplexzdotc= {0.0, 0.0};
if (incx==1&&incy==1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] +=conj(Cd(&x[i]))._Val[0] *Cd(&y[i])._Val[0];
zdotc._Val[1] +=conj(Cd(&x[i]))._Val[1] *Cd(&y[i])._Val[1];
 }
 } else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] +=conj(Cd(&x[i*incx]))._Val[0] *Cd(&y[i*incy])._Val[0];
zdotc._Val[1] +=conj(Cd(&x[i*incx]))._Val[1] *Cd(&y[i*incy])._Val[1];
 }
 }
pCd(z) =zdotc;
}
#else
_Complexdoublezdotc=0.0;
if (incx==1&&incy==1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc+=conj(Cd(&x[i])) *Cd(&y[i]);
 }
 } else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc+=conj(Cd(&x[i*incx])) *Cd(&y[i*incy]);
 }
 }
pCd(z) =zdotc;
}
#endif
staticinlinevoidcdotu_(complex*z, integer*n_, complex*x, integer*incx_, complex*y, integer*incy_) {
integern=*n_, incx=*incx_, incy=*incy_, i;
#ifdef_MSC_VER
_Fcomplexzdotc= {0.0, 0.0};
if (incx==1&&incy==1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] +=Cf(&x[i])._Val[0] *Cf(&y[i])._Val[0];
zdotc._Val[1] +=Cf(&x[i])._Val[1] *Cf(&y[i])._Val[1];
 }
 } else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] +=Cf(&x[i*incx])._Val[0] *Cf(&y[i*incy])._Val[0];
zdotc._Val[1] +=Cf(&x[i*incx])._Val[1] *Cf(&y[i*incy])._Val[1];
 }
 }
pCf(z) =zdotc;
}
#else
_Complexfloatzdotc=0.0;
if (incx==1&&incy==1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc+=Cf(&x[i]) *Cf(&y[i]);
 }
 } else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc+=Cf(&x[i*incx]) *Cf(&y[i*incy]);
 }
 }
pCf(z) =zdotc;
}
#endif
staticinlinevoidzdotu_(doublecomplex*z, integer*n_, doublecomplex*x, integer*incx_, doublecomplex*y, integer*incy_) {
integern=*n_, incx=*incx_, incy=*incy_, i;
#ifdef_MSC_VER
_Dcomplexzdotc= {0.0, 0.0};
if (incx==1&&incy==1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] +=Cd(&x[i])._Val[0] *Cd(&y[i])._Val[0];
zdotc._Val[1] +=Cd(&x[i])._Val[1] *Cd(&y[i])._Val[1];
 }
 } else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] +=Cd(&x[i*incx])._Val[0] *Cd(&y[i*incy])._Val[0];
zdotc._Val[1] +=Cd(&x[i*incx])._Val[1] *Cd(&y[i*incy])._Val[1];
 }
 }
pCd(z) =zdotc;
}
#else
_Complexdoublezdotc=0.0;
if (incx==1&&incy==1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc+=Cd(&x[i]) *Cd(&y[i]);
 }
 } else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc+=Cd(&x[i*incx]) *Cd(&y[i*incy]);
 }
 }
pCd(z) =zdotc;
}
#endif
/* -- translated by f2c (version 20000121).
 You must link the resulting object file with the libraries:
 -lf2c -lm (in that order)
*/





/* Table of constant values */

staticintegerc__1=1;
staticintegerc__0=0;
staticintegerc_n1=-1;

/* > \brief <b> CGEEV computes the eigenvalues and, optionally, the left and/or right eigenvectors for GE matr
ices</b> */

/* =========== DOCUMENTATION =========== */

/* Online html documentation available at */
/* http://www.netlib.org/lapack/explore-html/ */

/* > \htmlonly */
/* > Download CGEEV + dependencies */
/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/cgeev.f
"> */
/* > [TGZ]</a> */
/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/cgeev.f
"> */
/* > [ZIP]</a> */
/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/cgeev.f
"> */
/* > [TXT]</a> */
/* > \endhtmlonly */

/* Definition: */
/* =========== */

/* SUBROUTINE CGEEV( JOBVL, JOBVR, N, A, LDA, W, VL, LDVL, VR, LDVR, */
/* WORK, LWORK, RWORK, INFO ) */

/* CHARACTER JOBVL, JOBVR */
/* INTEGER INFO, LDA, LDVL, LDVR, LWORK, N */
/* REAL RWORK( * ) */
/* COMPLEX A( LDA, * ), VL( LDVL, * ), VR( LDVR, * ), */
/* $ W( * ), WORK( * ) */


/* > \par Purpose: */
/* ============= */
/* > */
/* > \verbatim */
/* > */
/* > CGEEV computes for an N-by-N complex nonsymmetric matrix A, the */
/* > eigenvalues and, optionally, the left and/or right eigenvectors. */
/* > */
/* > The right eigenvector v(j) of A satisfies */
/* > A * v(j) = lambda(j) * v(j) */
/* > where lambda(j) is its eigenvalue. */
/* > The left eigenvector u(j) of A satisfies */
/* > u(j)**H * A = lambda(j) * u(j)**H */
/* > where u(j)**H denotes the conjugate transpose of u(j). */
/* > */
/* > The computed eigenvectors are normalized to have Euclidean norm */
/* > equal to 1 and largest component real. */
/* > \endverbatim */

/* Arguments: */
/* ========== */

/* > \param[in] JOBVL */
/* > \verbatim */
/* > JOBVL is CHARACTER*1 */
/* > = 'N': left eigenvectors of A are not computed; */
/* > = 'V': left eigenvectors of are computed. */
/* > \endverbatim */
/* > */
/* > \param[in] JOBVR */
/* > \verbatim */
/* > JOBVR is CHARACTER*1 */
/* > = 'N': right eigenvectors of A are not computed; */
/* > = 'V': right eigenvectors of A are computed. */
/* > \endverbatim */
/* > */
/* > \param[in] N */
/* > \verbatim */
/* > N is INTEGER */
/* > The order of the matrix A. N >= 0. */
/* > \endverbatim */
/* > */
/* > \param[in,out] A */
/* > \verbatim */
/* > A is COMPLEX array, dimension (LDA,N) */
/* > On entry, the N-by-N matrix A. */
/* > On exit, A has been overwritten. */
/* > \endverbatim */
/* > */
/* > \param[in] LDA */
/* > \verbatim */
/* > LDA is INTEGER */
/* > The leading dimension of the array A. LDA >= f2cmax(1,N). */
/* > \endverbatim */
/* > */
/* > \param[out] W */
/* > \verbatim */
/* > W is COMPLEX array, dimension (N) */
/* > W contains the computed eigenvalues. */
/* > \endverbatim */
/* > */
/* > \param[out] VL */
/* > \verbatim */
/* > VL is COMPLEX array, dimension (LDVL,N) */
/* > If JOBVL = 'V', the left eigenvectors u(j) are stored one */
/* > after another in the columns of VL, in the same order */
/* > as their eigenvalues. */
/* > If JOBVL = 'N', VL is not referenced. */
/* > u(j) = VL(:,j), the j-th column of VL. */
/* > \endverbatim */
/* > */
/* > \param[in] LDVL */
/* > \verbatim */
/* > LDVL is INTEGER */
/* > The leading dimension of the array VL. LDVL >= 1; if */
/* > JOBVL = 'V', LDVL >= N. */
/* > \endverbatim */
/* > */
/* > \param[out] VR */
/* > \verbatim */
/* > VR is COMPLEX array, dimension (LDVR,N) */
/* > If JOBVR = 'V', the right eigenvectors v(j) are stored one */
/* > after another in the columns of VR, in the same order */
/* > as their eigenvalues. */
/* > If JOBVR = 'N', VR is not referenced. */
/* > v(j) = VR(:,j), the j-th column of VR. */
/* > \endverbatim */
/* > */
/* > \param[in] LDVR */
/* > \verbatim */
/* > LDVR is INTEGER */
/* > The leading dimension of the array VR. LDVR >= 1; if */
/* > JOBVR = 'V', LDVR >= N. */
/* > \endverbatim */
/* > */
/* > \param[out] WORK */
/* > \verbatim */
/* > WORK is COMPLEX array, dimension (MAX(1,LWORK)) */
/* > On exit, if INFO = 0, WORK(1) returns the optimal LWORK. */
/* > \endverbatim */
/* > */
/* > \param[in] LWORK */
/* > \verbatim */
/* > LWORK is INTEGER */
/* > The dimension of the array WORK. LWORK >= f2cmax(1,2*N). */
/* > For good performance, LWORK must generally be larger. */
/* > */
/* > If LWORK = -1, then a workspace query is assumed; the routine */
/* > only calculates the optimal size of the WORK array, returns */
/* > this value as the first entry of the WORK array, and no error */
/* > message related to LWORK is issued by XERBLA. */
/* > \endverbatim */
/* > */
/* > \param[out] RWORK */
/* > \verbatim */
/* > RWORK is REAL array, dimension (2*N) */
/* > \endverbatim */
/* > */
/* > \param[out] INFO */
/* > \verbatim */
/* > INFO is INTEGER */
/* > = 0: successful exit */
/* > < 0: if INFO = -i, the i-th argument had an illegal value. */
/* > > 0: if INFO = i, the QR algorithm failed to compute all the */
/* > eigenvalues, and no eigenvectors have been computed; */
/* > elements i+1:N of W contain eigenvalues which have */
/* > converged. */
/* > \endverbatim */

/* Authors: */
/* ======== */

/* > \author Univ. of Tennessee */
/* > \author Univ. of California Berkeley */
/* > \author Univ. of Colorado Denver */
/* > \author NAG Ltd. */

/* > \date June 2016 */

/* @generated from zgeev.f, fortran z -> c, Tue Apr 19 01:47:44 2016 */

/* > \ingroup complexGEeigen */

/* ===================================================================== */
/* Subroutine */intcgeev_(char*jobvl, char*jobvr, integer*n, complex*a, 
integer*lda, complex*w, complex*vl, integer*ldvl, complex*vr, 
integer*ldvr, complex*work, integer*lwork, real*rwork, integer*
info)
{
/* System generated locals */
integera_dim1, a_offset, vl_dim1, vl_offset, vr_dim1, vr_offset, i__1, 
i__2, i__3;
realr__1, r__2;
complexq__1, q__2;

/* Local variables */
integeribal;
charside[1];
realanrm;
integerierr, itau, iwrk, nout, i__, k;
extern/* Subroutine */intcscal_(integer*, complex*, complex*, 
integer*);
externlogicallsame_(char*, char*);
externrealscnrm2_(integer*, complex*, integer*);
extern/* Subroutine */intcgebak_(char*, char*, integer*, integer*, 
integer*, real*, integer*, complex*, integer*, integer*), cgebal_(char*, integer*, complex*, integer*, 
integer*, integer*, real*, integer*), slabad_(real*, 
real*);
logicalscalea;
externrealclange_(char*, integer*, integer*, complex*, integer*, 
real*);
realcscale;
extern/* Subroutine */intcgehrd_(integer*, integer*, integer*, 
complex*, integer*, complex*, complex*, integer*, integer*),
clascl_(char*, integer*, integer*, real*, real*, integer*, 
integer*, complex*, integer*, integer*);
externrealslamch_(char*);
extern/* Subroutine */intcsscal_(integer*, real*, complex*, integer
*), clacpy_(char*, integer*, integer*, complex*, integer*, 
complex*, integer*), xerbla_(char*, integer*, ftnlen);
externintegerilaenv_(integer*, char*, char*, integer*, integer*, 
integer*, integer*, ftnlen, ftnlen);
logicalselect[1];
realbignum;
externintegerisamax_(integer*, real*, integer*);
extern/* Subroutine */intchseqr_(char*, char*, integer*, integer*, 
integer*, complex*, integer*, complex*, complex*, integer*, 
complex*, integer*, integer*), cunghr_(integer
*, integer*, integer*, complex*, integer*, complex*, complex
*, integer*, integer*);
integerminwrk, maxwrk;
logicalwantvl;
realsmlnum;
integerhswork, irwork;
logicallquery, wantvr;
extern/* Subroutine */intctrevc3_(char*, char*, logical*, integer*,
complex*, integer*, complex*, integer*, complex*, integer*,
integer*, integer*, complex*, integer*, real*, integer*, 
integer*);
integerihi;
realscl;
integerilo;
realdum[1], eps;
complextmp;
integerlwork_trevc__;


/* -- LAPACK driver routine (version 3.7.0) -- */
/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
/* June 2016 */


/* ===================================================================== */


/* Test the input arguments */

/* Parameter adjustments */
a_dim1=*lda;
a_offset=1+a_dim1*1;
a-=a_offset;
--w;
vl_dim1=*ldvl;
vl_offset=1+vl_dim1*1;
vl-=vl_offset;
vr_dim1=*ldvr;
vr_offset=1+vr_dim1*1;
vr-=vr_offset;
--work;
--rwork;

/* Function Body */
*info=0;
lquery=*lwork==-1;
wantvl=lsame_(jobvl, "V");
wantvr=lsame_(jobvr, "V");
if (! wantvl&& ! lsame_(jobvl, "N")) {
*info=-1;
 } elseif (! wantvr&& ! lsame_(jobvr, "N")) {
*info=-2;
 } elseif (*n<0) {
*info=-3;
 } elseif (*lda<f2cmax(1,*n)) {
*info=-5;
 } elseif (*ldvl<1||wantvl&&*ldvl<*n) {
*info=-8;
 } elseif (*ldvr<1||wantvr&&*ldvr<*n) {
*info=-10;
 }

/* Compute workspace */
/* (Note: Comments in the code beginning "Workspace:" describe the */
/* minimal amount of workspace needed at that point in the code, */
/* as well as the preferred amount for good performance. */
/* CWorkspace refers to complex workspace, and RWorkspace to real */
/* workspace. NB refers to the optimal block size for the */
/* immediately following subroutine, as returned by ILAENV. */
/* HSWORK refers to the workspace preferred by CHSEQR, as */
/* calculated below. HSWORK is computed assuming ILO=1 and IHI=N, */
/* the worst case.) */

if (*info==0) {
if (*n==0) {
minwrk=1;
maxwrk=1;
 } else {
maxwrk=*n+*n*ilaenv_(&c__1, "CGEHRD", " ", n, &c__1, n, &
c__0, (ftnlen)6, (ftnlen)1);
minwrk=*n << 1;
if (wantvl) {
/* Computing MAX */
i__1=maxwrk, i__2=*n+ (*n-1) *ilaenv_(&c__1, "CUNGHR",
" ", n, &c__1, n, &c_n1, (ftnlen)6, (ftnlen)1);
maxwrk=f2cmax(i__1,i__2);
ctrevc3_("L", "B", select, n, &a[a_offset], lda, &vl[
vl_offset], ldvl, &vr[vr_offset], ldvr, n, &nout, &
work[1], &c_n1, &rwork[1], &c_n1, &ierr);
lwork_trevc__= (integer) work[1].r;
/* Computing MAX */
i__1=maxwrk, i__2=*n+lwork_trevc__;
maxwrk=f2cmax(i__1,i__2);
chseqr_("S", "V", n, &c__1, n, &a[a_offset], lda, &w[1], &vl[
vl_offset], ldvl, &work[1], &c_n1, info);
 } elseif (wantvr) {
/* Computing MAX */
i__1=maxwrk, i__2=*n+ (*n-1) *ilaenv_(&c__1, "CUNGHR",
" ", n, &c__1, n, &c_n1, (ftnlen)6, (ftnlen)1);
maxwrk=f2cmax(i__1,i__2);
ctrevc3_("R", "B", select, n, &a[a_offset], lda, &vl[
vl_offset], ldvl, &vr[vr_offset], ldvr, n, &nout, &
work[1], &c_n1, &rwork[1], &c_n1, &ierr);
lwork_trevc__= (integer) work[1].r;
/* Computing MAX */
i__1=maxwrk, i__2=*n+lwork_trevc__;
maxwrk=f2cmax(i__1,i__2);
chseqr_("S", "V", n, &c__1, n, &a[a_offset], lda, &w[1], &vr[
vr_offset], ldvr, &work[1], &c_n1, info);
 } else {
chseqr_("E", "N", n, &c__1, n, &a[a_offset], lda, &w[1], &vr[
vr_offset], ldvr, &work[1], &c_n1, info);
 }
hswork= (integer) work[1].r;
/* Computing MAX */
i__1=f2cmax(maxwrk,hswork);
maxwrk=f2cmax(i__1,minwrk);
 }
work[1].r= (real) maxwrk, work[1].i=0.f;

if (*lwork<minwrk&& ! lquery) {
*info=-12;
 }
 }

if (*info!=0) {
i__1=-(*info);
xerbla_("CGEEV ", &i__1, (ftnlen)6);
return0;
 } elseif (lquery) {
return0;
 }

/* Quick return if possible */

if (*n==0) {
return0;
 }

/* Get machine constants */

eps=slamch_("P");
smlnum=slamch_("S");
bignum=1.f / smlnum;
slabad_(&smlnum, &bignum);
smlnum=sqrt(smlnum) / eps;
bignum=1.f / smlnum;

/* Scale A if f2cmax element outside range [SMLNUM,BIGNUM] */

anrm=clange_("M", n, n, &a[a_offset], lda, dum);
scalea=FALSE_;
if (anrm>0.f&&anrm<smlnum) {
scalea=TRUE_;
cscale=smlnum;
 } elseif (anrm>bignum) {
scalea=TRUE_;
cscale=bignum;
 }
if (scalea) {
clascl_("G", &c__0, &c__0, &anrm, &cscale, n, n, &a[a_offset], lda, &
ierr);
 }

/* Balance the matrix */
/* (CWorkspace: none) */
/* (RWorkspace: need N) */

ibal=1;
cgebal_("B", n, &a[a_offset], lda, &ilo, &ihi, &rwork[ibal], &ierr);

/* Reduce to upper Hessenberg form */
/* (CWorkspace: need 2*N, prefer N+N*NB) */
/* (RWorkspace: none) */

itau=1;
iwrk=itau+*n;
i__1=*lwork-iwrk+1;
cgehrd_(n, &ilo, &ihi, &a[a_offset], lda, &work[itau], &work[iwrk], &i__1,
&ierr);

if (wantvl) {

/* Want left eigenvectors */
/* Copy Householder vectors to VL */

*(unsigned char*)side='L';
clacpy_("L", n, n, &a[a_offset], lda, &vl[vl_offset], ldvl)
 ;

/* Generate unitary matrix in VL */
/* (CWorkspace: need 2*N-1, prefer N+(N-1)*NB) */
/* (RWorkspace: none) */

i__1=*lwork-iwrk+1;
cunghr_(n, &ilo, &ihi, &vl[vl_offset], ldvl, &work[itau], &work[iwrk],
&i__1, &ierr);

/* Perform QR iteration, accumulating Schur vectors in VL */
/* (CWorkspace: need 1, prefer HSWORK (see comments) ) */
/* (RWorkspace: none) */

iwrk=itau;
i__1=*lwork-iwrk+1;
chseqr_("S", "V", n, &ilo, &ihi, &a[a_offset], lda, &w[1], &vl[
vl_offset], ldvl, &work[iwrk], &i__1, info);

if (wantvr) {

/* Want left and right eigenvectors */
/* Copy Schur vectors to VR */

*(unsigned char*)side='B';
clacpy_("F", n, n, &vl[vl_offset], ldvl, &vr[vr_offset], ldvr);
 }

 } elseif (wantvr) {

/* Want right eigenvectors */
/* Copy Householder vectors to VR */

*(unsigned char*)side='R';
clacpy_("L", n, n, &a[a_offset], lda, &vr[vr_offset], ldvr)
 ;

/* Generate unitary matrix in VR */
/* (CWorkspace: need 2*N-1, prefer N+(N-1)*NB) */
/* (RWorkspace: none) */

i__1=*lwork-iwrk+1;
cunghr_(n, &ilo, &ihi, &vr[vr_offset], ldvr, &work[itau], &work[iwrk],
&i__1, &ierr);

/* Perform QR iteration, accumulating Schur vectors in VR */
/* (CWorkspace: need 1, prefer HSWORK (see comments) ) */
/* (RWorkspace: none) */

iwrk=itau;
i__1=*lwork-iwrk+1;
chseqr_("S", "V", n, &ilo, &ihi, &a[a_offset], lda, &w[1], &vr[
vr_offset], ldvr, &work[iwrk], &i__1, info);

 } else {

/* Compute eigenvalues only */
/* (CWorkspace: need 1, prefer HSWORK (see comments) ) */
/* (RWorkspace: none) */

iwrk=itau;
i__1=*lwork-iwrk+1;
chseqr_("E", "N", n, &ilo, &ihi, &a[a_offset], lda, &w[1], &vr[
vr_offset], ldvr, &work[iwrk], &i__1, info);
 }

/* If INFO .NE. 0 from CHSEQR, then quit */

if (*info!=0) {
 goto L50;