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 /* > \brief \b CLAGS2 */
515 /* =========== DOCUMENTATION =========== */
517 /* Online html documentation available at */
518 /* http://www.netlib.org/lapack/explore-html/ */
521 /* > Download CLAGS2 + dependencies */
522 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/clags2.
525 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/clags2.
528 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/clags2.
536 /* SUBROUTINE CLAGS2( UPPER, A1, A2, A3, B1, B2, B3, CSU, SNU, CSV, */
537 /* SNV, CSQ, SNQ ) */
540 /* REAL A1, A3, B1, B3, CSQ, CSU, CSV */
541 /* COMPLEX A2, B2, SNQ, SNU, SNV */
544 /* > \par Purpose: */
549 /* > CLAGS2 computes 2-by-2 unitary matrices U, V and Q, such */
550 /* > that if ( UPPER ) then */
552 /* > U**H *A*Q = U**H *( A1 A2 )*Q = ( x 0 ) */
553 /* > ( 0 A3 ) ( x x ) */
555 /* > V**H*B*Q = V**H *( B1 B2 )*Q = ( x 0 ) */
556 /* > ( 0 B3 ) ( x x ) */
558 /* > or if ( .NOT.UPPER ) then */
560 /* > U**H *A*Q = U**H *( A1 0 )*Q = ( x x ) */
561 /* > ( A2 A3 ) ( 0 x ) */
563 /* > V**H *B*Q = V**H *( B1 0 )*Q = ( x x ) */
564 /* > ( B2 B3 ) ( 0 x ) */
567 /* > U = ( CSU SNU ), V = ( CSV SNV ), */
568 /* > ( -SNU**H CSU ) ( -SNV**H CSV ) */
570 /* > Q = ( CSQ SNQ ) */
571 /* > ( -SNQ**H CSQ ) */
573 /* > The rows of the transformed A and B are parallel. Moreover, if the */
574 /* > input 2-by-2 matrix A is not zero, then the transformed (1,1) entry */
575 /* > of A is not zero. If the input matrices A and B are both not zero, */
576 /* > then the transformed (2,2) element of B is not zero, except when the */
577 /* > first rows of input A and B are parallel and the second rows are */
584 /* > \param[in] UPPER */
586 /* > UPPER is LOGICAL */
587 /* > = .TRUE.: the input matrices A and B are upper triangular. */
588 /* > = .FALSE.: the input matrices A and B are lower triangular. */
591 /* > \param[in] A1 */
596 /* > \param[in] A2 */
598 /* > A2 is COMPLEX */
601 /* > \param[in] A3 */
604 /* > On entry, A1, A2 and A3 are elements of the input 2-by-2 */
605 /* > upper (lower) triangular matrix A. */
608 /* > \param[in] B1 */
613 /* > \param[in] B2 */
615 /* > B2 is COMPLEX */
618 /* > \param[in] B3 */
621 /* > On entry, B1, B2 and B3 are elements of the input 2-by-2 */
622 /* > upper (lower) triangular matrix B. */
625 /* > \param[out] CSU */
630 /* > \param[out] SNU */
632 /* > SNU is COMPLEX */
633 /* > The desired unitary matrix U. */
636 /* > \param[out] CSV */
641 /* > \param[out] SNV */
643 /* > SNV is COMPLEX */
644 /* > The desired unitary matrix V. */
647 /* > \param[out] CSQ */
652 /* > \param[out] SNQ */
654 /* > SNQ is COMPLEX */
655 /* > The desired unitary matrix Q. */
661 /* > \author Univ. of Tennessee */
662 /* > \author Univ. of California Berkeley */
663 /* > \author Univ. of Colorado Denver */
664 /* > \author NAG Ltd. */
666 /* > \date December 2016 */
668 /* > \ingroup complexOTHERauxiliary */
670 /* ===================================================================== */
671 /* Subroutine */ int clags2_(logical *upper, real *a1, complex *a2, real *a3,
672 real *b1, complex *b2, real *b3, real *csu, complex *snu, real *csv,
673 complex *snv, real *csq, complex *snq)
675 /* System generated locals */
676 real r__1, r__2, r__3, r__4, r__5, r__6, r__7, r__8;
677 complex q__1, q__2, q__3, q__4, q__5;
679 /* Local variables */
680 real aua11, aua12, aua21, aua22, avb11, avb12, avb21, avb22, ua11r, ua22r,
686 extern /* Subroutine */ int slasv2_(real *, real *, real *, real *, real *
687 , real *, real *, real *, real *), clartg_(complex *, complex *,
688 real *, complex *, complex *);
689 complex ua11, ua12, ua21, ua22, vb11, vb12, vb21, vb22;
690 real csl, csr, snl, snr;
693 /* -- LAPACK auxiliary routine (version 3.7.0) -- */
694 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
695 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
699 /* ===================================================================== */
704 /* Input matrices A and B are upper triangular matrices */
706 /* Form matrix C = A*adj(B) = ( a b ) */
711 q__2.r = *b1 * a2->r, q__2.i = *b1 * a2->i;
712 q__3.r = *a1 * b2->r, q__3.i = *a1 * b2->i;
713 q__1.r = q__2.r - q__3.r, q__1.i = q__2.i - q__3.i;
714 b.r = q__1.r, b.i = q__1.i;
717 /* Transform complex 2-by-2 matrix C to real matrix by unitary */
718 /* diagonal matrix diag(1,D1). */
720 d1.r = 1.f, d1.i = 0.f;
722 q__1.r = b.r / fb, q__1.i = b.i / fb;
723 d1.r = q__1.r, d1.i = q__1.i;
726 /* The SVD of real 2 by 2 triangular C */
728 /* ( CSL -SNL )*( A B )*( CSR SNR ) = ( R 0 ) */
729 /* ( SNL CSL ) ( 0 D ) ( -SNR CSR ) ( 0 T ) */
731 slasv2_(&a, &fb, &d__, &s1, &s2, &snr, &csr, &snl, &csl);
733 if (abs(csl) >= abs(snl) || abs(csr) >= abs(snr)) {
735 /* Compute the (1,1) and (1,2) elements of U**H *A and V**H *B, */
736 /* and (1,2) element of |U|**H *|A| and |V|**H *|B|. */
739 q__2.r = csl * a2->r, q__2.i = csl * a2->i;
740 q__4.r = snl * d1.r, q__4.i = snl * d1.i;
741 q__3.r = *a3 * q__4.r, q__3.i = *a3 * q__4.i;
742 q__1.r = q__2.r + q__3.r, q__1.i = q__2.i + q__3.i;
743 ua12.r = q__1.r, ua12.i = q__1.i;
746 q__2.r = csr * b2->r, q__2.i = csr * b2->i;
747 q__4.r = snr * d1.r, q__4.i = snr * d1.i;
748 q__3.r = *b3 * q__4.r, q__3.i = *b3 * q__4.i;
749 q__1.r = q__2.r + q__3.r, q__1.i = q__2.i + q__3.i;
750 vb12.r = q__1.r, vb12.i = q__1.i;
752 aua12 = abs(csl) * ((r__1 = a2->r, abs(r__1)) + (r__2 = r_imag(a2)
753 , abs(r__2))) + abs(snl) * abs(*a3);
754 avb12 = abs(csr) * ((r__1 = b2->r, abs(r__1)) + (r__2 = r_imag(b2)
755 , abs(r__2))) + abs(snr) * abs(*b3);
757 /* zero (1,2) elements of U**H *A and V**H *B */
759 if (abs(ua11r) + ((r__1 = ua12.r, abs(r__1)) + (r__2 = r_imag(&
760 ua12), abs(r__2))) == 0.f) {
761 q__2.r = vb11r, q__2.i = 0.f;
762 q__1.r = -q__2.r, q__1.i = -q__2.i;
763 r_cnjg(&q__3, &vb12);
764 clartg_(&q__1, &q__3, csq, snq, &r__);
765 } else if (abs(vb11r) + ((r__1 = vb12.r, abs(r__1)) + (r__2 =
766 r_imag(&vb12), abs(r__2))) == 0.f) {
767 q__2.r = ua11r, q__2.i = 0.f;
768 q__1.r = -q__2.r, q__1.i = -q__2.i;
769 r_cnjg(&q__3, &ua12);
770 clartg_(&q__1, &q__3, csq, snq, &r__);
771 } else if (aua12 / (abs(ua11r) + ((r__1 = ua12.r, abs(r__1)) + (
772 r__2 = r_imag(&ua12), abs(r__2)))) <= avb12 / (abs(vb11r)
773 + ((r__3 = vb12.r, abs(r__3)) + (r__4 = r_imag(&vb12),
775 q__2.r = ua11r, q__2.i = 0.f;
776 q__1.r = -q__2.r, q__1.i = -q__2.i;
777 r_cnjg(&q__3, &ua12);
778 clartg_(&q__1, &q__3, csq, snq, &r__);
780 q__2.r = vb11r, q__2.i = 0.f;
781 q__1.r = -q__2.r, q__1.i = -q__2.i;
782 r_cnjg(&q__3, &vb12);
783 clartg_(&q__1, &q__3, csq, snq, &r__);
787 q__2.r = -d1.r, q__2.i = -d1.i;
788 q__1.r = snl * q__2.r, q__1.i = snl * q__2.i;
789 snu->r = q__1.r, snu->i = q__1.i;
791 q__2.r = -d1.r, q__2.i = -d1.i;
792 q__1.r = snr * q__2.r, q__1.i = snr * q__2.i;
793 snv->r = q__1.r, snv->i = q__1.i;
797 /* Compute the (2,1) and (2,2) elements of U**H *A and V**H *B, */
798 /* and (2,2) element of |U|**H *|A| and |V|**H *|B|. */
801 q__3.r = -q__4.r, q__3.i = -q__4.i;
802 q__2.r = snl * q__3.r, q__2.i = snl * q__3.i;
803 q__1.r = *a1 * q__2.r, q__1.i = *a1 * q__2.i;
804 ua21.r = q__1.r, ua21.i = q__1.i;
806 q__4.r = -q__5.r, q__4.i = -q__5.i;
807 q__3.r = snl * q__4.r, q__3.i = snl * q__4.i;
808 q__2.r = q__3.r * a2->r - q__3.i * a2->i, q__2.i = q__3.r * a2->i
811 q__1.r = q__2.r + r__1, q__1.i = q__2.i;
812 ua22.r = q__1.r, ua22.i = q__1.i;
815 q__3.r = -q__4.r, q__3.i = -q__4.i;
816 q__2.r = snr * q__3.r, q__2.i = snr * q__3.i;
817 q__1.r = *b1 * q__2.r, q__1.i = *b1 * q__2.i;
818 vb21.r = q__1.r, vb21.i = q__1.i;
820 q__4.r = -q__5.r, q__4.i = -q__5.i;
821 q__3.r = snr * q__4.r, q__3.i = snr * q__4.i;
822 q__2.r = q__3.r * b2->r - q__3.i * b2->i, q__2.i = q__3.r * b2->i
825 q__1.r = q__2.r + r__1, q__1.i = q__2.i;
826 vb22.r = q__1.r, vb22.i = q__1.i;
828 aua22 = abs(snl) * ((r__1 = a2->r, abs(r__1)) + (r__2 = r_imag(a2)
829 , abs(r__2))) + abs(csl) * abs(*a3);
830 avb22 = abs(snr) * ((r__1 = b2->r, abs(r__1)) + (r__2 = r_imag(b2)
831 , abs(r__2))) + abs(csr) * abs(*b3);
833 /* zero (2,2) elements of U**H *A and V**H *B, and then swap. */
835 if ((r__1 = ua21.r, abs(r__1)) + (r__2 = r_imag(&ua21), abs(r__2))
836 + ((r__3 = ua22.r, abs(r__3)) + (r__4 = r_imag(&ua22),
837 abs(r__4))) == 0.f) {
838 r_cnjg(&q__2, &vb21);
839 q__1.r = -q__2.r, q__1.i = -q__2.i;
840 r_cnjg(&q__3, &vb22);
841 clartg_(&q__1, &q__3, csq, snq, &r__);
842 } else if ((r__1 = vb21.r, abs(r__1)) + (r__2 = r_imag(&vb21),
843 abs(r__2)) + c_abs(&vb22) == 0.f) {
844 r_cnjg(&q__2, &ua21);
845 q__1.r = -q__2.r, q__1.i = -q__2.i;
846 r_cnjg(&q__3, &ua22);
847 clartg_(&q__1, &q__3, csq, snq, &r__);
848 } else if (aua22 / ((r__1 = ua21.r, abs(r__1)) + (r__2 = r_imag(&
849 ua21), abs(r__2)) + ((r__3 = ua22.r, abs(r__3)) + (r__4 =
850 r_imag(&ua22), abs(r__4)))) <= avb22 / ((r__5 = vb21.r,
851 abs(r__5)) + (r__6 = r_imag(&vb21), abs(r__6)) + ((r__7 =
852 vb22.r, abs(r__7)) + (r__8 = r_imag(&vb22), abs(r__8)))))
854 r_cnjg(&q__2, &ua21);
855 q__1.r = -q__2.r, q__1.i = -q__2.i;
856 r_cnjg(&q__3, &ua22);
857 clartg_(&q__1, &q__3, csq, snq, &r__);
859 r_cnjg(&q__2, &vb21);
860 q__1.r = -q__2.r, q__1.i = -q__2.i;
861 r_cnjg(&q__3, &vb22);
862 clartg_(&q__1, &q__3, csq, snq, &r__);
866 q__1.r = csl * d1.r, q__1.i = csl * d1.i;
867 snu->r = q__1.r, snu->i = q__1.i;
869 q__1.r = csr * d1.r, q__1.i = csr * d1.i;
870 snv->r = q__1.r, snv->i = q__1.i;
876 /* Input matrices A and B are lower triangular matrices */
878 /* Form matrix C = A*adj(B) = ( a 0 ) */
883 q__2.r = *b3 * a2->r, q__2.i = *b3 * a2->i;
884 q__3.r = *a3 * b2->r, q__3.i = *a3 * b2->i;
885 q__1.r = q__2.r - q__3.r, q__1.i = q__2.i - q__3.i;
886 c__.r = q__1.r, c__.i = q__1.i;
889 /* Transform complex 2-by-2 matrix C to real matrix by unitary */
890 /* diagonal matrix diag(d1,1). */
892 d1.r = 1.f, d1.i = 0.f;
894 q__1.r = c__.r / fc, q__1.i = c__.i / fc;
895 d1.r = q__1.r, d1.i = q__1.i;
898 /* The SVD of real 2 by 2 triangular C */
900 /* ( CSL -SNL )*( A 0 )*( CSR SNR ) = ( R 0 ) */
901 /* ( SNL CSL ) ( C D ) ( -SNR CSR ) ( 0 T ) */
903 slasv2_(&a, &fc, &d__, &s1, &s2, &snr, &csr, &snl, &csl);
905 if (abs(csr) >= abs(snr) || abs(csl) >= abs(snl)) {
907 /* Compute the (2,1) and (2,2) elements of U**H *A and V**H *B, */
908 /* and (2,1) element of |U|**H *|A| and |V|**H *|B|. */
910 q__4.r = -d1.r, q__4.i = -d1.i;
911 q__3.r = snr * q__4.r, q__3.i = snr * q__4.i;
912 q__2.r = *a1 * q__3.r, q__2.i = *a1 * q__3.i;
913 q__5.r = csr * a2->r, q__5.i = csr * a2->i;
914 q__1.r = q__2.r + q__5.r, q__1.i = q__2.i + q__5.i;
915 ua21.r = q__1.r, ua21.i = q__1.i;
918 q__4.r = -d1.r, q__4.i = -d1.i;
919 q__3.r = snl * q__4.r, q__3.i = snl * q__4.i;
920 q__2.r = *b1 * q__3.r, q__2.i = *b1 * q__3.i;
921 q__5.r = csl * b2->r, q__5.i = csl * b2->i;
922 q__1.r = q__2.r + q__5.r, q__1.i = q__2.i + q__5.i;
923 vb21.r = q__1.r, vb21.i = q__1.i;
926 aua21 = abs(snr) * abs(*a1) + abs(csr) * ((r__1 = a2->r, abs(r__1)
927 ) + (r__2 = r_imag(a2), abs(r__2)));
928 avb21 = abs(snl) * abs(*b1) + abs(csl) * ((r__1 = b2->r, abs(r__1)
929 ) + (r__2 = r_imag(b2), abs(r__2)));
931 /* zero (2,1) elements of U**H *A and V**H *B. */
933 if ((r__1 = ua21.r, abs(r__1)) + (r__2 = r_imag(&ua21), abs(r__2))
934 + abs(ua22r) == 0.f) {
935 q__1.r = vb22r, q__1.i = 0.f;
936 clartg_(&q__1, &vb21, csq, snq, &r__);
937 } else if ((r__1 = vb21.r, abs(r__1)) + (r__2 = r_imag(&vb21),
938 abs(r__2)) + abs(vb22r) == 0.f) {
939 q__1.r = ua22r, q__1.i = 0.f;
940 clartg_(&q__1, &ua21, csq, snq, &r__);
941 } else if (aua21 / ((r__1 = ua21.r, abs(r__1)) + (r__2 = r_imag(&
942 ua21), abs(r__2)) + abs(ua22r)) <= avb21 / ((r__3 =
943 vb21.r, abs(r__3)) + (r__4 = r_imag(&vb21), abs(r__4)) +
945 q__1.r = ua22r, q__1.i = 0.f;
946 clartg_(&q__1, &ua21, csq, snq, &r__);
948 q__1.r = vb22r, q__1.i = 0.f;
949 clartg_(&q__1, &vb21, csq, snq, &r__);
954 q__2.r = -q__3.r, q__2.i = -q__3.i;
955 q__1.r = snr * q__2.r, q__1.i = snr * q__2.i;
956 snu->r = q__1.r, snu->i = q__1.i;
959 q__2.r = -q__3.r, q__2.i = -q__3.i;
960 q__1.r = snl * q__2.r, q__1.i = snl * q__2.i;
961 snv->r = q__1.r, snv->i = q__1.i;
965 /* Compute the (1,1) and (1,2) elements of U**H *A and V**H *B, */
966 /* and (1,1) element of |U|**H *|A| and |V|**H *|B|. */
970 q__3.r = snr * q__4.r, q__3.i = snr * q__4.i;
971 q__2.r = q__3.r * a2->r - q__3.i * a2->i, q__2.i = q__3.r * a2->i
973 q__1.r = r__1 + q__2.r, q__1.i = q__2.i;
974 ua11.r = q__1.r, ua11.i = q__1.i;
976 q__2.r = snr * q__3.r, q__2.i = snr * q__3.i;
977 q__1.r = *a3 * q__2.r, q__1.i = *a3 * q__2.i;
978 ua12.r = q__1.r, ua12.i = q__1.i;
982 q__3.r = snl * q__4.r, q__3.i = snl * q__4.i;
983 q__2.r = q__3.r * b2->r - q__3.i * b2->i, q__2.i = q__3.r * b2->i
985 q__1.r = r__1 + q__2.r, q__1.i = q__2.i;
986 vb11.r = q__1.r, vb11.i = q__1.i;
988 q__2.r = snl * q__3.r, q__2.i = snl * q__3.i;
989 q__1.r = *b3 * q__2.r, q__1.i = *b3 * q__2.i;
990 vb12.r = q__1.r, vb12.i = q__1.i;
992 aua11 = abs(csr) * abs(*a1) + abs(snr) * ((r__1 = a2->r, abs(r__1)
993 ) + (r__2 = r_imag(a2), abs(r__2)));
994 avb11 = abs(csl) * abs(*b1) + abs(snl) * ((r__1 = b2->r, abs(r__1)
995 ) + (r__2 = r_imag(b2), abs(r__2)));
997 /* zero (1,1) elements of U**H *A and V**H *B, and then swap. */
999 if ((r__1 = ua11.r, abs(r__1)) + (r__2 = r_imag(&ua11), abs(r__2))
1000 + ((r__3 = ua12.r, abs(r__3)) + (r__4 = r_imag(&ua12),
1001 abs(r__4))) == 0.f) {
1002 clartg_(&vb12, &vb11, csq, snq, &r__);
1003 } else if ((r__1 = vb11.r, abs(r__1)) + (r__2 = r_imag(&vb11),
1004 abs(r__2)) + ((r__3 = vb12.r, abs(r__3)) + (r__4 = r_imag(
1005 &vb12), abs(r__4))) == 0.f) {
1006 clartg_(&ua12, &ua11, csq, snq, &r__);
1007 } else if (aua11 / ((r__1 = ua11.r, abs(r__1)) + (r__2 = r_imag(&
1008 ua11), abs(r__2)) + ((r__3 = ua12.r, abs(r__3)) + (r__4 =
1009 r_imag(&ua12), abs(r__4)))) <= avb11 / ((r__5 = vb11.r,
1010 abs(r__5)) + (r__6 = r_imag(&vb11), abs(r__6)) + ((r__7 =
1011 vb12.r, abs(r__7)) + (r__8 = r_imag(&vb12), abs(r__8)))))
1013 clartg_(&ua12, &ua11, csq, snq, &r__);
1015 clartg_(&vb12, &vb11, csq, snq, &r__);
1020 q__1.r = csr * q__2.r, q__1.i = csr * q__2.i;
1021 snu->r = q__1.r, snu->i = q__1.i;
1024 q__1.r = csl * q__2.r, q__1.i = csl * q__2.i;
1025 snv->r = q__1.r, snv->i = q__1.i;