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 integer c__1 = 1;
517 /* > \brief \b ZLAEIN computes a specified right or left eigenvector of an upper Hessenberg matrix by inverse
520 /* =========== DOCUMENTATION =========== */
522 /* Online html documentation available at */
523 /* http://www.netlib.org/lapack/explore-html/ */
526 /* > Download ZLAEIN + dependencies */
527 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zlaein.
530 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zlaein.
533 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zlaein.
541 /* SUBROUTINE ZLAEIN( RIGHTV, NOINIT, N, H, LDH, W, V, B, LDB, RWORK, */
542 /* EPS3, SMLNUM, INFO ) */
544 /* LOGICAL NOINIT, RIGHTV */
545 /* INTEGER INFO, LDB, LDH, N */
546 /* DOUBLE PRECISION EPS3, SMLNUM */
548 /* DOUBLE PRECISION RWORK( * ) */
549 /* COMPLEX*16 B( LDB, * ), H( LDH, * ), V( * ) */
552 /* > \par Purpose: */
557 /* > ZLAEIN uses inverse iteration to find a right or left eigenvector */
558 /* > corresponding to the eigenvalue W of a complex upper Hessenberg */
565 /* > \param[in] RIGHTV */
567 /* > RIGHTV is LOGICAL */
568 /* > = .TRUE. : compute right eigenvector; */
569 /* > = .FALSE.: compute left eigenvector. */
572 /* > \param[in] NOINIT */
574 /* > NOINIT is LOGICAL */
575 /* > = .TRUE. : no initial vector supplied in V */
576 /* > = .FALSE.: initial vector supplied in V. */
582 /* > The order of the matrix H. N >= 0. */
587 /* > H is COMPLEX*16 array, dimension (LDH,N) */
588 /* > The upper Hessenberg matrix H. */
591 /* > \param[in] LDH */
593 /* > LDH is INTEGER */
594 /* > The leading dimension of the array H. LDH >= f2cmax(1,N). */
599 /* > W is COMPLEX*16 */
600 /* > The eigenvalue of H whose corresponding right or left */
601 /* > eigenvector is to be computed. */
604 /* > \param[in,out] V */
606 /* > V is COMPLEX*16 array, dimension (N) */
607 /* > On entry, if NOINIT = .FALSE., V must contain a starting */
608 /* > vector for inverse iteration; otherwise V need not be set. */
609 /* > On exit, V contains the computed eigenvector, normalized so */
610 /* > that the component of largest magnitude has magnitude 1; here */
611 /* > the magnitude of a complex number (x,y) is taken to be */
615 /* > \param[out] B */
617 /* > B is COMPLEX*16 array, dimension (LDB,N) */
620 /* > \param[in] LDB */
622 /* > LDB is INTEGER */
623 /* > The leading dimension of the array B. LDB >= f2cmax(1,N). */
626 /* > \param[out] RWORK */
628 /* > RWORK is DOUBLE PRECISION array, dimension (N) */
631 /* > \param[in] EPS3 */
633 /* > EPS3 is DOUBLE PRECISION */
634 /* > A small machine-dependent value which is used to perturb */
635 /* > close eigenvalues, and to replace zero pivots. */
638 /* > \param[in] SMLNUM */
640 /* > SMLNUM is DOUBLE PRECISION */
641 /* > A machine-dependent value close to the underflow threshold. */
644 /* > \param[out] INFO */
646 /* > INFO is INTEGER */
647 /* > = 0: successful exit */
648 /* > = 1: inverse iteration did not converge; V is set to the */
649 /* > last iterate. */
655 /* > \author Univ. of Tennessee */
656 /* > \author Univ. of California Berkeley */
657 /* > \author Univ. of Colorado Denver */
658 /* > \author NAG Ltd. */
660 /* > \date December 2016 */
662 /* > \ingroup complex16OTHERauxiliary */
664 /* ===================================================================== */
665 /* Subroutine */ int zlaein_(logical *rightv, logical *noinit, integer *n,
666 doublecomplex *h__, integer *ldh, doublecomplex *w, doublecomplex *v,
667 doublecomplex *b, integer *ldb, doublereal *rwork, doublereal *eps3,
668 doublereal *smlnum, integer *info)
670 /* System generated locals */
671 integer b_dim1, b_offset, h_dim1, h_offset, i__1, i__2, i__3, i__4, i__5;
672 doublereal d__1, d__2, d__3, d__4;
673 doublecomplex z__1, z__2;
675 /* Local variables */
682 doublereal rtemp, rootn, vnorm;
683 extern doublereal dznrm2_(integer *, doublecomplex *, integer *);
684 doublecomplex ei, ej;
685 extern /* Subroutine */ int zdscal_(integer *, doublereal *,
686 doublecomplex *, integer *);
687 extern integer izamax_(integer *, doublecomplex *, integer *);
688 extern /* Double Complex */ VOID zladiv_(doublecomplex *, doublecomplex *,
691 extern doublereal dzasum_(integer *, doublecomplex *, integer *);
693 extern /* Subroutine */ int zlatrs_(char *, char *, char *, char *,
694 integer *, doublecomplex *, integer *, doublecomplex *,
695 doublereal *, doublereal *, integer *);
700 /* -- LAPACK auxiliary routine (version 3.7.0) -- */
701 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
702 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
706 /* ===================================================================== */
709 /* Parameter adjustments */
711 h_offset = 1 + h_dim1 * 1;
715 b_offset = 1 + b_dim1 * 1;
722 /* GROWTO is the threshold used in the acceptance test for an */
725 rootn = sqrt((doublereal) (*n));
728 d__1 = 1., d__2 = *eps3 * rootn;
729 nrmsml = f2cmax(d__1,d__2) * *smlnum;
731 /* Form B = H - W*I (except that the subdiagonal elements are not */
735 for (j = 1; j <= i__1; ++j) {
737 for (i__ = 1; i__ <= i__2; ++i__) {
738 i__3 = i__ + j * b_dim1;
739 i__4 = i__ + j * h_dim1;
740 b[i__3].r = h__[i__4].r, b[i__3].i = h__[i__4].i;
743 i__2 = j + j * b_dim1;
744 i__3 = j + j * h_dim1;
745 z__1.r = h__[i__3].r - w->r, z__1.i = h__[i__3].i - w->i;
746 b[i__2].r = z__1.r, b[i__2].i = z__1.i;
755 for (i__ = 1; i__ <= i__1; ++i__) {
757 v[i__2].r = *eps3, v[i__2].i = 0.;
762 /* Scale supplied initial vector. */
764 vnorm = dznrm2_(n, &v[1], &c__1);
765 d__1 = *eps3 * rootn / f2cmax(vnorm,nrmsml);
766 zdscal_(n, &d__1, &v[1], &c__1);
771 /* LU decomposition with partial pivoting of B, replacing zero */
772 /* pivots by EPS3. */
775 for (i__ = 1; i__ <= i__1; ++i__) {
776 i__2 = i__ + 1 + i__ * h_dim1;
777 ei.r = h__[i__2].r, ei.i = h__[i__2].i;
778 i__2 = i__ + i__ * b_dim1;
779 if ((d__1 = b[i__2].r, abs(d__1)) + (d__2 = d_imag(&b[i__ + i__ *
780 b_dim1]), abs(d__2)) < (d__3 = ei.r, abs(d__3)) + (d__4 =
781 d_imag(&ei), abs(d__4))) {
783 /* Interchange rows and eliminate. */
785 zladiv_(&z__1, &b[i__ + i__ * b_dim1], &ei);
786 x.r = z__1.r, x.i = z__1.i;
787 i__2 = i__ + i__ * b_dim1;
788 b[i__2].r = ei.r, b[i__2].i = ei.i;
790 for (j = i__ + 1; j <= i__2; ++j) {
791 i__3 = i__ + 1 + j * b_dim1;
792 temp.r = b[i__3].r, temp.i = b[i__3].i;
793 i__3 = i__ + 1 + j * b_dim1;
794 i__4 = i__ + j * b_dim1;
795 z__2.r = x.r * temp.r - x.i * temp.i, z__2.i = x.r *
796 temp.i + x.i * temp.r;
797 z__1.r = b[i__4].r - z__2.r, z__1.i = b[i__4].i - z__2.i;
798 b[i__3].r = z__1.r, b[i__3].i = z__1.i;
799 i__3 = i__ + j * b_dim1;
800 b[i__3].r = temp.r, b[i__3].i = temp.i;
805 /* Eliminate without interchange. */
807 i__2 = i__ + i__ * b_dim1;
808 if (b[i__2].r == 0. && b[i__2].i == 0.) {
809 i__3 = i__ + i__ * b_dim1;
810 b[i__3].r = *eps3, b[i__3].i = 0.;
812 zladiv_(&z__1, &ei, &b[i__ + i__ * b_dim1]);
813 x.r = z__1.r, x.i = z__1.i;
814 if (x.r != 0. || x.i != 0.) {
816 for (j = i__ + 1; j <= i__2; ++j) {
817 i__3 = i__ + 1 + j * b_dim1;
818 i__4 = i__ + 1 + j * b_dim1;
819 i__5 = i__ + j * b_dim1;
820 z__2.r = x.r * b[i__5].r - x.i * b[i__5].i, z__2.i =
821 x.r * b[i__5].i + x.i * b[i__5].r;
822 z__1.r = b[i__4].r - z__2.r, z__1.i = b[i__4].i -
824 b[i__3].r = z__1.r, b[i__3].i = z__1.i;
831 i__1 = *n + *n * b_dim1;
832 if (b[i__1].r == 0. && b[i__1].i == 0.) {
833 i__2 = *n + *n * b_dim1;
834 b[i__2].r = *eps3, b[i__2].i = 0.;
837 *(unsigned char *)trans = 'N';
841 /* UL decomposition with partial pivoting of B, replacing zero */
842 /* pivots by EPS3. */
844 for (j = *n; j >= 2; --j) {
845 i__1 = j + (j - 1) * h_dim1;
846 ej.r = h__[i__1].r, ej.i = h__[i__1].i;
847 i__1 = j + j * b_dim1;
848 if ((d__1 = b[i__1].r, abs(d__1)) + (d__2 = d_imag(&b[j + j *
849 b_dim1]), abs(d__2)) < (d__3 = ej.r, abs(d__3)) + (d__4 =
850 d_imag(&ej), abs(d__4))) {
852 /* Interchange columns and eliminate. */
854 zladiv_(&z__1, &b[j + j * b_dim1], &ej);
855 x.r = z__1.r, x.i = z__1.i;
856 i__1 = j + j * b_dim1;
857 b[i__1].r = ej.r, b[i__1].i = ej.i;
859 for (i__ = 1; i__ <= i__1; ++i__) {
860 i__2 = i__ + (j - 1) * b_dim1;
861 temp.r = b[i__2].r, temp.i = b[i__2].i;
862 i__2 = i__ + (j - 1) * b_dim1;
863 i__3 = i__ + j * b_dim1;
864 z__2.r = x.r * temp.r - x.i * temp.i, z__2.i = x.r *
865 temp.i + x.i * temp.r;
866 z__1.r = b[i__3].r - z__2.r, z__1.i = b[i__3].i - z__2.i;
867 b[i__2].r = z__1.r, b[i__2].i = z__1.i;
868 i__2 = i__ + j * b_dim1;
869 b[i__2].r = temp.r, b[i__2].i = temp.i;
874 /* Eliminate without interchange. */
876 i__1 = j + j * b_dim1;
877 if (b[i__1].r == 0. && b[i__1].i == 0.) {
878 i__2 = j + j * b_dim1;
879 b[i__2].r = *eps3, b[i__2].i = 0.;
881 zladiv_(&z__1, &ej, &b[j + j * b_dim1]);
882 x.r = z__1.r, x.i = z__1.i;
883 if (x.r != 0. || x.i != 0.) {
885 for (i__ = 1; i__ <= i__1; ++i__) {
886 i__2 = i__ + (j - 1) * b_dim1;
887 i__3 = i__ + (j - 1) * b_dim1;
888 i__4 = i__ + j * b_dim1;
889 z__2.r = x.r * b[i__4].r - x.i * b[i__4].i, z__2.i =
890 x.r * b[i__4].i + x.i * b[i__4].r;
891 z__1.r = b[i__3].r - z__2.r, z__1.i = b[i__3].i -
893 b[i__2].r = z__1.r, b[i__2].i = z__1.i;
901 if (b[i__1].r == 0. && b[i__1].i == 0.) {
903 b[i__2].r = *eps3, b[i__2].i = 0.;
906 *(unsigned char *)trans = 'C';
910 *(unsigned char *)normin = 'N';
912 for (its = 1; its <= i__1; ++its) {
914 /* Solve U*x = scale*v for a right eigenvector */
915 /* or U**H *x = scale*v for a left eigenvector, */
916 /* overwriting x on v. */
918 zlatrs_("Upper", trans, "Nonunit", normin, n, &b[b_offset], ldb, &v[1]
919 , &scale, &rwork[1], &ierr);
920 *(unsigned char *)normin = 'Y';
922 /* Test for sufficient growth in the norm of v. */
924 vnorm = dzasum_(n, &v[1], &c__1);
925 if (vnorm >= growto * scale) {
929 /* Choose new orthogonal starting vector and try again. */
931 rtemp = *eps3 / (rootn + 1.);
932 v[1].r = *eps3, v[1].i = 0.;
934 for (i__ = 2; i__ <= i__2; ++i__) {
936 v[i__3].r = rtemp, v[i__3].i = 0.;
941 d__1 = *eps3 * rootn;
942 z__1.r = v[i__3].r - d__1, z__1.i = v[i__3].i;
943 v[i__2].r = z__1.r, v[i__2].i = z__1.i;
947 /* Failure to find eigenvector in N iterations. */
953 /* Normalize eigenvector. */
955 i__ = izamax_(n, &v[1], &c__1);
957 d__3 = 1. / ((d__1 = v[i__1].r, abs(d__1)) + (d__2 = d_imag(&v[i__]), abs(
959 zdscal_(n, &d__3, &v[1], &c__1);