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};
517 static integer c__1 = 1;
519 /* > \brief \b CLAQPS computes a step of QR factorization with column pivoting of a real m-by-n matrix A by us
522 /* =========== DOCUMENTATION =========== */
524 /* Online html documentation available at */
525 /* http://www.netlib.org/lapack/explore-html/ */
528 /* > Download CLAQPS + dependencies */
529 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/claqps.
532 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/claqps.
535 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/claqps.
543 /* SUBROUTINE CLAQPS( M, N, OFFSET, NB, KB, A, LDA, JPVT, TAU, VN1, */
544 /* VN2, AUXV, F, LDF ) */
546 /* INTEGER KB, LDA, LDF, M, N, NB, OFFSET */
547 /* INTEGER JPVT( * ) */
548 /* REAL VN1( * ), VN2( * ) */
549 /* COMPLEX A( LDA, * ), AUXV( * ), F( LDF, * ), TAU( * ) */
552 /* > \par Purpose: */
557 /* > CLAQPS computes a step of QR factorization with column pivoting */
558 /* > of a complex M-by-N matrix A by using Blas-3. It tries to factorize */
559 /* > NB columns from A starting from the row OFFSET+1, and updates all */
560 /* > of the matrix with Blas-3 xGEMM. */
562 /* > In some cases, due to catastrophic cancellations, it cannot */
563 /* > factorize NB columns. Hence, the actual number of factorized */
564 /* > columns is returned in KB. */
566 /* > Block A(1:OFFSET,1:N) is accordingly pivoted, but not factorized. */
575 /* > The number of rows of the matrix A. M >= 0. */
581 /* > The number of columns of the matrix A. N >= 0 */
584 /* > \param[in] OFFSET */
586 /* > OFFSET is INTEGER */
587 /* > The number of rows of A that have been factorized in */
588 /* > previous steps. */
591 /* > \param[in] NB */
593 /* > NB is INTEGER */
594 /* > The number of columns to factorize. */
597 /* > \param[out] KB */
599 /* > KB is INTEGER */
600 /* > The number of columns actually factorized. */
603 /* > \param[in,out] A */
605 /* > A is COMPLEX array, dimension (LDA,N) */
606 /* > On entry, the M-by-N matrix A. */
607 /* > On exit, block A(OFFSET+1:M,1:KB) is the triangular */
608 /* > factor obtained and block A(1:OFFSET,1:N) has been */
609 /* > accordingly pivoted, but no factorized. */
610 /* > The rest of the matrix, block A(OFFSET+1:M,KB+1:N) has */
611 /* > been updated. */
614 /* > \param[in] LDA */
616 /* > LDA is INTEGER */
617 /* > The leading dimension of the array A. LDA >= f2cmax(1,M). */
620 /* > \param[in,out] JPVT */
622 /* > JPVT is INTEGER array, dimension (N) */
623 /* > JPVT(I) = K <==> Column K of the full matrix A has been */
624 /* > permuted into position I in AP. */
627 /* > \param[out] TAU */
629 /* > TAU is COMPLEX array, dimension (KB) */
630 /* > The scalar factors of the elementary reflectors. */
633 /* > \param[in,out] VN1 */
635 /* > VN1 is REAL array, dimension (N) */
636 /* > The vector with the partial column norms. */
639 /* > \param[in,out] VN2 */
641 /* > VN2 is REAL array, dimension (N) */
642 /* > The vector with the exact column norms. */
645 /* > \param[in,out] AUXV */
647 /* > AUXV is COMPLEX array, dimension (NB) */
648 /* > Auxiliary vector. */
651 /* > \param[in,out] F */
653 /* > F is COMPLEX array, dimension (LDF,NB) */
654 /* > Matrix F**H = L * Y**H * A. */
657 /* > \param[in] LDF */
659 /* > LDF is INTEGER */
660 /* > The leading dimension of the array F. LDF >= f2cmax(1,N). */
666 /* > \author Univ. of Tennessee */
667 /* > \author Univ. of California Berkeley */
668 /* > \author Univ. of Colorado Denver */
669 /* > \author NAG Ltd. */
671 /* > \date December 2016 */
673 /* > \ingroup complexOTHERauxiliary */
675 /* > \par Contributors: */
676 /* ================== */
678 /* > G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain */
679 /* > X. Sun, Computer Science Dept., Duke University, USA */
682 /* > Partial column norm updating strategy modified on April 2011 */
683 /* > Z. Drmac and Z. Bujanovic, Dept. of Mathematics, */
684 /* > University of Zagreb, Croatia. */
686 /* > \par References: */
687 /* ================ */
689 /* > LAPACK Working Note 176 */
692 /* > <a href="http://www.netlib.org/lapack/lawnspdf/lawn176.pdf">[PDF]</a> */
695 /* ===================================================================== */
696 /* Subroutine */ int claqps_(integer *m, integer *n, integer *offset, integer
697 *nb, integer *kb, complex *a, integer *lda, integer *jpvt, complex *
698 tau, real *vn1, real *vn2, complex *auxv, complex *f, integer *ldf)
700 /* System generated locals */
701 integer a_dim1, a_offset, f_dim1, f_offset, i__1, i__2, i__3;
705 /* Local variables */
709 extern /* Subroutine */ int cgemm_(char *, char *, integer *, integer *,
710 integer *, complex *, complex *, integer *, complex *, integer *,
711 complex *, complex *, integer *), cgemv_(char *,
712 integer *, integer *, complex *, complex *, integer *, complex *,
713 integer *, complex *, complex *, integer *), cswap_(
714 integer *, complex *, integer *, complex *, integer *);
716 extern real scnrm2_(integer *, complex *, integer *);
718 extern /* Subroutine */ int clarfg_(integer *, complex *, complex *,
719 integer *, complex *);
720 extern real slamch_(char *);
722 extern integer isamax_(integer *, real *, integer *);
728 /* -- LAPACK auxiliary routine (version 3.7.0) -- */
729 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
730 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
734 /* ===================================================================== */
737 /* Parameter adjustments */
739 a_offset = 1 + a_dim1 * 1;
747 f_offset = 1 + f_dim1 * 1;
752 i__1 = *m, i__2 = *n + *offset;
753 lastrk = f2cmin(i__1,i__2);
756 tol3z = sqrt(slamch_("Epsilon"));
758 /* Beginning of while loop. */
761 if (k < *nb && lsticc == 0) {
765 /* Determine ith pivot column and swap if necessary */
768 pvt = k - 1 + isamax_(&i__1, &vn1[k], &c__1);
770 cswap_(m, &a[pvt * a_dim1 + 1], &c__1, &a[k * a_dim1 + 1], &c__1);
772 cswap_(&i__1, &f[pvt + f_dim1], ldf, &f[k + f_dim1], ldf);
780 /* Apply previous Householder reflectors to column K: */
781 /* A(RK:M,K) := A(RK:M,K) - A(RK:M,1:K-1)*F(K,1:K-1)**H. */
785 for (j = 1; j <= i__1; ++j) {
786 i__2 = k + j * f_dim1;
787 r_cnjg(&q__1, &f[k + j * f_dim1]);
788 f[i__2].r = q__1.r, f[i__2].i = q__1.i;
793 q__1.r = -1.f, q__1.i = 0.f;
794 cgemv_("No transpose", &i__1, &i__2, &q__1, &a[rk + a_dim1], lda,
795 &f[k + f_dim1], ldf, &c_b2, &a[rk + k * a_dim1], &c__1);
797 for (j = 1; j <= i__1; ++j) {
798 i__2 = k + j * f_dim1;
799 r_cnjg(&q__1, &f[k + j * f_dim1]);
800 f[i__2].r = q__1.r, f[i__2].i = q__1.i;
805 /* Generate elementary reflector H(k). */
809 clarfg_(&i__1, &a[rk + k * a_dim1], &a[rk + 1 + k * a_dim1], &
812 clarfg_(&c__1, &a[rk + k * a_dim1], &a[rk + k * a_dim1], &c__1, &
816 i__1 = rk + k * a_dim1;
817 akk.r = a[i__1].r, akk.i = a[i__1].i;
818 i__1 = rk + k * a_dim1;
819 a[i__1].r = 1.f, a[i__1].i = 0.f;
821 /* Compute Kth column of F: */
823 /* Compute F(K+1:N,K) := tau(K)*A(RK:M,K+1:N)**H*A(RK:M,K). */
828 cgemv_("Conjugate transpose", &i__1, &i__2, &tau[k], &a[rk + (k +
829 1) * a_dim1], lda, &a[rk + k * a_dim1], &c__1, &c_b1, &f[
830 k + 1 + k * f_dim1], &c__1);
833 /* Padding F(1:K,K) with zeros. */
836 for (j = 1; j <= i__1; ++j) {
837 i__2 = j + k * f_dim1;
838 f[i__2].r = 0.f, f[i__2].i = 0.f;
842 /* Incremental updating of F: */
843 /* F(1:N,K) := F(1:N,K) - tau(K)*F(1:N,1:K-1)*A(RK:M,1:K-1)**H */
850 q__1.r = -tau[i__3].r, q__1.i = -tau[i__3].i;
851 cgemv_("Conjugate transpose", &i__1, &i__2, &q__1, &a[rk + a_dim1]
852 , lda, &a[rk + k * a_dim1], &c__1, &c_b1, &auxv[1], &c__1);
855 cgemv_("No transpose", n, &i__1, &c_b2, &f[f_dim1 + 1], ldf, &
856 auxv[1], &c__1, &c_b2, &f[k * f_dim1 + 1], &c__1);
859 /* Update the current row of A: */
860 /* A(RK,K+1:N) := A(RK,K+1:N) - A(RK,1:K)*F(K+1:N,1:K)**H. */
864 q__1.r = -1.f, q__1.i = 0.f;
865 cgemm_("No transpose", "Conjugate transpose", &c__1, &i__1, &k, &
866 q__1, &a[rk + a_dim1], lda, &f[k + 1 + f_dim1], ldf, &
867 c_b2, &a[rk + (k + 1) * a_dim1], lda);
870 /* Update partial column norms. */
874 for (j = k + 1; j <= i__1; ++j) {
877 /* NOTE: The following 4 lines follow from the analysis in */
878 /* Lapack Working Note 176. */
880 temp = c_abs(&a[rk + j * a_dim1]) / vn1[j];
882 r__1 = 0.f, r__2 = (temp + 1.f) * (1.f - temp);
883 temp = f2cmax(r__1,r__2);
884 /* Computing 2nd power */
885 r__1 = vn1[j] / vn2[j];
886 temp2 = temp * (r__1 * r__1);
887 if (temp2 <= tol3z) {
888 vn2[j] = (real) lsticc;
891 vn1[j] *= sqrt(temp);
898 i__1 = rk + k * a_dim1;
899 a[i__1].r = akk.r, a[i__1].i = akk.i;
901 /* End of while loop. */
908 /* Apply the block reflector to the rest of the matrix: */
909 /* A(OFFSET+KB+1:M,KB+1:N) := A(OFFSET+KB+1:M,KB+1:N) - */
910 /* A(OFFSET+KB+1:M,1:KB)*F(KB+1:N,1:KB)**H. */
913 i__1 = *n, i__2 = *m - *offset;
914 if (*kb < f2cmin(i__1,i__2)) {
917 q__1.r = -1.f, q__1.i = 0.f;
918 cgemm_("No transpose", "Conjugate transpose", &i__1, &i__2, kb, &q__1,
919 &a[rk + 1 + a_dim1], lda, &f[*kb + 1 + f_dim1], ldf, &c_b2, &
920 a[rk + 1 + (*kb + 1) * a_dim1], lda);
923 /* Recomputation of difficult columns. */
927 itemp = i_nint(&vn2[lsticc]);
929 vn1[lsticc] = scnrm2_(&i__1, &a[rk + 1 + lsticc * a_dim1], &c__1);
931 /* NOTE: The computation of VN1( LSTICC ) relies on the fact that */
932 /* SNRM2 does not fail on vectors with norm below the value of */
933 /* SQRT(DLAMCH('S')) */
935 vn2[lsticc] = vn1[lsticc];