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;
516 static integer c__4 = 4;
517 static integer c__8 = 8;
518 static integer c__24 = 24;
520 /* > \brief \b CLATM6 */
522 /* =========== DOCUMENTATION =========== */
524 /* Online html documentation available at */
525 /* http://www.netlib.org/lapack/explore-html/ */
530 /* SUBROUTINE CLATM6( TYPE, N, A, LDA, B, X, LDX, Y, LDY, ALPHA, */
531 /* BETA, WX, WY, S, DIF ) */
533 /* INTEGER LDA, LDX, LDY, N, TYPE */
534 /* COMPLEX ALPHA, BETA, WX, WY */
535 /* REAL DIF( * ), S( * ) */
536 /* COMPLEX A( LDA, * ), B( LDA, * ), X( LDX, * ), */
540 /* > \par Purpose: */
545 /* > CLATM6 generates test matrices for the generalized eigenvalue */
546 /* > problem, their corresponding right and left eigenvector matrices, */
547 /* > and also reciprocal condition numbers for all eigenvalues and */
548 /* > the reciprocal condition numbers of eigenvectors corresponding to */
549 /* > the 1th and 5th eigenvalues. */
551 /* > Test Matrices */
552 /* > ============= */
554 /* > Two kinds of test matrix pairs */
555 /* > (A, B) = inverse(YH) * (Da, Db) * inverse(X) */
556 /* > are used in the tests: */
559 /* > Da = 1+a 0 0 0 0 Db = 1 0 0 0 0 */
560 /* > 0 2+a 0 0 0 0 1 0 0 0 */
561 /* > 0 0 3+a 0 0 0 0 1 0 0 */
562 /* > 0 0 0 4+a 0 0 0 0 1 0 */
563 /* > 0 0 0 0 5+a , 0 0 0 0 1 */
565 /* > Da = 1+i 0 0 0 0 Db = 1 0 0 0 0 */
566 /* > 0 1-i 0 0 0 0 1 0 0 0 */
567 /* > 0 0 1 0 0 0 0 1 0 0 */
568 /* > 0 0 0 (1+a)+(1+b)i 0 0 0 0 1 0 */
569 /* > 0 0 0 0 (1+a)-(1+b)i, 0 0 0 0 1 . */
571 /* > In both cases the same inverse(YH) and inverse(X) are used to compute */
572 /* > (A, B), giving the exact eigenvectors to (A,B) as (YH, X): */
574 /* > YH: = 1 0 -y y -y X = 1 0 -x -x x */
575 /* > 0 1 -y y -y 0 1 x -x -x */
576 /* > 0 0 1 0 0 0 0 1 0 0 */
577 /* > 0 0 0 1 0 0 0 0 1 0 */
578 /* > 0 0 0 0 1, 0 0 0 0 1 , where */
580 /* > a, b, x and y will have all values independently of each other. */
586 /* > \param[in] TYPE */
588 /* > TYPE is INTEGER */
589 /* > Specifies the problem type (see further details). */
595 /* > Size of the matrices A and B. */
598 /* > \param[out] A */
600 /* > A is COMPLEX array, dimension (LDA, N). */
601 /* > On exit A N-by-N is initialized according to TYPE. */
604 /* > \param[in] LDA */
606 /* > LDA is INTEGER */
607 /* > The leading dimension of A and of B. */
610 /* > \param[out] B */
612 /* > B is COMPLEX array, dimension (LDA, N). */
613 /* > On exit B N-by-N is initialized according to TYPE. */
616 /* > \param[out] X */
618 /* > X is COMPLEX array, dimension (LDX, N). */
619 /* > On exit X is the N-by-N matrix of right eigenvectors. */
622 /* > \param[in] LDX */
624 /* > LDX is INTEGER */
625 /* > The leading dimension of X. */
628 /* > \param[out] Y */
630 /* > Y is COMPLEX array, dimension (LDY, N). */
631 /* > On exit Y is the N-by-N matrix of left eigenvectors. */
634 /* > \param[in] LDY */
636 /* > LDY is INTEGER */
637 /* > The leading dimension of Y. */
640 /* > \param[in] ALPHA */
642 /* > ALPHA is COMPLEX */
645 /* > \param[in] BETA */
647 /* > BETA is COMPLEX */
649 /* > Weighting constants for matrix A. */
652 /* > \param[in] WX */
654 /* > WX is COMPLEX */
655 /* > Constant for right eigenvector matrix. */
658 /* > \param[in] WY */
660 /* > WY is COMPLEX */
661 /* > Constant for left eigenvector matrix. */
664 /* > \param[out] S */
666 /* > S is REAL array, dimension (N) */
667 /* > S(i) is the reciprocal condition number for eigenvalue i. */
670 /* > \param[out] DIF */
672 /* > DIF is REAL array, dimension (N) */
673 /* > DIF(i) is the reciprocal condition number for eigenvector i. */
679 /* > \author Univ. of Tennessee */
680 /* > \author Univ. of California Berkeley */
681 /* > \author Univ. of Colorado Denver */
682 /* > \author NAG Ltd. */
684 /* > \date December 2016 */
686 /* > \ingroup complex_matgen */
688 /* ===================================================================== */
689 /* Subroutine */ int clatm6_(integer *type__, integer *n, complex *a, integer
690 *lda, complex *b, complex *x, integer *ldx, complex *y, integer *ldy,
691 complex *alpha, complex *beta, complex *wx, complex *wy, real *s,
694 /* System generated locals */
695 integer a_dim1, a_offset, b_dim1, b_offset, x_dim1, x_offset, y_dim1,
696 y_offset, i__1, i__2, i__3;
698 complex q__1, q__2, q__3, q__4;
700 /* Local variables */
704 complex z__[64] /* was [8][8] */;
705 extern /* Subroutine */ int clakf2_(integer *, integer *, complex *,
706 integer *, complex *, complex *, complex *, complex *, integer *);
708 extern /* Subroutine */ int cgesvd_(char *, char *, integer *, integer *,
709 complex *, integer *, real *, complex *, integer *, complex *,
710 integer *, complex *, integer *, real *, integer *), clacpy_(char *, integer *, integer *, complex *, integer
711 *, complex *, integer *);
714 /* -- LAPACK computational routine (version 3.7.0) -- */
715 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
716 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
720 /* ===================================================================== */
723 /* Generate test problem ... */
726 /* Parameter adjustments */
728 b_offset = 1 + b_dim1 * 1;
731 a_offset = 1 + a_dim1 * 1;
734 x_offset = 1 + x_dim1 * 1;
737 y_offset = 1 + y_dim1 * 1;
744 for (i__ = 1; i__ <= i__1; ++i__) {
746 for (j = 1; j <= i__2; ++j) {
749 i__3 = i__ + i__ * a_dim1;
750 q__2.r = (real) i__, q__2.i = 0.f;
751 q__1.r = q__2.r + alpha->r, q__1.i = q__2.i + alpha->i;
752 a[i__3].r = q__1.r, a[i__3].i = q__1.i;
753 i__3 = i__ + i__ * b_dim1;
754 b[i__3].r = 1.f, b[i__3].i = 0.f;
756 i__3 = i__ + j * a_dim1;
757 a[i__3].r = 0.f, a[i__3].i = 0.f;
758 i__3 = i__ + j * b_dim1;
759 b[i__3].r = 0.f, b[i__3].i = 0.f;
768 a[i__1].r = 1.f, a[i__1].i = 1.f;
769 i__1 = (a_dim1 << 1) + 2;
770 r_cnjg(&q__1, &a[a_dim1 + 1]);
771 a[i__1].r = q__1.r, a[i__1].i = q__1.i;
772 i__1 = a_dim1 * 3 + 3;
773 a[i__1].r = 1.f, a[i__1].i = 0.f;
774 i__1 = (a_dim1 << 2) + 4;
775 q__2.r = alpha->r + 1.f, q__2.i = alpha->i + 0.f;
777 q__3.r = beta->r + 1.f, q__3.i = beta->i + 0.f;
779 q__1.r = r__1, q__1.i = r__2;
780 a[i__1].r = q__1.r, a[i__1].i = q__1.i;
781 i__1 = a_dim1 * 5 + 5;
782 r_cnjg(&q__1, &a[(a_dim1 << 2) + 4]);
783 a[i__1].r = q__1.r, a[i__1].i = q__1.i;
788 clacpy_("F", n, n, &b[b_offset], lda, &y[y_offset], ldy);
791 q__1.r = -q__2.r, q__1.i = -q__2.i;
792 y[i__1].r = q__1.r, y[i__1].i = q__1.i;
795 y[i__1].r = q__1.r, y[i__1].i = q__1.i;
798 q__1.r = -q__2.r, q__1.i = -q__2.i;
799 y[i__1].r = q__1.r, y[i__1].i = q__1.i;
800 i__1 = (y_dim1 << 1) + 3;
802 q__1.r = -q__2.r, q__1.i = -q__2.i;
803 y[i__1].r = q__1.r, y[i__1].i = q__1.i;
804 i__1 = (y_dim1 << 1) + 4;
806 y[i__1].r = q__1.r, y[i__1].i = q__1.i;
807 i__1 = (y_dim1 << 1) + 5;
809 q__1.r = -q__2.r, q__1.i = -q__2.i;
810 y[i__1].r = q__1.r, y[i__1].i = q__1.i;
812 clacpy_("F", n, n, &b[b_offset], lda, &x[x_offset], ldx);
813 i__1 = x_dim1 * 3 + 1;
814 q__1.r = -wx->r, q__1.i = -wx->i;
815 x[i__1].r = q__1.r, x[i__1].i = q__1.i;
816 i__1 = (x_dim1 << 2) + 1;
817 q__1.r = -wx->r, q__1.i = -wx->i;
818 x[i__1].r = q__1.r, x[i__1].i = q__1.i;
819 i__1 = x_dim1 * 5 + 1;
820 x[i__1].r = wx->r, x[i__1].i = wx->i;
821 i__1 = x_dim1 * 3 + 2;
822 x[i__1].r = wx->r, x[i__1].i = wx->i;
823 i__1 = (x_dim1 << 2) + 2;
824 q__1.r = -wx->r, q__1.i = -wx->i;
825 x[i__1].r = q__1.r, x[i__1].i = q__1.i;
826 i__1 = x_dim1 * 5 + 2;
827 q__1.r = -wx->r, q__1.i = -wx->i;
828 x[i__1].r = q__1.r, x[i__1].i = q__1.i;
832 i__1 = b_dim1 * 3 + 1;
833 q__1.r = wx->r + wy->r, q__1.i = wx->i + wy->i;
834 b[i__1].r = q__1.r, b[i__1].i = q__1.i;
835 i__1 = b_dim1 * 3 + 2;
836 q__2.r = -wx->r, q__2.i = -wx->i;
837 q__1.r = q__2.r + wy->r, q__1.i = q__2.i + wy->i;
838 b[i__1].r = q__1.r, b[i__1].i = q__1.i;
839 i__1 = (b_dim1 << 2) + 1;
840 q__1.r = wx->r - wy->r, q__1.i = wx->i - wy->i;
841 b[i__1].r = q__1.r, b[i__1].i = q__1.i;
842 i__1 = (b_dim1 << 2) + 2;
843 q__1.r = wx->r - wy->r, q__1.i = wx->i - wy->i;
844 b[i__1].r = q__1.r, b[i__1].i = q__1.i;
845 i__1 = b_dim1 * 5 + 1;
846 q__2.r = -wx->r, q__2.i = -wx->i;
847 q__1.r = q__2.r + wy->r, q__1.i = q__2.i + wy->i;
848 b[i__1].r = q__1.r, b[i__1].i = q__1.i;
849 i__1 = b_dim1 * 5 + 2;
850 q__1.r = wx->r + wy->r, q__1.i = wx->i + wy->i;
851 b[i__1].r = q__1.r, b[i__1].i = q__1.i;
852 i__1 = a_dim1 * 3 + 1;
854 q__2.r = wx->r * a[i__2].r - wx->i * a[i__2].i, q__2.i = wx->r * a[i__2]
855 .i + wx->i * a[i__2].r;
856 i__3 = a_dim1 * 3 + 3;
857 q__3.r = wy->r * a[i__3].r - wy->i * a[i__3].i, q__3.i = wy->r * a[i__3]
858 .i + wy->i * a[i__3].r;
859 q__1.r = q__2.r + q__3.r, q__1.i = q__2.i + q__3.i;
860 a[i__1].r = q__1.r, a[i__1].i = q__1.i;
861 i__1 = a_dim1 * 3 + 2;
862 q__3.r = -wx->r, q__3.i = -wx->i;
863 i__2 = (a_dim1 << 1) + 2;
864 q__2.r = q__3.r * a[i__2].r - q__3.i * a[i__2].i, q__2.i = q__3.r * a[
865 i__2].i + q__3.i * a[i__2].r;
866 i__3 = a_dim1 * 3 + 3;
867 q__4.r = wy->r * a[i__3].r - wy->i * a[i__3].i, q__4.i = wy->r * a[i__3]
868 .i + wy->i * a[i__3].r;
869 q__1.r = q__2.r + q__4.r, q__1.i = q__2.i + q__4.i;
870 a[i__1].r = q__1.r, a[i__1].i = q__1.i;
871 i__1 = (a_dim1 << 2) + 1;
873 q__2.r = wx->r * a[i__2].r - wx->i * a[i__2].i, q__2.i = wx->r * a[i__2]
874 .i + wx->i * a[i__2].r;
875 i__3 = (a_dim1 << 2) + 4;
876 q__3.r = wy->r * a[i__3].r - wy->i * a[i__3].i, q__3.i = wy->r * a[i__3]
877 .i + wy->i * a[i__3].r;
878 q__1.r = q__2.r - q__3.r, q__1.i = q__2.i - q__3.i;
879 a[i__1].r = q__1.r, a[i__1].i = q__1.i;
880 i__1 = (a_dim1 << 2) + 2;
881 i__2 = (a_dim1 << 1) + 2;
882 q__2.r = wx->r * a[i__2].r - wx->i * a[i__2].i, q__2.i = wx->r * a[i__2]
883 .i + wx->i * a[i__2].r;
884 i__3 = (a_dim1 << 2) + 4;
885 q__3.r = wy->r * a[i__3].r - wy->i * a[i__3].i, q__3.i = wy->r * a[i__3]
886 .i + wy->i * a[i__3].r;
887 q__1.r = q__2.r - q__3.r, q__1.i = q__2.i - q__3.i;
888 a[i__1].r = q__1.r, a[i__1].i = q__1.i;
889 i__1 = a_dim1 * 5 + 1;
890 q__3.r = -wx->r, q__3.i = -wx->i;
892 q__2.r = q__3.r * a[i__2].r - q__3.i * a[i__2].i, q__2.i = q__3.r * a[
893 i__2].i + q__3.i * a[i__2].r;
894 i__3 = a_dim1 * 5 + 5;
895 q__4.r = wy->r * a[i__3].r - wy->i * a[i__3].i, q__4.i = wy->r * a[i__3]
896 .i + wy->i * a[i__3].r;
897 q__1.r = q__2.r + q__4.r, q__1.i = q__2.i + q__4.i;
898 a[i__1].r = q__1.r, a[i__1].i = q__1.i;
899 i__1 = a_dim1 * 5 + 2;
900 i__2 = (a_dim1 << 1) + 2;
901 q__2.r = wx->r * a[i__2].r - wx->i * a[i__2].i, q__2.i = wx->r * a[i__2]
902 .i + wx->i * a[i__2].r;
903 i__3 = a_dim1 * 5 + 5;
904 q__3.r = wy->r * a[i__3].r - wy->i * a[i__3].i, q__3.i = wy->r * a[i__3]
905 .i + wy->i * a[i__3].r;
906 q__1.r = q__2.r + q__3.r, q__1.i = q__2.i + q__3.i;
907 a[i__1].r = q__1.r, a[i__1].i = q__1.i;
909 /* Compute condition numbers */
911 s[1] = 1.f / sqrt((c_abs(wy) * 3.f * c_abs(wy) + 1.f) / (c_abs(&a[a_dim1
912 + 1]) * c_abs(&a[a_dim1 + 1]) + 1.f));
913 s[2] = 1.f / sqrt((c_abs(wy) * 3.f * c_abs(wy) + 1.f) / (c_abs(&a[(a_dim1
914 << 1) + 2]) * c_abs(&a[(a_dim1 << 1) + 2]) + 1.f));
915 s[3] = 1.f / sqrt((c_abs(wx) * 2.f * c_abs(wx) + 1.f) / (c_abs(&a[a_dim1 *
916 3 + 3]) * c_abs(&a[a_dim1 * 3 + 3]) + 1.f));
917 s[4] = 1.f / sqrt((c_abs(wx) * 2.f * c_abs(wx) + 1.f) / (c_abs(&a[(a_dim1
918 << 2) + 4]) * c_abs(&a[(a_dim1 << 2) + 4]) + 1.f));
919 s[5] = 1.f / sqrt((c_abs(wx) * 2.f * c_abs(wx) + 1.f) / (c_abs(&a[a_dim1 *
920 5 + 5]) * c_abs(&a[a_dim1 * 5 + 5]) + 1.f));
922 clakf2_(&c__1, &c__4, &a[a_offset], lda, &a[(a_dim1 << 1) + 2], &b[
923 b_offset], &b[(b_dim1 << 1) + 2], z__, &c__8);
924 cgesvd_("N", "N", &c__8, &c__8, z__, &c__8, rwork, work, &c__1, &work[1],
925 &c__1, &work[2], &c__24, &rwork[8], &info);
928 clakf2_(&c__4, &c__1, &a[a_offset], lda, &a[a_dim1 * 5 + 5], &b[b_offset],
929 &b[b_dim1 * 5 + 5], z__, &c__8);
930 cgesvd_("N", "N", &c__8, &c__8, z__, &c__8, rwork, work, &c__1, &work[1],
931 &c__1, &work[2], &c__24, &rwork[8], &info);