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 logical c_false = FALSE_;
516 static integer c__1 = 1;
517 static real c_b22 = 1.f;
518 static real c_b25 = 0.f;
519 static integer c__2 = 2;
520 static logical c_true = TRUE_;
522 /* > \brief \b STREVC */
524 /* =========== DOCUMENTATION =========== */
526 /* Online html documentation available at */
527 /* http://www.netlib.org/lapack/explore-html/ */
530 /* > Download STREVC + dependencies */
531 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/strevc.
534 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/strevc.
537 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/strevc.
545 /* SUBROUTINE STREVC( SIDE, HOWMNY, SELECT, N, T, LDT, VL, LDVL, VR, */
546 /* LDVR, MM, M, WORK, INFO ) */
548 /* CHARACTER HOWMNY, SIDE */
549 /* INTEGER INFO, LDT, LDVL, LDVR, M, MM, N */
550 /* LOGICAL SELECT( * ) */
551 /* REAL T( LDT, * ), VL( LDVL, * ), VR( LDVR, * ), */
555 /* > \par Purpose: */
560 /* > STREVC computes some or all of the right and/or left eigenvectors of */
561 /* > a real upper quasi-triangular matrix T. */
562 /* > Matrices of this type are produced by the Schur factorization of */
563 /* > a real general matrix: A = Q*T*Q**T, as computed by SHSEQR. */
565 /* > The right eigenvector x and the left eigenvector y of T corresponding */
566 /* > to an eigenvalue w are defined by: */
568 /* > T*x = w*x, (y**H)*T = w*(y**H) */
570 /* > where y**H denotes the conjugate transpose of y. */
571 /* > The eigenvalues are not input to this routine, but are read directly */
572 /* > from the diagonal blocks of T. */
574 /* > This routine returns the matrices X and/or Y of right and left */
575 /* > eigenvectors of T, or the products Q*X and/or Q*Y, where Q is an */
576 /* > input matrix. If Q is the orthogonal factor that reduces a matrix */
577 /* > A to Schur form T, then Q*X and Q*Y are the matrices of right and */
578 /* > left eigenvectors of A. */
584 /* > \param[in] SIDE */
586 /* > SIDE is CHARACTER*1 */
587 /* > = 'R': compute right eigenvectors only; */
588 /* > = 'L': compute left eigenvectors only; */
589 /* > = 'B': compute both right and left eigenvectors. */
592 /* > \param[in] HOWMNY */
594 /* > HOWMNY is CHARACTER*1 */
595 /* > = 'A': compute all right and/or left eigenvectors; */
596 /* > = 'B': compute all right and/or left eigenvectors, */
597 /* > backtransformed by the matrices in VR and/or VL; */
598 /* > = 'S': compute selected right and/or left eigenvectors, */
599 /* > as indicated by the logical array SELECT. */
602 /* > \param[in,out] SELECT */
604 /* > SELECT is LOGICAL array, dimension (N) */
605 /* > If HOWMNY = 'S', SELECT specifies the eigenvectors to be */
607 /* > If w(j) is a real eigenvalue, the corresponding real */
608 /* > eigenvector is computed if SELECT(j) is .TRUE.. */
609 /* > If w(j) and w(j+1) are the real and imaginary parts of a */
610 /* > complex eigenvalue, the corresponding complex eigenvector is */
611 /* > computed if either SELECT(j) or SELECT(j+1) is .TRUE., and */
612 /* > on exit SELECT(j) is set to .TRUE. and SELECT(j+1) is set to */
614 /* > Not referenced if HOWMNY = 'A' or 'B'. */
620 /* > The order of the matrix T. N >= 0. */
625 /* > T is REAL array, dimension (LDT,N) */
626 /* > The upper quasi-triangular matrix T in Schur canonical form. */
629 /* > \param[in] LDT */
631 /* > LDT is INTEGER */
632 /* > The leading dimension of the array T. LDT >= f2cmax(1,N). */
635 /* > \param[in,out] VL */
637 /* > VL is REAL array, dimension (LDVL,MM) */
638 /* > On entry, if SIDE = 'L' or 'B' and HOWMNY = 'B', VL must */
639 /* > contain an N-by-N matrix Q (usually the orthogonal matrix Q */
640 /* > of Schur vectors returned by SHSEQR). */
641 /* > On exit, if SIDE = 'L' or 'B', VL contains: */
642 /* > if HOWMNY = 'A', the matrix Y of left eigenvectors of T; */
643 /* > if HOWMNY = 'B', the matrix Q*Y; */
644 /* > if HOWMNY = 'S', the left eigenvectors of T specified by */
645 /* > SELECT, stored consecutively in the columns */
646 /* > of VL, in the same order as their */
648 /* > A complex eigenvector corresponding to a complex eigenvalue */
649 /* > is stored in two consecutive columns, the first holding the */
650 /* > real part, and the second the imaginary part. */
651 /* > Not referenced if SIDE = 'R'. */
654 /* > \param[in] LDVL */
656 /* > LDVL is INTEGER */
657 /* > The leading dimension of the array VL. LDVL >= 1, and if */
658 /* > SIDE = 'L' or 'B', LDVL >= N. */
661 /* > \param[in,out] VR */
663 /* > VR is REAL array, dimension (LDVR,MM) */
664 /* > On entry, if SIDE = 'R' or 'B' and HOWMNY = 'B', VR must */
665 /* > contain an N-by-N matrix Q (usually the orthogonal matrix Q */
666 /* > of Schur vectors returned by SHSEQR). */
667 /* > On exit, if SIDE = 'R' or 'B', VR contains: */
668 /* > if HOWMNY = 'A', the matrix X of right eigenvectors of T; */
669 /* > if HOWMNY = 'B', the matrix Q*X; */
670 /* > if HOWMNY = 'S', the right eigenvectors of T specified by */
671 /* > SELECT, stored consecutively in the columns */
672 /* > of VR, in the same order as their */
674 /* > A complex eigenvector corresponding to a complex eigenvalue */
675 /* > is stored in two consecutive columns, the first holding the */
676 /* > real part and the second the imaginary part. */
677 /* > Not referenced if SIDE = 'L'. */
680 /* > \param[in] LDVR */
682 /* > LDVR is INTEGER */
683 /* > The leading dimension of the array VR. LDVR >= 1, and if */
684 /* > SIDE = 'R' or 'B', LDVR >= N. */
687 /* > \param[in] MM */
689 /* > MM is INTEGER */
690 /* > The number of columns in the arrays VL and/or VR. MM >= M. */
693 /* > \param[out] M */
696 /* > The number of columns in the arrays VL and/or VR actually */
697 /* > used to store the eigenvectors. */
698 /* > If HOWMNY = 'A' or 'B', M is set to N. */
699 /* > Each selected real eigenvector occupies one column and each */
700 /* > selected complex eigenvector occupies two columns. */
703 /* > \param[out] WORK */
705 /* > WORK is REAL array, dimension (3*N) */
708 /* > \param[out] INFO */
710 /* > INFO is INTEGER */
711 /* > = 0: successful exit */
712 /* > < 0: if INFO = -i, the i-th argument had an illegal value */
718 /* > \author Univ. of Tennessee */
719 /* > \author Univ. of California Berkeley */
720 /* > \author Univ. of Colorado Denver */
721 /* > \author NAG Ltd. */
723 /* > \date December 2016 */
725 /* > \ingroup realOTHERcomputational */
727 /* > \par Further Details: */
728 /* ===================== */
732 /* > The algorithm used in this program is basically backward (forward) */
733 /* > substitution, with scaling to make the the code robust against */
734 /* > possible overflow. */
736 /* > Each eigenvector is normalized so that the element of largest */
737 /* > magnitude has magnitude 1; here the magnitude of a complex number */
738 /* > (x,y) is taken to be |x| + |y|. */
741 /* ===================================================================== */
742 /* Subroutine */ int strevc_(char *side, char *howmny, logical *select,
743 integer *n, real *t, integer *ldt, real *vl, integer *ldvl, real *vr,
744 integer *ldvr, integer *mm, integer *m, real *work, integer *info)
746 /* System generated locals */
747 integer t_dim1, t_offset, vl_dim1, vl_offset, vr_dim1, vr_offset, i__1,
749 real r__1, r__2, r__3, r__4;
751 /* Local variables */
755 real unfl, ovfl, smin;
756 extern real sdot_(integer *, real *, integer *, real *, integer *);
759 integer jnxt, i__, j, k;
760 real scale, x[4] /* was [2][2] */;
761 extern logical lsame_(char *, char *);
762 extern /* Subroutine */ int sscal_(integer *, real *, real *, integer *);
765 extern /* Subroutine */ int sgemv_(char *, integer *, integer *, real *,
766 real *, integer *, real *, integer *, real *, real *, integer *);
771 extern /* Subroutine */ int scopy_(integer *, real *, integer *, real *,
775 extern /* Subroutine */ int saxpy_(integer *, real *, real *, integer *,
776 real *, integer *), slaln2_(logical *, integer *, integer *, real
777 *, real *, real *, integer *, real *, real *, real *, integer *,
778 real *, real *, real *, integer *, real *, real *, integer *);
780 extern /* Subroutine */ int slabad_(real *, real *);
783 extern real slamch_(char *);
785 extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
787 extern integer isamax_(integer *, real *, integer *);
789 real smlnum, rec, ulp;
792 /* -- LAPACK computational routine (version 3.7.0) -- */
793 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
794 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
798 /* ===================================================================== */
801 /* Decode and test the input parameters */
803 /* Parameter adjustments */
806 t_offset = 1 + t_dim1 * 1;
809 vl_offset = 1 + vl_dim1 * 1;
812 vr_offset = 1 + vr_dim1 * 1;
817 bothv = lsame_(side, "B");
818 rightv = lsame_(side, "R") || bothv;
819 leftv = lsame_(side, "L") || bothv;
821 allv = lsame_(howmny, "A");
822 over = lsame_(howmny, "B");
823 somev = lsame_(howmny, "S");
826 if (! rightv && ! leftv) {
828 } else if (! allv && ! over && ! somev) {
832 } else if (*ldt < f2cmax(1,*n)) {
834 } else if (*ldvl < 1 || leftv && *ldvl < *n) {
836 } else if (*ldvr < 1 || rightv && *ldvr < *n) {
840 /* Set M to the number of columns required to store the selected */
841 /* eigenvectors, standardize the array SELECT if necessary, and */
848 for (j = 1; j <= i__1; ++j) {
854 if (t[j + 1 + j * t_dim1] == 0.f) {
860 if (select[j] || select[j + 1]) {
883 xerbla_("STREVC", &i__1, (ftnlen)6);
887 /* Quick return if possible. */
893 /* Set the constants to control overflow. */
895 unfl = slamch_("Safe minimum");
897 slabad_(&unfl, &ovfl);
898 ulp = slamch_("Precision");
899 smlnum = unfl * (*n / ulp);
900 bignum = (1.f - ulp) / smlnum;
902 /* Compute 1-norm of each column of strictly upper triangular */
903 /* part of T to control overflow in triangular solver. */
907 for (j = 2; j <= i__1; ++j) {
910 for (i__ = 1; i__ <= i__2; ++i__) {
911 work[j] += (r__1 = t[i__ + j * t_dim1], abs(r__1));
917 /* Index IP is used to specify the real or complex eigenvalue: */
918 /* IP = 0, real eigenvalue, */
919 /* 1, first of conjugate complex pair: (wr,wi) */
920 /* -1, second of conjugate complex pair: (wr,wi) */
926 /* Compute right eigenvectors. */
930 for (ki = *n; ki >= 1; --ki) {
938 if (t[ki + (ki - 1) * t_dim1] == 0.f) {
950 if (! select[ki - 1]) {
956 /* Compute the KI-th eigenvalue (WR,WI). */
958 wr = t[ki + ki * t_dim1];
961 wi = sqrt((r__1 = t[ki + (ki - 1) * t_dim1], abs(r__1))) *
962 sqrt((r__2 = t[ki - 1 + ki * t_dim1], abs(r__2)));
965 r__1 = ulp * (abs(wr) + abs(wi));
966 smin = f2cmax(r__1,smlnum);
970 /* Real right eigenvector */
974 /* Form right-hand side */
977 for (k = 1; k <= i__1; ++k) {
978 work[k + *n] = -t[k + ki * t_dim1];
982 /* Solve the upper quasi-triangular system: */
983 /* (T(1:KI-1,1:KI-1) - WR)*X = SCALE*WORK. */
986 for (j = ki - 1; j >= 1; --j) {
994 if (t[j + (j - 1) * t_dim1] != 0.f) {
1002 /* 1-by-1 diagonal block */
1004 slaln2_(&c_false, &c__1, &c__1, &smin, &c_b22, &t[j +
1005 j * t_dim1], ldt, &c_b22, &c_b22, &work[j + *
1006 n], n, &wr, &c_b25, x, &c__2, &scale, &xnorm,
1009 /* Scale X(1,1) to avoid overflow when updating */
1010 /* the right-hand side. */
1013 if (work[j] > bignum / xnorm) {
1019 /* Scale if necessary */
1022 sscal_(&ki, &scale, &work[*n + 1], &c__1);
1024 work[j + *n] = x[0];
1026 /* Update right-hand side */
1030 saxpy_(&i__1, &r__1, &t[j * t_dim1 + 1], &c__1, &work[
1035 /* 2-by-2 diagonal block */
1037 slaln2_(&c_false, &c__2, &c__1, &smin, &c_b22, &t[j -
1038 1 + (j - 1) * t_dim1], ldt, &c_b22, &c_b22, &
1039 work[j - 1 + *n], n, &wr, &c_b25, x, &c__2, &
1040 scale, &xnorm, &ierr);
1042 /* Scale X(1,1) and X(2,1) to avoid overflow when */
1043 /* updating the right-hand side. */
1047 r__1 = work[j - 1], r__2 = work[j];
1048 beta = f2cmax(r__1,r__2);
1049 if (beta > bignum / xnorm) {
1056 /* Scale if necessary */
1059 sscal_(&ki, &scale, &work[*n + 1], &c__1);
1061 work[j - 1 + *n] = x[0];
1062 work[j + *n] = x[1];
1064 /* Update right-hand side */
1068 saxpy_(&i__1, &r__1, &t[(j - 1) * t_dim1 + 1], &c__1,
1069 &work[*n + 1], &c__1);
1072 saxpy_(&i__1, &r__1, &t[j * t_dim1 + 1], &c__1, &work[
1079 /* Copy the vector x or Q*x to VR and normalize. */
1082 scopy_(&ki, &work[*n + 1], &c__1, &vr[is * vr_dim1 + 1], &
1085 ii = isamax_(&ki, &vr[is * vr_dim1 + 1], &c__1);
1086 remax = 1.f / (r__1 = vr[ii + is * vr_dim1], abs(r__1));
1087 sscal_(&ki, &remax, &vr[is * vr_dim1 + 1], &c__1);
1090 for (k = ki + 1; k <= i__1; ++k) {
1091 vr[k + is * vr_dim1] = 0.f;
1097 sgemv_("N", n, &i__1, &c_b22, &vr[vr_offset], ldvr, &
1098 work[*n + 1], &c__1, &work[ki + *n], &vr[ki *
1099 vr_dim1 + 1], &c__1);
1102 ii = isamax_(n, &vr[ki * vr_dim1 + 1], &c__1);
1103 remax = 1.f / (r__1 = vr[ii + ki * vr_dim1], abs(r__1));
1104 sscal_(n, &remax, &vr[ki * vr_dim1 + 1], &c__1);
1109 /* Complex right eigenvector. */
1112 /* [ (T(KI-1,KI-1) T(KI-1,KI) ) - (WR + I* WI)]*X = 0. */
1113 /* [ (T(KI,KI-1) T(KI,KI) ) ] */
1115 if ((r__1 = t[ki - 1 + ki * t_dim1], abs(r__1)) >= (r__2 = t[
1116 ki + (ki - 1) * t_dim1], abs(r__2))) {
1117 work[ki - 1 + *n] = 1.f;
1118 work[ki + n2] = wi / t[ki - 1 + ki * t_dim1];
1120 work[ki - 1 + *n] = -wi / t[ki + (ki - 1) * t_dim1];
1121 work[ki + n2] = 1.f;
1123 work[ki + *n] = 0.f;
1124 work[ki - 1 + n2] = 0.f;
1126 /* Form right-hand side */
1129 for (k = 1; k <= i__1; ++k) {
1130 work[k + *n] = -work[ki - 1 + *n] * t[k + (ki - 1) *
1132 work[k + n2] = -work[ki + n2] * t[k + ki * t_dim1];
1136 /* Solve upper quasi-triangular system: */
1137 /* (T(1:KI-2,1:KI-2) - (WR+i*WI))*X = SCALE*(WORK+i*WORK2) */
1140 for (j = ki - 2; j >= 1; --j) {
1148 if (t[j + (j - 1) * t_dim1] != 0.f) {
1156 /* 1-by-1 diagonal block */
1158 slaln2_(&c_false, &c__1, &c__2, &smin, &c_b22, &t[j +
1159 j * t_dim1], ldt, &c_b22, &c_b22, &work[j + *
1160 n], n, &wr, &wi, x, &c__2, &scale, &xnorm, &
1163 /* Scale X(1,1) and X(1,2) to avoid overflow when */
1164 /* updating the right-hand side. */
1167 if (work[j] > bignum / xnorm) {
1174 /* Scale if necessary */
1177 sscal_(&ki, &scale, &work[*n + 1], &c__1);
1178 sscal_(&ki, &scale, &work[n2 + 1], &c__1);
1180 work[j + *n] = x[0];
1181 work[j + n2] = x[2];
1183 /* Update the right-hand side */
1187 saxpy_(&i__1, &r__1, &t[j * t_dim1 + 1], &c__1, &work[
1191 saxpy_(&i__1, &r__1, &t[j * t_dim1 + 1], &c__1, &work[
1196 /* 2-by-2 diagonal block */
1198 slaln2_(&c_false, &c__2, &c__2, &smin, &c_b22, &t[j -
1199 1 + (j - 1) * t_dim1], ldt, &c_b22, &c_b22, &
1200 work[j - 1 + *n], n, &wr, &wi, x, &c__2, &
1201 scale, &xnorm, &ierr);
1203 /* Scale X to avoid overflow when updating */
1204 /* the right-hand side. */
1208 r__1 = work[j - 1], r__2 = work[j];
1209 beta = f2cmax(r__1,r__2);
1210 if (beta > bignum / xnorm) {
1220 /* Scale if necessary */
1223 sscal_(&ki, &scale, &work[*n + 1], &c__1);
1224 sscal_(&ki, &scale, &work[n2 + 1], &c__1);
1226 work[j - 1 + *n] = x[0];
1227 work[j + *n] = x[1];
1228 work[j - 1 + n2] = x[2];
1229 work[j + n2] = x[3];
1231 /* Update the right-hand side */
1235 saxpy_(&i__1, &r__1, &t[(j - 1) * t_dim1 + 1], &c__1,
1236 &work[*n + 1], &c__1);
1239 saxpy_(&i__1, &r__1, &t[j * t_dim1 + 1], &c__1, &work[
1243 saxpy_(&i__1, &r__1, &t[(j - 1) * t_dim1 + 1], &c__1,
1244 &work[n2 + 1], &c__1);
1247 saxpy_(&i__1, &r__1, &t[j * t_dim1 + 1], &c__1, &work[
1254 /* Copy the vector x or Q*x to VR and normalize. */
1257 scopy_(&ki, &work[*n + 1], &c__1, &vr[(is - 1) * vr_dim1
1259 scopy_(&ki, &work[n2 + 1], &c__1, &vr[is * vr_dim1 + 1], &
1264 for (k = 1; k <= i__1; ++k) {
1266 r__3 = emax, r__4 = (r__1 = vr[k + (is - 1) * vr_dim1]
1267 , abs(r__1)) + (r__2 = vr[k + is * vr_dim1],
1269 emax = f2cmax(r__3,r__4);
1274 sscal_(&ki, &remax, &vr[(is - 1) * vr_dim1 + 1], &c__1);
1275 sscal_(&ki, &remax, &vr[is * vr_dim1 + 1], &c__1);
1278 for (k = ki + 1; k <= i__1; ++k) {
1279 vr[k + (is - 1) * vr_dim1] = 0.f;
1280 vr[k + is * vr_dim1] = 0.f;
1288 sgemv_("N", n, &i__1, &c_b22, &vr[vr_offset], ldvr, &
1289 work[*n + 1], &c__1, &work[ki - 1 + *n], &vr[(
1290 ki - 1) * vr_dim1 + 1], &c__1);
1292 sgemv_("N", n, &i__1, &c_b22, &vr[vr_offset], ldvr, &
1293 work[n2 + 1], &c__1, &work[ki + n2], &vr[ki *
1294 vr_dim1 + 1], &c__1);
1296 sscal_(n, &work[ki - 1 + *n], &vr[(ki - 1) * vr_dim1
1298 sscal_(n, &work[ki + n2], &vr[ki * vr_dim1 + 1], &
1304 for (k = 1; k <= i__1; ++k) {
1306 r__3 = emax, r__4 = (r__1 = vr[k + (ki - 1) * vr_dim1]
1307 , abs(r__1)) + (r__2 = vr[k + ki * vr_dim1],
1309 emax = f2cmax(r__3,r__4);
1313 sscal_(n, &remax, &vr[(ki - 1) * vr_dim1 + 1], &c__1);
1314 sscal_(n, &remax, &vr[ki * vr_dim1 + 1], &c__1);
1335 /* Compute left eigenvectors. */
1340 for (ki = 1; ki <= i__1; ++ki) {
1348 if (t[ki + 1 + ki * t_dim1] == 0.f) {
1360 /* Compute the KI-th eigenvalue (WR,WI). */
1362 wr = t[ki + ki * t_dim1];
1365 wi = sqrt((r__1 = t[ki + (ki + 1) * t_dim1], abs(r__1))) *
1366 sqrt((r__2 = t[ki + 1 + ki * t_dim1], abs(r__2)));
1369 r__1 = ulp * (abs(wr) + abs(wi));
1370 smin = f2cmax(r__1,smlnum);
1374 /* Real left eigenvector. */
1376 work[ki + *n] = 1.f;
1378 /* Form right-hand side */
1381 for (k = ki + 1; k <= i__2; ++k) {
1382 work[k + *n] = -t[ki + k * t_dim1];
1386 /* Solve the quasi-triangular system: */
1387 /* (T(KI+1:N,KI+1:N) - WR)**T*X = SCALE*WORK */
1394 for (j = ki + 1; j <= i__2; ++j) {
1402 if (t[j + 1 + j * t_dim1] != 0.f) {
1410 /* 1-by-1 diagonal block */
1412 /* Scale if necessary to avoid overflow when forming */
1413 /* the right-hand side. */
1415 if (work[j] > vcrit) {
1418 sscal_(&i__3, &rec, &work[ki + *n], &c__1);
1424 work[j + *n] -= sdot_(&i__3, &t[ki + 1 + j * t_dim1],
1425 &c__1, &work[ki + 1 + *n], &c__1);
1427 /* Solve (T(J,J)-WR)**T*X = WORK */
1429 slaln2_(&c_false, &c__1, &c__1, &smin, &c_b22, &t[j +
1430 j * t_dim1], ldt, &c_b22, &c_b22, &work[j + *
1431 n], n, &wr, &c_b25, x, &c__2, &scale, &xnorm,
1434 /* Scale if necessary */
1438 sscal_(&i__3, &scale, &work[ki + *n], &c__1);
1440 work[j + *n] = x[0];
1442 r__2 = (r__1 = work[j + *n], abs(r__1));
1443 vmax = f2cmax(r__2,vmax);
1444 vcrit = bignum / vmax;
1448 /* 2-by-2 diagonal block */
1450 /* Scale if necessary to avoid overflow when forming */
1451 /* the right-hand side. */
1454 r__1 = work[j], r__2 = work[j + 1];
1455 beta = f2cmax(r__1,r__2);
1459 sscal_(&i__3, &rec, &work[ki + *n], &c__1);
1465 work[j + *n] -= sdot_(&i__3, &t[ki + 1 + j * t_dim1],
1466 &c__1, &work[ki + 1 + *n], &c__1);
1469 work[j + 1 + *n] -= sdot_(&i__3, &t[ki + 1 + (j + 1) *
1470 t_dim1], &c__1, &work[ki + 1 + *n], &c__1);
1473 /* [T(J,J)-WR T(J,J+1) ]**T* X = SCALE*( WORK1 ) */
1474 /* [T(J+1,J) T(J+1,J+1)-WR] ( WORK2 ) */
1476 slaln2_(&c_true, &c__2, &c__1, &smin, &c_b22, &t[j +
1477 j * t_dim1], ldt, &c_b22, &c_b22, &work[j + *
1478 n], n, &wr, &c_b25, x, &c__2, &scale, &xnorm,
1481 /* Scale if necessary */
1485 sscal_(&i__3, &scale, &work[ki + *n], &c__1);
1487 work[j + *n] = x[0];
1488 work[j + 1 + *n] = x[1];
1491 r__3 = (r__1 = work[j + *n], abs(r__1)), r__4 = (r__2
1492 = work[j + 1 + *n], abs(r__2)), r__3 = f2cmax(
1494 vmax = f2cmax(r__3,vmax);
1495 vcrit = bignum / vmax;
1502 /* Copy the vector x or Q*x to VL and normalize. */
1506 scopy_(&i__2, &work[ki + *n], &c__1, &vl[ki + is *
1510 ii = isamax_(&i__2, &vl[ki + is * vl_dim1], &c__1) + ki -
1512 remax = 1.f / (r__1 = vl[ii + is * vl_dim1], abs(r__1));
1514 sscal_(&i__2, &remax, &vl[ki + is * vl_dim1], &c__1);
1517 for (k = 1; k <= i__2; ++k) {
1518 vl[k + is * vl_dim1] = 0.f;
1526 sgemv_("N", n, &i__2, &c_b22, &vl[(ki + 1) * vl_dim1
1527 + 1], ldvl, &work[ki + 1 + *n], &c__1, &work[
1528 ki + *n], &vl[ki * vl_dim1 + 1], &c__1);
1531 ii = isamax_(n, &vl[ki * vl_dim1 + 1], &c__1);
1532 remax = 1.f / (r__1 = vl[ii + ki * vl_dim1], abs(r__1));
1533 sscal_(n, &remax, &vl[ki * vl_dim1 + 1], &c__1);
1539 /* Complex left eigenvector. */
1541 /* Initial solve: */
1542 /* ((T(KI,KI) T(KI,KI+1) )**T - (WR - I* WI))*X = 0. */
1543 /* ((T(KI+1,KI) T(KI+1,KI+1)) ) */
1545 if ((r__1 = t[ki + (ki + 1) * t_dim1], abs(r__1)) >= (r__2 =
1546 t[ki + 1 + ki * t_dim1], abs(r__2))) {
1547 work[ki + *n] = wi / t[ki + (ki + 1) * t_dim1];
1548 work[ki + 1 + n2] = 1.f;
1550 work[ki + *n] = 1.f;
1551 work[ki + 1 + n2] = -wi / t[ki + 1 + ki * t_dim1];
1553 work[ki + 1 + *n] = 0.f;
1554 work[ki + n2] = 0.f;
1556 /* Form right-hand side */
1559 for (k = ki + 2; k <= i__2; ++k) {
1560 work[k + *n] = -work[ki + *n] * t[ki + k * t_dim1];
1561 work[k + n2] = -work[ki + 1 + n2] * t[ki + 1 + k * t_dim1]
1566 /* Solve complex quasi-triangular system: */
1567 /* ( T(KI+2,N:KI+2,N) - (WR-i*WI) )*X = WORK1+i*WORK2 */
1574 for (j = ki + 2; j <= i__2; ++j) {
1582 if (t[j + 1 + j * t_dim1] != 0.f) {
1590 /* 1-by-1 diagonal block */
1592 /* Scale if necessary to avoid overflow when */
1593 /* forming the right-hand side elements. */
1595 if (work[j] > vcrit) {
1598 sscal_(&i__3, &rec, &work[ki + *n], &c__1);
1600 sscal_(&i__3, &rec, &work[ki + n2], &c__1);
1606 work[j + *n] -= sdot_(&i__3, &t[ki + 2 + j * t_dim1],
1607 &c__1, &work[ki + 2 + *n], &c__1);
1609 work[j + n2] -= sdot_(&i__3, &t[ki + 2 + j * t_dim1],
1610 &c__1, &work[ki + 2 + n2], &c__1);
1612 /* Solve (T(J,J)-(WR-i*WI))*(X11+i*X12)= WK+I*WK2 */
1615 slaln2_(&c_false, &c__1, &c__2, &smin, &c_b22, &t[j +
1616 j * t_dim1], ldt, &c_b22, &c_b22, &work[j + *
1617 n], n, &wr, &r__1, x, &c__2, &scale, &xnorm, &
1620 /* Scale if necessary */
1624 sscal_(&i__3, &scale, &work[ki + *n], &c__1);
1626 sscal_(&i__3, &scale, &work[ki + n2], &c__1);
1628 work[j + *n] = x[0];
1629 work[j + n2] = x[2];
1631 r__3 = (r__1 = work[j + *n], abs(r__1)), r__4 = (r__2
1632 = work[j + n2], abs(r__2)), r__3 = f2cmax(r__3,
1634 vmax = f2cmax(r__3,vmax);
1635 vcrit = bignum / vmax;
1639 /* 2-by-2 diagonal block */
1641 /* Scale if necessary to avoid overflow when forming */
1642 /* the right-hand side elements. */
1645 r__1 = work[j], r__2 = work[j + 1];
1646 beta = f2cmax(r__1,r__2);
1650 sscal_(&i__3, &rec, &work[ki + *n], &c__1);
1652 sscal_(&i__3, &rec, &work[ki + n2], &c__1);
1658 work[j + *n] -= sdot_(&i__3, &t[ki + 2 + j * t_dim1],
1659 &c__1, &work[ki + 2 + *n], &c__1);
1662 work[j + n2] -= sdot_(&i__3, &t[ki + 2 + j * t_dim1],
1663 &c__1, &work[ki + 2 + n2], &c__1);
1666 work[j + 1 + *n] -= sdot_(&i__3, &t[ki + 2 + (j + 1) *
1667 t_dim1], &c__1, &work[ki + 2 + *n], &c__1);
1670 work[j + 1 + n2] -= sdot_(&i__3, &t[ki + 2 + (j + 1) *
1671 t_dim1], &c__1, &work[ki + 2 + n2], &c__1);
1673 /* Solve 2-by-2 complex linear equation */
1674 /* ([T(j,j) T(j,j+1) ]**T-(wr-i*wi)*I)*X = SCALE*B */
1675 /* ([T(j+1,j) T(j+1,j+1)] ) */
1678 slaln2_(&c_true, &c__2, &c__2, &smin, &c_b22, &t[j +
1679 j * t_dim1], ldt, &c_b22, &c_b22, &work[j + *
1680 n], n, &wr, &r__1, x, &c__2, &scale, &xnorm, &
1683 /* Scale if necessary */
1687 sscal_(&i__3, &scale, &work[ki + *n], &c__1);
1689 sscal_(&i__3, &scale, &work[ki + n2], &c__1);
1691 work[j + *n] = x[0];
1692 work[j + n2] = x[2];
1693 work[j + 1 + *n] = x[1];
1694 work[j + 1 + n2] = x[3];
1696 r__1 = abs(x[0]), r__2 = abs(x[2]), r__1 = f2cmax(r__1,
1697 r__2), r__2 = abs(x[1]), r__1 = f2cmax(r__1,r__2)
1698 , r__2 = abs(x[3]), r__1 = f2cmax(r__1,r__2);
1699 vmax = f2cmax(r__1,vmax);
1700 vcrit = bignum / vmax;
1707 /* Copy the vector x or Q*x to VL and normalize. */
1711 scopy_(&i__2, &work[ki + *n], &c__1, &vl[ki + is *
1714 scopy_(&i__2, &work[ki + n2], &c__1, &vl[ki + (is + 1) *
1719 for (k = ki; k <= i__2; ++k) {
1721 r__3 = emax, r__4 = (r__1 = vl[k + is * vl_dim1], abs(
1722 r__1)) + (r__2 = vl[k + (is + 1) * vl_dim1],
1724 emax = f2cmax(r__3,r__4);
1729 sscal_(&i__2, &remax, &vl[ki + is * vl_dim1], &c__1);
1731 sscal_(&i__2, &remax, &vl[ki + (is + 1) * vl_dim1], &c__1)
1735 for (k = 1; k <= i__2; ++k) {
1736 vl[k + is * vl_dim1] = 0.f;
1737 vl[k + (is + 1) * vl_dim1] = 0.f;
1743 sgemv_("N", n, &i__2, &c_b22, &vl[(ki + 2) * vl_dim1
1744 + 1], ldvl, &work[ki + 2 + *n], &c__1, &work[
1745 ki + *n], &vl[ki * vl_dim1 + 1], &c__1);
1747 sgemv_("N", n, &i__2, &c_b22, &vl[(ki + 2) * vl_dim1
1748 + 1], ldvl, &work[ki + 2 + n2], &c__1, &work[
1749 ki + 1 + n2], &vl[(ki + 1) * vl_dim1 + 1], &
1752 sscal_(n, &work[ki + *n], &vl[ki * vl_dim1 + 1], &
1754 sscal_(n, &work[ki + 1 + n2], &vl[(ki + 1) * vl_dim1
1760 for (k = 1; k <= i__2; ++k) {
1762 r__3 = emax, r__4 = (r__1 = vl[k + ki * vl_dim1], abs(
1763 r__1)) + (r__2 = vl[k + (ki + 1) * vl_dim1],
1765 emax = f2cmax(r__3,r__4);
1769 sscal_(n, &remax, &vl[ki * vl_dim1 + 1], &c__1);
1770 sscal_(n, &remax, &vl[(ki + 1) * vl_dim1 + 1], &c__1);