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 = {1.,0.};
516 static integer c__1 = 1;
518 /* \brief \b ZLAHEF_ROOK computes a partial factorization of a complex Hermitian indefinite matrix using the b
519 ounded Bunch-Kaufman ("rook") diagonal pivoting method (blocked algorithm, calling Level 3 BLAS). */
521 /* =========== DOCUMENTATION =========== */
523 /* Online html documentation available at */
524 /* http://www.netlib.org/lapack/explore-html/ */
527 /* > Download ZLAHEF_ROOK + dependencies */
528 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zlahef_
531 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zlahef_
534 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zlahef_
542 /* SUBROUTINE ZLAHEF_ROOK( UPLO, N, NB, KB, A, LDA, IPIV, W, LDW, INFO ) */
545 /* INTEGER INFO, KB, LDA, LDW, N, NB */
546 /* INTEGER IPIV( * ) */
547 /* COMPLEX*16 A( LDA, * ), W( LDW, * ) */
550 /* > \par Purpose: */
555 /* > ZLAHEF_ROOK computes a partial factorization of a complex Hermitian */
556 /* > matrix A using the bounded Bunch-Kaufman ("rook") diagonal pivoting */
557 /* > method. The partial factorization has the form: */
559 /* > A = ( I U12 ) ( A11 0 ) ( I 0 ) if UPLO = 'U', or: */
560 /* > ( 0 U22 ) ( 0 D ) ( U12**H U22**H ) */
562 /* > A = ( L11 0 ) ( D 0 ) ( L11**H L21**H ) if UPLO = 'L' */
563 /* > ( L21 I ) ( 0 A22 ) ( 0 I ) */
565 /* > where the order of D is at most NB. The actual order is returned in */
566 /* > the argument KB, and is either NB or NB-1, or N if N <= NB. */
567 /* > Note that U**H denotes the conjugate transpose of U. */
569 /* > ZLAHEF_ROOK is an auxiliary routine called by ZHETRF_ROOK. It uses */
570 /* > blocked code (calling Level 3 BLAS) to update the submatrix */
571 /* > A11 (if UPLO = 'U') or A22 (if UPLO = 'L'). */
577 /* > \param[in] UPLO */
579 /* > UPLO is CHARACTER*1 */
580 /* > Specifies whether the upper or lower triangular part of the */
581 /* > Hermitian matrix A is stored: */
582 /* > = 'U': Upper triangular */
583 /* > = 'L': Lower triangular */
589 /* > The order of the matrix A. N >= 0. */
592 /* > \param[in] NB */
594 /* > NB is INTEGER */
595 /* > The maximum number of columns of the matrix A that should be */
596 /* > factored. NB should be at least 2 to allow for 2-by-2 pivot */
600 /* > \param[out] KB */
602 /* > KB is INTEGER */
603 /* > The number of columns of A that were actually factored. */
604 /* > KB is either NB-1 or NB, or N if N <= NB. */
607 /* > \param[in,out] A */
609 /* > A is COMPLEX*16 array, dimension (LDA,N) */
610 /* > On entry, the Hermitian matrix A. If UPLO = 'U', the leading */
611 /* > n-by-n upper triangular part of A contains the upper */
612 /* > triangular part of the matrix A, and the strictly lower */
613 /* > triangular part of A is not referenced. If UPLO = 'L', the */
614 /* > leading n-by-n lower triangular part of A contains the lower */
615 /* > triangular part of the matrix A, and the strictly upper */
616 /* > triangular part of A is not referenced. */
617 /* > On exit, A contains details of the partial factorization. */
620 /* > \param[in] LDA */
622 /* > LDA is INTEGER */
623 /* > The leading dimension of the array A. LDA >= f2cmax(1,N). */
626 /* > \param[out] IPIV */
628 /* > IPIV is INTEGER array, dimension (N) */
629 /* > Details of the interchanges and the block structure of D. */
631 /* > If UPLO = 'U': */
632 /* > Only the last KB elements of IPIV are set. */
634 /* > If IPIV(k) > 0, then rows and columns k and IPIV(k) were */
635 /* > interchanged and D(k,k) is a 1-by-1 diagonal block. */
637 /* > If IPIV(k) < 0 and IPIV(k-1) < 0, then rows and */
638 /* > columns k and -IPIV(k) were interchanged and rows and */
639 /* > columns k-1 and -IPIV(k-1) were inerchaged, */
640 /* > D(k-1:k,k-1:k) is a 2-by-2 diagonal block. */
642 /* > If UPLO = 'L': */
643 /* > Only the first KB elements of IPIV are set. */
645 /* > If IPIV(k) > 0, then rows and columns k and IPIV(k) */
646 /* > were interchanged and D(k,k) is a 1-by-1 diagonal block. */
648 /* > If IPIV(k) < 0 and IPIV(k+1) < 0, then rows and */
649 /* > columns k and -IPIV(k) were interchanged and rows and */
650 /* > columns k+1 and -IPIV(k+1) were inerchaged, */
651 /* > D(k:k+1,k:k+1) is a 2-by-2 diagonal block. */
654 /* > \param[out] W */
656 /* > W is COMPLEX*16 array, dimension (LDW,NB) */
659 /* > \param[in] LDW */
661 /* > LDW is INTEGER */
662 /* > The leading dimension of the array W. LDW >= f2cmax(1,N). */
665 /* > \param[out] INFO */
667 /* > INFO is INTEGER */
668 /* > = 0: successful exit */
669 /* > > 0: if INFO = k, D(k,k) is exactly zero. The factorization */
670 /* > has been completed, but the block diagonal matrix D is */
671 /* > exactly singular. */
677 /* > \author Univ. of Tennessee */
678 /* > \author Univ. of California Berkeley */
679 /* > \author Univ. of Colorado Denver */
680 /* > \author NAG Ltd. */
682 /* > \date November 2013 */
684 /* > \ingroup complex16HEcomputational */
686 /* > \par Contributors: */
687 /* ================== */
691 /* > November 2013, Igor Kozachenko, */
692 /* > Computer Science Division, */
693 /* > University of California, Berkeley */
695 /* > September 2007, Sven Hammarling, Nicholas J. Higham, Craig Lucas, */
696 /* > School of Mathematics, */
697 /* > University of Manchester */
700 /* ===================================================================== */
701 /* Subroutine */ int zlahef_rook_(char *uplo, integer *n, integer *nb,
702 integer *kb, doublecomplex *a, integer *lda, integer *ipiv,
703 doublecomplex *w, integer *ldw, integer *info)
705 /* System generated locals */
706 integer a_dim1, a_offset, w_dim1, w_offset, i__1, i__2, i__3, i__4, i__5;
707 doublereal d__1, d__2;
708 doublecomplex z__1, z__2, z__3, z__4, z__5;
710 /* Local variables */
712 integer imax, jmax, j, k, p;
714 extern logical lsame_(char *, char *);
715 doublereal dtemp, sfmin;
717 extern /* Subroutine */ int zgemm_(char *, char *, integer *, integer *,
718 integer *, doublecomplex *, doublecomplex *, integer *,
719 doublecomplex *, integer *, doublecomplex *, doublecomplex *,
722 extern /* Subroutine */ int zgemv_(char *, integer *, integer *,
723 doublecomplex *, doublecomplex *, integer *, doublecomplex *,
724 integer *, doublecomplex *, doublecomplex *, integer *);
726 extern /* Subroutine */ int zcopy_(integer *, doublecomplex *, integer *,
727 doublecomplex *, integer *), zswap_(integer *, doublecomplex *,
728 integer *, doublecomplex *, integer *);
729 doublecomplex d11, d21, d22;
730 integer jb, ii, jj, kk;
731 extern doublereal dlamch_(char *);
735 extern /* Subroutine */ int zdscal_(integer *, doublereal *,
736 doublecomplex *, integer *);
738 extern /* Subroutine */ int zlacgv_(integer *, doublecomplex *, integer *)
740 extern integer izamax_(integer *, doublecomplex *, integer *);
746 /* -- LAPACK computational routine (version 3.5.0) -- */
747 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
748 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
752 /* ===================================================================== */
755 /* Parameter adjustments */
757 a_offset = 1 + a_dim1 * 1;
761 w_offset = 1 + w_dim1 * 1;
767 /* Initialize ALPHA for use in choosing pivot block size. */
769 alpha = (sqrt(17.) + 1.) / 8.;
771 /* Compute machine safe minimum */
773 sfmin = dlamch_("S");
775 if (lsame_(uplo, "U")) {
777 /* Factorize the trailing columns of A using the upper triangle */
778 /* of A and working backwards, and compute the matrix W = U12*D */
779 /* for use in updating A11 (note that conjg(W) is actually stored) */
781 /* K is the main loop index, decreasing from N in steps of 1 or 2 */
786 /* KW is the column of W which corresponds to column K of A */
792 if (k <= *n - *nb + 1 && *nb < *n || k < 1) {
799 /* Copy column K of A to column KW of W and update it */
803 zcopy_(&i__1, &a[k * a_dim1 + 1], &c__1, &w[kw * w_dim1 + 1], &
806 i__1 = k + kw * w_dim1;
807 i__2 = k + k * a_dim1;
809 w[i__1].r = d__1, w[i__1].i = 0.;
812 z__1.r = -1., z__1.i = 0.;
813 zgemv_("No transpose", &k, &i__1, &z__1, &a[(k + 1) * a_dim1 + 1],
814 lda, &w[k + (kw + 1) * w_dim1], ldw, &c_b1, &w[kw *
816 i__1 = k + kw * w_dim1;
817 i__2 = k + kw * w_dim1;
819 w[i__1].r = d__1, w[i__1].i = 0.;
822 /* Determine rows and columns to be interchanged and whether */
823 /* a 1-by-1 or 2-by-2 pivot block will be used */
825 i__1 = k + kw * w_dim1;
826 absakk = (d__1 = w[i__1].r, abs(d__1));
828 /* IMAX is the row-index of the largest off-diagonal element in */
829 /* column K, and COLMAX is its absolute value. */
830 /* Determine both COLMAX and IMAX. */
834 imax = izamax_(&i__1, &w[kw * w_dim1 + 1], &c__1);
835 i__1 = imax + kw * w_dim1;
836 colmax = (d__1 = w[i__1].r, abs(d__1)) + (d__2 = d_imag(&w[imax +
837 kw * w_dim1]), abs(d__2));
842 if (f2cmax(absakk,colmax) == 0.) {
844 /* Column K is zero or underflow: set INFO and continue */
850 i__1 = k + k * a_dim1;
851 i__2 = k + kw * w_dim1;
853 a[i__1].r = d__1, a[i__1].i = 0.;
856 zcopy_(&i__1, &w[kw * w_dim1 + 1], &c__1, &a[k * a_dim1 + 1],
861 /* ============================================================ */
863 /* BEGIN pivot search */
866 /* Equivalent to testing for ABSAKK.GE.ALPHA*COLMAX */
867 /* (used to handle NaN and Inf) */
868 if (! (absakk < alpha * colmax)) {
870 /* no interchange, use 1-by-1 pivot block */
876 /* Lop until pivot found */
882 /* BEGIN pivot search loop body */
885 /* Copy column IMAX to column KW-1 of W and update it */
889 zcopy_(&i__1, &a[imax * a_dim1 + 1], &c__1, &w[(kw - 1) *
892 i__1 = imax + (kw - 1) * w_dim1;
893 i__2 = imax + imax * a_dim1;
895 w[i__1].r = d__1, w[i__1].i = 0.;
898 zcopy_(&i__1, &a[imax + (imax + 1) * a_dim1], lda, &w[imax +
899 1 + (kw - 1) * w_dim1], &c__1);
901 zlacgv_(&i__1, &w[imax + 1 + (kw - 1) * w_dim1], &c__1);
905 z__1.r = -1., z__1.i = 0.;
906 zgemv_("No transpose", &k, &i__1, &z__1, &a[(k + 1) *
907 a_dim1 + 1], lda, &w[imax + (kw + 1) * w_dim1],
908 ldw, &c_b1, &w[(kw - 1) * w_dim1 + 1], &c__1);
909 i__1 = imax + (kw - 1) * w_dim1;
910 i__2 = imax + (kw - 1) * w_dim1;
912 w[i__1].r = d__1, w[i__1].i = 0.;
915 /* JMAX is the column-index of the largest off-diagonal */
916 /* element in row IMAX, and ROWMAX is its absolute value. */
917 /* Determine both ROWMAX and JMAX. */
921 jmax = imax + izamax_(&i__1, &w[imax + 1 + (kw - 1) *
923 i__1 = jmax + (kw - 1) * w_dim1;
924 rowmax = (d__1 = w[i__1].r, abs(d__1)) + (d__2 = d_imag(&
925 w[jmax + (kw - 1) * w_dim1]), abs(d__2));
932 itemp = izamax_(&i__1, &w[(kw - 1) * w_dim1 + 1], &c__1);
933 i__1 = itemp + (kw - 1) * w_dim1;
934 dtemp = (d__1 = w[i__1].r, abs(d__1)) + (d__2 = d_imag(&w[
935 itemp + (kw - 1) * w_dim1]), abs(d__2));
936 if (dtemp > rowmax) {
943 /* Equivalent to testing for */
944 /* ABS( REAL( W( IMAX,KW-1 ) ) ).GE.ALPHA*ROWMAX */
945 /* (used to handle NaN and Inf) */
947 i__1 = imax + (kw - 1) * w_dim1;
948 if (! ((d__1 = w[i__1].r, abs(d__1)) < alpha * rowmax)) {
950 /* interchange rows and columns K and IMAX, */
951 /* use 1-by-1 pivot block */
955 /* copy column KW-1 of W to column KW of W */
957 zcopy_(&k, &w[(kw - 1) * w_dim1 + 1], &c__1, &w[kw *
963 /* Equivalent to testing for ROWMAX.EQ.COLMAX, */
964 /* (used to handle NaN and Inf) */
966 } else if (p == jmax || rowmax <= colmax) {
968 /* interchange rows and columns K-1 and IMAX, */
969 /* use 2-by-2 pivot block */
978 /* Pivot not found: set params and repeat */
984 /* Copy updated JMAXth (next IMAXth) column to Kth of W */
986 zcopy_(&k, &w[(kw - 1) * w_dim1 + 1], &c__1, &w[kw *
992 /* END pivot search loop body */
1000 /* END pivot search */
1002 /* ============================================================ */
1004 /* KK is the column of A where pivoting step stopped */
1008 /* KKW is the column of W which corresponds to column KK of A */
1010 kkw = *nb + kk - *n;
1012 /* Interchange rows and columns P and K. */
1013 /* Updated column P is already stored in column KW of W. */
1015 if (kstep == 2 && p != k) {
1017 /* Copy non-updated column K to column P of submatrix A */
1018 /* at step K. No need to copy element into columns */
1019 /* K and K-1 of A for 2-by-2 pivot, since these columns */
1020 /* will be later overwritten. */
1022 i__1 = p + p * a_dim1;
1023 i__2 = k + k * a_dim1;
1025 a[i__1].r = d__1, a[i__1].i = 0.;
1027 zcopy_(&i__1, &a[p + 1 + k * a_dim1], &c__1, &a[p + (p + 1) *
1030 zlacgv_(&i__1, &a[p + (p + 1) * a_dim1], lda);
1033 zcopy_(&i__1, &a[k * a_dim1 + 1], &c__1, &a[p * a_dim1 +
1037 /* Interchange rows K and P in the last K+1 to N columns of A */
1038 /* (columns K and K-1 of A for 2-by-2 pivot will be */
1039 /* later overwritten). Interchange rows K and P */
1040 /* in last KKW to NB columns of W. */
1044 zswap_(&i__1, &a[k + (k + 1) * a_dim1], lda, &a[p + (k +
1048 zswap_(&i__1, &w[k + kkw * w_dim1], ldw, &w[p + kkw * w_dim1],
1052 /* Interchange rows and columns KP and KK. */
1053 /* Updated column KP is already stored in column KKW of W. */
1057 /* Copy non-updated column KK to column KP of submatrix A */
1058 /* at step K. No need to copy element into column K */
1059 /* (or K and K-1 for 2-by-2 pivot) of A, since these columns */
1060 /* will be later overwritten. */
1062 i__1 = kp + kp * a_dim1;
1063 i__2 = kk + kk * a_dim1;
1065 a[i__1].r = d__1, a[i__1].i = 0.;
1067 zcopy_(&i__1, &a[kp + 1 + kk * a_dim1], &c__1, &a[kp + (kp +
1070 zlacgv_(&i__1, &a[kp + (kp + 1) * a_dim1], lda);
1073 zcopy_(&i__1, &a[kk * a_dim1 + 1], &c__1, &a[kp * a_dim1
1077 /* Interchange rows KK and KP in last K+1 to N columns of A */
1078 /* (columns K (or K and K-1 for 2-by-2 pivot) of A will be */
1079 /* later overwritten). Interchange rows KK and KP */
1080 /* in last KKW to NB columns of W. */
1084 zswap_(&i__1, &a[kk + (k + 1) * a_dim1], lda, &a[kp + (k
1085 + 1) * a_dim1], lda);
1088 zswap_(&i__1, &w[kk + kkw * w_dim1], ldw, &w[kp + kkw *
1094 /* 1-by-1 pivot block D(k): column kw of W now holds */
1096 /* W(kw) = U(k)*D(k), */
1098 /* where U(k) is the k-th column of U */
1100 /* (1) Store subdiag. elements of column U(k) */
1101 /* and 1-by-1 block D(k) in column k of A. */
1102 /* (NOTE: Diagonal element U(k,k) is a UNIT element */
1103 /* and not stored) */
1104 /* A(k,k) := D(k,k) = W(k,kw) */
1105 /* A(1:k-1,k) := U(1:k-1,k) = W(1:k-1,kw)/D(k,k) */
1107 /* (NOTE: No need to use for Hermitian matrix */
1108 /* A( K, K ) = REAL( W( K, K) ) to separately copy diagonal */
1109 /* element D(k,k) from W (potentially saves only one load)) */
1110 zcopy_(&k, &w[kw * w_dim1 + 1], &c__1, &a[k * a_dim1 + 1], &
1114 /* (NOTE: No need to check if A(k,k) is NOT ZERO, */
1115 /* since that was ensured earlier in pivot search: */
1116 /* case A(k,k) = 0 falls into 2x2 pivot case(3)) */
1118 /* Handle division by a small number */
1120 i__1 = k + k * a_dim1;
1122 if (abs(t) >= sfmin) {
1125 zdscal_(&i__1, &r1, &a[k * a_dim1 + 1], &c__1);
1128 for (ii = 1; ii <= i__1; ++ii) {
1129 i__2 = ii + k * a_dim1;
1130 i__3 = ii + k * a_dim1;
1131 z__1.r = a[i__3].r / t, z__1.i = a[i__3].i / t;
1132 a[i__2].r = z__1.r, a[i__2].i = z__1.i;
1137 /* (2) Conjugate column W(kw) */
1140 zlacgv_(&i__1, &w[kw * w_dim1 + 1], &c__1);
1145 /* 2-by-2 pivot block D(k): columns kw and kw-1 of W now hold */
1147 /* ( W(kw-1) W(kw) ) = ( U(k-1) U(k) )*D(k) */
1149 /* where U(k) and U(k-1) are the k-th and (k-1)-th columns */
1152 /* (1) Store U(1:k-2,k-1) and U(1:k-2,k) and 2-by-2 */
1153 /* block D(k-1:k,k-1:k) in columns k-1 and k of A. */
1154 /* (NOTE: 2-by-2 diagonal block U(k-1:k,k-1:k) is a UNIT */
1155 /* block and not stored) */
1156 /* A(k-1:k,k-1:k) := D(k-1:k,k-1:k) = W(k-1:k,kw-1:kw) */
1157 /* A(1:k-2,k-1:k) := U(1:k-2,k:k-1:k) = */
1158 /* = W(1:k-2,kw-1:kw) * ( D(k-1:k,k-1:k)**(-1) ) */
1162 /* Factor out the columns of the inverse of 2-by-2 pivot */
1163 /* block D, so that each column contains 1, to reduce the */
1164 /* number of FLOPS when we multiply panel */
1165 /* ( W(kw-1) W(kw) ) by this inverse, i.e. by D**(-1). */
1167 /* D**(-1) = ( d11 cj(d21) )**(-1) = */
1170 /* = 1/(d11*d22-|d21|**2) * ( ( d22) (-cj(d21) ) ) = */
1171 /* ( (-d21) ( d11 ) ) */
1173 /* = 1/(|d21|**2) * 1/((d11/cj(d21))*(d22/d21)-1) * */
1175 /* * ( d21*( d22/d21 ) conj(d21)*( - 1 ) ) = */
1176 /* ( ( -1 ) ( d11/conj(d21) ) ) */
1178 /* = 1/(|d21|**2) * 1/(D22*D11-1) * */
1180 /* * ( d21*( D11 ) conj(d21)*( -1 ) ) = */
1181 /* ( ( -1 ) ( D22 ) ) */
1183 /* = (1/|d21|**2) * T * ( d21*( D11 ) conj(d21)*( -1 ) ) = */
1184 /* ( ( -1 ) ( D22 ) ) */
1186 /* = ( (T/conj(d21))*( D11 ) (T/d21)*( -1 ) ) = */
1187 /* ( ( -1 ) ( D22 ) ) */
1189 /* Handle division by a small number. (NOTE: order of */
1190 /* operations is important) */
1192 /* = ( T*(( D11 )/conj(D21)) T*(( -1 )/D21 ) ) */
1193 /* ( (( -1 ) ) (( D22 ) ) ), */
1195 /* where D11 = d22/d21, */
1196 /* D22 = d11/conj(d21), */
1198 /* T = 1/(D22*D11-1). */
1200 /* (NOTE: No need to check for division by ZERO, */
1201 /* since that was ensured earlier in pivot search: */
1202 /* (a) d21 != 0 in 2x2 pivot case(4), */
1203 /* since |d21| should be larger than |d11| and |d22|; */
1204 /* (b) (D22*D11 - 1) != 0, since from (a), */
1205 /* both |D11| < 1, |D22| < 1, hence |D22*D11| << 1.) */
1207 i__1 = k - 1 + kw * w_dim1;
1208 d21.r = w[i__1].r, d21.i = w[i__1].i;
1209 d_cnjg(&z__2, &d21);
1210 z_div(&z__1, &w[k + kw * w_dim1], &z__2);
1211 d11.r = z__1.r, d11.i = z__1.i;
1212 z_div(&z__1, &w[k - 1 + (kw - 1) * w_dim1], &d21);
1213 d22.r = z__1.r, d22.i = z__1.i;
1214 z__1.r = d11.r * d22.r - d11.i * d22.i, z__1.i = d11.r *
1215 d22.i + d11.i * d22.r;
1216 t = 1. / (z__1.r - 1.);
1218 /* Update elements in columns A(k-1) and A(k) as */
1219 /* dot products of rows of ( W(kw-1) W(kw) ) and columns */
1223 for (j = 1; j <= i__1; ++j) {
1224 i__2 = j + (k - 1) * a_dim1;
1225 i__3 = j + (kw - 1) * w_dim1;
1226 z__4.r = d11.r * w[i__3].r - d11.i * w[i__3].i,
1227 z__4.i = d11.r * w[i__3].i + d11.i * w[i__3]
1229 i__4 = j + kw * w_dim1;
1230 z__3.r = z__4.r - w[i__4].r, z__3.i = z__4.i - w[i__4]
1232 z_div(&z__2, &z__3, &d21);
1233 z__1.r = t * z__2.r, z__1.i = t * z__2.i;
1234 a[i__2].r = z__1.r, a[i__2].i = z__1.i;
1235 i__2 = j + k * a_dim1;
1236 i__3 = j + kw * w_dim1;
1237 z__4.r = d22.r * w[i__3].r - d22.i * w[i__3].i,
1238 z__4.i = d22.r * w[i__3].i + d22.i * w[i__3]
1240 i__4 = j + (kw - 1) * w_dim1;
1241 z__3.r = z__4.r - w[i__4].r, z__3.i = z__4.i - w[i__4]
1243 d_cnjg(&z__5, &d21);
1244 z_div(&z__2, &z__3, &z__5);
1245 z__1.r = t * z__2.r, z__1.i = t * z__2.i;
1246 a[i__2].r = z__1.r, a[i__2].i = z__1.i;
1251 /* Copy D(k) to A */
1253 i__1 = k - 1 + (k - 1) * a_dim1;
1254 i__2 = k - 1 + (kw - 1) * w_dim1;
1255 a[i__1].r = w[i__2].r, a[i__1].i = w[i__2].i;
1256 i__1 = k - 1 + k * a_dim1;
1257 i__2 = k - 1 + kw * w_dim1;
1258 a[i__1].r = w[i__2].r, a[i__1].i = w[i__2].i;
1259 i__1 = k + k * a_dim1;
1260 i__2 = k + kw * w_dim1;
1261 a[i__1].r = w[i__2].r, a[i__1].i = w[i__2].i;
1263 /* (2) Conjugate columns W(kw) and W(kw-1) */
1266 zlacgv_(&i__1, &w[kw * w_dim1 + 1], &c__1);
1268 zlacgv_(&i__1, &w[(kw - 1) * w_dim1 + 1], &c__1);
1274 /* Store details of the interchanges in IPIV */
1283 /* Decrease K and return to the start of the main loop */
1290 /* Update the upper triangle of A11 (= A(1:k,1:k)) as */
1292 /* A11 := A11 - U12*D*U12**H = A11 - U12*W**H */
1294 /* computing blocks of NB columns at a time (note that conjg(W) is */
1295 /* actually stored) */
1298 for (j = (k - 1) / *nb * *nb + 1; i__1 < 0 ? j >= 1 : j <= 1; j +=
1301 i__2 = *nb, i__3 = k - j + 1;
1302 jb = f2cmin(i__2,i__3);
1304 /* Update the upper triangle of the diagonal block */
1307 for (jj = j; jj <= i__2; ++jj) {
1308 i__3 = jj + jj * a_dim1;
1309 i__4 = jj + jj * a_dim1;
1311 a[i__3].r = d__1, a[i__3].i = 0.;
1314 z__1.r = -1., z__1.i = 0.;
1315 zgemv_("No transpose", &i__3, &i__4, &z__1, &a[j + (k + 1) *
1316 a_dim1], lda, &w[jj + (kw + 1) * w_dim1], ldw, &c_b1,
1317 &a[j + jj * a_dim1], &c__1);
1318 i__3 = jj + jj * a_dim1;
1319 i__4 = jj + jj * a_dim1;
1321 a[i__3].r = d__1, a[i__3].i = 0.;
1325 /* Update the rectangular superdiagonal block */
1330 z__1.r = -1., z__1.i = 0.;
1331 zgemm_("No transpose", "Transpose", &i__2, &jb, &i__3, &z__1,
1332 &a[(k + 1) * a_dim1 + 1], lda, &w[j + (kw + 1) *
1333 w_dim1], ldw, &c_b1, &a[j * a_dim1 + 1], lda);
1338 /* Put U12 in standard form by partially undoing the interchanges */
1339 /* in of rows in columns k+1:n looping backwards from k+1 to n */
1344 /* Undo the interchanges (if any) of rows J and JP2 */
1345 /* (or J and JP2, and J+1 and JP1) at each step J */
1349 /* (Here, J is a diagonal index) */
1354 /* (Here, J is a diagonal index) */
1359 /* (NOTE: Here, J is used to determine row length. Length N-J+1 */
1360 /* of the rows to swap back doesn't include diagonal element) */
1362 if (jp2 != jj && j <= *n) {
1364 zswap_(&i__1, &a[jp2 + j * a_dim1], lda, &a[jj + j * a_dim1], lda)
1368 if (kstep == 2 && jp1 != jj && j <= *n) {
1370 zswap_(&i__1, &a[jp1 + j * a_dim1], lda, &a[jj + j * a_dim1], lda)
1377 /* Set KB to the number of columns factorized */
1383 /* Factorize the leading columns of A using the lower triangle */
1384 /* of A and working forwards, and compute the matrix W = L21*D */
1385 /* for use in updating A22 (note that conjg(W) is actually stored) */
1387 /* K is the main loop index, increasing from 1 in steps of 1 or 2 */
1392 /* Exit from loop */
1394 if (k >= *nb && *nb < *n || k > *n) {
1401 /* Copy column K of A to column K of W and update column K of W */
1403 i__1 = k + k * w_dim1;
1404 i__2 = k + k * a_dim1;
1406 w[i__1].r = d__1, w[i__1].i = 0.;
1409 zcopy_(&i__1, &a[k + 1 + k * a_dim1], &c__1, &w[k + 1 + k *
1415 z__1.r = -1., z__1.i = 0.;
1416 zgemv_("No transpose", &i__1, &i__2, &z__1, &a[k + a_dim1], lda, &
1417 w[k + w_dim1], ldw, &c_b1, &w[k + k * w_dim1], &c__1);
1418 i__1 = k + k * w_dim1;
1419 i__2 = k + k * w_dim1;
1421 w[i__1].r = d__1, w[i__1].i = 0.;
1424 /* Determine rows and columns to be interchanged and whether */
1425 /* a 1-by-1 or 2-by-2 pivot block will be used */
1427 i__1 = k + k * w_dim1;
1428 absakk = (d__1 = w[i__1].r, abs(d__1));
1430 /* IMAX is the row-index of the largest off-diagonal element in */
1431 /* column K, and COLMAX is its absolute value. */
1432 /* Determine both COLMAX and IMAX. */
1436 imax = k + izamax_(&i__1, &w[k + 1 + k * w_dim1], &c__1);
1437 i__1 = imax + k * w_dim1;
1438 colmax = (d__1 = w[i__1].r, abs(d__1)) + (d__2 = d_imag(&w[imax +
1439 k * w_dim1]), abs(d__2));
1444 if (f2cmax(absakk,colmax) == 0.) {
1446 /* Column K is zero or underflow: set INFO and continue */
1452 i__1 = k + k * a_dim1;
1453 i__2 = k + k * w_dim1;
1455 a[i__1].r = d__1, a[i__1].i = 0.;
1458 zcopy_(&i__1, &w[k + 1 + k * w_dim1], &c__1, &a[k + 1 + k *
1463 /* ============================================================ */
1465 /* BEGIN pivot search */
1468 /* Equivalent to testing for ABSAKK.GE.ALPHA*COLMAX */
1469 /* (used to handle NaN and Inf) */
1471 if (! (absakk < alpha * colmax)) {
1473 /* no interchange, use 1-by-1 pivot block */
1481 /* Loop until pivot found */
1485 /* BEGIN pivot search loop body */
1488 /* Copy column IMAX to column k+1 of W and update it */
1491 zcopy_(&i__1, &a[imax + k * a_dim1], lda, &w[k + (k + 1) *
1494 zlacgv_(&i__1, &w[k + (k + 1) * w_dim1], &c__1);
1495 i__1 = imax + (k + 1) * w_dim1;
1496 i__2 = imax + imax * a_dim1;
1498 w[i__1].r = d__1, w[i__1].i = 0.;
1502 zcopy_(&i__1, &a[imax + 1 + imax * a_dim1], &c__1, &w[
1503 imax + 1 + (k + 1) * w_dim1], &c__1);
1509 z__1.r = -1., z__1.i = 0.;
1510 zgemv_("No transpose", &i__1, &i__2, &z__1, &a[k + a_dim1]
1511 , lda, &w[imax + w_dim1], ldw, &c_b1, &w[k + (k +
1512 1) * w_dim1], &c__1);
1513 i__1 = imax + (k + 1) * w_dim1;
1514 i__2 = imax + (k + 1) * w_dim1;
1516 w[i__1].r = d__1, w[i__1].i = 0.;
1519 /* JMAX is the column-index of the largest off-diagonal */
1520 /* element in row IMAX, and ROWMAX is its absolute value. */
1521 /* Determine both ROWMAX and JMAX. */
1525 jmax = k - 1 + izamax_(&i__1, &w[k + (k + 1) * w_dim1], &
1527 i__1 = jmax + (k + 1) * w_dim1;
1528 rowmax = (d__1 = w[i__1].r, abs(d__1)) + (d__2 = d_imag(&
1529 w[jmax + (k + 1) * w_dim1]), abs(d__2));
1536 itemp = imax + izamax_(&i__1, &w[imax + 1 + (k + 1) *
1538 i__1 = itemp + (k + 1) * w_dim1;
1539 dtemp = (d__1 = w[i__1].r, abs(d__1)) + (d__2 = d_imag(&w[
1540 itemp + (k + 1) * w_dim1]), abs(d__2));
1541 if (dtemp > rowmax) {
1548 /* Equivalent to testing for */
1549 /* ABS( REAL( W( IMAX,K+1 ) ) ).GE.ALPHA*ROWMAX */
1550 /* (used to handle NaN and Inf) */
1552 i__1 = imax + (k + 1) * w_dim1;
1553 if (! ((d__1 = w[i__1].r, abs(d__1)) < alpha * rowmax)) {
1555 /* interchange rows and columns K and IMAX, */
1556 /* use 1-by-1 pivot block */
1560 /* copy column K+1 of W to column K of W */
1563 zcopy_(&i__1, &w[k + (k + 1) * w_dim1], &c__1, &w[k + k *
1569 /* Equivalent to testing for ROWMAX.EQ.COLMAX, */
1570 /* (used to handle NaN and Inf) */
1572 } else if (p == jmax || rowmax <= colmax) {
1574 /* interchange rows and columns K+1 and IMAX, */
1575 /* use 2-by-2 pivot block */
1584 /* Pivot not found: set params and repeat */
1590 /* Copy updated JMAXth (next IMAXth) column to Kth of W */
1593 zcopy_(&i__1, &w[k + (k + 1) * w_dim1], &c__1, &w[k + k *
1599 /* End pivot search loop body */
1607 /* END pivot search */
1609 /* ============================================================ */
1611 /* KK is the column of A where pivoting step stopped */
1615 /* Interchange rows and columns P and K (only for 2-by-2 pivot). */
1616 /* Updated column P is already stored in column K of W. */
1618 if (kstep == 2 && p != k) {
1620 /* Copy non-updated column KK-1 to column P of submatrix A */
1621 /* at step K. No need to copy element into columns */
1622 /* K and K+1 of A for 2-by-2 pivot, since these columns */
1623 /* will be later overwritten. */
1625 i__1 = p + p * a_dim1;
1626 i__2 = k + k * a_dim1;
1628 a[i__1].r = d__1, a[i__1].i = 0.;
1630 zcopy_(&i__1, &a[k + 1 + k * a_dim1], &c__1, &a[p + (k + 1) *
1633 zlacgv_(&i__1, &a[p + (k + 1) * a_dim1], lda);
1636 zcopy_(&i__1, &a[p + 1 + k * a_dim1], &c__1, &a[p + 1 + p
1640 /* Interchange rows K and P in first K-1 columns of A */
1641 /* (columns K and K+1 of A for 2-by-2 pivot will be */
1642 /* later overwritten). Interchange rows K and P */
1643 /* in first KK columns of W. */
1647 zswap_(&i__1, &a[k + a_dim1], lda, &a[p + a_dim1], lda);
1649 zswap_(&kk, &w[k + w_dim1], ldw, &w[p + w_dim1], ldw);
1652 /* Interchange rows and columns KP and KK. */
1653 /* Updated column KP is already stored in column KK of W. */
1657 /* Copy non-updated column KK to column KP of submatrix A */
1658 /* at step K. No need to copy element into column K */
1659 /* (or K and K+1 for 2-by-2 pivot) of A, since these columns */
1660 /* will be later overwritten. */
1662 i__1 = kp + kp * a_dim1;
1663 i__2 = kk + kk * a_dim1;
1665 a[i__1].r = d__1, a[i__1].i = 0.;
1667 zcopy_(&i__1, &a[kk + 1 + kk * a_dim1], &c__1, &a[kp + (kk +
1670 zlacgv_(&i__1, &a[kp + (kk + 1) * a_dim1], lda);
1673 zcopy_(&i__1, &a[kp + 1 + kk * a_dim1], &c__1, &a[kp + 1
1674 + kp * a_dim1], &c__1);
1677 /* Interchange rows KK and KP in first K-1 columns of A */
1678 /* (column K (or K and K+1 for 2-by-2 pivot) of A will be */
1679 /* later overwritten). Interchange rows KK and KP */
1680 /* in first KK columns of W. */
1684 zswap_(&i__1, &a[kk + a_dim1], lda, &a[kp + a_dim1], lda);
1686 zswap_(&kk, &w[kk + w_dim1], ldw, &w[kp + w_dim1], ldw);
1691 /* 1-by-1 pivot block D(k): column k of W now holds */
1693 /* W(k) = L(k)*D(k), */
1695 /* where L(k) is the k-th column of L */
1697 /* (1) Store subdiag. elements of column L(k) */
1698 /* and 1-by-1 block D(k) in column k of A. */
1699 /* (NOTE: Diagonal element L(k,k) is a UNIT element */
1700 /* and not stored) */
1701 /* A(k,k) := D(k,k) = W(k,k) */
1702 /* A(k+1:N,k) := L(k+1:N,k) = W(k+1:N,k)/D(k,k) */
1704 /* (NOTE: No need to use for Hermitian matrix */
1705 /* A( K, K ) = REAL( W( K, K) ) to separately copy diagonal */
1706 /* element D(k,k) from W (potentially saves only one load)) */
1708 zcopy_(&i__1, &w[k + k * w_dim1], &c__1, &a[k + k * a_dim1], &
1712 /* (NOTE: No need to check if A(k,k) is NOT ZERO, */
1713 /* since that was ensured earlier in pivot search: */
1714 /* case A(k,k) = 0 falls into 2x2 pivot case(3)) */
1716 /* Handle division by a small number */
1718 i__1 = k + k * a_dim1;
1720 if (abs(t) >= sfmin) {
1723 zdscal_(&i__1, &r1, &a[k + 1 + k * a_dim1], &c__1);
1726 for (ii = k + 1; ii <= i__1; ++ii) {
1727 i__2 = ii + k * a_dim1;
1728 i__3 = ii + k * a_dim1;
1729 z__1.r = a[i__3].r / t, z__1.i = a[i__3].i / t;
1730 a[i__2].r = z__1.r, a[i__2].i = z__1.i;
1735 /* (2) Conjugate column W(k) */
1738 zlacgv_(&i__1, &w[k + 1 + k * w_dim1], &c__1);
1743 /* 2-by-2 pivot block D(k): columns k and k+1 of W now hold */
1745 /* ( W(k) W(k+1) ) = ( L(k) L(k+1) )*D(k) */
1747 /* where L(k) and L(k+1) are the k-th and (k+1)-th columns */
1750 /* (1) Store L(k+2:N,k) and L(k+2:N,k+1) and 2-by-2 */
1751 /* block D(k:k+1,k:k+1) in columns k and k+1 of A. */
1752 /* NOTE: 2-by-2 diagonal block L(k:k+1,k:k+1) is a UNIT */
1753 /* block and not stored. */
1754 /* A(k:k+1,k:k+1) := D(k:k+1,k:k+1) = W(k:k+1,k:k+1) */
1755 /* A(k+2:N,k:k+1) := L(k+2:N,k:k+1) = */
1756 /* = W(k+2:N,k:k+1) * ( D(k:k+1,k:k+1)**(-1) ) */
1760 /* Factor out the columns of the inverse of 2-by-2 pivot */
1761 /* block D, so that each column contains 1, to reduce the */
1762 /* number of FLOPS when we multiply panel */
1763 /* ( W(kw-1) W(kw) ) by this inverse, i.e. by D**(-1). */
1765 /* D**(-1) = ( d11 cj(d21) )**(-1) = */
1768 /* = 1/(d11*d22-|d21|**2) * ( ( d22) (-cj(d21) ) ) = */
1769 /* ( (-d21) ( d11 ) ) */
1771 /* = 1/(|d21|**2) * 1/((d11/cj(d21))*(d22/d21)-1) * */
1773 /* * ( d21*( d22/d21 ) conj(d21)*( - 1 ) ) = */
1774 /* ( ( -1 ) ( d11/conj(d21) ) ) */
1776 /* = 1/(|d21|**2) * 1/(D22*D11-1) * */
1778 /* * ( d21*( D11 ) conj(d21)*( -1 ) ) = */
1779 /* ( ( -1 ) ( D22 ) ) */
1781 /* = (1/|d21|**2) * T * ( d21*( D11 ) conj(d21)*( -1 ) ) = */
1782 /* ( ( -1 ) ( D22 ) ) */
1784 /* = ( (T/conj(d21))*( D11 ) (T/d21)*( -1 ) ) = */
1785 /* ( ( -1 ) ( D22 ) ) */
1787 /* Handle division by a small number. (NOTE: order of */
1788 /* operations is important) */
1790 /* = ( T*(( D11 )/conj(D21)) T*(( -1 )/D21 ) ) */
1791 /* ( (( -1 ) ) (( D22 ) ) ), */
1793 /* where D11 = d22/d21, */
1794 /* D22 = d11/conj(d21), */
1796 /* T = 1/(D22*D11-1). */
1798 /* (NOTE: No need to check for division by ZERO, */
1799 /* since that was ensured earlier in pivot search: */
1800 /* (a) d21 != 0 in 2x2 pivot case(4), */
1801 /* since |d21| should be larger than |d11| and |d22|; */
1802 /* (b) (D22*D11 - 1) != 0, since from (a), */
1803 /* both |D11| < 1, |D22| < 1, hence |D22*D11| << 1.) */
1805 i__1 = k + 1 + k * w_dim1;
1806 d21.r = w[i__1].r, d21.i = w[i__1].i;
1807 z_div(&z__1, &w[k + 1 + (k + 1) * w_dim1], &d21);
1808 d11.r = z__1.r, d11.i = z__1.i;
1809 d_cnjg(&z__2, &d21);
1810 z_div(&z__1, &w[k + k * w_dim1], &z__2);
1811 d22.r = z__1.r, d22.i = z__1.i;
1812 z__1.r = d11.r * d22.r - d11.i * d22.i, z__1.i = d11.r *
1813 d22.i + d11.i * d22.r;
1814 t = 1. / (z__1.r - 1.);
1816 /* Update elements in columns A(k) and A(k+1) as */
1817 /* dot products of rows of ( W(k) W(k+1) ) and columns */
1821 for (j = k + 2; j <= i__1; ++j) {
1822 i__2 = j + k * a_dim1;
1823 i__3 = j + k * w_dim1;
1824 z__4.r = d11.r * w[i__3].r - d11.i * w[i__3].i,
1825 z__4.i = d11.r * w[i__3].i + d11.i * w[i__3]
1827 i__4 = j + (k + 1) * w_dim1;
1828 z__3.r = z__4.r - w[i__4].r, z__3.i = z__4.i - w[i__4]
1830 d_cnjg(&z__5, &d21);
1831 z_div(&z__2, &z__3, &z__5);
1832 z__1.r = t * z__2.r, z__1.i = t * z__2.i;
1833 a[i__2].r = z__1.r, a[i__2].i = z__1.i;
1834 i__2 = j + (k + 1) * a_dim1;
1835 i__3 = j + (k + 1) * w_dim1;
1836 z__4.r = d22.r * w[i__3].r - d22.i * w[i__3].i,
1837 z__4.i = d22.r * w[i__3].i + d22.i * w[i__3]
1839 i__4 = j + k * w_dim1;
1840 z__3.r = z__4.r - w[i__4].r, z__3.i = z__4.i - w[i__4]
1842 z_div(&z__2, &z__3, &d21);
1843 z__1.r = t * z__2.r, z__1.i = t * z__2.i;
1844 a[i__2].r = z__1.r, a[i__2].i = z__1.i;
1849 /* Copy D(k) to A */
1851 i__1 = k + k * a_dim1;
1852 i__2 = k + k * w_dim1;
1853 a[i__1].r = w[i__2].r, a[i__1].i = w[i__2].i;
1854 i__1 = k + 1 + k * a_dim1;
1855 i__2 = k + 1 + k * w_dim1;
1856 a[i__1].r = w[i__2].r, a[i__1].i = w[i__2].i;
1857 i__1 = k + 1 + (k + 1) * a_dim1;
1858 i__2 = k + 1 + (k + 1) * w_dim1;
1859 a[i__1].r = w[i__2].r, a[i__1].i = w[i__2].i;
1861 /* (2) Conjugate columns W(k) and W(k+1) */
1864 zlacgv_(&i__1, &w[k + 1 + k * w_dim1], &c__1);
1866 zlacgv_(&i__1, &w[k + 2 + (k + 1) * w_dim1], &c__1);
1872 /* Store details of the interchanges in IPIV */
1881 /* Increase K and return to the start of the main loop */
1888 /* Update the lower triangle of A22 (= A(k:n,k:n)) as */
1890 /* A22 := A22 - L21*D*L21**H = A22 - L21*W**H */
1892 /* computing blocks of NB columns at a time (note that conjg(W) is */
1893 /* actually stored) */
1897 for (j = k; i__2 < 0 ? j >= i__1 : j <= i__1; j += i__2) {
1899 i__3 = *nb, i__4 = *n - j + 1;
1900 jb = f2cmin(i__3,i__4);
1902 /* Update the lower triangle of the diagonal block */
1905 for (jj = j; jj <= i__3; ++jj) {
1906 i__4 = jj + jj * a_dim1;
1907 i__5 = jj + jj * a_dim1;
1909 a[i__4].r = d__1, a[i__4].i = 0.;
1912 z__1.r = -1., z__1.i = 0.;
1913 zgemv_("No transpose", &i__4, &i__5, &z__1, &a[jj + a_dim1],
1914 lda, &w[jj + w_dim1], ldw, &c_b1, &a[jj + jj * a_dim1]
1916 i__4 = jj + jj * a_dim1;
1917 i__5 = jj + jj * a_dim1;
1919 a[i__4].r = d__1, a[i__4].i = 0.;
1923 /* Update the rectangular subdiagonal block */
1926 i__3 = *n - j - jb + 1;
1928 z__1.r = -1., z__1.i = 0.;
1929 zgemm_("No transpose", "Transpose", &i__3, &jb, &i__4, &z__1,
1930 &a[j + jb + a_dim1], lda, &w[j + w_dim1], ldw, &c_b1,
1931 &a[j + jb + j * a_dim1], lda);
1936 /* Put L21 in standard form by partially undoing the interchanges */
1937 /* of rows in columns 1:k-1 looping backwards from k-1 to 1 */
1942 /* Undo the interchanges (if any) of rows J and JP2 */
1943 /* (or J and JP2, and J-1 and JP1) at each step J */
1947 /* (Here, J is a diagonal index) */
1952 /* (Here, J is a diagonal index) */
1957 /* (NOTE: Here, J is used to determine row length. Length J */
1958 /* of the rows to swap back doesn't include diagonal element) */
1960 if (jp2 != jj && j >= 1) {
1961 zswap_(&j, &a[jp2 + a_dim1], lda, &a[jj + a_dim1], lda);
1964 if (kstep == 2 && jp1 != jj && j >= 1) {
1965 zswap_(&j, &a[jp1 + a_dim1], lda, &a[jj + a_dim1], lda);
1971 /* Set KB to the number of columns factorized */
1978 /* End of ZLAHEF_ROOK */
1980 } /* zlahef_rook__ */