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 = {1.f,0.f};
517 /* > \brief \b CHEGVD */
519 /* =========== DOCUMENTATION =========== */
521 /* Online html documentation available at */
522 /* http://www.netlib.org/lapack/explore-html/ */
525 /* > Download CHEGVD + dependencies */
526 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/chegvd.
529 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/chegvd.
532 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/chegvd.
540 /* SUBROUTINE CHEGVD( ITYPE, JOBZ, UPLO, N, A, LDA, B, LDB, W, WORK, */
541 /* LWORK, RWORK, LRWORK, IWORK, LIWORK, INFO ) */
543 /* CHARACTER JOBZ, UPLO */
544 /* INTEGER INFO, ITYPE, LDA, LDB, LIWORK, LRWORK, LWORK, N */
545 /* INTEGER IWORK( * ) */
546 /* REAL RWORK( * ), W( * ) */
547 /* COMPLEX A( LDA, * ), B( LDB, * ), WORK( * ) */
550 /* > \par Purpose: */
555 /* > CHEGVD computes all the eigenvalues, and optionally, the eigenvectors */
556 /* > of a complex generalized Hermitian-definite eigenproblem, of the form */
557 /* > A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x. Here A and */
558 /* > B are assumed to be Hermitian and B is also positive definite. */
559 /* > If eigenvectors are desired, it uses a divide and conquer algorithm. */
561 /* > The divide and conquer algorithm makes very mild assumptions about */
562 /* > floating point arithmetic. It will work on machines with a guard */
563 /* > digit in add/subtract, or on those binary machines without guard */
564 /* > digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or */
565 /* > Cray-2. It could conceivably fail on hexadecimal or decimal machines */
566 /* > without guard digits, but we know of none. */
572 /* > \param[in] ITYPE */
574 /* > ITYPE is INTEGER */
575 /* > Specifies the problem type to be solved: */
576 /* > = 1: A*x = (lambda)*B*x */
577 /* > = 2: A*B*x = (lambda)*x */
578 /* > = 3: B*A*x = (lambda)*x */
581 /* > \param[in] JOBZ */
583 /* > JOBZ is CHARACTER*1 */
584 /* > = 'N': Compute eigenvalues only; */
585 /* > = 'V': Compute eigenvalues and eigenvectors. */
588 /* > \param[in] UPLO */
590 /* > UPLO is CHARACTER*1 */
591 /* > = 'U': Upper triangles of A and B are stored; */
592 /* > = 'L': Lower triangles of A and B are stored. */
598 /* > The order of the matrices A and B. N >= 0. */
601 /* > \param[in,out] A */
603 /* > A is COMPLEX array, dimension (LDA, N) */
604 /* > On entry, the Hermitian matrix A. If UPLO = 'U', the */
605 /* > leading N-by-N upper triangular part of A contains the */
606 /* > upper triangular part of the matrix A. If UPLO = 'L', */
607 /* > the leading N-by-N lower triangular part of A contains */
608 /* > the lower triangular part of the matrix A. */
610 /* > On exit, if JOBZ = 'V', then if INFO = 0, A contains the */
611 /* > matrix Z of eigenvectors. The eigenvectors are normalized */
613 /* > if ITYPE = 1 or 2, Z**H*B*Z = I; */
614 /* > if ITYPE = 3, Z**H*inv(B)*Z = I. */
615 /* > If JOBZ = 'N', then on exit the upper triangle (if UPLO='U') */
616 /* > or the lower triangle (if UPLO='L') of A, including the */
617 /* > diagonal, is destroyed. */
620 /* > \param[in] LDA */
622 /* > LDA is INTEGER */
623 /* > The leading dimension of the array A. LDA >= f2cmax(1,N). */
626 /* > \param[in,out] B */
628 /* > B is COMPLEX array, dimension (LDB, N) */
629 /* > On entry, the Hermitian matrix B. If UPLO = 'U', the */
630 /* > leading N-by-N upper triangular part of B contains the */
631 /* > upper triangular part of the matrix B. If UPLO = 'L', */
632 /* > the leading N-by-N lower triangular part of B contains */
633 /* > the lower triangular part of the matrix B. */
635 /* > On exit, if INFO <= N, the part of B containing the matrix is */
636 /* > overwritten by the triangular factor U or L from the Cholesky */
637 /* > factorization B = U**H*U or B = L*L**H. */
640 /* > \param[in] LDB */
642 /* > LDB is INTEGER */
643 /* > The leading dimension of the array B. LDB >= f2cmax(1,N). */
646 /* > \param[out] W */
648 /* > W is REAL array, dimension (N) */
649 /* > If INFO = 0, the eigenvalues in ascending order. */
652 /* > \param[out] WORK */
654 /* > WORK is COMPLEX array, dimension (MAX(1,LWORK)) */
655 /* > On exit, if INFO = 0, WORK(1) returns the optimal LWORK. */
658 /* > \param[in] LWORK */
660 /* > LWORK is INTEGER */
661 /* > The length of the array WORK. */
662 /* > If N <= 1, LWORK >= 1. */
663 /* > If JOBZ = 'N' and N > 1, LWORK >= N + 1. */
664 /* > If JOBZ = 'V' and N > 1, LWORK >= 2*N + N**2. */
666 /* > If LWORK = -1, then a workspace query is assumed; the routine */
667 /* > only calculates the optimal sizes of the WORK, RWORK and */
668 /* > IWORK arrays, returns these values as the first entries of */
669 /* > the WORK, RWORK and IWORK arrays, and no error message */
670 /* > related to LWORK or LRWORK or LIWORK is issued by XERBLA. */
673 /* > \param[out] RWORK */
675 /* > RWORK is REAL array, dimension (MAX(1,LRWORK)) */
676 /* > On exit, if INFO = 0, RWORK(1) returns the optimal LRWORK. */
679 /* > \param[in] LRWORK */
681 /* > LRWORK is INTEGER */
682 /* > The dimension of the array RWORK. */
683 /* > If N <= 1, LRWORK >= 1. */
684 /* > If JOBZ = 'N' and N > 1, LRWORK >= N. */
685 /* > If JOBZ = 'V' and N > 1, LRWORK >= 1 + 5*N + 2*N**2. */
687 /* > If LRWORK = -1, then a workspace query is assumed; the */
688 /* > routine only calculates the optimal sizes of the WORK, RWORK */
689 /* > and IWORK arrays, returns these values as the first entries */
690 /* > of the WORK, RWORK and IWORK arrays, and no error message */
691 /* > related to LWORK or LRWORK or LIWORK is issued by XERBLA. */
694 /* > \param[out] IWORK */
696 /* > IWORK is INTEGER array, dimension (MAX(1,LIWORK)) */
697 /* > On exit, if INFO = 0, IWORK(1) returns the optimal LIWORK. */
700 /* > \param[in] LIWORK */
702 /* > LIWORK is INTEGER */
703 /* > The dimension of the array IWORK. */
704 /* > If N <= 1, LIWORK >= 1. */
705 /* > If JOBZ = 'N' and N > 1, LIWORK >= 1. */
706 /* > If JOBZ = 'V' and N > 1, LIWORK >= 3 + 5*N. */
708 /* > If LIWORK = -1, then a workspace query is assumed; the */
709 /* > routine only calculates the optimal sizes of the WORK, RWORK */
710 /* > and IWORK arrays, returns these values as the first entries */
711 /* > of the WORK, RWORK and IWORK arrays, and no error message */
712 /* > related to LWORK or LRWORK or LIWORK is issued by XERBLA. */
715 /* > \param[out] INFO */
717 /* > INFO is INTEGER */
718 /* > = 0: successful exit */
719 /* > < 0: if INFO = -i, the i-th argument had an illegal value */
720 /* > > 0: CPOTRF or CHEEVD returned an error code: */
721 /* > <= N: if INFO = i and JOBZ = 'N', then the algorithm */
722 /* > failed to converge; i off-diagonal elements of an */
723 /* > intermediate tridiagonal form did not converge to */
725 /* > if INFO = i and JOBZ = 'V', then the algorithm */
726 /* > failed to compute an eigenvalue while working on */
727 /* > the submatrix lying in rows and columns INFO/(N+1) */
728 /* > through mod(INFO,N+1); */
729 /* > > N: if INFO = N + i, for 1 <= i <= N, then the leading */
730 /* > minor of order i of B is not positive definite. */
731 /* > The factorization of B could not be completed and */
732 /* > no eigenvalues or eigenvectors were computed. */
738 /* > \author Univ. of Tennessee */
739 /* > \author Univ. of California Berkeley */
740 /* > \author Univ. of Colorado Denver */
741 /* > \author NAG Ltd. */
743 /* > \date December 2016 */
745 /* > \ingroup complexHEeigen */
747 /* > \par Further Details: */
748 /* ===================== */
752 /* > Modified so that no backsubstitution is performed if CHEEVD fails to */
753 /* > converge (NEIG in old code could be greater than N causing out of */
754 /* > bounds reference to A - reported by Ralf Meyer). Also corrected the */
755 /* > description of INFO and the test on ITYPE. Sven, 16 Feb 05. */
758 /* > \par Contributors: */
759 /* ================== */
761 /* > Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA */
763 /* ===================================================================== */
764 /* Subroutine */ int chegvd_(integer *itype, char *jobz, char *uplo, integer *
765 n, complex *a, integer *lda, complex *b, integer *ldb, real *w,
766 complex *work, integer *lwork, real *rwork, integer *lrwork, integer *
767 iwork, integer *liwork, integer *info)
769 /* System generated locals */
770 integer a_dim1, a_offset, b_dim1, b_offset, i__1;
773 /* Local variables */
775 extern logical lsame_(char *, char *);
776 extern /* Subroutine */ int ctrmm_(char *, char *, char *, char *,
777 integer *, integer *, complex *, complex *, integer *, complex *,
782 extern /* Subroutine */ int ctrsm_(char *, char *, char *, char *,
783 integer *, integer *, complex *, complex *, integer *, complex *,
788 extern /* Subroutine */ int cheevd_(char *, char *, integer *, complex *,
789 integer *, real *, complex *, integer *, real *, integer *,
790 integer *, integer *, integer *), chegst_(integer
791 *, char *, integer *, complex *, integer *, complex *, integer *,
792 integer *), xerbla_(char *, integer *, ftnlen), cpotrf_(
793 char *, integer *, complex *, integer *, integer *);
794 integer liwmin, lrwmin;
798 /* -- LAPACK driver routine (version 3.7.0) -- */
799 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
800 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
804 /* ===================================================================== */
807 /* Test the input parameters. */
809 /* Parameter adjustments */
811 a_offset = 1 + a_dim1 * 1;
814 b_offset = 1 + b_dim1 * 1;
822 wantz = lsame_(jobz, "V");
823 upper = lsame_(uplo, "U");
824 lquery = *lwork == -1 || *lrwork == -1 || *liwork == -1;
832 lwmin = (*n << 1) + *n * *n;
833 lrwmin = *n * 5 + 1 + (*n << 1) * *n;
843 if (*itype < 1 || *itype > 3) {
845 } else if (! (wantz || lsame_(jobz, "N"))) {
847 } else if (! (upper || lsame_(uplo, "L"))) {
851 } else if (*lda < f2cmax(1,*n)) {
853 } else if (*ldb < f2cmax(1,*n)) {
858 work[1].r = (real) lopt, work[1].i = 0.f;
859 rwork[1] = (real) lropt;
862 if (*lwork < lwmin && ! lquery) {
864 } else if (*lrwork < lrwmin && ! lquery) {
866 } else if (*liwork < liwmin && ! lquery) {
873 xerbla_("CHEGVD", &i__1, (ftnlen)6);
879 /* Quick return if possible */
885 /* Form a Cholesky factorization of B. */
887 cpotrf_(uplo, n, &b[b_offset], ldb, info);
893 /* Transform problem to standard eigenvalue problem and solve. */
895 chegst_(itype, uplo, n, &a[a_offset], lda, &b[b_offset], ldb, info);
896 cheevd_(jobz, uplo, n, &a[a_offset], lda, &w[1], &work[1], lwork, &rwork[
897 1], lrwork, &iwork[1], liwork, info);
899 r__1 = (real) lopt, r__2 = work[1].r;
900 lopt = f2cmax(r__1,r__2);
903 lropt = f2cmax(r__1,rwork[1]);
905 r__1 = (real) liopt, r__2 = (real) iwork[1];
906 liopt = f2cmax(r__1,r__2);
908 if (wantz && *info == 0) {
910 /* Backtransform eigenvectors to the original problem. */
912 if (*itype == 1 || *itype == 2) {
914 /* For A*x=(lambda)*B*x and A*B*x=(lambda)*x; */
915 /* backtransform eigenvectors: x = inv(L)**H *y or inv(U)*y */
918 *(unsigned char *)trans = 'N';
920 *(unsigned char *)trans = 'C';
923 ctrsm_("Left", uplo, trans, "Non-unit", n, n, &c_b1, &b[b_offset],
924 ldb, &a[a_offset], lda);
926 } else if (*itype == 3) {
928 /* For B*A*x=(lambda)*x; */
929 /* backtransform eigenvectors: x = L*y or U**H *y */
932 *(unsigned char *)trans = 'C';
934 *(unsigned char *)trans = 'N';
937 ctrmm_("Left", uplo, trans, "Non-unit", n, n, &c_b1, &b[b_offset],
938 ldb, &a[a_offset], lda);
942 work[1].r = (real) lopt, work[1].i = 0.f;
943 rwork[1] = (real) lropt;