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 ZTRSNA */
519 /* =========== DOCUMENTATION =========== */
521 /* Online html documentation available at */
522 /* http://www.netlib.org/lapack/explore-html/ */
525 /* > Download ZTRSNA + dependencies */
526 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/ztrsna.
529 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/ztrsna.
532 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/ztrsna.
540 /* SUBROUTINE ZTRSNA( JOB, HOWMNY, SELECT, N, T, LDT, VL, LDVL, VR, */
541 /* LDVR, S, SEP, MM, M, WORK, LDWORK, RWORK, */
544 /* CHARACTER HOWMNY, JOB */
545 /* INTEGER INFO, LDT, LDVL, LDVR, LDWORK, M, MM, N */
546 /* LOGICAL SELECT( * ) */
547 /* DOUBLE PRECISION RWORK( * ), S( * ), SEP( * ) */
548 /* COMPLEX*16 T( LDT, * ), VL( LDVL, * ), VR( LDVR, * ), */
549 /* $ WORK( LDWORK, * ) */
552 /* > \par Purpose: */
557 /* > ZTRSNA estimates reciprocal condition numbers for specified */
558 /* > eigenvalues and/or right eigenvectors of a complex upper triangular */
559 /* > matrix T (or of any matrix Q*T*Q**H with Q unitary). */
565 /* > \param[in] JOB */
567 /* > JOB is CHARACTER*1 */
568 /* > Specifies whether condition numbers are required for */
569 /* > eigenvalues (S) or eigenvectors (SEP): */
570 /* > = 'E': for eigenvalues only (S); */
571 /* > = 'V': for eigenvectors only (SEP); */
572 /* > = 'B': for both eigenvalues and eigenvectors (S and SEP). */
575 /* > \param[in] HOWMNY */
577 /* > HOWMNY is CHARACTER*1 */
578 /* > = 'A': compute condition numbers for all eigenpairs; */
579 /* > = 'S': compute condition numbers for selected eigenpairs */
580 /* > specified by the array SELECT. */
583 /* > \param[in] SELECT */
585 /* > SELECT is LOGICAL array, dimension (N) */
586 /* > If HOWMNY = 'S', SELECT specifies the eigenpairs for which */
587 /* > condition numbers are required. To select condition numbers */
588 /* > for the j-th eigenpair, SELECT(j) must be set to .TRUE.. */
589 /* > If HOWMNY = 'A', SELECT is not referenced. */
595 /* > The order of the matrix T. N >= 0. */
600 /* > T is COMPLEX*16 array, dimension (LDT,N) */
601 /* > The upper triangular matrix T. */
604 /* > \param[in] LDT */
606 /* > LDT is INTEGER */
607 /* > The leading dimension of the array T. LDT >= f2cmax(1,N). */
610 /* > \param[in] VL */
612 /* > VL is COMPLEX*16 array, dimension (LDVL,M) */
613 /* > If JOB = 'E' or 'B', VL must contain left eigenvectors of T */
614 /* > (or of any Q*T*Q**H with Q unitary), corresponding to the */
615 /* > eigenpairs specified by HOWMNY and SELECT. The eigenvectors */
616 /* > must be stored in consecutive columns of VL, as returned by */
617 /* > ZHSEIN or ZTREVC. */
618 /* > If JOB = 'V', VL is not referenced. */
621 /* > \param[in] LDVL */
623 /* > LDVL is INTEGER */
624 /* > The leading dimension of the array VL. */
625 /* > LDVL >= 1; and if JOB = 'E' or 'B', LDVL >= N. */
628 /* > \param[in] VR */
630 /* > VR is COMPLEX*16 array, dimension (LDVR,M) */
631 /* > If JOB = 'E' or 'B', VR must contain right eigenvectors of T */
632 /* > (or of any Q*T*Q**H with Q unitary), corresponding to the */
633 /* > eigenpairs specified by HOWMNY and SELECT. The eigenvectors */
634 /* > must be stored in consecutive columns of VR, as returned by */
635 /* > ZHSEIN or ZTREVC. */
636 /* > If JOB = 'V', VR is not referenced. */
639 /* > \param[in] LDVR */
641 /* > LDVR is INTEGER */
642 /* > The leading dimension of the array VR. */
643 /* > LDVR >= 1; and if JOB = 'E' or 'B', LDVR >= N. */
646 /* > \param[out] S */
648 /* > S is DOUBLE PRECISION array, dimension (MM) */
649 /* > If JOB = 'E' or 'B', the reciprocal condition numbers of the */
650 /* > selected eigenvalues, stored in consecutive elements of the */
651 /* > array. Thus S(j), SEP(j), and the j-th columns of VL and VR */
652 /* > all correspond to the same eigenpair (but not in general the */
653 /* > j-th eigenpair, unless all eigenpairs are selected). */
654 /* > If JOB = 'V', S is not referenced. */
657 /* > \param[out] SEP */
659 /* > SEP is DOUBLE PRECISION array, dimension (MM) */
660 /* > If JOB = 'V' or 'B', the estimated reciprocal condition */
661 /* > numbers of the selected eigenvectors, stored in consecutive */
662 /* > elements of the array. */
663 /* > If JOB = 'E', SEP is not referenced. */
666 /* > \param[in] MM */
668 /* > MM is INTEGER */
669 /* > The number of elements in the arrays S (if JOB = 'E' or 'B') */
670 /* > and/or SEP (if JOB = 'V' or 'B'). MM >= M. */
673 /* > \param[out] M */
676 /* > The number of elements of the arrays S and/or SEP actually */
677 /* > used to store the estimated condition numbers. */
678 /* > If HOWMNY = 'A', M is set to N. */
681 /* > \param[out] WORK */
683 /* > WORK is COMPLEX*16 array, dimension (LDWORK,N+6) */
684 /* > If JOB = 'E', WORK is not referenced. */
687 /* > \param[in] LDWORK */
689 /* > LDWORK is INTEGER */
690 /* > The leading dimension of the array WORK. */
691 /* > LDWORK >= 1; and if JOB = 'V' or 'B', LDWORK >= N. */
694 /* > \param[out] RWORK */
696 /* > RWORK is DOUBLE PRECISION array, dimension (N) */
697 /* > If JOB = 'E', RWORK is not referenced. */
700 /* > \param[out] INFO */
702 /* > INFO is INTEGER */
703 /* > = 0: successful exit */
704 /* > < 0: if INFO = -i, the i-th argument had an illegal value */
710 /* > \author Univ. of Tennessee */
711 /* > \author Univ. of California Berkeley */
712 /* > \author Univ. of Colorado Denver */
713 /* > \author NAG Ltd. */
715 /* > \date November 2017 */
717 /* > \ingroup complex16OTHERcomputational */
719 /* > \par Further Details: */
720 /* ===================== */
724 /* > The reciprocal of the condition number of an eigenvalue lambda is */
727 /* > S(lambda) = |v**H*u| / (norm(u)*norm(v)) */
729 /* > where u and v are the right and left eigenvectors of T corresponding */
730 /* > to lambda; v**H denotes the conjugate transpose of v, and norm(u) */
731 /* > denotes the Euclidean norm. These reciprocal condition numbers always */
732 /* > lie between zero (very badly conditioned) and one (very well */
733 /* > conditioned). If n = 1, S(lambda) is defined to be 1. */
735 /* > An approximate error bound for a computed eigenvalue W(i) is given by */
737 /* > EPS * norm(T) / S(i) */
739 /* > where EPS is the machine precision. */
741 /* > The reciprocal of the condition number of the right eigenvector u */
742 /* > corresponding to lambda is defined as follows. Suppose */
744 /* > T = ( lambda c ) */
747 /* > Then the reciprocal condition number is */
749 /* > SEP( lambda, T22 ) = sigma-f2cmin( T22 - lambda*I ) */
751 /* > where sigma-f2cmin denotes the smallest singular value. We approximate */
752 /* > the smallest singular value by the reciprocal of an estimate of the */
753 /* > one-norm of the inverse of T22 - lambda*I. If n = 1, SEP(1) is */
754 /* > defined to be abs(T(1,1)). */
756 /* > An approximate error bound for a computed right eigenvector VR(i) */
759 /* > EPS * norm(T) / SEP(i) */
762 /* ===================================================================== */
763 /* Subroutine */ int ztrsna_(char *job, char *howmny, logical *select,
764 integer *n, doublecomplex *t, integer *ldt, doublecomplex *vl,
765 integer *ldvl, doublecomplex *vr, integer *ldvr, doublereal *s,
766 doublereal *sep, integer *mm, integer *m, doublecomplex *work,
767 integer *ldwork, doublereal *rwork, integer *info)
769 /* System generated locals */
770 integer t_dim1, t_offset, vl_dim1, vl_offset, vr_dim1, vr_offset,
771 work_dim1, work_offset, i__1, i__2, i__3, i__4, i__5;
772 doublereal d__1, d__2;
775 /* Local variables */
778 doublereal lnrm, rnrm;
781 extern logical lsame_(char *, char *);
783 extern /* Double Complex */ VOID zdotc_(doublecomplex *, integer *,
784 doublecomplex *, integer *, doublecomplex *, integer *);
785 doublecomplex dummy[1];
788 extern /* Subroutine */ int zlacn2_(integer *, doublecomplex *,
789 doublecomplex *, doublereal *, integer *, integer *), dlabad_(
790 doublereal *, doublereal *);
791 extern doublereal dznrm2_(integer *, doublecomplex *, integer *), dlamch_(
794 extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
797 extern integer izamax_(integer *, doublecomplex *, integer *);
799 extern /* Subroutine */ int zdrscl_(integer *, doublereal *,
800 doublecomplex *, integer *);
802 extern /* Subroutine */ int zlacpy_(char *, integer *, integer *,
803 doublecomplex *, integer *, doublecomplex *, integer *);
806 extern /* Subroutine */ int zlatrs_(char *, char *, char *, char *,
807 integer *, doublecomplex *, integer *, doublecomplex *,
808 doublereal *, doublereal *, integer *), ztrexc_(char *, integer *, doublecomplex *, integer *,
809 doublecomplex *, integer *, integer *, integer *, integer *);
813 /* -- LAPACK computational routine (version 3.8.0) -- */
814 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
815 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
819 /* ===================================================================== */
822 /* Decode and test the input parameters */
824 /* Parameter adjustments */
827 t_offset = 1 + t_dim1 * 1;
830 vl_offset = 1 + vl_dim1 * 1;
833 vr_offset = 1 + vr_dim1 * 1;
838 work_offset = 1 + work_dim1 * 1;
843 wantbh = lsame_(job, "B");
844 wants = lsame_(job, "E") || wantbh;
845 wantsp = lsame_(job, "V") || wantbh;
847 somcon = lsame_(howmny, "S");
849 /* Set M to the number of eigenpairs for which condition numbers are */
850 /* to be computed. */
855 for (j = 1; j <= i__1; ++j) {
866 if (! wants && ! wantsp) {
868 } else if (! lsame_(howmny, "A") && ! somcon) {
872 } else if (*ldt < f2cmax(1,*n)) {
874 } else if (*ldvl < 1 || wants && *ldvl < *n) {
876 } else if (*ldvr < 1 || wants && *ldvr < *n) {
878 } else if (*mm < *m) {
880 } else if (*ldwork < 1 || wantsp && *ldwork < *n) {
885 xerbla_("ZTRSNA", &i__1, (ftnlen)6);
889 /* Quick return if possible */
905 sep[1] = z_abs(&t[t_dim1 + 1]);
910 /* Get machine constants */
913 smlnum = dlamch_("S") / eps;
914 bignum = 1. / smlnum;
915 dlabad_(&smlnum, &bignum);
919 for (k = 1; k <= i__1; ++k) {
929 /* Compute the reciprocal condition number of the k-th */
932 zdotc_(&z__1, n, &vr[ks * vr_dim1 + 1], &c__1, &vl[ks * vl_dim1 +
934 prod.r = z__1.r, prod.i = z__1.i;
935 rnrm = dznrm2_(n, &vr[ks * vr_dim1 + 1], &c__1);
936 lnrm = dznrm2_(n, &vl[ks * vl_dim1 + 1], &c__1);
937 s[ks] = z_abs(&prod) / (rnrm * lnrm);
943 /* Estimate the reciprocal condition number of the k-th */
946 /* Copy the matrix T to the array WORK and swap the k-th */
947 /* diagonal element to the (1,1) position. */
949 zlacpy_("Full", n, n, &t[t_offset], ldt, &work[work_offset],
951 ztrexc_("No Q", n, &work[work_offset], ldwork, dummy, &c__1, &k, &
954 /* Form C = T22 - lambda*I in WORK(2:N,2:N). */
957 for (i__ = 2; i__ <= i__2; ++i__) {
958 i__3 = i__ + i__ * work_dim1;
959 i__4 = i__ + i__ * work_dim1;
960 i__5 = work_dim1 + 1;
961 z__1.r = work[i__4].r - work[i__5].r, z__1.i = work[i__4].i -
963 work[i__3].r = z__1.r, work[i__3].i = z__1.i;
967 /* Estimate a lower bound for the 1-norm of inv(C**H). The 1st */
968 /* and (N+1)th columns of WORK are used to store work vectors. */
973 *(unsigned char *)normin = 'N';
976 zlacn2_(&i__2, &work[(*n + 1) * work_dim1 + 1], &work[work_offset]
977 , &est, &kase, isave);
982 /* Solve C**H*x = scale*b */
985 zlatrs_("Upper", "Conjugate transpose", "Nonunit", normin,
986 &i__2, &work[(work_dim1 << 1) + 2], ldwork, &
987 work[work_offset], &scale, &rwork[1], &ierr);
990 /* Solve C*x = scale*b */
993 zlatrs_("Upper", "No transpose", "Nonunit", normin, &i__2,
994 &work[(work_dim1 << 1) + 2], ldwork, &work[
995 work_offset], &scale, &rwork[1], &ierr);
997 *(unsigned char *)normin = 'Y';
1000 /* Multiply by 1/SCALE if doing so will not cause */
1004 ix = izamax_(&i__2, &work[work_offset], &c__1);
1005 i__2 = ix + work_dim1;
1006 xnorm = (d__1 = work[i__2].r, abs(d__1)) + (d__2 = d_imag(
1007 &work[ix + work_dim1]), abs(d__2));
1008 if (scale < xnorm * smlnum || scale == 0.) {
1011 zdrscl_(n, &scale, &work[work_offset], &c__1);
1016 sep[ks] = 1. / f2cmax(est,smlnum);