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)
514 /* Table of constant values */
516 static complex c_b1 = {1.f,0.f};
517 static integer c__1 = 1;
518 static integer c_n1 = -1;
519 static real c_b32 = -1.f;
520 static real c_b33 = 1.f;
522 /* > \brief \b CPSTRF computes the Cholesky factorization with complete pivoting of complex Hermitian positive
523 semidefinite matrix. */
525 /* =========== DOCUMENTATION =========== */
527 /* Online html documentation available at */
528 /* http://www.netlib.org/lapack/explore-html/ */
531 /* > Download CPSTRF + dependencies */
532 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/cpstrf.
535 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/cpstrf.
538 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/cpstrf.
546 /* SUBROUTINE CPSTRF( UPLO, N, A, LDA, PIV, RANK, TOL, WORK, INFO ) */
549 /* INTEGER INFO, LDA, N, RANK */
551 /* COMPLEX A( LDA, * ) */
552 /* REAL WORK( 2*N ) */
553 /* INTEGER PIV( N ) */
556 /* > \par Purpose: */
561 /* > CPSTRF computes the Cholesky factorization with complete */
562 /* > pivoting of a complex Hermitian positive semidefinite matrix A. */
564 /* > The factorization has the form */
565 /* > P**T * A * P = U**H * U , if UPLO = 'U', */
566 /* > P**T * A * P = L * L**H, if UPLO = 'L', */
567 /* > where U is an upper triangular matrix and L is lower triangular, and */
568 /* > P is stored as vector PIV. */
570 /* > This algorithm does not attempt to check that A is positive */
571 /* > semidefinite. This version of the algorithm calls level 3 BLAS. */
577 /* > \param[in] UPLO */
579 /* > UPLO is CHARACTER*1 */
580 /* > Specifies whether the upper or lower triangular part of the */
581 /* > symmetric matrix A is stored. */
582 /* > = 'U': Upper triangular */
583 /* > = 'L': Lower triangular */
589 /* > The order of the matrix A. N >= 0. */
592 /* > \param[in,out] A */
594 /* > A is COMPLEX array, dimension (LDA,N) */
595 /* > On entry, the symmetric matrix A. If UPLO = 'U', the leading */
596 /* > n by n upper triangular part of A contains the upper */
597 /* > triangular part of the matrix A, and the strictly lower */
598 /* > triangular part of A is not referenced. If UPLO = 'L', the */
599 /* > leading n by n lower triangular part of A contains the lower */
600 /* > triangular part of the matrix A, and the strictly upper */
601 /* > triangular part of A is not referenced. */
603 /* > On exit, if INFO = 0, the factor U or L from the Cholesky */
604 /* > factorization as above. */
607 /* > \param[in] LDA */
609 /* > LDA is INTEGER */
610 /* > The leading dimension of the array A. LDA >= f2cmax(1,N). */
613 /* > \param[out] PIV */
615 /* > PIV is INTEGER array, dimension (N) */
616 /* > PIV is such that the nonzero entries are P( PIV(K), K ) = 1. */
619 /* > \param[out] RANK */
621 /* > RANK is INTEGER */
622 /* > The rank of A given by the number of steps the algorithm */
626 /* > \param[in] TOL */
629 /* > User defined tolerance. If TOL < 0, then N*U*MAX( A(K,K) ) */
630 /* > will be used. The algorithm terminates at the (K-1)st step */
631 /* > if the pivot <= TOL. */
634 /* > \param[out] WORK */
636 /* > WORK is REAL array, dimension (2*N) */
640 /* > \param[out] INFO */
642 /* > INFO is INTEGER */
643 /* > < 0: If INFO = -K, the K-th argument had an illegal value, */
644 /* > = 0: algorithm completed successfully, and */
645 /* > > 0: the matrix A is either rank deficient with computed rank */
646 /* > as returned in RANK, or is not positive semidefinite. See */
647 /* > Section 7 of LAPACK Working Note #161 for further */
654 /* > \author Univ. of Tennessee */
655 /* > \author Univ. of California Berkeley */
656 /* > \author Univ. of Colorado Denver */
657 /* > \author NAG Ltd. */
659 /* > \date December 2016 */
661 /* > \ingroup complexOTHERcomputational */
663 /* ===================================================================== */
664 /* Subroutine */ int cpstrf_(char *uplo, integer *n, complex *a, integer *lda,
665 integer *piv, integer *rank, real *tol, real *work, integer *info)
667 /* System generated locals */
668 integer a_dim1, a_offset, i__1, i__2, i__3, i__4, i__5;
672 /* Local variables */
675 extern /* Subroutine */ int cherk_(char *, char *, integer *, integer *,
676 real *, complex *, integer *, real *, complex *, integer *);
677 extern logical lsame_(char *, char *);
678 extern /* Subroutine */ int cgemv_(char *, integer *, integer *, complex *
679 , complex *, integer *, complex *, integer *, complex *, complex *
682 extern /* Subroutine */ int cswap_(integer *, complex *, integer *,
683 complex *, integer *);
688 extern /* Subroutine */ int cpstf2_(char *, integer *, complex *, integer
689 *, integer *, integer *, real *, real *, integer *);
691 extern /* Subroutine */ int clacgv_(integer *, complex *, integer *);
692 extern real slamch_(char *);
693 extern /* Subroutine */ int csscal_(integer *, real *, complex *, integer
694 *), xerbla_(char *, integer *, ftnlen);
695 extern integer ilaenv_(integer *, char *, char *, integer *, integer *,
696 integer *, integer *, ftnlen, ftnlen);
697 extern logical sisnan_(real *);
702 /* -- LAPACK computational routine (version 3.7.0) -- */
703 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
704 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
708 /* ===================================================================== */
711 /* Test the input parameters. */
713 /* Parameter adjustments */
717 a_offset = 1 + a_dim1 * 1;
722 upper = lsame_(uplo, "U");
723 if (! upper && ! lsame_(uplo, "L")) {
727 } else if (*lda < f2cmax(1,*n)) {
732 xerbla_("CPSTRF", &i__1, (ftnlen)6);
736 /* Quick return if possible */
744 nb = ilaenv_(&c__1, "CPOTRF", uplo, n, &c_n1, &c_n1, &c_n1, (ftnlen)6, (
746 if (nb <= 1 || nb >= *n) {
748 /* Use unblocked code */
750 cpstf2_(uplo, n, &a[a_dim1 + 1], lda, &piv[1], rank, tol, &work[1],
759 for (i__ = 1; i__ <= i__1; ++i__) {
764 /* Compute stopping value */
767 for (i__ = 1; i__ <= i__1; ++i__) {
768 i__2 = i__ + i__ * a_dim1;
769 work[i__] = a[i__2].r;
772 pvt = mymaxloc_(&work[1], &c__1, n, &c__1);
773 i__1 = pvt + pvt * a_dim1;
775 if (ajj <= 0.f || sisnan_(&ajj)) {
781 /* Compute stopping value if not supplied */
784 sstop = *n * slamch_("Epsilon") * ajj;
792 /* Compute the Cholesky factorization P**T * A * P = U**H * U */
796 for (k = 1; i__2 < 0 ? k >= i__1 : k <= i__1; k += i__2) {
798 /* Account for last block not being NB wide */
801 i__3 = nb, i__4 = *n - k + 1;
802 jb = f2cmin(i__3,i__4);
804 /* Set relevant part of first half of WORK to zero, */
805 /* holds dot products */
808 for (i__ = k; i__ <= i__3; ++i__) {
814 for (j = k; j <= i__3; ++j) {
816 /* Find pivot, test for exit, else swap rows and columns */
817 /* Update dot products, compute possible pivots which are */
818 /* stored in the second half of WORK */
821 for (i__ = j; i__ <= i__4; ++i__) {
824 r_cnjg(&q__2, &a[j - 1 + i__ * a_dim1]);
825 i__5 = j - 1 + i__ * a_dim1;
826 q__1.r = q__2.r * a[i__5].r - q__2.i * a[i__5].i,
827 q__1.i = q__2.r * a[i__5].i + q__2.i * a[
831 i__5 = i__ + i__ * a_dim1;
832 work[*n + i__] = a[i__5].r - work[i__];
840 itemp = mymaxloc_(&work[1], &i__4, &i__5, &c__1);
842 ajj = work[*n + pvt];
843 if (ajj <= sstop || sisnan_(&ajj)) {
844 i__4 = j + j * a_dim1;
845 a[i__4].r = ajj, a[i__4].i = 0.f;
852 /* Pivot OK, so can now swap pivot rows and columns */
854 i__4 = pvt + pvt * a_dim1;
855 i__5 = j + j * a_dim1;
856 a[i__4].r = a[i__5].r, a[i__4].i = a[i__5].i;
858 cswap_(&i__4, &a[j * a_dim1 + 1], &c__1, &a[pvt *
862 cswap_(&i__4, &a[j + (pvt + 1) * a_dim1], lda, &a[
863 pvt + (pvt + 1) * a_dim1], lda);
866 for (i__ = j + 1; i__ <= i__4; ++i__) {
867 r_cnjg(&q__1, &a[j + i__ * a_dim1]);
868 ctemp.r = q__1.r, ctemp.i = q__1.i;
869 i__5 = j + i__ * a_dim1;
870 r_cnjg(&q__1, &a[i__ + pvt * a_dim1]);
871 a[i__5].r = q__1.r, a[i__5].i = q__1.i;
872 i__5 = i__ + pvt * a_dim1;
873 a[i__5].r = ctemp.r, a[i__5].i = ctemp.i;
876 i__4 = j + pvt * a_dim1;
877 r_cnjg(&q__1, &a[j + pvt * a_dim1]);
878 a[i__4].r = q__1.r, a[i__4].i = q__1.i;
880 /* Swap dot products and PIV */
891 i__4 = j + j * a_dim1;
892 a[i__4].r = ajj, a[i__4].i = 0.f;
894 /* Compute elements J+1:N of row J. */
898 clacgv_(&i__4, &a[j * a_dim1 + 1], &c__1);
901 q__1.r = -1.f, q__1.i = 0.f;
902 cgemv_("Trans", &i__4, &i__5, &q__1, &a[k + (j + 1) *
903 a_dim1], lda, &a[k + j * a_dim1], &c__1, &
904 c_b1, &a[j + (j + 1) * a_dim1], lda);
906 clacgv_(&i__4, &a[j * a_dim1 + 1], &c__1);
909 csscal_(&i__4, &r__1, &a[j + (j + 1) * a_dim1], lda);
915 /* Update trailing matrix, J already incremented */
919 cherk_("Upper", "Conj Trans", &i__3, &jb, &c_b32, &a[k +
920 j * a_dim1], lda, &c_b33, &a[j + j * a_dim1], lda);
928 /* Compute the Cholesky factorization P**T * A * P = L * L**H */
932 for (k = 1; i__1 < 0 ? k >= i__2 : k <= i__2; k += i__1) {
934 /* Account for last block not being NB wide */
937 i__3 = nb, i__4 = *n - k + 1;
938 jb = f2cmin(i__3,i__4);
940 /* Set relevant part of first half of WORK to zero, */
941 /* holds dot products */
944 for (i__ = k; i__ <= i__3; ++i__) {
950 for (j = k; j <= i__3; ++j) {
952 /* Find pivot, test for exit, else swap rows and columns */
953 /* Update dot products, compute possible pivots which are */
954 /* stored in the second half of WORK */
957 for (i__ = j; i__ <= i__4; ++i__) {
960 r_cnjg(&q__2, &a[i__ + (j - 1) * a_dim1]);
961 i__5 = i__ + (j - 1) * a_dim1;
962 q__1.r = q__2.r * a[i__5].r - q__2.i * a[i__5].i,
963 q__1.i = q__2.r * a[i__5].i + q__2.i * a[
967 i__5 = i__ + i__ * a_dim1;
968 work[*n + i__] = a[i__5].r - work[i__];
976 itemp = mymaxloc_(&work[1], &i__4, &i__5, &c__1);
978 ajj = work[*n + pvt];
979 if (ajj <= sstop || sisnan_(&ajj)) {
980 i__4 = j + j * a_dim1;
981 a[i__4].r = ajj, a[i__4].i = 0.f;
988 /* Pivot OK, so can now swap pivot rows and columns */
990 i__4 = pvt + pvt * a_dim1;
991 i__5 = j + j * a_dim1;
992 a[i__4].r = a[i__5].r, a[i__4].i = a[i__5].i;
994 cswap_(&i__4, &a[j + a_dim1], lda, &a[pvt + a_dim1],
998 cswap_(&i__4, &a[pvt + 1 + j * a_dim1], &c__1, &a[
999 pvt + 1 + pvt * a_dim1], &c__1);
1002 for (i__ = j + 1; i__ <= i__4; ++i__) {
1003 r_cnjg(&q__1, &a[i__ + j * a_dim1]);
1004 ctemp.r = q__1.r, ctemp.i = q__1.i;
1005 i__5 = i__ + j * a_dim1;
1006 r_cnjg(&q__1, &a[pvt + i__ * a_dim1]);
1007 a[i__5].r = q__1.r, a[i__5].i = q__1.i;
1008 i__5 = pvt + i__ * a_dim1;
1009 a[i__5].r = ctemp.r, a[i__5].i = ctemp.i;
1012 i__4 = pvt + j * a_dim1;
1013 r_cnjg(&q__1, &a[pvt + j * a_dim1]);
1014 a[i__4].r = q__1.r, a[i__4].i = q__1.i;
1016 /* Swap dot products and PIV */
1019 work[j] = work[pvt];
1027 i__4 = j + j * a_dim1;
1028 a[i__4].r = ajj, a[i__4].i = 0.f;
1030 /* Compute elements J+1:N of column J. */
1034 clacgv_(&i__4, &a[j + a_dim1], lda);
1037 q__1.r = -1.f, q__1.i = 0.f;
1038 cgemv_("No Trans", &i__4, &i__5, &q__1, &a[j + 1 + k *
1039 a_dim1], lda, &a[j + k * a_dim1], lda, &c_b1,
1040 &a[j + 1 + j * a_dim1], &c__1);
1042 clacgv_(&i__4, &a[j + a_dim1], lda);
1045 csscal_(&i__4, &r__1, &a[j + 1 + j * a_dim1], &c__1);
1051 /* Update trailing matrix, J already incremented */
1055 cherk_("Lower", "No Trans", &i__3, &jb, &c_b32, &a[j + k *
1056 a_dim1], lda, &c_b33, &a[j + j * a_dim1], lda);
1065 /* Ran to completion, A has full rank */
1072 /* Rank is the number of steps completed. Set INFO = 1 to signal */
1073 /* that the factorization cannot be used to solve a system. */