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 = {1.f,0.f};
516 static complex c_b2 = {0.f,0.f};
517 static integer c__1 = 1;
519 /* > \brief \b CTPQRT2 computes a QR factorization of a real or complex "triangular-pentagonal" matrix, which
520 is composed of a triangular block and a pentagonal block, using the compact WY representation for Q.
523 /* =========== DOCUMENTATION =========== */
525 /* Online html documentation available at */
526 /* http://www.netlib.org/lapack/explore-html/ */
529 /* > Download CTPQRT2 + dependencies */
530 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/ctpqrt2
533 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/ctpqrt2
536 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/ctpqrt2
544 /* SUBROUTINE CTPQRT2( M, N, L, A, LDA, B, LDB, T, LDT, INFO ) */
546 /* INTEGER INFO, LDA, LDB, LDT, N, M, L */
547 /* COMPLEX A( LDA, * ), B( LDB, * ), T( LDT, * ) */
550 /* > \par Purpose: */
555 /* > CTPQRT2 computes a QR factorization of a complex "triangular-pentagonal" */
556 /* > matrix C, which is composed of a triangular block A and pentagonal block B, */
557 /* > using the compact WY representation for Q. */
566 /* > The total number of rows of the matrix B. */
573 /* > The number of columns of the matrix B, and the order of */
574 /* > the triangular matrix A. */
581 /* > The number of rows of the upper trapezoidal part of B. */
582 /* > MIN(M,N) >= L >= 0. See Further Details. */
585 /* > \param[in,out] A */
587 /* > A is COMPLEX array, dimension (LDA,N) */
588 /* > On entry, the upper triangular N-by-N matrix A. */
589 /* > On exit, the elements on and above the diagonal of the array */
590 /* > contain the upper triangular matrix R. */
593 /* > \param[in] LDA */
595 /* > LDA is INTEGER */
596 /* > The leading dimension of the array A. LDA >= f2cmax(1,N). */
599 /* > \param[in,out] B */
601 /* > B is COMPLEX array, dimension (LDB,N) */
602 /* > On entry, the pentagonal M-by-N matrix B. The first M-L rows */
603 /* > are rectangular, and the last L rows are upper trapezoidal. */
604 /* > On exit, B contains the pentagonal matrix V. See Further Details. */
607 /* > \param[in] LDB */
609 /* > LDB is INTEGER */
610 /* > The leading dimension of the array B. LDB >= f2cmax(1,M). */
613 /* > \param[out] T */
615 /* > T is COMPLEX array, dimension (LDT,N) */
616 /* > The N-by-N upper triangular factor T of the block reflector. */
617 /* > See Further Details. */
620 /* > \param[in] LDT */
622 /* > LDT is INTEGER */
623 /* > The leading dimension of the array T. LDT >= f2cmax(1,N) */
626 /* > \param[out] INFO */
628 /* > INFO is INTEGER */
629 /* > = 0: successful exit */
630 /* > < 0: if INFO = -i, the i-th argument had an illegal value */
636 /* > \author Univ. of Tennessee */
637 /* > \author Univ. of California Berkeley */
638 /* > \author Univ. of Colorado Denver */
639 /* > \author NAG Ltd. */
641 /* > \date December 2016 */
643 /* > \ingroup complexOTHERcomputational */
645 /* > \par Further Details: */
646 /* ===================== */
650 /* > The input matrix C is a (N+M)-by-N matrix */
655 /* > where A is an upper triangular N-by-N matrix, and B is M-by-N pentagonal */
656 /* > matrix consisting of a (M-L)-by-N rectangular matrix B1 on top of a L-by-N */
657 /* > upper trapezoidal matrix B2: */
659 /* > B = [ B1 ] <- (M-L)-by-N rectangular */
660 /* > [ B2 ] <- L-by-N upper trapezoidal. */
662 /* > The upper trapezoidal matrix B2 consists of the first L rows of a */
663 /* > N-by-N upper triangular matrix, where 0 <= L <= MIN(M,N). If L=0, */
664 /* > B is rectangular M-by-N; if M=L=N, B is upper triangular. */
666 /* > The matrix W stores the elementary reflectors H(i) in the i-th column */
667 /* > below the diagonal (of A) in the (N+M)-by-N input matrix C */
669 /* > C = [ A ] <- upper triangular N-by-N */
670 /* > [ B ] <- M-by-N pentagonal */
672 /* > so that W can be represented as */
674 /* > W = [ I ] <- identity, N-by-N */
675 /* > [ V ] <- M-by-N, same form as B. */
677 /* > Thus, all of information needed for W is contained on exit in B, which */
678 /* > we call V above. Note that V has the same form as B; that is, */
680 /* > V = [ V1 ] <- (M-L)-by-N rectangular */
681 /* > [ V2 ] <- L-by-N upper trapezoidal. */
683 /* > The columns of V represent the vectors which define the H(i)'s. */
684 /* > The (M+N)-by-(M+N) block reflector H is then given by */
686 /* > H = I - W * T * W**H */
688 /* > where W**H is the conjugate transpose of W and T is the upper triangular */
689 /* > factor of the block reflector. */
692 /* ===================================================================== */
693 /* Subroutine */ int ctpqrt2_(integer *m, integer *n, integer *l, complex *a,
694 integer *lda, complex *b, integer *ldb, complex *t, integer *ldt,
697 /* System generated locals */
698 integer a_dim1, a_offset, b_dim1, b_offset, t_dim1, t_offset, i__1, i__2,
700 complex q__1, q__2, q__3;
702 /* Local variables */
704 extern /* Subroutine */ int cgerc_(integer *, integer *, complex *,
705 complex *, integer *, complex *, integer *, complex *, integer *);
707 extern /* Subroutine */ int cgemv_(char *, integer *, integer *, complex *
708 , complex *, integer *, complex *, integer *, complex *, complex *
709 , integer *), ctrmv_(char *, char *, char *, integer *,
710 complex *, integer *, complex *, integer *);
712 extern /* Subroutine */ int clarfg_(integer *, complex *, complex *,
713 integer *, complex *), xerbla_(char *, integer *, ftnlen);
716 /* -- LAPACK computational routine (version 3.7.0) -- */
717 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
718 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
722 /* ===================================================================== */
725 /* Test the input arguments */
727 /* Parameter adjustments */
729 a_offset = 1 + a_dim1 * 1;
732 b_offset = 1 + b_dim1 * 1;
735 t_offset = 1 + t_dim1 * 1;
744 } else if (*l < 0 || *l > f2cmin(*m,*n)) {
746 } else if (*lda < f2cmax(1,*n)) {
748 } else if (*ldb < f2cmax(1,*m)) {
750 } else if (*ldt < f2cmax(1,*n)) {
755 xerbla_("CTPQRT2", &i__1, (ftnlen)7);
759 /* Quick return if possible */
761 if (*n == 0 || *m == 0) {
766 for (i__ = 1; i__ <= i__1; ++i__) {
768 /* Generate elementary reflector H(I) to annihilate B(:,I) */
770 p = *m - *l + f2cmin(*l,i__);
772 clarfg_(&i__2, &a[i__ + i__ * a_dim1], &b[i__ * b_dim1 + 1], &c__1, &
776 /* W(1:N-I) := C(I:M,I+1:N)**H * C(I:M,I) [use W = T(:,N)] */
779 for (j = 1; j <= i__2; ++j) {
780 i__3 = j + *n * t_dim1;
781 r_cnjg(&q__1, &a[i__ + (i__ + j) * a_dim1]);
782 t[i__3].r = q__1.r, t[i__3].i = q__1.i;
785 cgemv_("C", &p, &i__2, &c_b1, &b[(i__ + 1) * b_dim1 + 1], ldb, &b[
786 i__ * b_dim1 + 1], &c__1, &c_b1, &t[*n * t_dim1 + 1], &
789 /* C(I:M,I+1:N) = C(I:m,I+1:N) + alpha*C(I:M,I)*W(1:N-1)**H */
791 r_cnjg(&q__2, &t[i__ + t_dim1]);
792 q__1.r = -q__2.r, q__1.i = -q__2.i;
793 alpha.r = q__1.r, alpha.i = q__1.i;
795 for (j = 1; j <= i__2; ++j) {
796 i__3 = i__ + (i__ + j) * a_dim1;
797 i__4 = i__ + (i__ + j) * a_dim1;
798 r_cnjg(&q__3, &t[j + *n * t_dim1]);
799 q__2.r = alpha.r * q__3.r - alpha.i * q__3.i, q__2.i =
800 alpha.r * q__3.i + alpha.i * q__3.r;
801 q__1.r = a[i__4].r + q__2.r, q__1.i = a[i__4].i + q__2.i;
802 a[i__3].r = q__1.r, a[i__3].i = q__1.i;
805 cgerc_(&p, &i__2, &alpha, &b[i__ * b_dim1 + 1], &c__1, &t[*n *
806 t_dim1 + 1], &c__1, &b[(i__ + 1) * b_dim1 + 1], ldb);
811 for (i__ = 2; i__ <= i__1; ++i__) {
813 /* T(1:I-1,I) := C(I:M,1:I-1)**H * (alpha * C(I:M,I)) */
816 q__1.r = -t[i__2].r, q__1.i = -t[i__2].i;
817 alpha.r = q__1.r, alpha.i = q__1.i;
819 for (j = 1; j <= i__2; ++j) {
820 i__3 = j + i__ * t_dim1;
821 t[i__3].r = 0.f, t[i__3].i = 0.f;
828 mp = f2cmin(i__2,*m);
831 np = f2cmin(i__2,*n);
833 /* Triangular part of B2 */
836 for (j = 1; j <= i__2; ++j) {
837 i__3 = j + i__ * t_dim1;
838 i__4 = *m - *l + j + i__ * b_dim1;
839 q__1.r = alpha.r * b[i__4].r - alpha.i * b[i__4].i, q__1.i =
840 alpha.r * b[i__4].i + alpha.i * b[i__4].r;
841 t[i__3].r = q__1.r, t[i__3].i = q__1.i;
843 ctrmv_("U", "C", "N", &p, &b[mp + b_dim1], ldb, &t[i__ * t_dim1 + 1],
846 /* Rectangular part of B2 */
849 cgemv_("C", l, &i__2, &alpha, &b[mp + np * b_dim1], ldb, &b[mp + i__ *
850 b_dim1], &c__1, &c_b2, &t[np + i__ * t_dim1], &c__1);
856 cgemv_("C", &i__2, &i__3, &alpha, &b[b_offset], ldb, &b[i__ * b_dim1
857 + 1], &c__1, &c_b1, &t[i__ * t_dim1 + 1], &c__1);
859 /* T(1:I-1,I) := T(1:I-1,1:I-1) * T(1:I-1,I) */
862 ctrmv_("U", "N", "N", &i__2, &t[t_offset], ldt, &t[i__ * t_dim1 + 1],
865 /* T(I,I) = tau(I) */
867 i__2 = i__ + i__ * t_dim1;
869 t[i__2].r = t[i__3].r, t[i__2].i = t[i__3].i;
871 t[i__2].r = 0.f, t[i__2].i = 0.f;