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]/Cd(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 doublecomplex c_b1 = {0.,0.};
516 static doublecomplex c_b2 = {1.,0.};
517 static integer c__1 = 1;
519 /* > \brief \b ZTGEVC */
521 /* =========== DOCUMENTATION =========== */
523 /* Online html documentation available at */
524 /* http://www.netlib.org/lapack/explore-html/ */
527 /* > Download ZTGEVC + dependencies */
528 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/ztgevc.
531 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/ztgevc.
534 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/ztgevc.
542 /* SUBROUTINE ZTGEVC( SIDE, HOWMNY, SELECT, N, S, LDS, P, LDP, VL, */
543 /* LDVL, VR, LDVR, MM, M, WORK, RWORK, INFO ) */
545 /* CHARACTER HOWMNY, SIDE */
546 /* INTEGER INFO, LDP, LDS, LDVL, LDVR, M, MM, N */
547 /* LOGICAL SELECT( * ) */
548 /* DOUBLE PRECISION RWORK( * ) */
549 /* COMPLEX*16 P( LDP, * ), S( LDS, * ), VL( LDVL, * ), */
550 /* $ VR( LDVR, * ), WORK( * ) */
554 /* > \par Purpose: */
559 /* > ZTGEVC computes some or all of the right and/or left eigenvectors of */
560 /* > a pair of complex matrices (S,P), where S and P are upper triangular. */
561 /* > Matrix pairs of this type are produced by the generalized Schur */
562 /* > factorization of a complex matrix pair (A,B): */
564 /* > A = Q*S*Z**H, B = Q*P*Z**H */
566 /* > as computed by ZGGHRD + ZHGEQZ. */
568 /* > The right eigenvector x and the left eigenvector y of (S,P) */
569 /* > corresponding to an eigenvalue w are defined by: */
571 /* > S*x = w*P*x, (y**H)*S = w*(y**H)*P, */
573 /* > where y**H denotes the conjugate tranpose of y. */
574 /* > The eigenvalues are not input to this routine, but are computed */
575 /* > directly from the diagonal elements of S and P. */
577 /* > This routine returns the matrices X and/or Y of right and left */
578 /* > eigenvectors of (S,P), or the products Z*X and/or Q*Y, */
579 /* > where Z and Q are input matrices. */
580 /* > If Q and Z are the unitary factors from the generalized Schur */
581 /* > factorization of a matrix pair (A,B), then Z*X and Q*Y */
582 /* > are the matrices of right and left eigenvectors of (A,B). */
588 /* > \param[in] SIDE */
590 /* > SIDE is CHARACTER*1 */
591 /* > = 'R': compute right eigenvectors only; */
592 /* > = 'L': compute left eigenvectors only; */
593 /* > = 'B': compute both right and left eigenvectors. */
596 /* > \param[in] HOWMNY */
598 /* > HOWMNY is CHARACTER*1 */
599 /* > = 'A': compute all right and/or left eigenvectors; */
600 /* > = 'B': compute all right and/or left eigenvectors, */
601 /* > backtransformed by the matrices in VR and/or VL; */
602 /* > = 'S': compute selected right and/or left eigenvectors, */
603 /* > specified by the logical array SELECT. */
606 /* > \param[in] SELECT */
608 /* > SELECT is LOGICAL array, dimension (N) */
609 /* > If HOWMNY='S', SELECT specifies the eigenvectors to be */
610 /* > computed. The eigenvector corresponding to the j-th */
611 /* > eigenvalue is computed if SELECT(j) = .TRUE.. */
612 /* > Not referenced if HOWMNY = 'A' or 'B'. */
618 /* > The order of the matrices S and P. N >= 0. */
623 /* > S is COMPLEX*16 array, dimension (LDS,N) */
624 /* > The upper triangular matrix S from a generalized Schur */
625 /* > factorization, as computed by ZHGEQZ. */
628 /* > \param[in] LDS */
630 /* > LDS is INTEGER */
631 /* > The leading dimension of array S. LDS >= f2cmax(1,N). */
636 /* > P is COMPLEX*16 array, dimension (LDP,N) */
637 /* > The upper triangular matrix P from a generalized Schur */
638 /* > factorization, as computed by ZHGEQZ. P must have real */
639 /* > diagonal elements. */
642 /* > \param[in] LDP */
644 /* > LDP is INTEGER */
645 /* > The leading dimension of array P. LDP >= f2cmax(1,N). */
648 /* > \param[in,out] VL */
650 /* > VL is COMPLEX*16 array, dimension (LDVL,MM) */
651 /* > On entry, if SIDE = 'L' or 'B' and HOWMNY = 'B', VL must */
652 /* > contain an N-by-N matrix Q (usually the unitary matrix Q */
653 /* > of left Schur vectors returned by ZHGEQZ). */
654 /* > On exit, if SIDE = 'L' or 'B', VL contains: */
655 /* > if HOWMNY = 'A', the matrix Y of left eigenvectors of (S,P); */
656 /* > if HOWMNY = 'B', the matrix Q*Y; */
657 /* > if HOWMNY = 'S', the left eigenvectors of (S,P) specified by */
658 /* > SELECT, stored consecutively in the columns of */
659 /* > VL, in the same order as their eigenvalues. */
660 /* > Not referenced if SIDE = 'R'. */
663 /* > \param[in] LDVL */
665 /* > LDVL is INTEGER */
666 /* > The leading dimension of array VL. LDVL >= 1, and if */
667 /* > SIDE = 'L' or 'l' or 'B' or 'b', LDVL >= N. */
670 /* > \param[in,out] VR */
672 /* > VR is COMPLEX*16 array, dimension (LDVR,MM) */
673 /* > On entry, if SIDE = 'R' or 'B' and HOWMNY = 'B', VR must */
674 /* > contain an N-by-N matrix Q (usually the unitary matrix Z */
675 /* > of right Schur vectors returned by ZHGEQZ). */
676 /* > On exit, if SIDE = 'R' or 'B', VR contains: */
677 /* > if HOWMNY = 'A', the matrix X of right eigenvectors of (S,P); */
678 /* > if HOWMNY = 'B', the matrix Z*X; */
679 /* > if HOWMNY = 'S', the right eigenvectors of (S,P) specified by */
680 /* > SELECT, stored consecutively in the columns of */
681 /* > VR, in the same order as their eigenvalues. */
682 /* > Not referenced if SIDE = 'L'. */
685 /* > \param[in] LDVR */
687 /* > LDVR is INTEGER */
688 /* > The leading dimension of the array VR. LDVR >= 1, and if */
689 /* > SIDE = 'R' or 'B', LDVR >= N. */
692 /* > \param[in] MM */
694 /* > MM is INTEGER */
695 /* > The number of columns in the arrays VL and/or VR. MM >= M. */
698 /* > \param[out] M */
701 /* > The number of columns in the arrays VL and/or VR actually */
702 /* > used to store the eigenvectors. If HOWMNY = 'A' or 'B', M */
703 /* > is set to N. Each selected eigenvector occupies one column. */
706 /* > \param[out] WORK */
708 /* > WORK is COMPLEX*16 array, dimension (2*N) */
711 /* > \param[out] RWORK */
713 /* > RWORK is DOUBLE PRECISION array, dimension (2*N) */
716 /* > \param[out] INFO */
718 /* > INFO is INTEGER */
719 /* > = 0: successful exit. */
720 /* > < 0: if INFO = -i, the i-th argument had an illegal value. */
726 /* > \author Univ. of Tennessee */
727 /* > \author Univ. of California Berkeley */
728 /* > \author Univ. of Colorado Denver */
729 /* > \author NAG Ltd. */
731 /* > \date December 2016 */
733 /* > \ingroup complex16GEcomputational */
735 /* ===================================================================== */
736 /* Subroutine */ int ztgevc_(char *side, char *howmny, logical *select,
737 integer *n, doublecomplex *s, integer *lds, doublecomplex *p, integer
738 *ldp, doublecomplex *vl, integer *ldvl, doublecomplex *vr, integer *
739 ldvr, integer *mm, integer *m, doublecomplex *work, doublereal *rwork,
742 /* System generated locals */
743 integer p_dim1, p_offset, s_dim1, s_offset, vl_dim1, vl_offset, vr_dim1,
744 vr_offset, i__1, i__2, i__3, i__4, i__5;
745 doublereal d__1, d__2, d__3, d__4, d__5, d__6;
746 doublecomplex z__1, z__2, z__3, z__4;
748 /* Local variables */
749 integer ibeg, ieig, iend;
753 doublecomplex suma, sumb;
761 extern logical lsame_(char *, char *);
764 doublereal anorm, bnorm;
766 extern /* Subroutine */ int zgemv_(char *, integer *, integer *,
767 doublecomplex *, doublecomplex *, integer *, doublecomplex *,
768 integer *, doublecomplex *, doublecomplex *, integer *);
769 doublecomplex ca, cb;
770 extern /* Subroutine */ int dlabad_(doublereal *, doublereal *);
774 doublereal bcoefa, acoeff;
775 doublecomplex bcoeff;
778 doublereal ascale, bscale;
779 extern doublereal dlamch_(char *);
781 doublecomplex salpha;
783 extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
786 extern /* Double Complex */ VOID zladiv_(doublecomplex *, doublecomplex *,
795 /* -- LAPACK computational routine (version 3.7.0) -- */
796 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
797 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
802 /* ===================================================================== */
805 /* Decode and Test the input parameters */
807 /* Parameter adjustments */
810 s_offset = 1 + s_dim1 * 1;
813 p_offset = 1 + p_dim1 * 1;
816 vl_offset = 1 + vl_dim1 * 1;
819 vr_offset = 1 + vr_dim1 * 1;
825 if (lsame_(howmny, "A")) {
829 } else if (lsame_(howmny, "S")) {
833 } else if (lsame_(howmny, "B")) {
841 if (lsame_(side, "R")) {
845 } else if (lsame_(side, "L")) {
849 } else if (lsame_(side, "B")) {
860 } else if (ihwmny < 0) {
864 } else if (*lds < f2cmax(1,*n)) {
866 } else if (*ldp < f2cmax(1,*n)) {
871 xerbla_("ZTGEVC", &i__1, (ftnlen)6);
875 /* Count the number of eigenvectors */
880 for (j = 1; j <= i__1; ++j) {
890 /* Check diagonal of B */
894 for (j = 1; j <= i__1; ++j) {
895 if (d_imag(&p[j + j * p_dim1]) != 0.) {
903 } else if (compl && *ldvl < *n || *ldvl < 1) {
905 } else if (compr && *ldvr < *n || *ldvr < 1) {
907 } else if (*mm < im) {
912 xerbla_("ZTGEVC", &i__1, (ftnlen)6);
916 /* Quick return if possible */
923 /* Machine Constants */
925 safmin = dlamch_("Safe minimum");
927 dlabad_(&safmin, &big);
928 ulp = dlamch_("Epsilon") * dlamch_("Base");
929 small = safmin * *n / ulp;
931 bignum = 1. / (safmin * *n);
933 /* Compute the 1-norm of each column of the strictly upper triangular */
934 /* part of A and B to check for possible overflow in the triangular */
938 anorm = (d__1 = s[i__1].r, abs(d__1)) + (d__2 = d_imag(&s[s_dim1 + 1]),
941 bnorm = (d__1 = p[i__1].r, abs(d__1)) + (d__2 = d_imag(&p[p_dim1 + 1]),
946 for (j = 2; j <= i__1; ++j) {
950 for (i__ = 1; i__ <= i__2; ++i__) {
951 i__3 = i__ + j * s_dim1;
952 rwork[j] += (d__1 = s[i__3].r, abs(d__1)) + (d__2 = d_imag(&s[i__
953 + j * s_dim1]), abs(d__2));
954 i__3 = i__ + j * p_dim1;
955 rwork[*n + j] += (d__1 = p[i__3].r, abs(d__1)) + (d__2 = d_imag(&
956 p[i__ + j * p_dim1]), abs(d__2));
960 i__2 = j + j * s_dim1;
961 d__3 = anorm, d__4 = rwork[j] + ((d__1 = s[i__2].r, abs(d__1)) + (
962 d__2 = d_imag(&s[j + j * s_dim1]), abs(d__2)));
963 anorm = f2cmax(d__3,d__4);
965 i__2 = j + j * p_dim1;
966 d__3 = bnorm, d__4 = rwork[*n + j] + ((d__1 = p[i__2].r, abs(d__1)) +
967 (d__2 = d_imag(&p[j + j * p_dim1]), abs(d__2)));
968 bnorm = f2cmax(d__3,d__4);
972 ascale = 1. / f2cmax(anorm,safmin);
973 bscale = 1. / f2cmax(bnorm,safmin);
975 /* Left eigenvectors */
980 /* Main loop over eigenvalues */
983 for (je = 1; je <= i__1; ++je) {
992 i__2 = je + je * s_dim1;
993 i__3 = je + je * p_dim1;
994 if ((d__2 = s[i__2].r, abs(d__2)) + (d__3 = d_imag(&s[je + je
995 * s_dim1]), abs(d__3)) <= safmin && (d__1 = p[i__3].r,
996 abs(d__1)) <= safmin) {
998 /* Singular matrix pencil -- return unit eigenvector */
1001 for (jr = 1; jr <= i__2; ++jr) {
1002 i__3 = jr + ieig * vl_dim1;
1003 vl[i__3].r = 0., vl[i__3].i = 0.;
1006 i__2 = ieig + ieig * vl_dim1;
1007 vl[i__2].r = 1., vl[i__2].i = 0.;
1011 /* Non-singular eigenvalue: */
1012 /* Compute coefficients a and b in */
1014 /* y ( a A - b B ) = 0 */
1017 i__2 = je + je * s_dim1;
1018 i__3 = je + je * p_dim1;
1019 d__4 = ((d__2 = s[i__2].r, abs(d__2)) + (d__3 = d_imag(&s[je
1020 + je * s_dim1]), abs(d__3))) * ascale, d__5 = (d__1 =
1021 p[i__3].r, abs(d__1)) * bscale, d__4 = f2cmax(d__4,d__5);
1022 temp = 1. / f2cmax(d__4,safmin);
1023 i__2 = je + je * s_dim1;
1024 z__2.r = temp * s[i__2].r, z__2.i = temp * s[i__2].i;
1025 z__1.r = ascale * z__2.r, z__1.i = ascale * z__2.i;
1026 salpha.r = z__1.r, salpha.i = z__1.i;
1027 i__2 = je + je * p_dim1;
1028 sbeta = temp * p[i__2].r * bscale;
1029 acoeff = sbeta * ascale;
1030 z__1.r = bscale * salpha.r, z__1.i = bscale * salpha.i;
1031 bcoeff.r = z__1.r, bcoeff.i = z__1.i;
1033 /* Scale to avoid underflow */
1035 lsa = abs(sbeta) >= safmin && abs(acoeff) < small;
1036 lsb = (d__1 = salpha.r, abs(d__1)) + (d__2 = d_imag(&salpha),
1037 abs(d__2)) >= safmin && (d__3 = bcoeff.r, abs(d__3))
1038 + (d__4 = d_imag(&bcoeff), abs(d__4)) < small;
1042 scale = small / abs(sbeta) * f2cmin(anorm,big);
1046 d__3 = scale, d__4 = small / ((d__1 = salpha.r, abs(d__1))
1047 + (d__2 = d_imag(&salpha), abs(d__2))) * f2cmin(
1049 scale = f2cmax(d__3,d__4);
1054 d__5 = 1., d__6 = abs(acoeff), d__5 = f2cmax(d__5,d__6),
1055 d__6 = (d__1 = bcoeff.r, abs(d__1)) + (d__2 =
1056 d_imag(&bcoeff), abs(d__2));
1057 d__3 = scale, d__4 = 1. / (safmin * f2cmax(d__5,d__6));
1058 scale = f2cmin(d__3,d__4);
1060 acoeff = ascale * (scale * sbeta);
1062 acoeff = scale * acoeff;
1065 z__2.r = scale * salpha.r, z__2.i = scale * salpha.i;
1066 z__1.r = bscale * z__2.r, z__1.i = bscale * z__2.i;
1067 bcoeff.r = z__1.r, bcoeff.i = z__1.i;
1069 z__1.r = scale * bcoeff.r, z__1.i = scale * bcoeff.i;
1070 bcoeff.r = z__1.r, bcoeff.i = z__1.i;
1074 acoefa = abs(acoeff);
1075 bcoefa = (d__1 = bcoeff.r, abs(d__1)) + (d__2 = d_imag(&
1076 bcoeff), abs(d__2));
1079 for (jr = 1; jr <= i__2; ++jr) {
1081 work[i__3].r = 0., work[i__3].i = 0.;
1085 work[i__2].r = 1., work[i__2].i = 0.;
1087 d__1 = ulp * acoefa * anorm, d__2 = ulp * bcoefa * bnorm,
1088 d__1 = f2cmax(d__1,d__2);
1089 dmin__ = f2cmax(d__1,safmin);
1092 /* Triangular solve of (a A - b B) y = 0 */
1095 /* (rowwise in (a A - b B) , or columnwise in a A - b B) */
1098 for (j = je + 1; j <= i__2; ++j) {
1102 /* SUM = sum conjg( a*S(k,j) - b*P(k,j) )*x(k) */
1104 /* (Scale if necessary) */
1107 if (acoefa * rwork[j] + bcoefa * rwork[*n + j] > bignum *
1110 for (jr = je; jr <= i__3; ++jr) {
1113 z__1.r = temp * work[i__5].r, z__1.i = temp *
1115 work[i__4].r = z__1.r, work[i__4].i = z__1.i;
1120 suma.r = 0., suma.i = 0.;
1121 sumb.r = 0., sumb.i = 0.;
1124 for (jr = je; jr <= i__3; ++jr) {
1125 d_cnjg(&z__3, &s[jr + j * s_dim1]);
1127 z__2.r = z__3.r * work[i__4].r - z__3.i * work[i__4]
1128 .i, z__2.i = z__3.r * work[i__4].i + z__3.i *
1130 z__1.r = suma.r + z__2.r, z__1.i = suma.i + z__2.i;
1131 suma.r = z__1.r, suma.i = z__1.i;
1132 d_cnjg(&z__3, &p[jr + j * p_dim1]);
1134 z__2.r = z__3.r * work[i__4].r - z__3.i * work[i__4]
1135 .i, z__2.i = z__3.r * work[i__4].i + z__3.i *
1137 z__1.r = sumb.r + z__2.r, z__1.i = sumb.i + z__2.i;
1138 sumb.r = z__1.r, sumb.i = z__1.i;
1141 z__2.r = acoeff * suma.r, z__2.i = acoeff * suma.i;
1142 d_cnjg(&z__4, &bcoeff);
1143 z__3.r = z__4.r * sumb.r - z__4.i * sumb.i, z__3.i =
1144 z__4.r * sumb.i + z__4.i * sumb.r;
1145 z__1.r = z__2.r - z__3.r, z__1.i = z__2.i - z__3.i;
1146 sum.r = z__1.r, sum.i = z__1.i;
1148 /* Form x(j) = - SUM / conjg( a*S(j,j) - b*P(j,j) ) */
1150 /* with scaling and perturbation of the denominator */
1152 i__3 = j + j * s_dim1;
1153 z__3.r = acoeff * s[i__3].r, z__3.i = acoeff * s[i__3].i;
1154 i__4 = j + j * p_dim1;
1155 z__4.r = bcoeff.r * p[i__4].r - bcoeff.i * p[i__4].i,
1156 z__4.i = bcoeff.r * p[i__4].i + bcoeff.i * p[i__4]
1158 z__2.r = z__3.r - z__4.r, z__2.i = z__3.i - z__4.i;
1159 d_cnjg(&z__1, &z__2);
1160 d__.r = z__1.r, d__.i = z__1.i;
1161 if ((d__1 = d__.r, abs(d__1)) + (d__2 = d_imag(&d__), abs(
1163 z__1.r = dmin__, z__1.i = 0.;
1164 d__.r = z__1.r, d__.i = z__1.i;
1167 if ((d__1 = d__.r, abs(d__1)) + (d__2 = d_imag(&d__), abs(
1169 if ((d__1 = sum.r, abs(d__1)) + (d__2 = d_imag(&sum),
1170 abs(d__2)) >= bignum * ((d__3 = d__.r, abs(
1171 d__3)) + (d__4 = d_imag(&d__), abs(d__4)))) {
1172 temp = 1. / ((d__1 = sum.r, abs(d__1)) + (d__2 =
1173 d_imag(&sum), abs(d__2)));
1175 for (jr = je; jr <= i__3; ++jr) {
1178 z__1.r = temp * work[i__5].r, z__1.i = temp *
1180 work[i__4].r = z__1.r, work[i__4].i = z__1.i;
1184 z__1.r = temp * sum.r, z__1.i = temp * sum.i;
1185 sum.r = z__1.r, sum.i = z__1.i;
1189 z__2.r = -sum.r, z__2.i = -sum.i;
1190 zladiv_(&z__1, &z__2, &d__);
1191 work[i__3].r = z__1.r, work[i__3].i = z__1.i;
1194 d__3 = xmax, d__4 = (d__1 = work[i__3].r, abs(d__1)) + (
1195 d__2 = d_imag(&work[j]), abs(d__2));
1196 xmax = f2cmax(d__3,d__4);
1200 /* Back transform eigenvector if HOWMNY='B'. */
1204 zgemv_("N", n, &i__2, &c_b2, &vl[je * vl_dim1 + 1], ldvl,
1205 &work[je], &c__1, &c_b1, &work[*n + 1], &c__1);
1213 /* Copy and scale eigenvector into column of VL */
1217 for (jr = ibeg; jr <= i__2; ++jr) {
1219 i__3 = (isrc - 1) * *n + jr;
1220 d__3 = xmax, d__4 = (d__1 = work[i__3].r, abs(d__1)) + (
1221 d__2 = d_imag(&work[(isrc - 1) * *n + jr]), abs(
1223 xmax = f2cmax(d__3,d__4);
1227 if (xmax > safmin) {
1230 for (jr = ibeg; jr <= i__2; ++jr) {
1231 i__3 = jr + ieig * vl_dim1;
1232 i__4 = (isrc - 1) * *n + jr;
1233 z__1.r = temp * work[i__4].r, z__1.i = temp * work[
1235 vl[i__3].r = z__1.r, vl[i__3].i = z__1.i;
1243 for (jr = 1; jr <= i__2; ++jr) {
1244 i__3 = jr + ieig * vl_dim1;
1245 vl[i__3].r = 0., vl[i__3].i = 0.;
1255 /* Right eigenvectors */
1260 /* Main loop over eigenvalues */
1262 for (je = *n; je >= 1; --je) {
1266 ilcomp = select[je];
1271 i__1 = je + je * s_dim1;
1272 i__2 = je + je * p_dim1;
1273 if ((d__2 = s[i__1].r, abs(d__2)) + (d__3 = d_imag(&s[je + je
1274 * s_dim1]), abs(d__3)) <= safmin && (d__1 = p[i__2].r,
1275 abs(d__1)) <= safmin) {
1277 /* Singular matrix pencil -- return unit eigenvector */
1280 for (jr = 1; jr <= i__1; ++jr) {
1281 i__2 = jr + ieig * vr_dim1;
1282 vr[i__2].r = 0., vr[i__2].i = 0.;
1285 i__1 = ieig + ieig * vr_dim1;
1286 vr[i__1].r = 1., vr[i__1].i = 0.;
1290 /* Non-singular eigenvalue: */
1291 /* Compute coefficients a and b in */
1293 /* ( a A - b B ) x = 0 */
1296 i__1 = je + je * s_dim1;
1297 i__2 = je + je * p_dim1;
1298 d__4 = ((d__2 = s[i__1].r, abs(d__2)) + (d__3 = d_imag(&s[je
1299 + je * s_dim1]), abs(d__3))) * ascale, d__5 = (d__1 =
1300 p[i__2].r, abs(d__1)) * bscale, d__4 = f2cmax(d__4,d__5);
1301 temp = 1. / f2cmax(d__4,safmin);
1302 i__1 = je + je * s_dim1;
1303 z__2.r = temp * s[i__1].r, z__2.i = temp * s[i__1].i;
1304 z__1.r = ascale * z__2.r, z__1.i = ascale * z__2.i;
1305 salpha.r = z__1.r, salpha.i = z__1.i;
1306 i__1 = je + je * p_dim1;
1307 sbeta = temp * p[i__1].r * bscale;
1308 acoeff = sbeta * ascale;
1309 z__1.r = bscale * salpha.r, z__1.i = bscale * salpha.i;
1310 bcoeff.r = z__1.r, bcoeff.i = z__1.i;
1312 /* Scale to avoid underflow */
1314 lsa = abs(sbeta) >= safmin && abs(acoeff) < small;
1315 lsb = (d__1 = salpha.r, abs(d__1)) + (d__2 = d_imag(&salpha),
1316 abs(d__2)) >= safmin && (d__3 = bcoeff.r, abs(d__3))
1317 + (d__4 = d_imag(&bcoeff), abs(d__4)) < small;
1321 scale = small / abs(sbeta) * f2cmin(anorm,big);
1325 d__3 = scale, d__4 = small / ((d__1 = salpha.r, abs(d__1))
1326 + (d__2 = d_imag(&salpha), abs(d__2))) * f2cmin(
1328 scale = f2cmax(d__3,d__4);
1333 d__5 = 1., d__6 = abs(acoeff), d__5 = f2cmax(d__5,d__6),
1334 d__6 = (d__1 = bcoeff.r, abs(d__1)) + (d__2 =
1335 d_imag(&bcoeff), abs(d__2));
1336 d__3 = scale, d__4 = 1. / (safmin * f2cmax(d__5,d__6));
1337 scale = f2cmin(d__3,d__4);
1339 acoeff = ascale * (scale * sbeta);
1341 acoeff = scale * acoeff;
1344 z__2.r = scale * salpha.r, z__2.i = scale * salpha.i;
1345 z__1.r = bscale * z__2.r, z__1.i = bscale * z__2.i;
1346 bcoeff.r = z__1.r, bcoeff.i = z__1.i;
1348 z__1.r = scale * bcoeff.r, z__1.i = scale * bcoeff.i;
1349 bcoeff.r = z__1.r, bcoeff.i = z__1.i;
1353 acoefa = abs(acoeff);
1354 bcoefa = (d__1 = bcoeff.r, abs(d__1)) + (d__2 = d_imag(&
1355 bcoeff), abs(d__2));
1358 for (jr = 1; jr <= i__1; ++jr) {
1360 work[i__2].r = 0., work[i__2].i = 0.;
1364 work[i__1].r = 1., work[i__1].i = 0.;
1366 d__1 = ulp * acoefa * anorm, d__2 = ulp * bcoefa * bnorm,
1367 d__1 = f2cmax(d__1,d__2);
1368 dmin__ = f2cmax(d__1,safmin);
1370 /* Triangular solve of (a A - b B) x = 0 (columnwise) */
1372 /* WORK(1:j-1) contains sums w, */
1373 /* WORK(j+1:JE) contains x */
1376 for (jr = 1; jr <= i__1; ++jr) {
1378 i__3 = jr + je * s_dim1;
1379 z__2.r = acoeff * s[i__3].r, z__2.i = acoeff * s[i__3].i;
1380 i__4 = jr + je * p_dim1;
1381 z__3.r = bcoeff.r * p[i__4].r - bcoeff.i * p[i__4].i,
1382 z__3.i = bcoeff.r * p[i__4].i + bcoeff.i * p[i__4]
1384 z__1.r = z__2.r - z__3.r, z__1.i = z__2.i - z__3.i;
1385 work[i__2].r = z__1.r, work[i__2].i = z__1.i;
1389 work[i__1].r = 1., work[i__1].i = 0.;
1391 for (j = je - 1; j >= 1; --j) {
1393 /* Form x(j) := - w(j) / d */
1394 /* with scaling and perturbation of the denominator */
1396 i__1 = j + j * s_dim1;
1397 z__2.r = acoeff * s[i__1].r, z__2.i = acoeff * s[i__1].i;
1398 i__2 = j + j * p_dim1;
1399 z__3.r = bcoeff.r * p[i__2].r - bcoeff.i * p[i__2].i,
1400 z__3.i = bcoeff.r * p[i__2].i + bcoeff.i * p[i__2]
1402 z__1.r = z__2.r - z__3.r, z__1.i = z__2.i - z__3.i;
1403 d__.r = z__1.r, d__.i = z__1.i;
1404 if ((d__1 = d__.r, abs(d__1)) + (d__2 = d_imag(&d__), abs(
1406 z__1.r = dmin__, z__1.i = 0.;
1407 d__.r = z__1.r, d__.i = z__1.i;
1410 if ((d__1 = d__.r, abs(d__1)) + (d__2 = d_imag(&d__), abs(
1413 if ((d__1 = work[i__1].r, abs(d__1)) + (d__2 = d_imag(
1414 &work[j]), abs(d__2)) >= bignum * ((d__3 =
1415 d__.r, abs(d__3)) + (d__4 = d_imag(&d__), abs(
1418 temp = 1. / ((d__1 = work[i__1].r, abs(d__1)) + (
1419 d__2 = d_imag(&work[j]), abs(d__2)));
1421 for (jr = 1; jr <= i__1; ++jr) {
1424 z__1.r = temp * work[i__3].r, z__1.i = temp *
1426 work[i__2].r = z__1.r, work[i__2].i = z__1.i;
1434 z__2.r = -work[i__2].r, z__2.i = -work[i__2].i;
1435 zladiv_(&z__1, &z__2, &d__);
1436 work[i__1].r = z__1.r, work[i__1].i = z__1.i;
1440 /* w = w + x(j)*(a S(*,j) - b P(*,j) ) with scaling */
1443 if ((d__1 = work[i__1].r, abs(d__1)) + (d__2 = d_imag(
1444 &work[j]), abs(d__2)) > 1.) {
1446 temp = 1. / ((d__1 = work[i__1].r, abs(d__1)) + (
1447 d__2 = d_imag(&work[j]), abs(d__2)));
1448 if (acoefa * rwork[j] + bcoefa * rwork[*n + j] >=
1451 for (jr = 1; jr <= i__1; ++jr) {
1454 z__1.r = temp * work[i__3].r, z__1.i =
1455 temp * work[i__3].i;
1456 work[i__2].r = z__1.r, work[i__2].i =
1464 z__1.r = acoeff * work[i__1].r, z__1.i = acoeff *
1466 ca.r = z__1.r, ca.i = z__1.i;
1468 z__1.r = bcoeff.r * work[i__1].r - bcoeff.i * work[
1469 i__1].i, z__1.i = bcoeff.r * work[i__1].i +
1470 bcoeff.i * work[i__1].r;
1471 cb.r = z__1.r, cb.i = z__1.i;
1473 for (jr = 1; jr <= i__1; ++jr) {
1476 i__4 = jr + j * s_dim1;
1477 z__3.r = ca.r * s[i__4].r - ca.i * s[i__4].i,
1478 z__3.i = ca.r * s[i__4].i + ca.i * s[i__4]
1480 z__2.r = work[i__3].r + z__3.r, z__2.i = work[
1482 i__5 = jr + j * p_dim1;
1483 z__4.r = cb.r * p[i__5].r - cb.i * p[i__5].i,
1484 z__4.i = cb.r * p[i__5].i + cb.i * p[i__5]
1486 z__1.r = z__2.r - z__4.r, z__1.i = z__2.i -
1488 work[i__2].r = z__1.r, work[i__2].i = z__1.i;
1495 /* Back transform eigenvector if HOWMNY='B'. */
1498 zgemv_("N", n, &je, &c_b2, &vr[vr_offset], ldvr, &work[1],
1499 &c__1, &c_b1, &work[*n + 1], &c__1);
1507 /* Copy and scale eigenvector into column of VR */
1511 for (jr = 1; jr <= i__1; ++jr) {
1513 i__2 = (isrc - 1) * *n + jr;
1514 d__3 = xmax, d__4 = (d__1 = work[i__2].r, abs(d__1)) + (
1515 d__2 = d_imag(&work[(isrc - 1) * *n + jr]), abs(
1517 xmax = f2cmax(d__3,d__4);
1521 if (xmax > safmin) {
1524 for (jr = 1; jr <= i__1; ++jr) {
1525 i__2 = jr + ieig * vr_dim1;
1526 i__3 = (isrc - 1) * *n + jr;
1527 z__1.r = temp * work[i__3].r, z__1.i = temp * work[
1529 vr[i__2].r = z__1.r, vr[i__2].i = z__1.i;
1537 for (jr = iend + 1; jr <= i__1; ++jr) {
1538 i__2 = jr + ieig * vr_dim1;
1539 vr[i__2].r = 0., vr[i__2].i = 0.;