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 integer c__1 = 1;
517 /* > \brief \b SLAEIN 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 SLAEIN + dependencies */
527 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/slaein.
530 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/slaein.
533 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/slaein.
541 /* SUBROUTINE SLAEIN( RIGHTV, NOINIT, N, H, LDH, WR, WI, VR, VI, B, */
542 /* LDB, WORK, EPS3, SMLNUM, BIGNUM, INFO ) */
544 /* LOGICAL NOINIT, RIGHTV */
545 /* INTEGER INFO, LDB, LDH, N */
546 /* REAL BIGNUM, EPS3, SMLNUM, WI, WR */
547 /* REAL B( LDB, * ), H( LDH, * ), VI( * ), VR( * ), */
551 /* > \par Purpose: */
556 /* > SLAEIN uses inverse iteration to find a right or left eigenvector */
557 /* > corresponding to the eigenvalue (WR,WI) of a real upper Hessenberg */
564 /* > \param[in] RIGHTV */
566 /* > RIGHTV is LOGICAL */
567 /* > = .TRUE. : compute right eigenvector; */
568 /* > = .FALSE.: compute left eigenvector. */
571 /* > \param[in] NOINIT */
573 /* > NOINIT is LOGICAL */
574 /* > = .TRUE. : no initial vector supplied in (VR,VI). */
575 /* > = .FALSE.: initial vector supplied in (VR,VI). */
581 /* > The order of the matrix H. N >= 0. */
586 /* > H is REAL array, dimension (LDH,N) */
587 /* > The upper Hessenberg matrix H. */
590 /* > \param[in] LDH */
592 /* > LDH is INTEGER */
593 /* > The leading dimension of the array H. LDH >= f2cmax(1,N). */
596 /* > \param[in] WR */
601 /* > \param[in] WI */
604 /* > The real and imaginary parts of the eigenvalue of H whose */
605 /* > corresponding right or left eigenvector is to be computed. */
608 /* > \param[in,out] VR */
610 /* > VR is REAL array, dimension (N) */
613 /* > \param[in,out] VI */
615 /* > VI is REAL array, dimension (N) */
616 /* > On entry, if NOINIT = .FALSE. and WI = 0.0, VR must contain */
617 /* > a real starting vector for inverse iteration using the real */
618 /* > eigenvalue WR; if NOINIT = .FALSE. and WI.ne.0.0, VR and VI */
619 /* > must contain the real and imaginary parts of a complex */
620 /* > starting vector for inverse iteration using the complex */
621 /* > eigenvalue (WR,WI); otherwise VR and VI need not be set. */
622 /* > On exit, if WI = 0.0 (real eigenvalue), VR contains the */
623 /* > computed real eigenvector; if WI.ne.0.0 (complex eigenvalue), */
624 /* > VR and VI contain the real and imaginary parts of the */
625 /* > computed complex eigenvector. The eigenvector is normalized */
626 /* > so that the component of largest magnitude has magnitude 1; */
627 /* > here the magnitude of a complex number (x,y) is taken to be */
629 /* > VI is not referenced if WI = 0.0. */
632 /* > \param[out] B */
634 /* > B is REAL array, dimension (LDB,N) */
637 /* > \param[in] LDB */
639 /* > LDB is INTEGER */
640 /* > The leading dimension of the array B. LDB >= N+1. */
643 /* > \param[out] WORK */
645 /* > WORK is REAL array, dimension (N) */
648 /* > \param[in] EPS3 */
651 /* > A small machine-dependent value which is used to perturb */
652 /* > close eigenvalues, and to replace zero pivots. */
655 /* > \param[in] SMLNUM */
657 /* > SMLNUM is REAL */
658 /* > A machine-dependent value close to the underflow threshold. */
661 /* > \param[in] BIGNUM */
663 /* > BIGNUM is REAL */
664 /* > A machine-dependent value close to the overflow threshold. */
667 /* > \param[out] INFO */
669 /* > INFO is INTEGER */
670 /* > = 0: successful exit */
671 /* > = 1: inverse iteration did not converge; VR is set to the */
672 /* > last iterate, and so is VI if WI.ne.0.0. */
678 /* > \author Univ. of Tennessee */
679 /* > \author Univ. of California Berkeley */
680 /* > \author Univ. of Colorado Denver */
681 /* > \author NAG Ltd. */
683 /* > \date December 2016 */
685 /* > \ingroup realOTHERauxiliary */
687 /* ===================================================================== */
688 /* Subroutine */ int slaein_(logical *rightv, logical *noinit, integer *n,
689 real *h__, integer *ldh, real *wr, real *wi, real *vr, real *vi, real
690 *b, integer *ldb, real *work, real *eps3, real *smlnum, real *bignum,
693 /* System generated locals */
694 integer b_dim1, b_offset, h_dim1, h_offset, i__1, i__2, i__3, i__4;
695 real r__1, r__2, r__3, r__4;
697 /* Local variables */
699 real temp, norm, vmax;
700 extern real snrm2_(integer *, real *, integer *);
703 extern /* Subroutine */ int sscal_(integer *, real *, real *, integer *);
706 extern real sasum_(integer *, real *, integer *);
708 real rootn, vnorm, w1;
709 extern real slapy2_(real *, real *);
710 real ei, ej, absbii, absbjj, xi, xr;
711 extern integer isamax_(integer *, real *, integer *);
712 extern /* Subroutine */ int sladiv_(real *, real *, real *, real *, real *
716 extern /* Subroutine */ int slatrs_(char *, char *, char *, char *,
717 integer *, real *, integer *, real *, real *, real *, integer *);
722 /* -- LAPACK auxiliary routine (version 3.7.0) -- */
723 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
724 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
728 /* ===================================================================== */
731 /* Parameter adjustments */
733 h_offset = 1 + h_dim1 * 1;
738 b_offset = 1 + b_dim1 * 1;
745 /* GROWTO is the threshold used in the acceptance test for an */
748 rootn = sqrt((real) (*n));
749 growto = .1f / rootn;
751 r__1 = 1.f, r__2 = *eps3 * rootn;
752 nrmsml = f2cmax(r__1,r__2) * *smlnum;
754 /* Form B = H - (WR,WI)*I (except that the subdiagonal elements and */
755 /* the imaginary parts of the diagonal elements are not stored). */
758 for (j = 1; j <= i__1; ++j) {
760 for (i__ = 1; i__ <= i__2; ++i__) {
761 b[i__ + j * b_dim1] = h__[i__ + j * h_dim1];
764 b[j + j * b_dim1] = h__[j + j * h_dim1] - *wr;
770 /* Real eigenvalue. */
774 /* Set initial vector. */
777 for (i__ = 1; i__ <= i__1; ++i__) {
783 /* Scale supplied initial vector. */
785 vnorm = snrm2_(n, &vr[1], &c__1);
786 r__1 = *eps3 * rootn / f2cmax(vnorm,nrmsml);
787 sscal_(n, &r__1, &vr[1], &c__1);
792 /* LU decomposition with partial pivoting of B, replacing zero */
793 /* pivots by EPS3. */
796 for (i__ = 1; i__ <= i__1; ++i__) {
797 ei = h__[i__ + 1 + i__ * h_dim1];
798 if ((r__1 = b[i__ + i__ * b_dim1], abs(r__1)) < abs(ei)) {
800 /* Interchange rows and eliminate. */
802 x = b[i__ + i__ * b_dim1] / ei;
803 b[i__ + i__ * b_dim1] = ei;
805 for (j = i__ + 1; j <= i__2; ++j) {
806 temp = b[i__ + 1 + j * b_dim1];
807 b[i__ + 1 + j * b_dim1] = b[i__ + j * b_dim1] - x *
809 b[i__ + j * b_dim1] = temp;
814 /* Eliminate without interchange. */
816 if (b[i__ + i__ * b_dim1] == 0.f) {
817 b[i__ + i__ * b_dim1] = *eps3;
819 x = ei / b[i__ + i__ * b_dim1];
822 for (j = i__ + 1; j <= i__2; ++j) {
823 b[i__ + 1 + j * b_dim1] -= x * b[i__ + j * b_dim1]
831 if (b[*n + *n * b_dim1] == 0.f) {
832 b[*n + *n * b_dim1] = *eps3;
835 *(unsigned char *)trans = 'N';
839 /* UL decomposition with partial pivoting of B, replacing zero */
840 /* pivots by EPS3. */
842 for (j = *n; j >= 2; --j) {
843 ej = h__[j + (j - 1) * h_dim1];
844 if ((r__1 = b[j + j * b_dim1], abs(r__1)) < abs(ej)) {
846 /* Interchange columns and eliminate. */
848 x = b[j + j * b_dim1] / ej;
849 b[j + j * b_dim1] = ej;
851 for (i__ = 1; i__ <= i__1; ++i__) {
852 temp = b[i__ + (j - 1) * b_dim1];
853 b[i__ + (j - 1) * b_dim1] = b[i__ + j * b_dim1] - x *
855 b[i__ + j * b_dim1] = temp;
860 /* Eliminate without interchange. */
862 if (b[j + j * b_dim1] == 0.f) {
863 b[j + j * b_dim1] = *eps3;
865 x = ej / b[j + j * b_dim1];
868 for (i__ = 1; i__ <= i__1; ++i__) {
869 b[i__ + (j - 1) * b_dim1] -= x * b[i__ + j *
877 if (b[b_dim1 + 1] == 0.f) {
878 b[b_dim1 + 1] = *eps3;
881 *(unsigned char *)trans = 'T';
885 *(unsigned char *)normin = 'N';
887 for (its = 1; its <= i__1; ++its) {
889 /* Solve U*x = scale*v for a right eigenvector */
890 /* or U**T*x = scale*v for a left eigenvector, */
891 /* overwriting x on v. */
893 slatrs_("Upper", trans, "Nonunit", normin, n, &b[b_offset], ldb, &
894 vr[1], &scale, &work[1], &ierr);
895 *(unsigned char *)normin = 'Y';
897 /* Test for sufficient growth in the norm of v. */
899 vnorm = sasum_(n, &vr[1], &c__1);
900 if (vnorm >= growto * scale) {
904 /* Choose new orthogonal starting vector and try again. */
906 temp = *eps3 / (rootn + 1.f);
909 for (i__ = 2; i__ <= i__2; ++i__) {
913 vr[*n - its + 1] -= *eps3 * rootn;
917 /* Failure to find eigenvector in N iterations. */
923 /* Normalize eigenvector. */
925 i__ = isamax_(n, &vr[1], &c__1);
926 r__2 = 1.f / (r__1 = vr[i__], abs(r__1));
927 sscal_(n, &r__2, &vr[1], &c__1);
930 /* Complex eigenvalue. */
934 /* Set initial vector. */
937 for (i__ = 1; i__ <= i__1; ++i__) {
944 /* Scale supplied initial vector. */
946 r__1 = snrm2_(n, &vr[1], &c__1);
947 r__2 = snrm2_(n, &vi[1], &c__1);
948 norm = slapy2_(&r__1, &r__2);
949 rec = *eps3 * rootn / f2cmax(norm,nrmsml);
950 sscal_(n, &rec, &vr[1], &c__1);
951 sscal_(n, &rec, &vi[1], &c__1);
956 /* LU decomposition with partial pivoting of B, replacing zero */
957 /* pivots by EPS3. */
959 /* The imaginary part of the (i,j)-th element of U is stored in */
962 b[b_dim1 + 2] = -(*wi);
964 for (i__ = 2; i__ <= i__1; ++i__) {
965 b[i__ + 1 + b_dim1] = 0.f;
970 for (i__ = 1; i__ <= i__1; ++i__) {
971 absbii = slapy2_(&b[i__ + i__ * b_dim1], &b[i__ + 1 + i__ *
973 ei = h__[i__ + 1 + i__ * h_dim1];
974 if (absbii < abs(ei)) {
976 /* Interchange rows and eliminate. */
978 xr = b[i__ + i__ * b_dim1] / ei;
979 xi = b[i__ + 1 + i__ * b_dim1] / ei;
980 b[i__ + i__ * b_dim1] = ei;
981 b[i__ + 1 + i__ * b_dim1] = 0.f;
983 for (j = i__ + 1; j <= i__2; ++j) {
984 temp = b[i__ + 1 + j * b_dim1];
985 b[i__ + 1 + j * b_dim1] = b[i__ + j * b_dim1] - xr *
987 b[j + 1 + (i__ + 1) * b_dim1] = b[j + 1 + i__ *
989 b[i__ + j * b_dim1] = temp;
990 b[j + 1 + i__ * b_dim1] = 0.f;
993 b[i__ + 2 + i__ * b_dim1] = -(*wi);
994 b[i__ + 1 + (i__ + 1) * b_dim1] -= xi * *wi;
995 b[i__ + 2 + (i__ + 1) * b_dim1] += xr * *wi;
998 /* Eliminate without interchanging rows. */
1000 if (absbii == 0.f) {
1001 b[i__ + i__ * b_dim1] = *eps3;
1002 b[i__ + 1 + i__ * b_dim1] = 0.f;
1005 ei = ei / absbii / absbii;
1006 xr = b[i__ + i__ * b_dim1] * ei;
1007 xi = -b[i__ + 1 + i__ * b_dim1] * ei;
1009 for (j = i__ + 1; j <= i__2; ++j) {
1010 b[i__ + 1 + j * b_dim1] = b[i__ + 1 + j * b_dim1] -
1011 xr * b[i__ + j * b_dim1] + xi * b[j + 1 + i__
1013 b[j + 1 + (i__ + 1) * b_dim1] = -xr * b[j + 1 + i__ *
1014 b_dim1] - xi * b[i__ + j * b_dim1];
1017 b[i__ + 2 + (i__ + 1) * b_dim1] -= *wi;
1020 /* Compute 1-norm of offdiagonal elements of i-th row. */
1024 work[i__] = sasum_(&i__2, &b[i__ + (i__ + 1) * b_dim1], ldb)
1025 + sasum_(&i__3, &b[i__ + 2 + i__ * b_dim1], &c__1);
1028 if (b[*n + *n * b_dim1] == 0.f && b[*n + 1 + *n * b_dim1] == 0.f)
1030 b[*n + *n * b_dim1] = *eps3;
1039 /* UL decomposition with partial pivoting of conjg(B), */
1040 /* replacing zero pivots by EPS3. */
1042 /* The imaginary part of the (i,j)-th element of U is stored in */
1045 b[*n + 1 + *n * b_dim1] = *wi;
1047 for (j = 1; j <= i__1; ++j) {
1048 b[*n + 1 + j * b_dim1] = 0.f;
1052 for (j = *n; j >= 2; --j) {
1053 ej = h__[j + (j - 1) * h_dim1];
1054 absbjj = slapy2_(&b[j + j * b_dim1], &b[j + 1 + j * b_dim1]);
1055 if (absbjj < abs(ej)) {
1057 /* Interchange columns and eliminate */
1059 xr = b[j + j * b_dim1] / ej;
1060 xi = b[j + 1 + j * b_dim1] / ej;
1061 b[j + j * b_dim1] = ej;
1062 b[j + 1 + j * b_dim1] = 0.f;
1064 for (i__ = 1; i__ <= i__1; ++i__) {
1065 temp = b[i__ + (j - 1) * b_dim1];
1066 b[i__ + (j - 1) * b_dim1] = b[i__ + j * b_dim1] - xr *
1068 b[j + i__ * b_dim1] = b[j + 1 + i__ * b_dim1] - xi *
1070 b[i__ + j * b_dim1] = temp;
1071 b[j + 1 + i__ * b_dim1] = 0.f;
1074 b[j + 1 + (j - 1) * b_dim1] = *wi;
1075 b[j - 1 + (j - 1) * b_dim1] += xi * *wi;
1076 b[j + (j - 1) * b_dim1] -= xr * *wi;
1079 /* Eliminate without interchange. */
1081 if (absbjj == 0.f) {
1082 b[j + j * b_dim1] = *eps3;
1083 b[j + 1 + j * b_dim1] = 0.f;
1086 ej = ej / absbjj / absbjj;
1087 xr = b[j + j * b_dim1] * ej;
1088 xi = -b[j + 1 + j * b_dim1] * ej;
1090 for (i__ = 1; i__ <= i__1; ++i__) {
1091 b[i__ + (j - 1) * b_dim1] = b[i__ + (j - 1) * b_dim1]
1092 - xr * b[i__ + j * b_dim1] + xi * b[j + 1 +
1094 b[j + i__ * b_dim1] = -xr * b[j + 1 + i__ * b_dim1] -
1095 xi * b[i__ + j * b_dim1];
1098 b[j + (j - 1) * b_dim1] += *wi;
1101 /* Compute 1-norm of offdiagonal elements of j-th column. */
1105 work[j] = sasum_(&i__1, &b[j * b_dim1 + 1], &c__1) + sasum_(&
1106 i__2, &b[j + 1 + b_dim1], ldb);
1109 if (b[b_dim1 + 1] == 0.f && b[b_dim1 + 2] == 0.f) {
1110 b[b_dim1 + 1] = *eps3;
1120 for (its = 1; its <= i__1; ++its) {
1125 /* Solve U*(xr,xi) = scale*(vr,vi) for a right eigenvector, */
1126 /* or U**T*(xr,xi) = scale*(vr,vi) for a left eigenvector, */
1127 /* overwriting (xr,xi) on (vr,vi). */
1131 for (i__ = i1; i__3 < 0 ? i__ >= i__2 : i__ <= i__2; i__ += i__3)
1134 if (work[i__] > vcrit) {
1136 sscal_(n, &rec, &vr[1], &c__1);
1137 sscal_(n, &rec, &vi[1], &c__1);
1147 for (j = i__ + 1; j <= i__4; ++j) {
1148 xr = xr - b[i__ + j * b_dim1] * vr[j] + b[j + 1 + i__
1150 xi = xi - b[i__ + j * b_dim1] * vi[j] - b[j + 1 + i__
1156 for (j = 1; j <= i__4; ++j) {
1157 xr = xr - b[j + i__ * b_dim1] * vr[j] + b[i__ + 1 + j
1159 xi = xi - b[j + i__ * b_dim1] * vi[j] - b[i__ + 1 + j
1165 w = (r__1 = b[i__ + i__ * b_dim1], abs(r__1)) + (r__2 = b[i__
1166 + 1 + i__ * b_dim1], abs(r__2));
1169 w1 = abs(xr) + abs(xi);
1170 if (w1 > w * *bignum) {
1172 sscal_(n, &rec, &vr[1], &c__1);
1173 sscal_(n, &rec, &vi[1], &c__1);
1181 /* Divide by diagonal element of B. */
1183 sladiv_(&xr, &xi, &b[i__ + i__ * b_dim1], &b[i__ + 1 +
1184 i__ * b_dim1], &vr[i__], &vi[i__]);
1186 r__3 = (r__1 = vr[i__], abs(r__1)) + (r__2 = vi[i__], abs(
1188 vmax = f2cmax(r__3,vmax);
1189 vcrit = *bignum / vmax;
1192 for (j = 1; j <= i__4; ++j) {
1206 /* Test for sufficient growth in the norm of (VR,VI). */
1208 vnorm = sasum_(n, &vr[1], &c__1) + sasum_(n, &vi[1], &c__1);
1209 if (vnorm >= growto * scale) {
1213 /* Choose a new orthogonal starting vector and try again. */
1215 y = *eps3 / (rootn + 1.f);
1220 for (i__ = 2; i__ <= i__3; ++i__) {
1225 vr[*n - its + 1] -= *eps3 * rootn;
1229 /* Failure to find eigenvector in N iterations */
1235 /* Normalize eigenvector. */
1239 for (i__ = 1; i__ <= i__1; ++i__) {
1241 r__3 = vnorm, r__4 = (r__1 = vr[i__], abs(r__1)) + (r__2 = vi[i__]
1243 vnorm = f2cmax(r__3,r__4);
1247 sscal_(n, &r__1, &vr[1], &c__1);
1249 sscal_(n, &r__1, &vi[1], &c__1);