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 integer c__1 = 1;
517 /* > \brief \b ZHETF2_ROOK computes the factorization of a complex Hermitian indefinite matrix using the bound
518 ed Bunch-Kaufman ("rook") diagonal pivoting method (unblocked algorithm). */
520 /* =========== DOCUMENTATION =========== */
522 /* Online html documentation available at */
523 /* http://www.netlib.org/lapack/explore-html/ */
526 /* > Download ZHETF2_ROOK + dependencies */
527 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zhetf2_
530 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zhetf2_
533 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zhetf2_
541 /* SUBROUTINE ZHETF2_ROOK( UPLO, N, A, LDA, IPIV, INFO ) */
544 /* INTEGER INFO, LDA, N */
545 /* INTEGER IPIV( * ) */
546 /* COMPLEX*16 A( LDA, * ) */
549 /* > \par Purpose: */
554 /* > ZHETF2_ROOK computes the factorization of a complex Hermitian matrix A */
555 /* > using the bounded Bunch-Kaufman ("rook") diagonal pivoting method: */
557 /* > A = U*D*U**H or A = L*D*L**H */
559 /* > where U (or L) is a product of permutation and unit upper (lower) */
560 /* > triangular matrices, U**H is the conjugate transpose of U, and D is */
561 /* > Hermitian and block diagonal with 1-by-1 and 2-by-2 diagonal blocks. */
563 /* > This is the unblocked version of the algorithm, calling Level 2 BLAS. */
569 /* > \param[in] UPLO */
571 /* > UPLO is CHARACTER*1 */
572 /* > Specifies whether the upper or lower triangular part of the */
573 /* > Hermitian matrix A is stored: */
574 /* > = 'U': Upper triangular */
575 /* > = 'L': Lower triangular */
581 /* > The order of the matrix A. N >= 0. */
584 /* > \param[in,out] A */
586 /* > A is COMPLEX*16 array, dimension (LDA,N) */
587 /* > On entry, the Hermitian matrix A. If UPLO = 'U', the leading */
588 /* > n-by-n upper triangular part of A contains the upper */
589 /* > triangular part of the matrix A, and the strictly lower */
590 /* > triangular part of A is not referenced. If UPLO = 'L', the */
591 /* > leading n-by-n lower triangular part of A contains the lower */
592 /* > triangular part of the matrix A, and the strictly upper */
593 /* > triangular part of A is not referenced. */
595 /* > On exit, the block diagonal matrix D and the multipliers used */
596 /* > to obtain the factor U or L (see below for further details). */
599 /* > \param[in] LDA */
601 /* > LDA is INTEGER */
602 /* > The leading dimension of the array A. LDA >= f2cmax(1,N). */
605 /* > \param[out] IPIV */
607 /* > IPIV is INTEGER array, dimension (N) */
608 /* > Details of the interchanges and the block structure of D. */
610 /* > If UPLO = 'U': */
611 /* > If IPIV(k) > 0, then rows and columns k and IPIV(k) were */
612 /* > interchanged and D(k,k) is a 1-by-1 diagonal block. */
614 /* > If IPIV(k) < 0 and IPIV(k-1) < 0, then rows and */
615 /* > columns k and -IPIV(k) were interchanged and rows and */
616 /* > columns k-1 and -IPIV(k-1) were inerchaged, */
617 /* > D(k-1:k,k-1:k) is a 2-by-2 diagonal block. */
619 /* > If UPLO = 'L': */
620 /* > If IPIV(k) > 0, then rows and columns k and IPIV(k) */
621 /* > were interchanged and D(k,k) is a 1-by-1 diagonal block. */
623 /* > If IPIV(k) < 0 and IPIV(k+1) < 0, then rows and */
624 /* > columns k and -IPIV(k) were interchanged and rows and */
625 /* > columns k+1 and -IPIV(k+1) were inerchaged, */
626 /* > D(k:k+1,k:k+1) is a 2-by-2 diagonal block. */
629 /* > \param[out] INFO */
631 /* > INFO is INTEGER */
632 /* > = 0: successful exit */
633 /* > < 0: if INFO = -k, the k-th argument had an illegal value */
634 /* > > 0: if INFO = k, D(k,k) is exactly zero. The factorization */
635 /* > has been completed, but the block diagonal matrix D is */
636 /* > exactly singular, and division by zero will occur if it */
637 /* > is used to solve a system of equations. */
643 /* > \author Univ. of Tennessee */
644 /* > \author Univ. of California Berkeley */
645 /* > \author Univ. of Colorado Denver */
646 /* > \author NAG Ltd. */
648 /* > \date November 2013 */
650 /* > \ingroup complex16HEcomputational */
652 /* > \par Further Details: */
653 /* ===================== */
657 /* > If UPLO = 'U', then A = U*D*U**H, where */
658 /* > U = P(n)*U(n)* ... *P(k)U(k)* ..., */
659 /* > i.e., U is a product of terms P(k)*U(k), where k decreases from n to */
660 /* > 1 in steps of 1 or 2, and D is a block diagonal matrix with 1-by-1 */
661 /* > and 2-by-2 diagonal blocks D(k). P(k) is a permutation matrix as */
662 /* > defined by IPIV(k), and U(k) is a unit upper triangular matrix, such */
663 /* > that if the diagonal block D(k) is of order s (s = 1 or 2), then */
665 /* > ( I v 0 ) k-s */
666 /* > U(k) = ( 0 I 0 ) s */
667 /* > ( 0 0 I ) n-k */
670 /* > If s = 1, D(k) overwrites A(k,k), and v overwrites A(1:k-1,k). */
671 /* > If s = 2, the upper triangle of D(k) overwrites A(k-1,k-1), A(k-1,k), */
672 /* > and A(k,k), and v overwrites A(1:k-2,k-1:k). */
674 /* > If UPLO = 'L', then A = L*D*L**H, where */
675 /* > L = P(1)*L(1)* ... *P(k)*L(k)* ..., */
676 /* > i.e., L is a product of terms P(k)*L(k), where k increases from 1 to */
677 /* > n in steps of 1 or 2, and D is a block diagonal matrix with 1-by-1 */
678 /* > and 2-by-2 diagonal blocks D(k). P(k) is a permutation matrix as */
679 /* > defined by IPIV(k), and L(k) is a unit lower triangular matrix, such */
680 /* > that if the diagonal block D(k) is of order s (s = 1 or 2), then */
682 /* > ( I 0 0 ) k-1 */
683 /* > L(k) = ( 0 I 0 ) s */
684 /* > ( 0 v I ) n-k-s+1 */
685 /* > k-1 s n-k-s+1 */
687 /* > If s = 1, D(k) overwrites A(k,k), and v overwrites A(k+1:n,k). */
688 /* > If s = 2, the lower triangle of D(k) overwrites A(k,k), A(k+1,k), */
689 /* > and A(k+1,k+1), and v overwrites A(k+2:n,k:k+1). */
692 /* > \par Contributors: */
693 /* ================== */
697 /* > November 2013, Igor Kozachenko, */
698 /* > Computer Science Division, */
699 /* > University of California, Berkeley */
701 /* > September 2007, Sven Hammarling, Nicholas J. Higham, Craig Lucas, */
702 /* > School of Mathematics, */
703 /* > University of Manchester */
705 /* > 01-01-96 - Based on modifications by */
706 /* > J. Lewis, Boeing Computer Services Company */
707 /* > A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA */
710 /* ===================================================================== */
711 /* Subroutine */ int zhetf2_rook_(char *uplo, integer *n, doublecomplex *a,
712 integer *lda, integer *ipiv, integer *info)
714 /* System generated locals */
715 integer a_dim1, a_offset, i__1, i__2, i__3, i__4, i__5, i__6;
716 doublereal d__1, d__2;
717 doublecomplex z__1, z__2, z__3, z__4, z__5, z__6, z__7, z__8;
719 /* Local variables */
722 extern /* Subroutine */ int zher_(char *, integer *, doublereal *,
723 doublecomplex *, integer *, doublecomplex *, integer *);
725 integer i__, j, k, p;
728 extern logical lsame_(char *, char *);
729 doublereal dtemp, sfmin;
730 integer itemp, kstep;
733 extern /* Subroutine */ int zswap_(integer *, doublecomplex *, integer *,
734 doublecomplex *, integer *);
735 extern doublereal dlapy2_(doublereal *, doublereal *);
741 extern doublereal dlamch_(char *);
746 extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen), zdscal_(
747 integer *, doublereal *, doublecomplex *, integer *);
749 extern integer izamax_(integer *, doublecomplex *, integer *);
751 doublecomplex wkm1, wkp1;
754 /* -- LAPACK computational routine (version 3.5.0) -- */
755 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
756 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
760 /* ====================================================================== */
764 /* Test the input parameters. */
766 /* Parameter adjustments */
768 a_offset = 1 + a_dim1 * 1;
774 upper = lsame_(uplo, "U");
775 if (! upper && ! lsame_(uplo, "L")) {
779 } else if (*lda < f2cmax(1,*n)) {
784 xerbla_("ZHETF2_ROOK", &i__1, (ftnlen)11);
788 /* Initialize ALPHA for use in choosing pivot block size. */
790 alpha = (sqrt(17.) + 1.) / 8.;
792 /* Compute machine safe minimum */
794 sfmin = dlamch_("S");
798 /* Factorize A as U*D*U**H using the upper triangle of A */
800 /* K is the main loop index, decreasing from N to 1 in steps of */
806 /* If K < 1, exit from loop */
814 /* Determine rows and columns to be interchanged and whether */
815 /* a 1-by-1 or 2-by-2 pivot block will be used */
817 i__1 = k + k * a_dim1;
818 absakk = (d__1 = a[i__1].r, abs(d__1));
820 /* IMAX is the row-index of the largest off-diagonal element in */
821 /* column K, and COLMAX is its absolute value. */
822 /* Determine both COLMAX and IMAX. */
826 imax = izamax_(&i__1, &a[k * a_dim1 + 1], &c__1);
827 i__1 = imax + k * a_dim1;
828 colmax = (d__1 = a[i__1].r, abs(d__1)) + (d__2 = d_imag(&a[imax +
829 k * a_dim1]), abs(d__2));
834 if (f2cmax(absakk,colmax) == 0.) {
836 /* Column K is zero or underflow: set INFO and continue */
842 i__1 = k + k * a_dim1;
843 i__2 = k + k * a_dim1;
845 a[i__1].r = d__1, a[i__1].i = 0.;
848 /* ============================================================ */
850 /* BEGIN pivot search */
853 /* Equivalent to testing for ABSAKK.GE.ALPHA*COLMAX */
854 /* (used to handle NaN and Inf) */
856 if (! (absakk < alpha * colmax)) {
858 /* no interchange, use 1-by-1 pivot block */
866 /* Loop until pivot found */
870 /* BEGIN pivot search loop body */
873 /* JMAX is the column-index of the largest off-diagonal */
874 /* element in row IMAX, and ROWMAX is its absolute value. */
875 /* Determine both ROWMAX and JMAX. */
879 jmax = imax + izamax_(&i__1, &a[imax + (imax + 1) *
881 i__1 = imax + jmax * a_dim1;
882 rowmax = (d__1 = a[i__1].r, abs(d__1)) + (d__2 = d_imag(&
883 a[imax + jmax * a_dim1]), abs(d__2));
890 itemp = izamax_(&i__1, &a[imax * a_dim1 + 1], &c__1);
891 i__1 = itemp + imax * a_dim1;
892 dtemp = (d__1 = a[i__1].r, abs(d__1)) + (d__2 = d_imag(&a[
893 itemp + imax * a_dim1]), abs(d__2));
894 if (dtemp > rowmax) {
901 /* Equivalent to testing for */
902 /* ABS( REAL( W( IMAX,KW-1 ) ) ).GE.ALPHA*ROWMAX */
903 /* (used to handle NaN and Inf) */
905 i__1 = imax + imax * a_dim1;
906 if (! ((d__1 = a[i__1].r, abs(d__1)) < alpha * rowmax)) {
908 /* interchange rows and columns K and IMAX, */
909 /* use 1-by-1 pivot block */
915 /* Equivalent to testing for ROWMAX.EQ.COLMAX, */
916 /* (used to handle NaN and Inf) */
918 } else if (p == jmax || rowmax <= colmax) {
920 /* interchange rows and columns K-1 and IMAX, */
921 /* use 2-by-2 pivot block */
930 /* Pivot not found: set params and repeat */
937 /* END pivot search loop body */
945 /* END pivot search */
947 /* ============================================================ */
949 /* KK is the column of A where pivoting step stopped */
953 /* For only a 2x2 pivot, interchange rows and columns K and P */
954 /* in the leading submatrix A(1:k,1:k) */
956 if (kstep == 2 && p != k) {
957 /* (1) Swap columnar parts */
960 zswap_(&i__1, &a[k * a_dim1 + 1], &c__1, &a[p * a_dim1 +
963 /* (2) Swap and conjugate middle parts */
965 for (j = p + 1; j <= i__1; ++j) {
966 d_cnjg(&z__1, &a[j + k * a_dim1]);
967 t.r = z__1.r, t.i = z__1.i;
968 i__2 = j + k * a_dim1;
969 d_cnjg(&z__1, &a[p + j * a_dim1]);
970 a[i__2].r = z__1.r, a[i__2].i = z__1.i;
971 i__2 = p + j * a_dim1;
972 a[i__2].r = t.r, a[i__2].i = t.i;
975 /* (3) Swap and conjugate corner elements at row-col interserction */
976 i__1 = p + k * a_dim1;
977 d_cnjg(&z__1, &a[p + k * a_dim1]);
978 a[i__1].r = z__1.r, a[i__1].i = z__1.i;
979 /* (4) Swap diagonal elements at row-col intersection */
980 i__1 = k + k * a_dim1;
982 i__1 = k + k * a_dim1;
983 i__2 = p + p * a_dim1;
985 a[i__1].r = d__1, a[i__1].i = 0.;
986 i__1 = p + p * a_dim1;
987 a[i__1].r = r1, a[i__1].i = 0.;
990 /* For both 1x1 and 2x2 pivots, interchange rows and */
991 /* columns KK and KP in the leading submatrix A(1:k,1:k) */
994 /* (1) Swap columnar parts */
997 zswap_(&i__1, &a[kk * a_dim1 + 1], &c__1, &a[kp * a_dim1
1000 /* (2) Swap and conjugate middle parts */
1002 for (j = kp + 1; j <= i__1; ++j) {
1003 d_cnjg(&z__1, &a[j + kk * a_dim1]);
1004 t.r = z__1.r, t.i = z__1.i;
1005 i__2 = j + kk * a_dim1;
1006 d_cnjg(&z__1, &a[kp + j * a_dim1]);
1007 a[i__2].r = z__1.r, a[i__2].i = z__1.i;
1008 i__2 = kp + j * a_dim1;
1009 a[i__2].r = t.r, a[i__2].i = t.i;
1012 /* (3) Swap and conjugate corner elements at row-col interserction */
1013 i__1 = kp + kk * a_dim1;
1014 d_cnjg(&z__1, &a[kp + kk * a_dim1]);
1015 a[i__1].r = z__1.r, a[i__1].i = z__1.i;
1016 /* (4) Swap diagonal elements at row-col intersection */
1017 i__1 = kk + kk * a_dim1;
1019 i__1 = kk + kk * a_dim1;
1020 i__2 = kp + kp * a_dim1;
1022 a[i__1].r = d__1, a[i__1].i = 0.;
1023 i__1 = kp + kp * a_dim1;
1024 a[i__1].r = r1, a[i__1].i = 0.;
1027 /* (*) Make sure that diagonal element of pivot is real */
1028 i__1 = k + k * a_dim1;
1029 i__2 = k + k * a_dim1;
1031 a[i__1].r = d__1, a[i__1].i = 0.;
1032 /* (5) Swap row elements */
1033 i__1 = k - 1 + k * a_dim1;
1034 t.r = a[i__1].r, t.i = a[i__1].i;
1035 i__1 = k - 1 + k * a_dim1;
1036 i__2 = kp + k * a_dim1;
1037 a[i__1].r = a[i__2].r, a[i__1].i = a[i__2].i;
1038 i__1 = kp + k * a_dim1;
1039 a[i__1].r = t.r, a[i__1].i = t.i;
1042 /* (*) Make sure that diagonal element of pivot is real */
1043 i__1 = k + k * a_dim1;
1044 i__2 = k + k * a_dim1;
1046 a[i__1].r = d__1, a[i__1].i = 0.;
1048 i__1 = k - 1 + (k - 1) * a_dim1;
1049 i__2 = k - 1 + (k - 1) * a_dim1;
1051 a[i__1].r = d__1, a[i__1].i = 0.;
1055 /* Update the leading submatrix */
1059 /* 1-by-1 pivot block D(k): column k now holds */
1061 /* W(k) = U(k)*D(k) */
1063 /* where U(k) is the k-th column of U */
1067 /* Perform a rank-1 update of A(1:k-1,1:k-1) and */
1068 /* store U(k) in column k */
1070 i__1 = k + k * a_dim1;
1071 if ((d__1 = a[i__1].r, abs(d__1)) >= sfmin) {
1073 /* Perform a rank-1 update of A(1:k-1,1:k-1) as */
1074 /* A := A - U(k)*D(k)*U(k)**T */
1075 /* = A - W(k)*1/D(k)*W(k)**T */
1077 i__1 = k + k * a_dim1;
1078 d11 = 1. / a[i__1].r;
1081 zher_(uplo, &i__1, &d__1, &a[k * a_dim1 + 1], &c__1, &
1084 /* Store U(k) in column k */
1087 zdscal_(&i__1, &d11, &a[k * a_dim1 + 1], &c__1);
1090 /* Store L(k) in column K */
1092 i__1 = k + k * a_dim1;
1095 for (ii = 1; ii <= i__1; ++ii) {
1096 i__2 = ii + k * a_dim1;
1097 i__3 = ii + k * a_dim1;
1098 z__1.r = a[i__3].r / d11, z__1.i = a[i__3].i /
1100 a[i__2].r = z__1.r, a[i__2].i = z__1.i;
1104 /* Perform a rank-1 update of A(k+1:n,k+1:n) as */
1105 /* A := A - U(k)*D(k)*U(k)**T */
1106 /* = A - W(k)*(1/D(k))*W(k)**T */
1107 /* = A - (W(k)/D(k))*(D(k))*(W(k)/D(K))**T */
1111 zher_(uplo, &i__1, &d__1, &a[k * a_dim1 + 1], &c__1, &
1118 /* 2-by-2 pivot block D(k): columns k and k-1 now hold */
1120 /* ( W(k-1) W(k) ) = ( U(k-1) U(k) )*D(k) */
1122 /* where U(k) and U(k-1) are the k-th and (k-1)-th columns */
1125 /* Perform a rank-2 update of A(1:k-2,1:k-2) as */
1127 /* A := A - ( U(k-1) U(k) )*D(k)*( U(k-1) U(k) )**T */
1128 /* = A - ( ( A(k-1)A(k) )*inv(D(k)) ) * ( A(k-1)A(k) )**T */
1130 /* and store L(k) and L(k+1) in columns k and k+1 */
1134 i__1 = k - 1 + k * a_dim1;
1136 d__2 = d_imag(&a[k - 1 + k * a_dim1]);
1137 d__ = dlapy2_(&d__1, &d__2);
1138 i__1 = k + k * a_dim1;
1139 z__1.r = a[i__1].r / d__, z__1.i = a[i__1].i / d__;
1141 i__1 = k - 1 + (k - 1) * a_dim1;
1142 z__1.r = a[i__1].r / d__, z__1.i = a[i__1].i / d__;
1144 i__1 = k - 1 + k * a_dim1;
1145 z__1.r = a[i__1].r / d__, z__1.i = a[i__1].i / d__;
1146 d12.r = z__1.r, d12.i = z__1.i;
1147 tt = 1. / (d11 * d22 - 1.);
1149 for (j = k - 2; j >= 1; --j) {
1151 /* Compute D21 * ( W(k)W(k+1) ) * inv(D(k)) for row J */
1153 i__1 = j + (k - 1) * a_dim1;
1154 z__3.r = d11 * a[i__1].r, z__3.i = d11 * a[i__1].i;
1155 d_cnjg(&z__5, &d12);
1156 i__2 = j + k * a_dim1;
1157 z__4.r = z__5.r * a[i__2].r - z__5.i * a[i__2].i,
1158 z__4.i = z__5.r * a[i__2].i + z__5.i * a[i__2]
1160 z__2.r = z__3.r - z__4.r, z__2.i = z__3.i - z__4.i;
1161 z__1.r = tt * z__2.r, z__1.i = tt * z__2.i;
1162 wkm1.r = z__1.r, wkm1.i = z__1.i;
1163 i__1 = j + k * a_dim1;
1164 z__3.r = d22 * a[i__1].r, z__3.i = d22 * a[i__1].i;
1165 i__2 = j + (k - 1) * a_dim1;
1166 z__4.r = d12.r * a[i__2].r - d12.i * a[i__2].i,
1167 z__4.i = d12.r * a[i__2].i + d12.i * a[i__2]
1169 z__2.r = z__3.r - z__4.r, z__2.i = z__3.i - z__4.i;
1170 z__1.r = tt * z__2.r, z__1.i = tt * z__2.i;
1171 wk.r = z__1.r, wk.i = z__1.i;
1173 /* Perform a rank-2 update of A(1:k-2,1:k-2) */
1175 for (i__ = j; i__ >= 1; --i__) {
1176 i__1 = i__ + j * a_dim1;
1177 i__2 = i__ + j * a_dim1;
1178 i__3 = i__ + k * a_dim1;
1179 z__4.r = a[i__3].r / d__, z__4.i = a[i__3].i /
1182 z__3.r = z__4.r * z__5.r - z__4.i * z__5.i,
1183 z__3.i = z__4.r * z__5.i + z__4.i *
1185 z__2.r = a[i__2].r - z__3.r, z__2.i = a[i__2].i -
1187 i__4 = i__ + (k - 1) * a_dim1;
1188 z__7.r = a[i__4].r / d__, z__7.i = a[i__4].i /
1190 d_cnjg(&z__8, &wkm1);
1191 z__6.r = z__7.r * z__8.r - z__7.i * z__8.i,
1192 z__6.i = z__7.r * z__8.i + z__7.i *
1194 z__1.r = z__2.r - z__6.r, z__1.i = z__2.i -
1196 a[i__1].r = z__1.r, a[i__1].i = z__1.i;
1200 /* Store U(k) and U(k-1) in cols k and k-1 for row J */
1202 i__1 = j + k * a_dim1;
1203 z__1.r = wk.r / d__, z__1.i = wk.i / d__;
1204 a[i__1].r = z__1.r, a[i__1].i = z__1.i;
1205 i__1 = j + (k - 1) * a_dim1;
1206 z__1.r = wkm1.r / d__, z__1.i = wkm1.i / d__;
1207 a[i__1].r = z__1.r, a[i__1].i = z__1.i;
1208 /* (*) Make sure that diagonal element of pivot is real */
1209 i__1 = j + j * a_dim1;
1210 i__2 = j + j * a_dim1;
1212 z__1.r = d__1, z__1.i = 0.;
1213 a[i__1].r = z__1.r, a[i__1].i = z__1.i;
1224 /* Store details of the interchanges in IPIV */
1233 /* Decrease K and return to the start of the main loop */
1240 /* Factorize A as L*D*L**H using the lower triangle of A */
1242 /* K is the main loop index, increasing from 1 to N in steps of */
1248 /* If K > N, exit from loop */
1256 /* Determine rows and columns to be interchanged and whether */
1257 /* a 1-by-1 or 2-by-2 pivot block will be used */
1259 i__1 = k + k * a_dim1;
1260 absakk = (d__1 = a[i__1].r, abs(d__1));
1262 /* IMAX is the row-index of the largest off-diagonal element in */
1263 /* column K, and COLMAX is its absolute value. */
1264 /* Determine both COLMAX and IMAX. */
1268 imax = k + izamax_(&i__1, &a[k + 1 + k * a_dim1], &c__1);
1269 i__1 = imax + k * a_dim1;
1270 colmax = (d__1 = a[i__1].r, abs(d__1)) + (d__2 = d_imag(&a[imax +
1271 k * a_dim1]), abs(d__2));
1276 if (f2cmax(absakk,colmax) == 0.) {
1278 /* Column K is zero or underflow: set INFO and continue */
1284 i__1 = k + k * a_dim1;
1285 i__2 = k + k * a_dim1;
1287 a[i__1].r = d__1, a[i__1].i = 0.;
1290 /* ============================================================ */
1292 /* BEGIN pivot search */
1295 /* Equivalent to testing for ABSAKK.GE.ALPHA*COLMAX */
1296 /* (used to handle NaN and Inf) */
1298 if (! (absakk < alpha * colmax)) {
1300 /* no interchange, use 1-by-1 pivot block */
1308 /* Loop until pivot found */
1312 /* BEGIN pivot search loop body */
1315 /* JMAX is the column-index of the largest off-diagonal */
1316 /* element in row IMAX, and ROWMAX is its absolute value. */
1317 /* Determine both ROWMAX and JMAX. */
1321 jmax = k - 1 + izamax_(&i__1, &a[imax + k * a_dim1], lda);
1322 i__1 = imax + jmax * a_dim1;
1323 rowmax = (d__1 = a[i__1].r, abs(d__1)) + (d__2 = d_imag(&
1324 a[imax + jmax * a_dim1]), abs(d__2));
1331 itemp = imax + izamax_(&i__1, &a[imax + 1 + imax * a_dim1]
1333 i__1 = itemp + imax * a_dim1;
1334 dtemp = (d__1 = a[i__1].r, abs(d__1)) + (d__2 = d_imag(&a[
1335 itemp + imax * a_dim1]), abs(d__2));
1336 if (dtemp > rowmax) {
1343 /* Equivalent to testing for */
1344 /* ABS( REAL( W( IMAX,KW-1 ) ) ).GE.ALPHA*ROWMAX */
1345 /* (used to handle NaN and Inf) */
1347 i__1 = imax + imax * a_dim1;
1348 if (! ((d__1 = a[i__1].r, abs(d__1)) < alpha * rowmax)) {
1350 /* interchange rows and columns K and IMAX, */
1351 /* use 1-by-1 pivot block */
1357 /* Equivalent to testing for ROWMAX.EQ.COLMAX, */
1358 /* (used to handle NaN and Inf) */
1360 } else if (p == jmax || rowmax <= colmax) {
1362 /* interchange rows and columns K+1 and IMAX, */
1363 /* use 2-by-2 pivot block */
1372 /* Pivot not found: set params and repeat */
1380 /* END pivot search loop body */
1388 /* END pivot search */
1390 /* ============================================================ */
1392 /* KK is the column of A where pivoting step stopped */
1396 /* For only a 2x2 pivot, interchange rows and columns K and P */
1397 /* in the trailing submatrix A(k:n,k:n) */
1399 if (kstep == 2 && p != k) {
1400 /* (1) Swap columnar parts */
1403 zswap_(&i__1, &a[p + 1 + k * a_dim1], &c__1, &a[p + 1 + p
1406 /* (2) Swap and conjugate middle parts */
1408 for (j = k + 1; j <= i__1; ++j) {
1409 d_cnjg(&z__1, &a[j + k * a_dim1]);
1410 t.r = z__1.r, t.i = z__1.i;
1411 i__2 = j + k * a_dim1;
1412 d_cnjg(&z__1, &a[p + j * a_dim1]);
1413 a[i__2].r = z__1.r, a[i__2].i = z__1.i;
1414 i__2 = p + j * a_dim1;
1415 a[i__2].r = t.r, a[i__2].i = t.i;
1418 /* (3) Swap and conjugate corner elements at row-col interserction */
1419 i__1 = p + k * a_dim1;
1420 d_cnjg(&z__1, &a[p + k * a_dim1]);
1421 a[i__1].r = z__1.r, a[i__1].i = z__1.i;
1422 /* (4) Swap diagonal elements at row-col intersection */
1423 i__1 = k + k * a_dim1;
1425 i__1 = k + k * a_dim1;
1426 i__2 = p + p * a_dim1;
1428 a[i__1].r = d__1, a[i__1].i = 0.;
1429 i__1 = p + p * a_dim1;
1430 a[i__1].r = r1, a[i__1].i = 0.;
1433 /* For both 1x1 and 2x2 pivots, interchange rows and */
1434 /* columns KK and KP in the trailing submatrix A(k:n,k:n) */
1437 /* (1) Swap columnar parts */
1440 zswap_(&i__1, &a[kp + 1 + kk * a_dim1], &c__1, &a[kp + 1
1441 + kp * a_dim1], &c__1);
1443 /* (2) Swap and conjugate middle parts */
1445 for (j = kk + 1; j <= i__1; ++j) {
1446 d_cnjg(&z__1, &a[j + kk * a_dim1]);
1447 t.r = z__1.r, t.i = z__1.i;
1448 i__2 = j + kk * a_dim1;
1449 d_cnjg(&z__1, &a[kp + j * a_dim1]);
1450 a[i__2].r = z__1.r, a[i__2].i = z__1.i;
1451 i__2 = kp + j * a_dim1;
1452 a[i__2].r = t.r, a[i__2].i = t.i;
1455 /* (3) Swap and conjugate corner elements at row-col interserction */
1456 i__1 = kp + kk * a_dim1;
1457 d_cnjg(&z__1, &a[kp + kk * a_dim1]);
1458 a[i__1].r = z__1.r, a[i__1].i = z__1.i;
1459 /* (4) Swap diagonal elements at row-col intersection */
1460 i__1 = kk + kk * a_dim1;
1462 i__1 = kk + kk * a_dim1;
1463 i__2 = kp + kp * a_dim1;
1465 a[i__1].r = d__1, a[i__1].i = 0.;
1466 i__1 = kp + kp * a_dim1;
1467 a[i__1].r = r1, a[i__1].i = 0.;
1470 /* (*) Make sure that diagonal element of pivot is real */
1471 i__1 = k + k * a_dim1;
1472 i__2 = k + k * a_dim1;
1474 a[i__1].r = d__1, a[i__1].i = 0.;
1475 /* (5) Swap row elements */
1476 i__1 = k + 1 + k * a_dim1;
1477 t.r = a[i__1].r, t.i = a[i__1].i;
1478 i__1 = k + 1 + k * a_dim1;
1479 i__2 = kp + k * a_dim1;
1480 a[i__1].r = a[i__2].r, a[i__1].i = a[i__2].i;
1481 i__1 = kp + k * a_dim1;
1482 a[i__1].r = t.r, a[i__1].i = t.i;
1485 /* (*) Make sure that diagonal element of pivot is real */
1486 i__1 = k + k * a_dim1;
1487 i__2 = k + k * a_dim1;
1489 a[i__1].r = d__1, a[i__1].i = 0.;
1491 i__1 = k + 1 + (k + 1) * a_dim1;
1492 i__2 = k + 1 + (k + 1) * a_dim1;
1494 a[i__1].r = d__1, a[i__1].i = 0.;
1498 /* Update the trailing submatrix */
1502 /* 1-by-1 pivot block D(k): column k of A now holds */
1504 /* W(k) = L(k)*D(k), */
1506 /* where L(k) is the k-th column of L */
1510 /* Perform a rank-1 update of A(k+1:n,k+1:n) and */
1511 /* store L(k) in column k */
1513 /* Handle division by a small number */
1515 i__1 = k + k * a_dim1;
1516 if ((d__1 = a[i__1].r, abs(d__1)) >= sfmin) {
1518 /* Perform a rank-1 update of A(k+1:n,k+1:n) as */
1519 /* A := A - L(k)*D(k)*L(k)**T */
1520 /* = A - W(k)*(1/D(k))*W(k)**T */
1522 i__1 = k + k * a_dim1;
1523 d11 = 1. / a[i__1].r;
1526 zher_(uplo, &i__1, &d__1, &a[k + 1 + k * a_dim1], &
1527 c__1, &a[k + 1 + (k + 1) * a_dim1], lda);
1529 /* Store L(k) in column k */
1532 zdscal_(&i__1, &d11, &a[k + 1 + k * a_dim1], &c__1);
1535 /* Store L(k) in column k */
1537 i__1 = k + k * a_dim1;
1540 for (ii = k + 1; ii <= i__1; ++ii) {
1541 i__2 = ii + k * a_dim1;
1542 i__3 = ii + k * a_dim1;
1543 z__1.r = a[i__3].r / d11, z__1.i = a[i__3].i /
1545 a[i__2].r = z__1.r, a[i__2].i = z__1.i;
1549 /* Perform a rank-1 update of A(k+1:n,k+1:n) as */
1550 /* A := A - L(k)*D(k)*L(k)**T */
1551 /* = A - W(k)*(1/D(k))*W(k)**T */
1552 /* = A - (W(k)/D(k))*(D(k))*(W(k)/D(K))**T */
1556 zher_(uplo, &i__1, &d__1, &a[k + 1 + k * a_dim1], &
1557 c__1, &a[k + 1 + (k + 1) * a_dim1], lda);
1563 /* 2-by-2 pivot block D(k): columns k and k+1 now hold */
1565 /* ( W(k) W(k+1) ) = ( L(k) L(k+1) )*D(k) */
1567 /* where L(k) and L(k+1) are the k-th and (k+1)-th columns */
1571 /* Perform a rank-2 update of A(k+2:n,k+2:n) as */
1573 /* A := A - ( L(k) L(k+1) ) * D(k) * ( L(k) L(k+1) )**T */
1574 /* = A - ( ( A(k)A(k+1) )*inv(D(k) ) * ( A(k)A(k+1) )**T */
1576 /* and store L(k) and L(k+1) in columns k and k+1 */
1580 i__1 = k + 1 + k * a_dim1;
1582 d__2 = d_imag(&a[k + 1 + k * a_dim1]);
1583 d__ = dlapy2_(&d__1, &d__2);
1584 i__1 = k + 1 + (k + 1) * a_dim1;
1585 d11 = a[i__1].r / d__;
1586 i__1 = k + k * a_dim1;
1587 d22 = a[i__1].r / d__;
1588 i__1 = k + 1 + k * a_dim1;
1589 z__1.r = a[i__1].r / d__, z__1.i = a[i__1].i / d__;
1590 d21.r = z__1.r, d21.i = z__1.i;
1591 tt = 1. / (d11 * d22 - 1.);
1594 for (j = k + 2; j <= i__1; ++j) {
1596 /* Compute D21 * ( W(k)W(k+1) ) * inv(D(k)) for row J */
1598 i__2 = j + k * a_dim1;
1599 z__3.r = d11 * a[i__2].r, z__3.i = d11 * a[i__2].i;
1600 i__3 = j + (k + 1) * a_dim1;
1601 z__4.r = d21.r * a[i__3].r - d21.i * a[i__3].i,
1602 z__4.i = d21.r * a[i__3].i + d21.i * a[i__3]
1604 z__2.r = z__3.r - z__4.r, z__2.i = z__3.i - z__4.i;
1605 z__1.r = tt * z__2.r, z__1.i = tt * z__2.i;
1606 wk.r = z__1.r, wk.i = z__1.i;
1607 i__2 = j + (k + 1) * a_dim1;
1608 z__3.r = d22 * a[i__2].r, z__3.i = d22 * a[i__2].i;
1609 d_cnjg(&z__5, &d21);
1610 i__3 = j + k * a_dim1;
1611 z__4.r = z__5.r * a[i__3].r - z__5.i * a[i__3].i,
1612 z__4.i = z__5.r * a[i__3].i + z__5.i * a[i__3]
1614 z__2.r = z__3.r - z__4.r, z__2.i = z__3.i - z__4.i;
1615 z__1.r = tt * z__2.r, z__1.i = tt * z__2.i;
1616 wkp1.r = z__1.r, wkp1.i = z__1.i;
1618 /* Perform a rank-2 update of A(k+2:n,k+2:n) */
1621 for (i__ = j; i__ <= i__2; ++i__) {
1622 i__3 = i__ + j * a_dim1;
1623 i__4 = i__ + j * a_dim1;
1624 i__5 = i__ + k * a_dim1;
1625 z__4.r = a[i__5].r / d__, z__4.i = a[i__5].i /
1628 z__3.r = z__4.r * z__5.r - z__4.i * z__5.i,
1629 z__3.i = z__4.r * z__5.i + z__4.i *
1631 z__2.r = a[i__4].r - z__3.r, z__2.i = a[i__4].i -
1633 i__6 = i__ + (k + 1) * a_dim1;
1634 z__7.r = a[i__6].r / d__, z__7.i = a[i__6].i /
1636 d_cnjg(&z__8, &wkp1);
1637 z__6.r = z__7.r * z__8.r - z__7.i * z__8.i,
1638 z__6.i = z__7.r * z__8.i + z__7.i *
1640 z__1.r = z__2.r - z__6.r, z__1.i = z__2.i -
1642 a[i__3].r = z__1.r, a[i__3].i = z__1.i;
1646 /* Store L(k) and L(k+1) in cols k and k+1 for row J */
1648 i__2 = j + k * a_dim1;
1649 z__1.r = wk.r / d__, z__1.i = wk.i / d__;
1650 a[i__2].r = z__1.r, a[i__2].i = z__1.i;
1651 i__2 = j + (k + 1) * a_dim1;
1652 z__1.r = wkp1.r / d__, z__1.i = wkp1.i / d__;
1653 a[i__2].r = z__1.r, a[i__2].i = z__1.i;
1654 /* (*) Make sure that diagonal element of pivot is real */
1655 i__2 = j + j * a_dim1;
1656 i__3 = j + j * a_dim1;
1658 z__1.r = d__1, z__1.i = 0.;
1659 a[i__2].r = z__1.r, a[i__2].i = z__1.i;
1670 /* Store details of the interchanges in IPIV */
1679 /* Increase K and return to the start of the main loop */
1690 /* End of ZHETF2_ROOK */
1692 } /* zhetf2_rook__ */