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__2 = 2;
516 static integer c__1 = 1;
518 /* > \brief \b ZTGEX2 swaps adjacent diagonal blocks in an upper (quasi) triangular matrix pair by an unitary
519 equivalence transformation. */
521 /* =========== DOCUMENTATION =========== */
523 /* Online html documentation available at */
524 /* http://www.netlib.org/lapack/explore-html/ */
527 /* > Download ZTGEX2 + dependencies */
528 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/ztgex2.
531 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/ztgex2.
534 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/ztgex2.
542 /* SUBROUTINE ZTGEX2( WANTQ, WANTZ, N, A, LDA, B, LDB, Q, LDQ, Z, */
543 /* LDZ, J1, INFO ) */
545 /* LOGICAL WANTQ, WANTZ */
546 /* INTEGER INFO, J1, LDA, LDB, LDQ, LDZ, N */
547 /* COMPLEX*16 A( LDA, * ), B( LDB, * ), Q( LDQ, * ), */
551 /* > \par Purpose: */
556 /* > ZTGEX2 swaps adjacent diagonal 1 by 1 blocks (A11,B11) and (A22,B22) */
557 /* > in an upper triangular matrix pair (A, B) by an unitary equivalence */
558 /* > transformation. */
560 /* > (A, B) must be in generalized Schur canonical form, that is, A and */
561 /* > B are both upper triangular. */
563 /* > Optionally, the matrices Q and Z of generalized Schur vectors are */
566 /* > Q(in) * A(in) * Z(in)**H = Q(out) * A(out) * Z(out)**H */
567 /* > Q(in) * B(in) * Z(in)**H = Q(out) * B(out) * Z(out)**H */
574 /* > \param[in] WANTQ */
576 /* > WANTQ is LOGICAL */
577 /* > .TRUE. : update the left transformation matrix Q; */
578 /* > .FALSE.: do not update Q. */
581 /* > \param[in] WANTZ */
583 /* > WANTZ is LOGICAL */
584 /* > .TRUE. : update the right transformation matrix Z; */
585 /* > .FALSE.: do not update Z. */
591 /* > The order of the matrices A and B. N >= 0. */
594 /* > \param[in,out] A */
596 /* > A is COMPLEX*16 array, dimensions (LDA,N) */
597 /* > On entry, the matrix A in the pair (A, B). */
598 /* > On exit, the updated matrix A. */
601 /* > \param[in] LDA */
603 /* > LDA is INTEGER */
604 /* > The leading dimension of the array A. LDA >= f2cmax(1,N). */
607 /* > \param[in,out] B */
609 /* > B is COMPLEX*16 array, dimensions (LDB,N) */
610 /* > On entry, the matrix B in the pair (A, B). */
611 /* > On exit, the updated matrix B. */
614 /* > \param[in] LDB */
616 /* > LDB is INTEGER */
617 /* > The leading dimension of the array B. LDB >= f2cmax(1,N). */
620 /* > \param[in,out] Q */
622 /* > Q is COMPLEX*16 array, dimension (LDQ,N) */
623 /* > If WANTQ = .TRUE, on entry, the unitary matrix Q. On exit, */
624 /* > the updated matrix Q. */
625 /* > Not referenced if WANTQ = .FALSE.. */
628 /* > \param[in] LDQ */
630 /* > LDQ is INTEGER */
631 /* > The leading dimension of the array Q. LDQ >= 1; */
632 /* > If WANTQ = .TRUE., LDQ >= N. */
635 /* > \param[in,out] Z */
637 /* > Z is COMPLEX*16 array, dimension (LDZ,N) */
638 /* > If WANTZ = .TRUE, on entry, the unitary matrix Z. On exit, */
639 /* > the updated matrix Z. */
640 /* > Not referenced if WANTZ = .FALSE.. */
643 /* > \param[in] LDZ */
645 /* > LDZ is INTEGER */
646 /* > The leading dimension of the array Z. LDZ >= 1; */
647 /* > If WANTZ = .TRUE., LDZ >= N. */
650 /* > \param[in] J1 */
652 /* > J1 is INTEGER */
653 /* > The index to the first block (A11, B11). */
656 /* > \param[out] INFO */
658 /* > INFO is INTEGER */
659 /* > =0: Successful exit. */
660 /* > =1: The transformed matrix pair (A, B) would be too far */
661 /* > from generalized Schur form; the problem is ill- */
668 /* > \author Univ. of Tennessee */
669 /* > \author Univ. of California Berkeley */
670 /* > \author Univ. of Colorado Denver */
671 /* > \author NAG Ltd. */
673 /* > \date June 2017 */
675 /* > \ingroup complex16GEauxiliary */
677 /* > \par Further Details: */
678 /* ===================== */
680 /* > In the current code both weak and strong stability tests are */
681 /* > performed. The user can omit the strong stability test by changing */
682 /* > the internal logical parameter WANDS to .FALSE.. See ref. [2] for */
685 /* > \par Contributors: */
686 /* ================== */
688 /* > Bo Kagstrom and Peter Poromaa, Department of Computing Science, */
689 /* > Umea University, S-901 87 Umea, Sweden. */
691 /* > \par References: */
692 /* ================ */
694 /* > [1] B. Kagstrom; A Direct Method for Reordering Eigenvalues in the */
695 /* > Generalized Real Schur Form of a Regular Matrix Pair (A, B), in */
696 /* > M.S. Moonen et al (eds), Linear Algebra for Large Scale and */
697 /* > Real-Time Applications, Kluwer Academic Publ. 1993, pp 195-218. */
699 /* > [2] B. Kagstrom and P. Poromaa; Computing Eigenspaces with Specified */
700 /* > Eigenvalues of a Regular Matrix Pair (A, B) and Condition */
701 /* > Estimation: Theory, Algorithms and Software, Report UMINF-94.04, */
702 /* > Department of Computing Science, Umea University, S-901 87 Umea, */
703 /* > Sweden, 1994. Also as LAPACK Working Note 87. To appear in */
704 /* > Numerical Algorithms, 1996. */
706 /* ===================================================================== */
707 /* Subroutine */ int ztgex2_(logical *wantq, logical *wantz, integer *n,
708 doublecomplex *a, integer *lda, doublecomplex *b, integer *ldb,
709 doublecomplex *q, integer *ldq, doublecomplex *z__, integer *ldz,
710 integer *j1, integer *info)
712 /* System generated locals */
713 integer a_dim1, a_offset, b_dim1, b_offset, q_dim1, q_offset, z_dim1,
714 z_offset, i__1, i__2, i__3;
716 doublecomplex z__1, z__2, z__3;
718 /* Local variables */
720 doublecomplex cdum, work[8];
721 extern /* Subroutine */ int zrot_(integer *, doublecomplex *, integer *,
722 doublecomplex *, integer *, doublereal *, doublecomplex *);
725 doublecomplex s[4] /* was [2][2] */, t[4] /* was [2][2] */;
726 doublereal scale, cq, sa, sb;
727 extern doublereal dlamch_(char *);
734 extern /* Subroutine */ int zlacpy_(char *, integer *, integer *,
735 doublecomplex *, integer *, doublecomplex *, integer *),
736 zlartg_(doublecomplex *, doublecomplex *, doublereal *,
737 doublecomplex *, doublecomplex *);
739 extern /* Subroutine */ int zlassq_(integer *, doublecomplex *, integer *,
740 doublereal *, doublereal *);
744 /* -- LAPACK auxiliary routine (version 3.7.1) -- */
745 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
746 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
750 /* ===================================================================== */
753 /* Parameter adjustments */
755 a_offset = 1 + a_dim1 * 1;
758 b_offset = 1 + b_dim1 * 1;
761 q_offset = 1 + q_dim1 * 1;
764 z_offset = 1 + z_dim1 * 1;
770 /* Quick return if possible */
780 /* Make a local copy of selected block in (A, B) */
782 zlacpy_("Full", &m, &m, &a[*j1 + *j1 * a_dim1], lda, s, &c__2);
783 zlacpy_("Full", &m, &m, &b[*j1 + *j1 * b_dim1], ldb, t, &c__2);
785 /* Compute the threshold for testing the acceptance of swapping. */
788 smlnum = dlamch_("S") / eps;
791 zlacpy_("Full", &m, &m, s, &c__2, work, &m);
792 zlacpy_("Full", &m, &m, t, &c__2, &work[m * m], &m);
794 zlassq_(&i__1, work, &c__1, &scale, &sum);
795 sa = scale * sqrt(sum);
797 /* THRES has been changed from */
798 /* THRESH = MAX( TEN*EPS*SA, SMLNUM ) */
800 /* THRESH = MAX( TWENTY*EPS*SA, SMLNUM ) */
802 /* "Bug" reported by Ondra Kamenik, confirmed by Julie Langou, fixed by */
803 /* Jim Demmel and Guillaume Revy. See forum post 1783. */
806 d__1 = eps * 20. * sa;
807 thresh = f2cmax(d__1,smlnum);
809 /* Compute unitary QL and RQ that swap 1-by-1 and 1-by-1 blocks */
810 /* using Givens rotations and perform the swap tentatively. */
812 z__2.r = s[3].r * t[0].r - s[3].i * t[0].i, z__2.i = s[3].r * t[0].i + s[
814 z__3.r = t[3].r * s[0].r - t[3].i * s[0].i, z__3.i = t[3].r * s[0].i + t[
816 z__1.r = z__2.r - z__3.r, z__1.i = z__2.i - z__3.i;
817 f.r = z__1.r, f.i = z__1.i;
818 z__2.r = s[3].r * t[2].r - s[3].i * t[2].i, z__2.i = s[3].r * t[2].i + s[
820 z__3.r = t[3].r * s[2].r - t[3].i * s[2].i, z__3.i = t[3].r * s[2].i + t[
822 z__1.r = z__2.r - z__3.r, z__1.i = z__2.i - z__3.i;
823 g.r = z__1.r, g.i = z__1.i;
826 zlartg_(&g, &f, &cz, &sz, &cdum);
827 z__1.r = -sz.r, z__1.i = -sz.i;
828 sz.r = z__1.r, sz.i = z__1.i;
830 zrot_(&c__2, s, &c__1, &s[2], &c__1, &cz, &z__1);
832 zrot_(&c__2, t, &c__1, &t[2], &c__1, &cz, &z__1);
834 zlartg_(s, &s[1], &cq, &sq, &cdum);
836 zlartg_(t, &t[1], &cq, &sq, &cdum);
838 zrot_(&c__2, s, &c__2, &s[1], &c__2, &cq, &sq);
839 zrot_(&c__2, t, &c__2, &t[1], &c__2, &cq, &sq);
841 /* Weak stability test: |S21| + |T21| <= O(EPS F-norm((S, T))) */
843 ws = z_abs(&s[1]) + z_abs(&t[1]);
851 /* Strong stability test: */
852 /* F-norm((A-QL**H*S*QR, B-QL**H*T*QR)) <= O(EPS*F-norm((A, B))) */
854 zlacpy_("Full", &m, &m, s, &c__2, work, &m);
855 zlacpy_("Full", &m, &m, t, &c__2, &work[m * m], &m);
857 z__1.r = -z__2.r, z__1.i = -z__2.i;
858 zrot_(&c__2, work, &c__1, &work[2], &c__1, &cz, &z__1);
860 z__1.r = -z__2.r, z__1.i = -z__2.i;
861 zrot_(&c__2, &work[4], &c__1, &work[6], &c__1, &cz, &z__1);
862 z__1.r = -sq.r, z__1.i = -sq.i;
863 zrot_(&c__2, work, &c__2, &work[1], &c__2, &cq, &z__1);
864 z__1.r = -sq.r, z__1.i = -sq.i;
865 zrot_(&c__2, &work[4], &c__2, &work[5], &c__2, &cq, &z__1);
866 for (i__ = 1; i__ <= 2; ++i__) {
869 i__3 = *j1 + i__ - 1 + *j1 * a_dim1;
870 z__1.r = work[i__2].r - a[i__3].r, z__1.i = work[i__2].i - a[i__3]
872 work[i__1].r = z__1.r, work[i__1].i = z__1.i;
875 i__3 = *j1 + i__ - 1 + (*j1 + 1) * a_dim1;
876 z__1.r = work[i__2].r - a[i__3].r, z__1.i = work[i__2].i - a[i__3]
878 work[i__1].r = z__1.r, work[i__1].i = z__1.i;
881 i__3 = *j1 + i__ - 1 + *j1 * b_dim1;
882 z__1.r = work[i__2].r - b[i__3].r, z__1.i = work[i__2].i - b[i__3]
884 work[i__1].r = z__1.r, work[i__1].i = z__1.i;
887 i__3 = *j1 + i__ - 1 + (*j1 + 1) * b_dim1;
888 z__1.r = work[i__2].r - b[i__3].r, z__1.i = work[i__2].i - b[i__3]
890 work[i__1].r = z__1.r, work[i__1].i = z__1.i;
896 zlassq_(&i__1, work, &c__1, &scale, &sum);
897 ss = scale * sqrt(sum);
898 dtrong = ss <= thresh;
904 /* If the swap is accepted ("weakly" and "strongly"), apply the */
905 /* equivalence transformations to the original matrix pair (A,B) */
909 zrot_(&i__1, &a[*j1 * a_dim1 + 1], &c__1, &a[(*j1 + 1) * a_dim1 + 1], &
913 zrot_(&i__1, &b[*j1 * b_dim1 + 1], &c__1, &b[(*j1 + 1) * b_dim1 + 1], &
916 zrot_(&i__1, &a[*j1 + *j1 * a_dim1], lda, &a[*j1 + 1 + *j1 * a_dim1], lda,
919 zrot_(&i__1, &b[*j1 + *j1 * b_dim1], ldb, &b[*j1 + 1 + *j1 * b_dim1], ldb,
922 /* Set N1 by N2 (2,1) blocks to 0 */
924 i__1 = *j1 + 1 + *j1 * a_dim1;
925 a[i__1].r = 0., a[i__1].i = 0.;
926 i__1 = *j1 + 1 + *j1 * b_dim1;
927 b[i__1].r = 0., b[i__1].i = 0.;
929 /* Accumulate transformations into Q and Z if requested. */
933 zrot_(n, &z__[*j1 * z_dim1 + 1], &c__1, &z__[(*j1 + 1) * z_dim1 + 1],
938 zrot_(n, &q[*j1 * q_dim1 + 1], &c__1, &q[(*j1 + 1) * q_dim1 + 1], &
942 /* Exit with INFO = 0 if swap was successfully performed. */
946 /* Exit with INFO = 1 if swap was rejected. */