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;
516 static integer c_n1 = -1;
517 static integer c__2 = 2;
519 /* > \brief \b DSYTRF */
521 /* =========== DOCUMENTATION =========== */
523 /* Online html documentation available at */
524 /* http://www.netlib.org/lapack/explore-html/ */
527 /* > Download DSYTRF + dependencies */
528 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/dsytrf.
531 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/dsytrf.
534 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/dsytrf.
542 /* SUBROUTINE DSYTRF( UPLO, N, A, LDA, IPIV, WORK, LWORK, INFO ) */
545 /* INTEGER INFO, LDA, LWORK, N */
546 /* INTEGER IPIV( * ) */
547 /* DOUBLE PRECISION A( LDA, * ), WORK( * ) */
550 /* > \par Purpose: */
555 /* > DSYTRF computes the factorization of a real symmetric matrix A using */
556 /* > the Bunch-Kaufman diagonal pivoting method. The form of the */
557 /* > factorization is */
559 /* > A = U**T*D*U or A = L*D*L**T */
561 /* > where U (or L) is a product of permutation and unit upper (lower) */
562 /* > triangular matrices, and D is symmetric and block diagonal with */
563 /* > 1-by-1 and 2-by-2 diagonal blocks. */
565 /* > This is the blocked version of the algorithm, calling Level 3 BLAS. */
571 /* > \param[in] UPLO */
573 /* > UPLO is CHARACTER*1 */
574 /* > = 'U': Upper triangle of A is stored; */
575 /* > = 'L': Lower triangle of A is stored. */
581 /* > The order of the matrix A. N >= 0. */
584 /* > \param[in,out] A */
586 /* > A is DOUBLE PRECISION array, dimension (LDA,N) */
587 /* > On entry, the symmetric 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. */
609 /* > If IPIV(k) > 0, then rows and columns k and IPIV(k) were */
610 /* > interchanged and D(k,k) is a 1-by-1 diagonal block. */
611 /* > If UPLO = 'U' and IPIV(k) = IPIV(k-1) < 0, then rows and */
612 /* > columns k-1 and -IPIV(k) were interchanged and D(k-1:k,k-1:k) */
613 /* > is a 2-by-2 diagonal block. If UPLO = 'L' and IPIV(k) = */
614 /* > IPIV(k+1) < 0, then rows and columns k+1 and -IPIV(k) were */
615 /* > interchanged and D(k:k+1,k:k+1) is a 2-by-2 diagonal block. */
618 /* > \param[out] WORK */
620 /* > WORK is DOUBLE PRECISION array, dimension (MAX(1,LWORK)) */
621 /* > On exit, if INFO = 0, WORK(1) returns the optimal LWORK. */
624 /* > \param[in] LWORK */
626 /* > LWORK is INTEGER */
627 /* > The length of WORK. LWORK >=1. For best performance */
628 /* > LWORK >= N*NB, where NB is the block size returned by ILAENV. */
630 /* > If LWORK = -1, then a workspace query is assumed; the routine */
631 /* > only calculates the optimal size of the WORK array, returns */
632 /* > this value as the first entry of the WORK array, and no error */
633 /* > message related to LWORK is issued by XERBLA. */
636 /* > \param[out] INFO */
638 /* > INFO is INTEGER */
639 /* > = 0: successful exit */
640 /* > < 0: if INFO = -i, the i-th argument had an illegal value */
641 /* > > 0: if INFO = i, D(i,i) is exactly zero. The factorization */
642 /* > has been completed, but the block diagonal matrix D is */
643 /* > exactly singular, and division by zero will occur if it */
644 /* > is used to solve a system of equations. */
650 /* > \author Univ. of Tennessee */
651 /* > \author Univ. of California Berkeley */
652 /* > \author Univ. of Colorado Denver */
653 /* > \author NAG Ltd. */
655 /* > \date December 2016 */
657 /* > \ingroup doubleSYcomputational */
659 /* > \par Further Details: */
660 /* ===================== */
664 /* > If UPLO = 'U', then A = U**T*D*U, where */
665 /* > U = P(n)*U(n)* ... *P(k)U(k)* ..., */
666 /* > i.e., U is a product of terms P(k)*U(k), where k decreases from n to */
667 /* > 1 in steps of 1 or 2, and D is a block diagonal matrix with 1-by-1 */
668 /* > and 2-by-2 diagonal blocks D(k). P(k) is a permutation matrix as */
669 /* > defined by IPIV(k), and U(k) is a unit upper triangular matrix, such */
670 /* > that if the diagonal block D(k) is of order s (s = 1 or 2), then */
672 /* > ( I v 0 ) k-s */
673 /* > U(k) = ( 0 I 0 ) s */
674 /* > ( 0 0 I ) n-k */
677 /* > If s = 1, D(k) overwrites A(k,k), and v overwrites A(1:k-1,k). */
678 /* > If s = 2, the upper triangle of D(k) overwrites A(k-1,k-1), A(k-1,k), */
679 /* > and A(k,k), and v overwrites A(1:k-2,k-1:k). */
681 /* > If UPLO = 'L', then A = L*D*L**T, where */
682 /* > L = P(1)*L(1)* ... *P(k)*L(k)* ..., */
683 /* > i.e., L is a product of terms P(k)*L(k), where k increases from 1 to */
684 /* > n in steps of 1 or 2, and D is a block diagonal matrix with 1-by-1 */
685 /* > and 2-by-2 diagonal blocks D(k). P(k) is a permutation matrix as */
686 /* > defined by IPIV(k), and L(k) is a unit lower triangular matrix, such */
687 /* > that if the diagonal block D(k) is of order s (s = 1 or 2), then */
689 /* > ( I 0 0 ) k-1 */
690 /* > L(k) = ( 0 I 0 ) s */
691 /* > ( 0 v I ) n-k-s+1 */
692 /* > k-1 s n-k-s+1 */
694 /* > If s = 1, D(k) overwrites A(k,k), and v overwrites A(k+1:n,k). */
695 /* > If s = 2, the lower triangle of D(k) overwrites A(k,k), A(k+1,k), */
696 /* > and A(k+1,k+1), and v overwrites A(k+2:n,k:k+1). */
699 /* ===================================================================== */
700 /* Subroutine */ int dsytrf_(char *uplo, integer *n, doublereal *a, integer *
701 lda, integer *ipiv, doublereal *work, integer *lwork, integer *info)
703 /* System generated locals */
704 integer a_dim1, a_offset, i__1, i__2;
706 /* Local variables */
708 extern logical lsame_(char *, char *);
709 integer nbmin, iinfo;
711 extern /* Subroutine */ int dsytf2_(char *, integer *, doublereal *,
712 integer *, integer *, integer *);
714 extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
715 extern integer ilaenv_(integer *, char *, char *, integer *, integer *,
716 integer *, integer *, ftnlen, ftnlen);
717 extern /* Subroutine */ int dlasyf_(char *, integer *, integer *, integer
718 *, doublereal *, integer *, integer *, doublereal *, integer *,
720 integer ldwork, lwkopt;
725 /* -- LAPACK computational routine (version 3.7.0) -- */
726 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
727 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
731 /* ===================================================================== */
734 /* Test the input parameters. */
736 /* Parameter adjustments */
738 a_offset = 1 + a_dim1 * 1;
745 upper = lsame_(uplo, "U");
746 lquery = *lwork == -1;
747 if (! upper && ! lsame_(uplo, "L")) {
751 } else if (*lda < f2cmax(1,*n)) {
753 } else if (*lwork < 1 && ! lquery) {
759 /* Determine the block size */
761 nb = ilaenv_(&c__1, "DSYTRF", uplo, n, &c_n1, &c_n1, &c_n1, (ftnlen)6,
764 work[1] = (doublereal) lwkopt;
769 xerbla_("DSYTRF", &i__1, (ftnlen)6);
777 if (nb > 1 && nb < *n) {
781 i__1 = *lwork / ldwork;
784 i__1 = 2, i__2 = ilaenv_(&c__2, "DSYTRF", uplo, n, &c_n1, &c_n1, &
785 c_n1, (ftnlen)6, (ftnlen)1);
786 nbmin = f2cmax(i__1,i__2);
797 /* Factorize A as U**T*D*U using the upper triangle of A */
799 /* K is the main loop index, decreasing from N to 1 in steps of */
800 /* KB, where KB is the number of columns factorized by DLASYF; */
801 /* KB is either NB or NB-1, or K for the last block */
806 /* If K < 1, exit from loop */
814 /* Factorize columns k-kb+1:k of A and use blocked code to */
815 /* update columns 1:k-kb */
817 dlasyf_(uplo, &k, &nb, &kb, &a[a_offset], lda, &ipiv[1], &work[1],
821 /* Use unblocked code to factorize columns 1:k of A */
823 dsytf2_(uplo, &k, &a[a_offset], lda, &ipiv[1], &iinfo);
827 /* Set INFO on the first occurrence of a zero pivot */
829 if (*info == 0 && iinfo > 0) {
833 /* Decrease K and return to the start of the main loop */
840 /* Factorize A as L*D*L**T using the lower triangle of A */
842 /* K is the main loop index, increasing from 1 to N in steps of */
843 /* KB, where KB is the number of columns factorized by DLASYF; */
844 /* KB is either NB or NB-1, or N-K+1 for the last block */
849 /* If K > N, exit from loop */
857 /* Factorize columns k:k+kb-1 of A and use blocked code to */
858 /* update columns k+kb:n */
861 dlasyf_(uplo, &i__1, &nb, &kb, &a[k + k * a_dim1], lda, &ipiv[k],
862 &work[1], &ldwork, &iinfo);
865 /* Use unblocked code to factorize columns k:n of A */
868 dsytf2_(uplo, &i__1, &a[k + k * a_dim1], lda, &ipiv[k], &iinfo);
872 /* Set INFO on the first occurrence of a zero pivot */
874 if (*info == 0 && iinfo > 0) {
875 *info = iinfo + k - 1;
881 for (j = k; j <= i__1; ++j) {
883 ipiv[j] = ipiv[j] + k - 1;
885 ipiv[j] = ipiv[j] - k + 1;
890 /* Increase K and return to the start of the main loop */
898 work[1] = (doublereal) lwkopt;