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]/Cd(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 doublecomplex c_b1 = {0.,0.};
516 static doublecomplex c_b2 = {1.,0.};
517 static integer c__1 = 1;
519 /* > \brief \b ZLAHR2 reduces the specified number of first columns of a general rectangular matrix A so that
520 elements below the specified subdiagonal are zero, and returns auxiliary matrices which are needed to
521 apply the transformation to the unreduced part */
524 /* =========== DOCUMENTATION =========== */
526 /* Online html documentation available at */
527 /* http://www.netlib.org/lapack/explore-html/ */
530 /* > Download ZLAHR2 + dependencies */
531 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zlahr2.
534 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zlahr2.
537 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zlahr2.
545 /* SUBROUTINE ZLAHR2( N, K, NB, A, LDA, TAU, T, LDT, Y, LDY ) */
547 /* INTEGER K, LDA, LDT, LDY, N, NB */
548 /* COMPLEX*16 A( LDA, * ), T( LDT, NB ), TAU( NB ), */
552 /* > \par Purpose: */
557 /* > ZLAHR2 reduces the first NB columns of A complex general n-BY-(n-k+1) */
558 /* > matrix A so that elements below the k-th subdiagonal are zero. The */
559 /* > reduction is performed by an unitary similarity transformation */
560 /* > Q**H * A * Q. The routine returns the matrices V and T which determine */
561 /* > Q as a block reflector I - V*T*V**H, and also the matrix Y = A * V * T. */
563 /* > This is an auxiliary routine called by ZGEHRD. */
572 /* > The order of the matrix A. */
578 /* > The offset for the reduction. Elements below the k-th */
579 /* > subdiagonal in the first NB columns are reduced to zero. */
583 /* > \param[in] NB */
585 /* > NB is INTEGER */
586 /* > The number of columns to be reduced. */
589 /* > \param[in,out] A */
591 /* > A is COMPLEX*16 array, dimension (LDA,N-K+1) */
592 /* > On entry, the n-by-(n-k+1) general matrix A. */
593 /* > On exit, the elements on and above the k-th subdiagonal in */
594 /* > the first NB columns are overwritten with the corresponding */
595 /* > elements of the reduced matrix; the elements below the k-th */
596 /* > subdiagonal, with the array TAU, represent the matrix Q as a */
597 /* > product of elementary reflectors. The other columns of A are */
598 /* > unchanged. See Further Details. */
601 /* > \param[in] LDA */
603 /* > LDA is INTEGER */
604 /* > The leading dimension of the array A. LDA >= f2cmax(1,N). */
607 /* > \param[out] TAU */
609 /* > TAU is COMPLEX*16 array, dimension (NB) */
610 /* > The scalar factors of the elementary reflectors. See Further */
614 /* > \param[out] T */
616 /* > T is COMPLEX*16 array, dimension (LDT,NB) */
617 /* > The upper triangular matrix T. */
620 /* > \param[in] LDT */
622 /* > LDT is INTEGER */
623 /* > The leading dimension of the array T. LDT >= NB. */
626 /* > \param[out] Y */
628 /* > Y is COMPLEX*16 array, dimension (LDY,NB) */
629 /* > The n-by-nb matrix Y. */
632 /* > \param[in] LDY */
634 /* > LDY is INTEGER */
635 /* > The leading dimension of the array Y. LDY >= N. */
641 /* > \author Univ. of Tennessee */
642 /* > \author Univ. of California Berkeley */
643 /* > \author Univ. of Colorado Denver */
644 /* > \author NAG Ltd. */
646 /* > \date December 2016 */
648 /* > \ingroup complex16OTHERauxiliary */
650 /* > \par Further Details: */
651 /* ===================== */
655 /* > The matrix Q is represented as a product of nb elementary reflectors */
657 /* > Q = H(1) H(2) . . . H(nb). */
659 /* > Each H(i) has the form */
661 /* > H(i) = I - tau * v * v**H */
663 /* > where tau is a complex scalar, and v is a complex vector with */
664 /* > v(1:i+k-1) = 0, v(i+k) = 1; v(i+k+1:n) is stored on exit in */
665 /* > A(i+k+1:n,i), and tau in TAU(i). */
667 /* > The elements of the vectors v together form the (n-k+1)-by-nb matrix */
668 /* > V which is needed, with T and Y, to apply the transformation to the */
669 /* > unreduced part of the matrix, using an update of the form: */
670 /* > A := (I - V*T*V**H) * (A - Y*V**H). */
672 /* > The contents of A on exit are illustrated by the following example */
673 /* > with n = 7, k = 3 and nb = 2: */
675 /* > ( a a a a a ) */
676 /* > ( a a a a a ) */
677 /* > ( a a a a a ) */
678 /* > ( h h a a a ) */
679 /* > ( v1 h a a a ) */
680 /* > ( v1 v2 a a a ) */
681 /* > ( v1 v2 a a a ) */
683 /* > where a denotes an element of the original matrix A, h denotes a */
684 /* > modified element of the upper Hessenberg matrix H, and vi denotes an */
685 /* > element of the vector defining H(i). */
687 /* > This subroutine is a slight modification of LAPACK-3.0's DLAHRD */
688 /* > incorporating improvements proposed by Quintana-Orti and Van de */
689 /* > Gejin. Note that the entries of A(1:K,2:NB) differ from those */
690 /* > returned by the original LAPACK-3.0's DLAHRD routine. (This */
691 /* > subroutine is not backward compatible with LAPACK-3.0's DLAHRD.) */
694 /* > \par References: */
695 /* ================ */
697 /* > Gregorio Quintana-Orti and Robert van de Geijn, "Improving the */
698 /* > performance of reduction to Hessenberg form," ACM Transactions on */
699 /* > Mathematical Software, 32(2):180-194, June 2006. */
701 /* ===================================================================== */
702 /* Subroutine */ int zlahr2_(integer *n, integer *k, integer *nb,
703 doublecomplex *a, integer *lda, doublecomplex *tau, doublecomplex *t,
704 integer *ldt, doublecomplex *y, integer *ldy)
706 /* System generated locals */
707 integer a_dim1, a_offset, t_dim1, t_offset, y_dim1, y_offset, i__1, i__2,
711 /* Local variables */
713 extern /* Subroutine */ int zscal_(integer *, doublecomplex *,
714 doublecomplex *, integer *), zgemm_(char *, char *, integer *,
715 integer *, integer *, doublecomplex *, doublecomplex *, integer *,
716 doublecomplex *, integer *, doublecomplex *, doublecomplex *,
717 integer *), zgemv_(char *, integer *, integer *,
718 doublecomplex *, doublecomplex *, integer *, doublecomplex *,
719 integer *, doublecomplex *, doublecomplex *, integer *),
720 zcopy_(integer *, doublecomplex *, integer *, doublecomplex *,
721 integer *), ztrmm_(char *, char *, char *, char *, integer *,
722 integer *, doublecomplex *, doublecomplex *, integer *,
723 doublecomplex *, integer *),
724 zaxpy_(integer *, doublecomplex *, doublecomplex *, integer *,
725 doublecomplex *, integer *), ztrmv_(char *, char *, char *,
726 integer *, doublecomplex *, integer *, doublecomplex *, integer *);
728 extern /* Subroutine */ int zlarfg_(integer *, doublecomplex *,
729 doublecomplex *, integer *, doublecomplex *), zlacgv_(integer *,
730 doublecomplex *, integer *), zlacpy_(char *, integer *, integer *,
731 doublecomplex *, integer *, doublecomplex *, integer *);
734 /* -- LAPACK auxiliary routine (version 3.7.0) -- */
735 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
736 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
740 /* ===================================================================== */
743 /* Quick return if possible */
745 /* Parameter adjustments */
748 a_offset = 1 + a_dim1 * 1;
751 t_offset = 1 + t_dim1 * 1;
754 y_offset = 1 + y_dim1 * 1;
763 for (i__ = 1; i__ <= i__1; ++i__) {
766 /* Update A(K+1:N,I) */
768 /* Update I-th column of A - Y * V**H */
771 zlacgv_(&i__2, &a[*k + i__ - 1 + a_dim1], lda);
774 z__1.r = -1., z__1.i = 0.;
775 zgemv_("NO TRANSPOSE", &i__2, &i__3, &z__1, &y[*k + 1 + y_dim1],
776 ldy, &a[*k + i__ - 1 + a_dim1], lda, &c_b2, &a[*k + 1 +
777 i__ * a_dim1], &c__1);
779 zlacgv_(&i__2, &a[*k + i__ - 1 + a_dim1], lda);
781 /* Apply I - V * T**H * V**H to this column (call it b) from the */
782 /* left, using the last column of T as workspace */
784 /* Let V = ( V1 ) and b = ( b1 ) (first I-1 rows) */
787 /* where V1 is unit lower triangular */
789 /* w := V1**H * b1 */
792 zcopy_(&i__2, &a[*k + 1 + i__ * a_dim1], &c__1, &t[*nb * t_dim1 +
795 ztrmv_("Lower", "Conjugate transpose", "UNIT", &i__2, &a[*k + 1 +
796 a_dim1], lda, &t[*nb * t_dim1 + 1], &c__1);
798 /* w := w + V2**H * b2 */
800 i__2 = *n - *k - i__ + 1;
802 zgemv_("Conjugate transpose", &i__2, &i__3, &c_b2, &a[*k + i__ +
803 a_dim1], lda, &a[*k + i__ + i__ * a_dim1], &c__1, &c_b2, &
804 t[*nb * t_dim1 + 1], &c__1);
809 ztrmv_("Upper", "Conjugate transpose", "NON-UNIT", &i__2, &t[
810 t_offset], ldt, &t[*nb * t_dim1 + 1], &c__1);
812 /* b2 := b2 - V2*w */
814 i__2 = *n - *k - i__ + 1;
816 z__1.r = -1., z__1.i = 0.;
817 zgemv_("NO TRANSPOSE", &i__2, &i__3, &z__1, &a[*k + i__ + a_dim1],
818 lda, &t[*nb * t_dim1 + 1], &c__1, &c_b2, &a[*k + i__ +
819 i__ * a_dim1], &c__1);
821 /* b1 := b1 - V1*w */
824 ztrmv_("Lower", "NO TRANSPOSE", "UNIT", &i__2, &a[*k + 1 + a_dim1]
825 , lda, &t[*nb * t_dim1 + 1], &c__1);
827 z__1.r = -1., z__1.i = 0.;
828 zaxpy_(&i__2, &z__1, &t[*nb * t_dim1 + 1], &c__1, &a[*k + 1 + i__
831 i__2 = *k + i__ - 1 + (i__ - 1) * a_dim1;
832 a[i__2].r = ei.r, a[i__2].i = ei.i;
835 /* Generate the elementary reflector H(I) to annihilate */
838 i__2 = *n - *k - i__ + 1;
841 zlarfg_(&i__2, &a[*k + i__ + i__ * a_dim1], &a[f2cmin(i__3,*n) + i__ *
842 a_dim1], &c__1, &tau[i__]);
843 i__2 = *k + i__ + i__ * a_dim1;
844 ei.r = a[i__2].r, ei.i = a[i__2].i;
845 i__2 = *k + i__ + i__ * a_dim1;
846 a[i__2].r = 1., a[i__2].i = 0.;
848 /* Compute Y(K+1:N,I) */
851 i__3 = *n - *k - i__ + 1;
852 zgemv_("NO TRANSPOSE", &i__2, &i__3, &c_b2, &a[*k + 1 + (i__ + 1) *
853 a_dim1], lda, &a[*k + i__ + i__ * a_dim1], &c__1, &c_b1, &y[*
854 k + 1 + i__ * y_dim1], &c__1);
855 i__2 = *n - *k - i__ + 1;
857 zgemv_("Conjugate transpose", &i__2, &i__3, &c_b2, &a[*k + i__ +
858 a_dim1], lda, &a[*k + i__ + i__ * a_dim1], &c__1, &c_b1, &t[
859 i__ * t_dim1 + 1], &c__1);
862 z__1.r = -1., z__1.i = 0.;
863 zgemv_("NO TRANSPOSE", &i__2, &i__3, &z__1, &y[*k + 1 + y_dim1], ldy,
864 &t[i__ * t_dim1 + 1], &c__1, &c_b2, &y[*k + 1 + i__ * y_dim1],
867 zscal_(&i__2, &tau[i__], &y[*k + 1 + i__ * y_dim1], &c__1);
869 /* Compute T(1:I,I) */
873 z__1.r = -tau[i__3].r, z__1.i = -tau[i__3].i;
874 zscal_(&i__2, &z__1, &t[i__ * t_dim1 + 1], &c__1);
876 ztrmv_("Upper", "No Transpose", "NON-UNIT", &i__2, &t[t_offset], ldt,
877 &t[i__ * t_dim1 + 1], &c__1)
879 i__2 = i__ + i__ * t_dim1;
881 t[i__2].r = tau[i__3].r, t[i__2].i = tau[i__3].i;
885 i__1 = *k + *nb + *nb * a_dim1;
886 a[i__1].r = ei.r, a[i__1].i = ei.i;
888 /* Compute Y(1:K,1:NB) */
890 zlacpy_("ALL", k, nb, &a[(a_dim1 << 1) + 1], lda, &y[y_offset], ldy);
891 ztrmm_("RIGHT", "Lower", "NO TRANSPOSE", "UNIT", k, nb, &c_b2, &a[*k + 1
892 + a_dim1], lda, &y[y_offset], ldy);
894 i__1 = *n - *k - *nb;
895 zgemm_("NO TRANSPOSE", "NO TRANSPOSE", k, nb, &i__1, &c_b2, &a[(*nb +
896 2) * a_dim1 + 1], lda, &a[*k + 1 + *nb + a_dim1], lda, &c_b2,
899 ztrmm_("RIGHT", "Upper", "NO TRANSPOSE", "NON-UNIT", k, nb, &c_b2, &t[
900 t_offset], ldt, &y[y_offset], ldy);