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 complex c_b1 = {0.f,0.f};
516 static complex c_b2 = {1.f,0.f};
518 /* > \brief \b CTPLQT2 */
523 /* SUBROUTINE CTPLQT2( M, N, L, A, LDA, B, LDB, T, LDT, INFO ) */
525 /* INTEGER INFO, LDA, LDB, LDT, N, M, L */
526 /* COMPLEX A( LDA, * ), B( LDB, * ), T( LDT, * ) */
529 /* > \par Purpose: */
534 /* > CTPLQT2 computes a LQ a factorization of a complex "triangular-pentagonal" */
535 /* > matrix C, which is composed of a triangular block A and pentagonal block B, */
536 /* > using the compact WY representation for Q. */
545 /* > The total number of rows of the matrix B. */
552 /* > The number of columns of the matrix B, and the order of */
553 /* > the triangular matrix A. */
560 /* > The number of rows of the lower trapezoidal part of B. */
561 /* > MIN(M,N) >= L >= 0. See Further Details. */
564 /* > \param[in,out] A */
566 /* > A is COMPLEX array, dimension (LDA,M) */
567 /* > On entry, the lower triangular M-by-M matrix A. */
568 /* > On exit, the elements on and below the diagonal of the array */
569 /* > contain the lower triangular matrix L. */
572 /* > \param[in] LDA */
574 /* > LDA is INTEGER */
575 /* > The leading dimension of the array A. LDA >= f2cmax(1,M). */
578 /* > \param[in,out] B */
580 /* > B is COMPLEX array, dimension (LDB,N) */
581 /* > On entry, the pentagonal M-by-N matrix B. The first N-L columns */
582 /* > are rectangular, and the last L columns are lower trapezoidal. */
583 /* > On exit, B contains the pentagonal matrix V. See Further Details. */
586 /* > \param[in] LDB */
588 /* > LDB is INTEGER */
589 /* > The leading dimension of the array B. LDB >= f2cmax(1,M). */
592 /* > \param[out] T */
594 /* > T is COMPLEX array, dimension (LDT,M) */
595 /* > The N-by-N upper triangular factor T of the block reflector. */
596 /* > See Further Details. */
599 /* > \param[in] LDT */
601 /* > LDT is INTEGER */
602 /* > The leading dimension of the array T. LDT >= f2cmax(1,M) */
605 /* > \param[out] INFO */
607 /* > INFO is INTEGER */
608 /* > = 0: successful exit */
609 /* > < 0: if INFO = -i, the i-th argument had an illegal value */
615 /* > \author Univ. of Tennessee */
616 /* > \author Univ. of California Berkeley */
617 /* > \author Univ. of Colorado Denver */
618 /* > \author NAG Ltd. */
620 /* > \date June 2017 */
622 /* > \ingroup doubleOTHERcomputational */
624 /* > \par Further Details: */
625 /* ===================== */
629 /* > The input matrix C is a M-by-(M+N) matrix */
631 /* > C = [ A ][ B ] */
634 /* > where A is an lower triangular M-by-M matrix, and B is M-by-N pentagonal */
635 /* > matrix consisting of a M-by-(N-L) rectangular matrix B1 left of a M-by-L */
636 /* > upper trapezoidal matrix B2: */
638 /* > B = [ B1 ][ B2 ] */
639 /* > [ B1 ] <- M-by-(N-L) rectangular */
640 /* > [ B2 ] <- M-by-L lower trapezoidal. */
642 /* > The lower trapezoidal matrix B2 consists of the first L columns of a */
643 /* > N-by-N lower triangular matrix, where 0 <= L <= MIN(M,N). If L=0, */
644 /* > B is rectangular M-by-N; if M=L=N, B is lower triangular. */
646 /* > The matrix W stores the elementary reflectors H(i) in the i-th row */
647 /* > above the diagonal (of A) in the M-by-(M+N) input matrix C */
649 /* > C = [ A ][ B ] */
650 /* > [ A ] <- lower triangular M-by-M */
651 /* > [ B ] <- M-by-N pentagonal */
653 /* > so that W can be represented as */
655 /* > W = [ I ][ V ] */
656 /* > [ I ] <- identity, M-by-M */
657 /* > [ V ] <- M-by-N, same form as B. */
659 /* > Thus, all of information needed for W is contained on exit in B, which */
660 /* > we call V above. Note that V has the same form as B; that is, */
662 /* > W = [ V1 ][ V2 ] */
663 /* > [ V1 ] <- M-by-(N-L) rectangular */
664 /* > [ V2 ] <- M-by-L lower trapezoidal. */
666 /* > The rows of V represent the vectors which define the H(i)'s. */
667 /* > The (M+N)-by-(M+N) block reflector H is then given by */
669 /* > H = I - W**T * T * W */
671 /* > where W^H is the conjugate transpose of W and T is the upper triangular */
672 /* > factor of the block reflector. */
675 /* ===================================================================== */
676 /* Subroutine */ int ctplqt2_(integer *m, integer *n, integer *l, complex *a,
677 integer *lda, complex *b, integer *ldb, complex *t, integer *ldt,
680 /* System generated locals */
681 integer a_dim1, a_offset, b_dim1, b_offset, t_dim1, t_offset, i__1, i__2,
685 /* Local variables */
687 extern /* Subroutine */ int cgerc_(integer *, integer *, complex *,
688 complex *, integer *, complex *, integer *, complex *, integer *);
690 extern /* Subroutine */ int cgemv_(char *, integer *, integer *, complex *
691 , complex *, integer *, complex *, integer *, complex *, complex *
692 , integer *), ctrmv_(char *, char *, char *, integer *,
693 complex *, integer *, complex *, integer *);
695 extern /* Subroutine */ int clarfg_(integer *, complex *, complex *,
696 integer *, complex *), xerbla_(char *, integer *, ftnlen);
699 /* -- LAPACK computational routine (version 3.7.1) -- */
700 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
701 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
705 /* ===================================================================== */
708 /* Test the input arguments */
710 /* Parameter adjustments */
712 a_offset = 1 + a_dim1 * 1;
715 b_offset = 1 + b_dim1 * 1;
718 t_offset = 1 + t_dim1 * 1;
727 } else if (*l < 0 || *l > f2cmin(*m,*n)) {
729 } else if (*lda < f2cmax(1,*m)) {
731 } else if (*ldb < f2cmax(1,*m)) {
733 } else if (*ldt < f2cmax(1,*m)) {
738 xerbla_("CTPLQT2", &i__1, (ftnlen)7);
742 /* Quick return if possible */
744 if (*n == 0 || *m == 0) {
749 for (i__ = 1; i__ <= i__1; ++i__) {
751 /* Generate elementary reflector H(I) to annihilate B(I,:) */
753 p = *n - *l + f2cmin(*l,i__);
755 clarfg_(&i__2, &a[i__ + i__ * a_dim1], &b[i__ + b_dim1], ldb, &t[i__ *
757 i__2 = i__ * t_dim1 + 1;
758 r_cnjg(&q__1, &t[i__ * t_dim1 + 1]);
759 t[i__2].r = q__1.r, t[i__2].i = q__1.i;
762 for (j = 1; j <= i__2; ++j) {
763 i__3 = i__ + j * b_dim1;
764 r_cnjg(&q__1, &b[i__ + j * b_dim1]);
765 b[i__3].r = q__1.r, b[i__3].i = q__1.i;
768 /* W(M-I:1) := C(I+1:M,I:N) * C(I,I:N) [use W = T(M,:)] */
771 for (j = 1; j <= i__2; ++j) {
772 i__3 = *m + j * t_dim1;
773 i__4 = i__ + j + i__ * a_dim1;
774 t[i__3].r = a[i__4].r, t[i__3].i = a[i__4].i;
777 cgemv_("N", &i__2, &p, &c_b2, &b[i__ + 1 + b_dim1], ldb, &b[i__ +
778 b_dim1], ldb, &c_b2, &t[*m + t_dim1], ldt);
780 /* C(I+1:M,I:N) = C(I+1:M,I:N) + alpha * C(I,I:N)*W(M-1:1)^H */
782 i__2 = i__ * t_dim1 + 1;
783 q__1.r = -t[i__2].r, q__1.i = -t[i__2].i;
784 alpha.r = q__1.r, alpha.i = q__1.i;
786 for (j = 1; j <= i__2; ++j) {
787 i__3 = i__ + j + i__ * a_dim1;
788 i__4 = i__ + j + i__ * a_dim1;
789 i__5 = *m + j * t_dim1;
790 q__2.r = alpha.r * t[i__5].r - alpha.i * t[i__5].i, q__2.i =
791 alpha.r * t[i__5].i + alpha.i * t[i__5].r;
792 q__1.r = a[i__4].r + q__2.r, q__1.i = a[i__4].i + q__2.i;
793 a[i__3].r = q__1.r, a[i__3].i = q__1.i;
796 q__1.r = alpha.r, q__1.i = alpha.i;
797 cgerc_(&i__2, &p, &q__1, &t[*m + t_dim1], ldt, &b[i__ + b_dim1],
798 ldb, &b[i__ + 1 + b_dim1], ldb);
800 for (j = 1; j <= i__2; ++j) {
801 i__3 = i__ + j * b_dim1;
802 r_cnjg(&q__1, &b[i__ + j * b_dim1]);
803 b[i__3].r = q__1.r, b[i__3].i = q__1.i;
809 for (i__ = 2; i__ <= i__1; ++i__) {
811 /* T(I,1:I-1) := C(I:I-1,1:N)**H * (alpha * C(I,I:N)) */
813 i__2 = i__ * t_dim1 + 1;
814 q__1.r = -t[i__2].r, q__1.i = -t[i__2].i;
815 alpha.r = q__1.r, alpha.i = q__1.i;
817 for (j = 1; j <= i__2; ++j) {
818 i__3 = i__ + j * t_dim1;
819 t[i__3].r = 0.f, t[i__3].i = 0.f;
826 np = f2cmin(i__2,*n);
829 mp = f2cmin(i__2,*m);
831 for (j = 1; j <= i__2; ++j) {
832 i__3 = i__ + j * b_dim1;
833 r_cnjg(&q__1, &b[i__ + j * b_dim1]);
834 b[i__3].r = q__1.r, b[i__3].i = q__1.i;
837 /* Triangular part of B2 */
840 for (j = 1; j <= i__2; ++j) {
841 i__3 = i__ + j * t_dim1;
842 i__4 = i__ + (*n - *l + j) * b_dim1;
843 q__1.r = alpha.r * b[i__4].r - alpha.i * b[i__4].i, q__1.i =
844 alpha.r * b[i__4].i + alpha.i * b[i__4].r;
845 t[i__3].r = q__1.r, t[i__3].i = q__1.i;
847 ctrmv_("L", "N", "N", &p, &b[np * b_dim1 + 1], ldb, &t[i__ + t_dim1],
850 /* Rectangular part of B2 */
853 cgemv_("N", &i__2, l, &alpha, &b[mp + np * b_dim1], ldb, &b[i__ + np *
854 b_dim1], ldb, &c_b1, &t[i__ + mp * t_dim1], ldt);
860 cgemv_("N", &i__2, &i__3, &alpha, &b[b_offset], ldb, &b[i__ + b_dim1],
861 ldb, &c_b2, &t[i__ + t_dim1], ldt);
864 /* T(1:I-1,I) := T(1:I-1,1:I-1) * T(I,1:I-1) */
867 for (j = 1; j <= i__2; ++j) {
868 i__3 = i__ + j * t_dim1;
869 r_cnjg(&q__1, &t[i__ + j * t_dim1]);
870 t[i__3].r = q__1.r, t[i__3].i = q__1.i;
873 ctrmv_("L", "C", "N", &i__2, &t[t_offset], ldt, &t[i__ + t_dim1], ldt);
875 for (j = 1; j <= i__2; ++j) {
876 i__3 = i__ + j * t_dim1;
877 r_cnjg(&q__1, &t[i__ + j * t_dim1]);
878 t[i__3].r = q__1.r, t[i__3].i = q__1.i;
881 for (j = 1; j <= i__2; ++j) {
882 i__3 = i__ + j * b_dim1;
883 r_cnjg(&q__1, &b[i__ + j * b_dim1]);
884 b[i__3].r = q__1.r, b[i__3].i = q__1.i;
887 /* T(I,I) = tau(I) */
889 i__2 = i__ + i__ * t_dim1;
890 i__3 = i__ * t_dim1 + 1;
891 t[i__2].r = t[i__3].r, t[i__2].i = t[i__3].i;
892 i__2 = i__ * t_dim1 + 1;
893 t[i__2].r = 0.f, t[i__2].i = 0.f;
896 for (i__ = 1; i__ <= i__1; ++i__) {
898 for (j = i__ + 1; j <= i__2; ++j) {
899 i__3 = i__ + j * t_dim1;
900 i__4 = j + i__ * t_dim1;
901 t[i__3].r = t[i__4].r, t[i__3].i = t[i__4].i;
902 i__3 = j + i__ * t_dim1;
903 t[i__3].r = 0.f, t[i__3].i = 0.f;