14 typedef long long BLASLONG;
15 typedef unsigned long long BLASULONG;
17 typedef long BLASLONG;
18 typedef unsigned long BLASULONG;
22 typedef BLASLONG blasint;
24 #define blasabs(x) llabs(x)
26 #define blasabs(x) labs(x)
30 #define blasabs(x) abs(x)
33 typedef blasint integer;
35 typedef unsigned int uinteger;
36 typedef char *address;
37 typedef short int shortint;
39 typedef double doublereal;
40 typedef struct { real r, i; } complex;
41 typedef struct { doublereal r, i; } doublecomplex;
43 static inline _Fcomplex Cf(complex *z) {_Fcomplex zz={z->r , z->i}; return zz;}
44 static inline _Dcomplex Cd(doublecomplex *z) {_Dcomplex zz={z->r , z->i};return zz;}
45 static inline _Fcomplex * _pCf(complex *z) {return (_Fcomplex*)z;}
46 static inline _Dcomplex * _pCd(doublecomplex *z) {return (_Dcomplex*)z;}
48 static inline _Complex float Cf(complex *z) {return z->r + z->i*_Complex_I;}
49 static inline _Complex double Cd(doublecomplex *z) {return z->r + z->i*_Complex_I;}
50 static inline _Complex float * _pCf(complex *z) {return (_Complex float*)z;}
51 static inline _Complex double * _pCd(doublecomplex *z) {return (_Complex double*)z;}
53 #define pCf(z) (*_pCf(z))
54 #define pCd(z) (*_pCd(z))
56 typedef short int shortlogical;
57 typedef char logical1;
58 typedef char integer1;
63 /* Extern is for use with -E */
74 /*external read, write*/
83 /*internal read, write*/
113 /*rewind, backspace, endfile*/
125 ftnint *inex; /*parameters in standard's order*/
151 union Multitype { /* for multiple entry points */
162 typedef union Multitype Multitype;
164 struct Vardesc { /* for Namelist */
170 typedef struct Vardesc Vardesc;
177 typedef struct Namelist Namelist;
179 #define abs(x) ((x) >= 0 ? (x) : -(x))
180 #define dabs(x) (fabs(x))
181 #define f2cmin(a,b) ((a) <= (b) ? (a) : (b))
182 #define f2cmax(a,b) ((a) >= (b) ? (a) : (b))
183 #define dmin(a,b) (f2cmin(a,b))
184 #define dmax(a,b) (f2cmax(a,b))
185 #define bit_test(a,b) ((a) >> (b) & 1)
186 #define bit_clear(a,b) ((a) & ~((uinteger)1 << (b)))
187 #define bit_set(a,b) ((a) | ((uinteger)1 << (b)))
189 #define abort_() { sig_die("Fortran abort routine called", 1); }
190 #define c_abs(z) (cabsf(Cf(z)))
191 #define c_cos(R,Z) { pCf(R)=ccos(Cf(Z)); }
193 #define c_div(c, a, b) {Cf(c)._Val[0] = (Cf(a)._Val[0]/Cf(b)._Val[0]); Cf(c)._Val[1]=(Cf(a)._Val[1]/Cf(b)._Val[1]);}
194 #define z_div(c, a, b) {Cd(c)._Val[0] = (Cd(a)._Val[0]/Cd(b)._Val[0]); Cd(c)._Val[1]=(Cd(a)._Val[1]/df(b)._Val[1]);}
196 #define c_div(c, a, b) {pCf(c) = Cf(a)/Cf(b);}
197 #define z_div(c, a, b) {pCd(c) = Cd(a)/Cd(b);}
199 #define c_exp(R, Z) {pCf(R) = cexpf(Cf(Z));}
200 #define c_log(R, Z) {pCf(R) = clogf(Cf(Z));}
201 #define c_sin(R, Z) {pCf(R) = csinf(Cf(Z));}
202 //#define c_sqrt(R, Z) {*(R) = csqrtf(Cf(Z));}
203 #define c_sqrt(R, Z) {pCf(R) = csqrtf(Cf(Z));}
204 #define d_abs(x) (fabs(*(x)))
205 #define d_acos(x) (acos(*(x)))
206 #define d_asin(x) (asin(*(x)))
207 #define d_atan(x) (atan(*(x)))
208 #define d_atn2(x, y) (atan2(*(x),*(y)))
209 #define d_cnjg(R, Z) { pCd(R) = conj(Cd(Z)); }
210 #define r_cnjg(R, Z) { pCf(R) = conjf(Cf(Z)); }
211 #define d_cos(x) (cos(*(x)))
212 #define d_cosh(x) (cosh(*(x)))
213 #define d_dim(__a, __b) ( *(__a) > *(__b) ? *(__a) - *(__b) : 0.0 )
214 #define d_exp(x) (exp(*(x)))
215 #define d_imag(z) (cimag(Cd(z)))
216 #define r_imag(z) (cimagf(Cf(z)))
217 #define d_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
218 #define r_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
219 #define d_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
220 #define r_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
221 #define d_log(x) (log(*(x)))
222 #define d_mod(x, y) (fmod(*(x), *(y)))
223 #define u_nint(__x) ((__x)>=0 ? floor((__x) + .5) : -floor(.5 - (__x)))
224 #define d_nint(x) u_nint(*(x))
225 #define u_sign(__a,__b) ((__b) >= 0 ? ((__a) >= 0 ? (__a) : -(__a)) : -((__a) >= 0 ? (__a) : -(__a)))
226 #define d_sign(a,b) u_sign(*(a),*(b))
227 #define r_sign(a,b) u_sign(*(a),*(b))
228 #define d_sin(x) (sin(*(x)))
229 #define d_sinh(x) (sinh(*(x)))
230 #define d_sqrt(x) (sqrt(*(x)))
231 #define d_tan(x) (tan(*(x)))
232 #define d_tanh(x) (tanh(*(x)))
233 #define i_abs(x) abs(*(x))
234 #define i_dnnt(x) ((integer)u_nint(*(x)))
235 #define i_len(s, n) (n)
236 #define i_nint(x) ((integer)u_nint(*(x)))
237 #define i_sign(a,b) ((integer)u_sign((integer)*(a),(integer)*(b)))
238 #define pow_dd(ap, bp) ( pow(*(ap), *(bp)))
239 #define pow_si(B,E) spow_ui(*(B),*(E))
240 #define pow_ri(B,E) spow_ui(*(B),*(E))
241 #define pow_di(B,E) dpow_ui(*(B),*(E))
242 #define pow_zi(p, a, b) {pCd(p) = zpow_ui(Cd(a), *(b));}
243 #define pow_ci(p, a, b) {pCf(p) = cpow_ui(Cf(a), *(b));}
244 #define pow_zz(R,A,B) {pCd(R) = cpow(Cd(A),*(B));}
245 #define s_cat(lpp, rpp, rnp, np, llp) { ftnlen i, nc, ll; char *f__rp, *lp; ll = (llp); lp = (lpp); for(i=0; i < (int)*(np); ++i) { nc = ll; if((rnp)[i] < nc) nc = (rnp)[i]; ll -= nc; f__rp = (rpp)[i]; while(--nc >= 0) *lp++ = *(f__rp)++; } while(--ll >= 0) *lp++ = ' '; }
246 #define s_cmp(a,b,c,d) ((integer)strncmp((a),(b),f2cmin((c),(d))))
247 #define s_copy(A,B,C,D) { int __i,__m; for (__i=0, __m=f2cmin((C),(D)); __i<__m && (B)[__i] != 0; ++__i) (A)[__i] = (B)[__i]; }
248 #define sig_die(s, kill) { exit(1); }
249 #define s_stop(s, n) {exit(0);}
250 static char junk[] = "\n@(#)LIBF77 VERSION 19990503\n";
251 #define z_abs(z) (cabs(Cd(z)))
252 #define z_exp(R, Z) {pCd(R) = cexp(Cd(Z));}
253 #define z_sqrt(R, Z) {pCd(R) = csqrt(Cd(Z));}
254 #define myexit_() break;
255 #define mycycle() continue;
256 #define myceiling(w) {ceil(w)}
257 #define myhuge(w) {HUGE_VAL}
258 //#define mymaxloc_(w,s,e,n) {if (sizeof(*(w)) == sizeof(double)) dmaxloc_((w),*(s),*(e),n); else dmaxloc_((w),*(s),*(e),n);}
259 #define mymaxloc(w,s,e,n) {dmaxloc_(w,*(s),*(e),n)}
261 /* procedure parameter types for -A and -C++ */
263 #define F2C_proc_par_types 1
265 typedef logical (*L_fp)(...);
267 typedef logical (*L_fp)();
270 static float spow_ui(float x, integer n) {
271 float pow=1.0; unsigned long int u;
273 if(n < 0) n = -n, x = 1/x;
282 static double dpow_ui(double x, integer n) {
283 double pow=1.0; unsigned long int u;
285 if(n < 0) n = -n, x = 1/x;
295 static _Fcomplex cpow_ui(complex x, integer n) {
296 complex pow={1.0,0.0}; unsigned long int u;
298 if(n < 0) n = -n, x.r = 1/x.r, x.i=1/x.i;
300 if(u & 01) pow.r *= x.r, pow.i *= x.i;
301 if(u >>= 1) x.r *= x.r, x.i *= x.i;
305 _Fcomplex p={pow.r, pow.i};
309 static _Complex float cpow_ui(_Complex float x, integer n) {
310 _Complex float pow=1.0; unsigned long int u;
312 if(n < 0) n = -n, x = 1/x;
323 static _Dcomplex zpow_ui(_Dcomplex x, integer n) {
324 _Dcomplex pow={1.0,0.0}; unsigned long int u;
326 if(n < 0) n = -n, x._Val[0] = 1/x._Val[0], x._Val[1] =1/x._Val[1];
328 if(u & 01) pow._Val[0] *= x._Val[0], pow._Val[1] *= x._Val[1];
329 if(u >>= 1) x._Val[0] *= x._Val[0], x._Val[1] *= x._Val[1];
333 _Dcomplex p = {pow._Val[0], pow._Val[1]};
337 static _Complex double zpow_ui(_Complex double x, integer n) {
338 _Complex double pow=1.0; unsigned long int u;
340 if(n < 0) n = -n, x = 1/x;
350 static integer pow_ii(integer x, integer n) {
351 integer pow; unsigned long int u;
353 if (n == 0 || x == 1) pow = 1;
354 else if (x != -1) pow = x == 0 ? 1/x : 0;
357 if ((n > 0) || !(n == 0 || x == 1 || x != -1)) {
367 static integer dmaxloc_(double *w, integer s, integer e, integer *n)
369 double m; integer i, mi;
370 for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
371 if (w[i-1]>m) mi=i ,m=w[i-1];
374 static integer smaxloc_(float *w, integer s, integer e, integer *n)
376 float m; integer i, mi;
377 for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
378 if (w[i-1]>m) mi=i ,m=w[i-1];
381 static inline void cdotc_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
382 integer n = *n_, incx = *incx_, incy = *incy_, i;
384 _Fcomplex zdotc = {0.0, 0.0};
385 if (incx == 1 && incy == 1) {
386 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
387 zdotc._Val[0] += conjf(Cf(&x[i]))._Val[0] * Cf(&y[i])._Val[0];
388 zdotc._Val[1] += conjf(Cf(&x[i]))._Val[1] * Cf(&y[i])._Val[1];
391 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
392 zdotc._Val[0] += conjf(Cf(&x[i*incx]))._Val[0] * Cf(&y[i*incy])._Val[0];
393 zdotc._Val[1] += conjf(Cf(&x[i*incx]))._Val[1] * Cf(&y[i*incy])._Val[1];
399 _Complex float zdotc = 0.0;
400 if (incx == 1 && incy == 1) {
401 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
402 zdotc += conjf(Cf(&x[i])) * Cf(&y[i]);
405 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
406 zdotc += conjf(Cf(&x[i*incx])) * Cf(&y[i*incy]);
412 static inline void zdotc_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
413 integer n = *n_, incx = *incx_, incy = *incy_, i;
415 _Dcomplex zdotc = {0.0, 0.0};
416 if (incx == 1 && incy == 1) {
417 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
418 zdotc._Val[0] += conj(Cd(&x[i]))._Val[0] * Cd(&y[i])._Val[0];
419 zdotc._Val[1] += conj(Cd(&x[i]))._Val[1] * Cd(&y[i])._Val[1];
422 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
423 zdotc._Val[0] += conj(Cd(&x[i*incx]))._Val[0] * Cd(&y[i*incy])._Val[0];
424 zdotc._Val[1] += conj(Cd(&x[i*incx]))._Val[1] * Cd(&y[i*incy])._Val[1];
430 _Complex double zdotc = 0.0;
431 if (incx == 1 && incy == 1) {
432 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
433 zdotc += conj(Cd(&x[i])) * Cd(&y[i]);
436 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
437 zdotc += conj(Cd(&x[i*incx])) * Cd(&y[i*incy]);
443 static inline void cdotu_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
444 integer n = *n_, incx = *incx_, incy = *incy_, i;
446 _Fcomplex zdotc = {0.0, 0.0};
447 if (incx == 1 && incy == 1) {
448 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
449 zdotc._Val[0] += Cf(&x[i])._Val[0] * Cf(&y[i])._Val[0];
450 zdotc._Val[1] += Cf(&x[i])._Val[1] * Cf(&y[i])._Val[1];
453 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
454 zdotc._Val[0] += Cf(&x[i*incx])._Val[0] * Cf(&y[i*incy])._Val[0];
455 zdotc._Val[1] += Cf(&x[i*incx])._Val[1] * Cf(&y[i*incy])._Val[1];
461 _Complex float zdotc = 0.0;
462 if (incx == 1 && incy == 1) {
463 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
464 zdotc += Cf(&x[i]) * Cf(&y[i]);
467 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
468 zdotc += Cf(&x[i*incx]) * Cf(&y[i*incy]);
474 static inline void zdotu_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
475 integer n = *n_, incx = *incx_, incy = *incy_, i;
477 _Dcomplex zdotc = {0.0, 0.0};
478 if (incx == 1 && incy == 1) {
479 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
480 zdotc._Val[0] += Cd(&x[i])._Val[0] * Cd(&y[i])._Val[0];
481 zdotc._Val[1] += Cd(&x[i])._Val[1] * Cd(&y[i])._Val[1];
484 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
485 zdotc._Val[0] += Cd(&x[i*incx])._Val[0] * Cd(&y[i*incy])._Val[0];
486 zdotc._Val[1] += Cd(&x[i*incx])._Val[1] * Cd(&y[i*incy])._Val[1];
492 _Complex double zdotc = 0.0;
493 if (incx == 1 && incy == 1) {
494 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
495 zdotc += Cd(&x[i]) * Cd(&y[i]);
498 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
499 zdotc += Cd(&x[i*incx]) * Cd(&y[i*incy]);
505 /* -- translated by f2c (version 20000121).
506 You must link the resulting object file with the libraries:
507 -lf2c -lm (in that order)
513 /* Table of constant values */
515 static complex c_b1 = {1.f,0.f};
516 static integer c__1 = 1;
517 static integer c_n1 = -1;
518 static real c_b21 = -1.f;
519 static real c_b22 = 1.f;
520 static integer c__33 = 33;
522 /* > \brief \b CPBTRF */
524 /* =========== DOCUMENTATION =========== */
526 /* Online html documentation available at */
527 /* http://www.netlib.org/lapack/explore-html/ */
530 /* > Download CPBTRF + dependencies */
531 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/cpbtrf.
534 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/cpbtrf.
537 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/cpbtrf.
545 /* SUBROUTINE CPBTRF( UPLO, N, KD, AB, LDAB, INFO ) */
548 /* INTEGER INFO, KD, LDAB, N */
549 /* COMPLEX AB( LDAB, * ) */
552 /* > \par Purpose: */
557 /* > CPBTRF computes the Cholesky factorization of a complex Hermitian */
558 /* > positive definite band matrix A. */
560 /* > The factorization has the form */
561 /* > A = U**H * U, if UPLO = 'U', or */
562 /* > A = L * L**H, if UPLO = 'L', */
563 /* > where U is an upper triangular matrix and L is lower triangular. */
569 /* > \param[in] UPLO */
571 /* > UPLO is CHARACTER*1 */
572 /* > = 'U': Upper triangle of A is stored; */
573 /* > = 'L': Lower triangle of A is stored. */
579 /* > The order of the matrix A. N >= 0. */
582 /* > \param[in] KD */
584 /* > KD is INTEGER */
585 /* > The number of superdiagonals of the matrix A if UPLO = 'U', */
586 /* > or the number of subdiagonals if UPLO = 'L'. KD >= 0. */
589 /* > \param[in,out] AB */
591 /* > AB is COMPLEX array, dimension (LDAB,N) */
592 /* > On entry, the upper or lower triangle of the Hermitian band */
593 /* > matrix A, stored in the first KD+1 rows of the array. The */
594 /* > j-th column of A is stored in the j-th column of the array AB */
596 /* > if UPLO = 'U', AB(kd+1+i-j,j) = A(i,j) for f2cmax(1,j-kd)<=i<=j; */
597 /* > if UPLO = 'L', AB(1+i-j,j) = A(i,j) for j<=i<=f2cmin(n,j+kd). */
599 /* > On exit, if INFO = 0, the triangular factor U or L from the */
600 /* > Cholesky factorization A = U**H*U or A = L*L**H of the band */
601 /* > matrix A, in the same storage format as A. */
604 /* > \param[in] LDAB */
606 /* > LDAB is INTEGER */
607 /* > The leading dimension of the array AB. LDAB >= KD+1. */
610 /* > \param[out] INFO */
612 /* > INFO is INTEGER */
613 /* > = 0: successful exit */
614 /* > < 0: if INFO = -i, the i-th argument had an illegal value */
615 /* > > 0: if INFO = i, the leading minor of order i is not */
616 /* > positive definite, and the factorization could not be */
623 /* > \author Univ. of Tennessee */
624 /* > \author Univ. of California Berkeley */
625 /* > \author Univ. of Colorado Denver */
626 /* > \author NAG Ltd. */
628 /* > \date December 2016 */
630 /* > \ingroup complexOTHERcomputational */
632 /* > \par Further Details: */
633 /* ===================== */
637 /* > The band storage scheme is illustrated by the following example, when */
638 /* > N = 6, KD = 2, and UPLO = 'U': */
640 /* > On entry: On exit: */
642 /* > * * a13 a24 a35 a46 * * u13 u24 u35 u46 */
643 /* > * a12 a23 a34 a45 a56 * u12 u23 u34 u45 u56 */
644 /* > a11 a22 a33 a44 a55 a66 u11 u22 u33 u44 u55 u66 */
646 /* > Similarly, if UPLO = 'L' the format of A is as follows: */
648 /* > On entry: On exit: */
650 /* > a11 a22 a33 a44 a55 a66 l11 l22 l33 l44 l55 l66 */
651 /* > a21 a32 a43 a54 a65 * l21 l32 l43 l54 l65 * */
652 /* > a31 a42 a53 a64 * * l31 l42 l53 l64 * * */
654 /* > Array elements marked * are not used by the routine. */
657 /* > \par Contributors: */
658 /* ================== */
660 /* > Peter Mayes and Giuseppe Radicati, IBM ECSEC, Rome, March 23, 1989 */
662 /* ===================================================================== */
663 /* Subroutine */ int cpbtrf_(char *uplo, integer *n, integer *kd, complex *ab,
664 integer *ldab, integer *info)
666 /* System generated locals */
667 integer ab_dim1, ab_offset, i__1, i__2, i__3, i__4, i__5, i__6;
670 /* Local variables */
671 complex work[1056] /* was [33][32] */;
673 extern /* Subroutine */ int cgemm_(char *, char *, integer *, integer *,
674 integer *, complex *, complex *, integer *, complex *, integer *,
675 complex *, complex *, integer *), cherk_(char *,
676 char *, integer *, integer *, real *, complex *, integer *, real *
677 , complex *, integer *);
678 extern logical lsame_(char *, char *);
679 extern /* Subroutine */ int ctrsm_(char *, char *, char *, char *,
680 integer *, integer *, complex *, complex *, integer *, complex *,
683 extern /* Subroutine */ int cpbtf2_(char *, integer *, integer *, complex
684 *, integer *, integer *), cpotf2_(char *, integer *,
685 complex *, integer *, integer *);
686 integer ib, nb, ii, jj;
687 extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
688 extern integer ilaenv_(integer *, char *, char *, integer *, integer *,
689 integer *, integer *, ftnlen, ftnlen);
692 /* -- LAPACK computational routine (version 3.7.0) -- */
693 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
694 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
698 /* ===================================================================== */
701 /* Test the input parameters. */
703 /* Parameter adjustments */
705 ab_offset = 1 + ab_dim1 * 1;
710 if (! lsame_(uplo, "U") && ! lsame_(uplo, "L")) {
714 } else if (*kd < 0) {
716 } else if (*ldab < *kd + 1) {
721 xerbla_("CPBTRF", &i__1, (ftnlen)6);
725 /* Quick return if possible */
731 /* Determine the block size for this environment */
733 nb = ilaenv_(&c__1, "CPBTRF", uplo, n, kd, &c_n1, &c_n1, (ftnlen)6, (
736 /* The block size must not exceed the semi-bandwidth KD, and must not */
737 /* exceed the limit set by the size of the local array WORK. */
741 if (nb <= 1 || nb > *kd) {
743 /* Use unblocked code */
745 cpbtf2_(uplo, n, kd, &ab[ab_offset], ldab, info);
748 /* Use blocked code */
750 if (lsame_(uplo, "U")) {
752 /* Compute the Cholesky factorization of a Hermitian band */
753 /* matrix, given the upper triangle of the matrix in band */
756 /* Zero the upper triangle of the work array. */
759 for (j = 1; j <= i__1; ++j) {
761 for (i__ = 1; i__ <= i__2; ++i__) {
762 i__3 = i__ + j * 33 - 34;
763 work[i__3].r = 0.f, work[i__3].i = 0.f;
769 /* Process the band matrix one diagonal block at a time. */
773 for (i__ = 1; i__2 < 0 ? i__ >= i__1 : i__ <= i__1; i__ += i__2) {
775 i__3 = nb, i__4 = *n - i__ + 1;
776 ib = f2cmin(i__3,i__4);
778 /* Factorize the diagonal block */
781 cpotf2_(uplo, &ib, &ab[*kd + 1 + i__ * ab_dim1], &i__3, &ii);
783 *info = i__ + ii - 1;
786 if (i__ + ib <= *n) {
788 /* Update the relevant part of the trailing submatrix. */
789 /* If A11 denotes the diagonal block which has just been */
790 /* factorized, then we need to update the remaining */
791 /* blocks in the diagram: */
797 /* The numbers of rows and columns in the partitioning */
798 /* are IB, I2, I3 respectively. The blocks A12, A22 and */
799 /* A23 are empty if IB = KD. The upper triangle of A13 */
800 /* lies outside the band. */
803 i__3 = *kd - ib, i__4 = *n - i__ - ib + 1;
804 i2 = f2cmin(i__3,i__4);
806 i__3 = ib, i__4 = *n - i__ - *kd + 1;
807 i3 = f2cmin(i__3,i__4);
815 ctrsm_("Left", "Upper", "Conjugate transpose", "Non-"
816 "unit", &ib, &i2, &c_b1, &ab[*kd + 1 + i__ *
817 ab_dim1], &i__3, &ab[*kd + 1 - ib + (i__ + ib)
824 cherk_("Upper", "Conjugate transpose", &i2, &ib, &
825 c_b21, &ab[*kd + 1 - ib + (i__ + ib) *
826 ab_dim1], &i__3, &c_b22, &ab[*kd + 1 + (i__ +
827 ib) * ab_dim1], &i__4);
832 /* Copy the lower triangle of A13 into the work array. */
835 for (jj = 1; jj <= i__3; ++jj) {
837 for (ii = jj; ii <= i__4; ++ii) {
838 i__5 = ii + jj * 33 - 34;
839 i__6 = ii - jj + 1 + (jj + i__ + *kd - 1) *
841 work[i__5].r = ab[i__6].r, work[i__5].i = ab[
848 /* Update A13 (in the work array). */
851 ctrsm_("Left", "Upper", "Conjugate transpose", "Non-"
852 "unit", &ib, &i3, &c_b1, &ab[*kd + 1 + i__ *
853 ab_dim1], &i__3, work, &c__33);
858 q__1.r = -1.f, q__1.i = 0.f;
861 cgemm_("Conjugate transpose", "No transpose", &i2,
862 &i3, &ib, &q__1, &ab[*kd + 1 - ib + (i__
863 + ib) * ab_dim1], &i__3, work, &c__33, &
864 c_b1, &ab[ib + 1 + (i__ + *kd) * ab_dim1],
871 cherk_("Upper", "Conjugate transpose", &i3, &ib, &
872 c_b21, work, &c__33, &c_b22, &ab[*kd + 1 + (
873 i__ + *kd) * ab_dim1], &i__3);
875 /* Copy the lower triangle of A13 back into place. */
878 for (jj = 1; jj <= i__3; ++jj) {
880 for (ii = jj; ii <= i__4; ++ii) {
881 i__5 = ii - jj + 1 + (jj + i__ + *kd - 1) *
883 i__6 = ii + jj * 33 - 34;
884 ab[i__5].r = work[i__6].r, ab[i__5].i = work[
896 /* Compute the Cholesky factorization of a Hermitian band */
897 /* matrix, given the lower triangle of the matrix in band */
900 /* Zero the lower triangle of the work array. */
903 for (j = 1; j <= i__2; ++j) {
905 for (i__ = j + 1; i__ <= i__1; ++i__) {
906 i__3 = i__ + j * 33 - 34;
907 work[i__3].r = 0.f, work[i__3].i = 0.f;
913 /* Process the band matrix one diagonal block at a time. */
917 for (i__ = 1; i__1 < 0 ? i__ >= i__2 : i__ <= i__2; i__ += i__1) {
919 i__3 = nb, i__4 = *n - i__ + 1;
920 ib = f2cmin(i__3,i__4);
922 /* Factorize the diagonal block */
925 cpotf2_(uplo, &ib, &ab[i__ * ab_dim1 + 1], &i__3, &ii);
927 *info = i__ + ii - 1;
930 if (i__ + ib <= *n) {
932 /* Update the relevant part of the trailing submatrix. */
933 /* If A11 denotes the diagonal block which has just been */
934 /* factorized, then we need to update the remaining */
935 /* blocks in the diagram: */
941 /* The numbers of rows and columns in the partitioning */
942 /* are IB, I2, I3 respectively. The blocks A21, A22 and */
943 /* A32 are empty if IB = KD. The lower triangle of A31 */
944 /* lies outside the band. */
947 i__3 = *kd - ib, i__4 = *n - i__ - ib + 1;
948 i2 = f2cmin(i__3,i__4);
950 i__3 = ib, i__4 = *n - i__ - *kd + 1;
951 i3 = f2cmin(i__3,i__4);
959 ctrsm_("Right", "Lower", "Conjugate transpose", "Non"
960 "-unit", &i2, &ib, &c_b1, &ab[i__ * ab_dim1 +
961 1], &i__3, &ab[ib + 1 + i__ * ab_dim1], &i__4);
967 cherk_("Lower", "No transpose", &i2, &ib, &c_b21, &ab[
968 ib + 1 + i__ * ab_dim1], &i__3, &c_b22, &ab[(
969 i__ + ib) * ab_dim1 + 1], &i__4);
974 /* Copy the upper triangle of A31 into the work array. */
977 for (jj = 1; jj <= i__3; ++jj) {
978 i__4 = f2cmin(jj,i3);
979 for (ii = 1; ii <= i__4; ++ii) {
980 i__5 = ii + jj * 33 - 34;
981 i__6 = *kd + 1 - jj + ii + (jj + i__ - 1) *
983 work[i__5].r = ab[i__6].r, work[i__5].i = ab[
990 /* Update A31 (in the work array). */
993 ctrsm_("Right", "Lower", "Conjugate transpose", "Non"
994 "-unit", &i3, &ib, &c_b1, &ab[i__ * ab_dim1 +
995 1], &i__3, work, &c__33);
1000 q__1.r = -1.f, q__1.i = 0.f;
1003 cgemm_("No transpose", "Conjugate transpose", &i3,
1004 &i2, &ib, &q__1, work, &c__33, &ab[ib +
1005 1 + i__ * ab_dim1], &i__3, &c_b1, &ab[*kd
1006 + 1 - ib + (i__ + ib) * ab_dim1], &i__4);
1012 cherk_("Lower", "No transpose", &i3, &ib, &c_b21,
1013 work, &c__33, &c_b22, &ab[(i__ + *kd) *
1014 ab_dim1 + 1], &i__3);
1016 /* Copy the upper triangle of A31 back into place. */
1019 for (jj = 1; jj <= i__3; ++jj) {
1020 i__4 = f2cmin(jj,i3);
1021 for (ii = 1; ii <= i__4; ++ii) {
1022 i__5 = *kd + 1 - jj + ii + (jj + i__ - 1) *
1024 i__6 = ii + jj * 33 - 34;
1025 ab[i__5].r = work[i__6].r, ab[i__5].i = work[