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__12 = 12;
518 static integer c__8 = 8;
519 static integer c__40 = 40;
520 static integer c__2 = 2;
521 static integer c__3 = 3;
522 static integer c__60 = 60;
524 /* > \brief \b SLATM6 */
526 /* =========== DOCUMENTATION =========== */
528 /* Online html documentation available at */
529 /* http://www.netlib.org/lapack/explore-html/ */
534 /* SUBROUTINE SLATM6( TYPE, N, A, LDA, B, X, LDX, Y, LDY, ALPHA, */
535 /* BETA, WX, WY, S, DIF ) */
537 /* INTEGER LDA, LDX, LDY, N, TYPE */
538 /* REAL ALPHA, BETA, WX, WY */
539 /* REAL A( LDA, * ), B( LDA, * ), DIF( * ), S( * ), */
540 /* $ X( LDX, * ), Y( LDY, * ) */
543 /* > \par Purpose: */
548 /* > SLATM6 generates test matrices for the generalized eigenvalue */
549 /* > problem, their corresponding right and left eigenvector matrices, */
550 /* > and also reciprocal condition numbers for all eigenvalues and */
551 /* > the reciprocal condition numbers of eigenvectors corresponding to */
552 /* > the 1th and 5th eigenvalues. */
554 /* > Test Matrices */
555 /* > ============= */
557 /* > Two kinds of test matrix pairs */
559 /* > (A, B) = inverse(YH) * (Da, Db) * inverse(X) */
561 /* > are used in the tests: */
564 /* > Da = 1+a 0 0 0 0 Db = 1 0 0 0 0 */
565 /* > 0 2+a 0 0 0 0 1 0 0 0 */
566 /* > 0 0 3+a 0 0 0 0 1 0 0 */
567 /* > 0 0 0 4+a 0 0 0 0 1 0 */
568 /* > 0 0 0 0 5+a , 0 0 0 0 1 , and */
571 /* > Da = 1 -1 0 0 0 Db = 1 0 0 0 0 */
572 /* > 1 1 0 0 0 0 1 0 0 0 */
573 /* > 0 0 1 0 0 0 0 1 0 0 */
574 /* > 0 0 0 1+a 1+b 0 0 0 1 0 */
575 /* > 0 0 0 -1-b 1+a , 0 0 0 0 1 . */
577 /* > In both cases the same inverse(YH) and inverse(X) are used to compute */
578 /* > (A, B), giving the exact eigenvectors to (A,B) as (YH, X): */
580 /* > YH: = 1 0 -y y -y X = 1 0 -x -x x */
581 /* > 0 1 -y y -y 0 1 x -x -x */
582 /* > 0 0 1 0 0 0 0 1 0 0 */
583 /* > 0 0 0 1 0 0 0 0 1 0 */
584 /* > 0 0 0 0 1, 0 0 0 0 1 , */
586 /* > where a, b, x and y will have all values independently of each other. */
592 /* > \param[in] TYPE */
594 /* > TYPE is INTEGER */
595 /* > Specifies the problem type (see further details). */
601 /* > Size of the matrices A and B. */
604 /* > \param[out] A */
606 /* > A is REAL array, dimension (LDA, N). */
607 /* > On exit A N-by-N is initialized according to TYPE. */
610 /* > \param[in] LDA */
612 /* > LDA is INTEGER */
613 /* > The leading dimension of A and of B. */
616 /* > \param[out] B */
618 /* > B is REAL array, dimension (LDA, N). */
619 /* > On exit B N-by-N is initialized according to TYPE. */
622 /* > \param[out] X */
624 /* > X is REAL array, dimension (LDX, N). */
625 /* > On exit X is the N-by-N matrix of right eigenvectors. */
628 /* > \param[in] LDX */
630 /* > LDX is INTEGER */
631 /* > The leading dimension of X. */
634 /* > \param[out] Y */
636 /* > Y is REAL array, dimension (LDY, N). */
637 /* > On exit Y is the N-by-N matrix of left eigenvectors. */
640 /* > \param[in] LDY */
642 /* > LDY is INTEGER */
643 /* > The leading dimension of Y. */
646 /* > \param[in] ALPHA */
648 /* > ALPHA is REAL */
651 /* > \param[in] BETA */
655 /* > Weighting constants for matrix A. */
658 /* > \param[in] WX */
661 /* > Constant for right eigenvector matrix. */
664 /* > \param[in] WY */
667 /* > Constant for left eigenvector matrix. */
670 /* > \param[out] S */
672 /* > S is REAL array, dimension (N) */
673 /* > S(i) is the reciprocal condition number for eigenvalue i. */
676 /* > \param[out] DIF */
678 /* > DIF is REAL array, dimension (N) */
679 /* > DIF(i) is the reciprocal condition number for eigenvector i. */
685 /* > \author Univ. of Tennessee */
686 /* > \author Univ. of California Berkeley */
687 /* > \author Univ. of Colorado Denver */
688 /* > \author NAG Ltd. */
690 /* > \date December 2016 */
692 /* > \ingroup real_matgen */
694 /* ===================================================================== */
695 /* Subroutine */ int slatm6_(integer *type__, integer *n, real *a, integer *
696 lda, real *b, real *x, integer *ldx, real *y, integer *ldy, real *
697 alpha, real *beta, real *wx, real *wy, real *s, real *dif)
699 /* System generated locals */
700 integer a_dim1, a_offset, b_dim1, b_offset, x_dim1, x_offset, y_dim1,
701 y_offset, i__1, i__2;
703 /* Local variables */
707 real z__[144] /* was [12][12] */;
708 extern /* Subroutine */ int slakf2_(integer *, integer *, real *, integer
709 *, real *, real *, real *, real *, integer *), sgesvd_(char *,
710 char *, integer *, integer *, real *, integer *, real *, real *,
711 integer *, real *, integer *, real *, integer *, integer *), slacpy_(char *, integer *, integer *, real *,
712 integer *, real *, integer *);
715 /* -- LAPACK computational routine (version 3.7.0) -- */
716 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
717 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
721 /* ===================================================================== */
724 /* Generate test problem ... */
727 /* Parameter adjustments */
729 b_offset = 1 + b_dim1 * 1;
732 a_offset = 1 + a_dim1 * 1;
735 x_offset = 1 + x_dim1 * 1;
738 y_offset = 1 + y_dim1 * 1;
745 for (i__ = 1; i__ <= i__1; ++i__) {
747 for (j = 1; j <= i__2; ++j) {
750 a[i__ + i__ * a_dim1] = (real) i__ + *alpha;
751 b[i__ + i__ * b_dim1] = 1.f;
753 a[i__ + j * a_dim1] = 0.f;
754 b[i__ + j * b_dim1] = 0.f;
764 slacpy_("F", n, n, &b[b_offset], lda, &y[y_offset], ldy);
765 y[y_dim1 + 3] = -(*wy);
767 y[y_dim1 + 5] = -(*wy);
768 y[(y_dim1 << 1) + 3] = -(*wy);
769 y[(y_dim1 << 1) + 4] = *wy;
770 y[(y_dim1 << 1) + 5] = -(*wy);
772 slacpy_("F", n, n, &b[b_offset], lda, &x[x_offset], ldx);
773 x[x_dim1 * 3 + 1] = -(*wx);
774 x[(x_dim1 << 2) + 1] = -(*wx);
775 x[x_dim1 * 5 + 1] = *wx;
776 x[x_dim1 * 3 + 2] = *wx;
777 x[(x_dim1 << 2) + 2] = -(*wx);
778 x[x_dim1 * 5 + 2] = -(*wx);
782 b[b_dim1 * 3 + 1] = *wx + *wy;
783 b[b_dim1 * 3 + 2] = -(*wx) + *wy;
784 b[(b_dim1 << 2) + 1] = *wx - *wy;
785 b[(b_dim1 << 2) + 2] = *wx - *wy;
786 b[b_dim1 * 5 + 1] = -(*wx) + *wy;
787 b[b_dim1 * 5 + 2] = *wx + *wy;
789 a[a_dim1 * 3 + 1] = *wx * a[a_dim1 + 1] + *wy * a[a_dim1 * 3 + 3];
790 a[a_dim1 * 3 + 2] = -(*wx) * a[(a_dim1 << 1) + 2] + *wy * a[a_dim1 *
792 a[(a_dim1 << 2) + 1] = *wx * a[a_dim1 + 1] - *wy * a[(a_dim1 << 2) +
794 a[(a_dim1 << 2) + 2] = *wx * a[(a_dim1 << 1) + 2] - *wy * a[(a_dim1 <<
796 a[a_dim1 * 5 + 1] = -(*wx) * a[a_dim1 + 1] + *wy * a[a_dim1 * 5 + 5];
797 a[a_dim1 * 5 + 2] = *wx * a[(a_dim1 << 1) + 2] + *wy * a[a_dim1 * 5 +
799 } else if (*type__ == 2) {
800 a[a_dim1 * 3 + 1] = *wx * 2.f + *wy;
801 a[a_dim1 * 3 + 2] = *wy;
802 a[(a_dim1 << 2) + 1] = -(*wy) * (*alpha + 2.f + *beta);
803 a[(a_dim1 << 2) + 2] = *wx * 2.f - *wy * (*alpha + 2.f + *beta);
804 a[a_dim1 * 5 + 1] = *wx * -2.f + *wy * (*alpha - *beta);
805 a[a_dim1 * 5 + 2] = *wy * (*alpha - *beta);
807 a[(a_dim1 << 1) + 1] = -1.f;
809 a[(a_dim1 << 1) + 2] = a[a_dim1 + 1];
810 a[a_dim1 * 3 + 3] = 1.f;
811 a[(a_dim1 << 2) + 4] = *alpha + 1.f;
812 a[a_dim1 * 5 + 4] = *beta + 1.f;
813 a[(a_dim1 << 2) + 5] = -a[a_dim1 * 5 + 4];
814 a[a_dim1 * 5 + 5] = a[(a_dim1 << 2) + 4];
817 /* Compute condition numbers */
821 s[1] = 1.f / sqrt((*wy * 3.f * *wy + 1.f) / (a[a_dim1 + 1] * a[a_dim1
823 s[2] = 1.f / sqrt((*wy * 3.f * *wy + 1.f) / (a[(a_dim1 << 1) + 2] * a[
824 (a_dim1 << 1) + 2] + 1.f));
825 s[3] = 1.f / sqrt((*wx * 2.f * *wx + 1.f) / (a[a_dim1 * 3 + 3] * a[
826 a_dim1 * 3 + 3] + 1.f));
827 s[4] = 1.f / sqrt((*wx * 2.f * *wx + 1.f) / (a[(a_dim1 << 2) + 4] * a[
828 (a_dim1 << 2) + 4] + 1.f));
829 s[5] = 1.f / sqrt((*wx * 2.f * *wx + 1.f) / (a[a_dim1 * 5 + 5] * a[
830 a_dim1 * 5 + 5] + 1.f));
832 slakf2_(&c__1, &c__4, &a[a_offset], lda, &a[(a_dim1 << 1) + 2], &b[
833 b_offset], &b[(b_dim1 << 1) + 2], z__, &c__12);
834 sgesvd_("N", "N", &c__8, &c__8, z__, &c__12, work, &work[8], &c__1, &
835 work[9], &c__1, &work[10], &c__40, &info);
838 slakf2_(&c__4, &c__1, &a[a_offset], lda, &a[a_dim1 * 5 + 5], &b[
839 b_offset], &b[b_dim1 * 5 + 5], z__, &c__12);
840 sgesvd_("N", "N", &c__8, &c__8, z__, &c__12, work, &work[8], &c__1, &
841 work[9], &c__1, &work[10], &c__40, &info);
844 } else if (*type__ == 2) {
846 s[1] = 1.f / sqrt(*wy * *wy + .33333333333333331f);
848 s[3] = 1.f / sqrt(*wx * *wx + .5f);
849 s[4] = 1.f / sqrt((*wx * 2.f * *wx + 1.f) / ((*alpha + 1.f) * (*alpha
850 + 1.f) + 1.f + (*beta + 1.f) * (*beta + 1.f)));
853 slakf2_(&c__2, &c__3, &a[a_offset], lda, &a[a_dim1 * 3 + 3], &b[
854 b_offset], &b[b_dim1 * 3 + 3], z__, &c__12);
855 sgesvd_("N", "N", &c__12, &c__12, z__, &c__12, work, &work[12], &c__1,
856 &work[13], &c__1, &work[14], &c__60, &info);
859 slakf2_(&c__3, &c__2, &a[a_offset], lda, &a[(a_dim1 << 2) + 4], &b[
860 b_offset], &b[(b_dim1 << 2) + 4], z__, &c__12);
861 sgesvd_("N", "N", &c__12, &c__12, z__, &c__12, work, &work[12], &c__1,
862 &work[13], &c__1, &work[14], &c__60, &info);