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 doublereal c_b8 = -1.;
517 static doublereal c_b9 = 1.;
519 /* > \brief \b DLASYF computes a partial factorization of a real symmetric matrix using the Bunch-Kaufman diag
520 onal pivoting method. */
522 /* =========== DOCUMENTATION =========== */
524 /* Online html documentation available at */
525 /* http://www.netlib.org/lapack/explore-html/ */
528 /* > Download DLASYF + dependencies */
529 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/dlasyf.
532 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/dlasyf.
535 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/dlasyf.
543 /* SUBROUTINE DLASYF( UPLO, N, NB, KB, A, LDA, IPIV, W, LDW, INFO ) */
546 /* INTEGER INFO, KB, LDA, LDW, N, NB */
547 /* INTEGER IPIV( * ) */
548 /* DOUBLE PRECISION A( LDA, * ), W( LDW, * ) */
551 /* > \par Purpose: */
556 /* > DLASYF computes a partial factorization of a real symmetric matrix A */
557 /* > using the Bunch-Kaufman diagonal pivoting method. The partial */
558 /* > factorization has the form: */
560 /* > A = ( I U12 ) ( A11 0 ) ( I 0 ) if UPLO = 'U', or: */
561 /* > ( 0 U22 ) ( 0 D ) ( U12**T U22**T ) */
563 /* > A = ( L11 0 ) ( D 0 ) ( L11**T L21**T ) if UPLO = 'L' */
564 /* > ( L21 I ) ( 0 A22 ) ( 0 I ) */
566 /* > where the order of D is at most NB. The actual order is returned in */
567 /* > the argument KB, and is either NB or NB-1, or N if N <= NB. */
569 /* > DLASYF is an auxiliary routine called by DSYTRF. It uses blocked code */
570 /* > (calling Level 3 BLAS) to update the submatrix A11 (if UPLO = 'U') or */
571 /* > A22 (if UPLO = 'L'). */
577 /* > \param[in] UPLO */
579 /* > UPLO is CHARACTER*1 */
580 /* > Specifies whether the upper or lower triangular part of the */
581 /* > 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] NB */
594 /* > NB is INTEGER */
595 /* > The maximum number of columns of the matrix A that should be */
596 /* > factored. NB should be at least 2 to allow for 2-by-2 pivot */
600 /* > \param[out] KB */
602 /* > KB is INTEGER */
603 /* > The number of columns of A that were actually factored. */
604 /* > KB is either NB-1 or NB, or N if N <= NB. */
607 /* > \param[in,out] A */
609 /* > A is DOUBLE PRECISION array, dimension (LDA,N) */
610 /* > On entry, the symmetric matrix A. If UPLO = 'U', the leading */
611 /* > n-by-n upper triangular part of A contains the upper */
612 /* > triangular part of the matrix A, and the strictly lower */
613 /* > triangular part of A is not referenced. If UPLO = 'L', the */
614 /* > leading n-by-n lower triangular part of A contains the lower */
615 /* > triangular part of the matrix A, and the strictly upper */
616 /* > triangular part of A is not referenced. */
617 /* > On exit, A contains details of the partial factorization. */
620 /* > \param[in] LDA */
622 /* > LDA is INTEGER */
623 /* > The leading dimension of the array A. LDA >= f2cmax(1,N). */
626 /* > \param[out] IPIV */
628 /* > IPIV is INTEGER array, dimension (N) */
629 /* > Details of the interchanges and the block structure of D. */
631 /* > If UPLO = 'U': */
632 /* > Only the last KB elements of IPIV are set. */
634 /* > If IPIV(k) > 0, then rows and columns k and IPIV(k) were */
635 /* > interchanged and D(k,k) is a 1-by-1 diagonal block. */
637 /* > If IPIV(k) = IPIV(k-1) < 0, then rows and columns */
638 /* > k-1 and -IPIV(k) were interchanged and D(k-1:k,k-1:k) */
639 /* > is a 2-by-2 diagonal block. */
641 /* > If UPLO = 'L': */
642 /* > Only the first KB elements of IPIV are set. */
644 /* > If IPIV(k) > 0, then rows and columns k and IPIV(k) were */
645 /* > interchanged and D(k,k) is a 1-by-1 diagonal block. */
647 /* > If IPIV(k) = IPIV(k+1) < 0, then rows and columns */
648 /* > k+1 and -IPIV(k) were interchanged and D(k:k+1,k:k+1) */
649 /* > is a 2-by-2 diagonal block. */
652 /* > \param[out] W */
654 /* > W is DOUBLE PRECISION array, dimension (LDW,NB) */
657 /* > \param[in] LDW */
659 /* > LDW is INTEGER */
660 /* > The leading dimension of the array W. LDW >= f2cmax(1,N). */
663 /* > \param[out] INFO */
665 /* > INFO is INTEGER */
666 /* > = 0: successful exit */
667 /* > > 0: if INFO = k, D(k,k) is exactly zero. The factorization */
668 /* > has been completed, but the block diagonal matrix D is */
669 /* > exactly singular. */
675 /* > \author Univ. of Tennessee */
676 /* > \author Univ. of California Berkeley */
677 /* > \author Univ. of Colorado Denver */
678 /* > \author NAG Ltd. */
680 /* > \date November 2013 */
682 /* > \ingroup doubleSYcomputational */
684 /* > \par Contributors: */
685 /* ================== */
689 /* > November 2013, Igor Kozachenko, */
690 /* > Computer Science Division, */
691 /* > University of California, Berkeley */
694 /* ===================================================================== */
695 /* Subroutine */ int dlasyf_(char *uplo, integer *n, integer *nb, integer *kb,
696 doublereal *a, integer *lda, integer *ipiv, doublereal *w, integer *
699 /* System generated locals */
700 integer a_dim1, a_offset, w_dim1, w_offset, i__1, i__2, i__3, i__4, i__5;
701 doublereal d__1, d__2, d__3;
703 /* Local variables */
704 integer imax, jmax, j, k;
706 extern /* Subroutine */ int dscal_(integer *, doublereal *, doublereal *,
707 integer *), dgemm_(char *, char *, integer *, integer *, integer *
708 , doublereal *, doublereal *, integer *, doublereal *, integer *,
709 doublereal *, doublereal *, integer *);
710 extern logical lsame_(char *, char *);
711 extern /* Subroutine */ int dgemv_(char *, integer *, integer *,
712 doublereal *, doublereal *, integer *, doublereal *, integer *,
713 doublereal *, doublereal *, integer *), dcopy_(integer *,
714 doublereal *, integer *, doublereal *, integer *), dswap_(integer
715 *, doublereal *, integer *, doublereal *, integer *);
717 doublereal r1, d11, d21, d22;
718 integer jb, jj, kk, jp, kp;
721 extern integer idamax_(integer *, doublereal *, integer *);
722 doublereal colmax, rowmax;
726 /* -- LAPACK computational routine (version 3.5.0) -- */
727 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
728 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
732 /* ===================================================================== */
735 /* Parameter adjustments */
737 a_offset = 1 + a_dim1 * 1;
741 w_offset = 1 + w_dim1 * 1;
747 /* Initialize ALPHA for use in choosing pivot block size. */
749 alpha = (sqrt(17.) + 1.) / 8.;
751 if (lsame_(uplo, "U")) {
753 /* Factorize the trailing columns of A using the upper triangle */
754 /* of A and working backwards, and compute the matrix W = U12*D */
755 /* for use in updating A11 */
757 /* K is the main loop index, decreasing from N in steps of 1 or 2 */
759 /* KW is the column of W which corresponds to column K of A */
767 if (k <= *n - *nb + 1 && *nb < *n || k < 1) {
771 /* Copy column K of A to column KW of W and update it */
773 dcopy_(&k, &a[k * a_dim1 + 1], &c__1, &w[kw * w_dim1 + 1], &c__1);
776 dgemv_("No transpose", &k, &i__1, &c_b8, &a[(k + 1) * a_dim1 + 1],
777 lda, &w[k + (kw + 1) * w_dim1], ldw, &c_b9, &w[kw *
783 /* Determine rows and columns to be interchanged and whether */
784 /* a 1-by-1 or 2-by-2 pivot block will be used */
786 absakk = (d__1 = w[k + kw * w_dim1], abs(d__1));
788 /* IMAX is the row-index of the largest off-diagonal element in */
789 /* column K, and COLMAX is its absolute value. */
790 /* Determine both COLMAX and IMAX. */
794 imax = idamax_(&i__1, &w[kw * w_dim1 + 1], &c__1);
795 colmax = (d__1 = w[imax + kw * w_dim1], abs(d__1));
800 if (f2cmax(absakk,colmax) == 0.) {
802 /* Column K is zero or underflow: set INFO and continue */
809 if (absakk >= alpha * colmax) {
811 /* no interchange, use 1-by-1 pivot block */
816 /* Copy column IMAX to column KW-1 of W and update it */
818 dcopy_(&imax, &a[imax * a_dim1 + 1], &c__1, &w[(kw - 1) *
821 dcopy_(&i__1, &a[imax + (imax + 1) * a_dim1], lda, &w[imax +
822 1 + (kw - 1) * w_dim1], &c__1);
825 dgemv_("No transpose", &k, &i__1, &c_b8, &a[(k + 1) *
826 a_dim1 + 1], lda, &w[imax + (kw + 1) * w_dim1],
827 ldw, &c_b9, &w[(kw - 1) * w_dim1 + 1], &c__1);
830 /* JMAX is the column-index of the largest off-diagonal */
831 /* element in row IMAX, and ROWMAX is its absolute value */
834 jmax = imax + idamax_(&i__1, &w[imax + 1 + (kw - 1) * w_dim1],
836 rowmax = (d__1 = w[jmax + (kw - 1) * w_dim1], abs(d__1));
839 jmax = idamax_(&i__1, &w[(kw - 1) * w_dim1 + 1], &c__1);
841 d__2 = rowmax, d__3 = (d__1 = w[jmax + (kw - 1) * w_dim1],
843 rowmax = f2cmax(d__2,d__3);
846 if (absakk >= alpha * colmax * (colmax / rowmax)) {
848 /* no interchange, use 1-by-1 pivot block */
851 } else if ((d__1 = w[imax + (kw - 1) * w_dim1], abs(d__1)) >=
854 /* interchange rows and columns K and IMAX, use 1-by-1 */
859 /* copy column KW-1 of W to column KW of W */
861 dcopy_(&k, &w[(kw - 1) * w_dim1 + 1], &c__1, &w[kw *
865 /* interchange rows and columns K-1 and IMAX, use 2-by-2 */
873 /* ============================================================ */
875 /* KK is the column of A where pivoting step stopped */
879 /* KKW is the column of W which corresponds to column KK of A */
883 /* Interchange rows and columns KP and KK. */
884 /* Updated column KP is already stored in column KKW of W. */
888 /* Copy non-updated column KK to column KP of submatrix A */
889 /* at step K. No need to copy element into column K */
890 /* (or K and K-1 for 2-by-2 pivot) of A, since these columns */
891 /* will be later overwritten. */
893 a[kp + kp * a_dim1] = a[kk + kk * a_dim1];
895 dcopy_(&i__1, &a[kp + 1 + kk * a_dim1], &c__1, &a[kp + (kp +
899 dcopy_(&i__1, &a[kk * a_dim1 + 1], &c__1, &a[kp * a_dim1
903 /* Interchange rows KK and KP in last K+1 to N columns of A */
904 /* (columns K (or K and K-1 for 2-by-2 pivot) of A will be */
905 /* later overwritten). Interchange rows KK and KP */
906 /* in last KKW to NB columns of W. */
910 dswap_(&i__1, &a[kk + (k + 1) * a_dim1], lda, &a[kp + (k
911 + 1) * a_dim1], lda);
914 dswap_(&i__1, &w[kk + kkw * w_dim1], ldw, &w[kp + kkw *
920 /* 1-by-1 pivot block D(k): column kw of W now holds */
922 /* W(kw) = U(k)*D(k), */
924 /* where U(k) is the k-th column of U */
926 /* Store subdiag. elements of column U(k) */
927 /* and 1-by-1 block D(k) in column k of A. */
928 /* NOTE: Diagonal element U(k,k) is a UNIT element */
929 /* and not stored. */
930 /* A(k,k) := D(k,k) = W(k,kw) */
931 /* A(1:k-1,k) := U(1:k-1,k) = W(1:k-1,kw)/D(k,k) */
933 dcopy_(&k, &w[kw * w_dim1 + 1], &c__1, &a[k * a_dim1 + 1], &
935 r1 = 1. / a[k + k * a_dim1];
937 dscal_(&i__1, &r1, &a[k * a_dim1 + 1], &c__1);
941 /* 2-by-2 pivot block D(k): columns kw and kw-1 of W now hold */
943 /* ( W(kw-1) W(kw) ) = ( U(k-1) U(k) )*D(k) */
945 /* where U(k) and U(k-1) are the k-th and (k-1)-th columns */
948 /* Store U(1:k-2,k-1) and U(1:k-2,k) and 2-by-2 */
949 /* block D(k-1:k,k-1:k) in columns k-1 and k of A. */
950 /* NOTE: 2-by-2 diagonal block U(k-1:k,k-1:k) is a UNIT */
951 /* block and not stored. */
952 /* A(k-1:k,k-1:k) := D(k-1:k,k-1:k) = W(k-1:k,kw-1:kw) */
953 /* A(1:k-2,k-1:k) := U(1:k-2,k:k-1:k) = */
954 /* = W(1:k-2,kw-1:kw) * ( D(k-1:k,k-1:k)**(-1) ) */
958 /* Compose the columns of the inverse of 2-by-2 pivot */
959 /* block D in the following way to reduce the number */
960 /* of FLOPS when we myltiply panel ( W(kw-1) W(kw) ) by */
963 /* D**(-1) = ( d11 d21 )**(-1) = */
966 /* = 1/(d11*d22-d21**2) * ( ( d22 ) (-d21 ) ) = */
967 /* ( (-d21 ) ( d11 ) ) */
969 /* = 1/d21 * 1/((d11/d21)*(d22/d21)-1) * */
971 /* * ( ( d22/d21 ) ( -1 ) ) = */
972 /* ( ( -1 ) ( d11/d21 ) ) */
974 /* = 1/d21 * 1/(D22*D11-1) * ( ( D11 ) ( -1 ) ) = */
975 /* ( ( -1 ) ( D22 ) ) */
977 /* = 1/d21 * T * ( ( D11 ) ( -1 ) ) */
978 /* ( ( -1 ) ( D22 ) ) */
980 /* = D21 * ( ( D11 ) ( -1 ) ) */
981 /* ( ( -1 ) ( D22 ) ) */
983 d21 = w[k - 1 + kw * w_dim1];
984 d11 = w[k + kw * w_dim1] / d21;
985 d22 = w[k - 1 + (kw - 1) * w_dim1] / d21;
986 t = 1. / (d11 * d22 - 1.);
989 /* Update elements in columns A(k-1) and A(k) as */
990 /* dot products of rows of ( W(kw-1) W(kw) ) and columns */
994 for (j = 1; j <= i__1; ++j) {
995 a[j + (k - 1) * a_dim1] = d21 * (d11 * w[j + (kw - 1)
996 * w_dim1] - w[j + kw * w_dim1]);
997 a[j + k * a_dim1] = d21 * (d22 * w[j + kw * w_dim1] -
998 w[j + (kw - 1) * w_dim1]);
1003 /* Copy D(k) to A */
1005 a[k - 1 + (k - 1) * a_dim1] = w[k - 1 + (kw - 1) * w_dim1];
1006 a[k - 1 + k * a_dim1] = w[k - 1 + kw * w_dim1];
1007 a[k + k * a_dim1] = w[k + kw * w_dim1];
1013 /* Store details of the interchanges in IPIV */
1022 /* Decrease K and return to the start of the main loop */
1029 /* Update the upper triangle of A11 (= A(1:k,1:k)) as */
1031 /* A11 := A11 - U12*D*U12**T = A11 - U12*W**T */
1033 /* computing blocks of NB columns at a time */
1036 for (j = (k - 1) / *nb * *nb + 1; i__1 < 0 ? j >= 1 : j <= 1; j +=
1039 i__2 = *nb, i__3 = k - j + 1;
1040 jb = f2cmin(i__2,i__3);
1042 /* Update the upper triangle of the diagonal block */
1045 for (jj = j; jj <= i__2; ++jj) {
1048 dgemv_("No transpose", &i__3, &i__4, &c_b8, &a[j + (k + 1) *
1049 a_dim1], lda, &w[jj + (kw + 1) * w_dim1], ldw, &c_b9,
1050 &a[j + jj * a_dim1], &c__1);
1054 /* Update the rectangular superdiagonal block */
1058 dgemm_("No transpose", "Transpose", &i__2, &jb, &i__3, &c_b8, &a[(
1059 k + 1) * a_dim1 + 1], lda, &w[j + (kw + 1) * w_dim1], ldw,
1060 &c_b9, &a[j * a_dim1 + 1], lda);
1064 /* Put U12 in standard form by partially undoing the interchanges */
1065 /* in columns k+1:n looping backwards from k+1 to n */
1070 /* Undo the interchanges (if any) of rows JJ and JP at each */
1073 /* (Here, J is a diagonal index) */
1078 /* (Here, J is a diagonal index) */
1081 /* (NOTE: Here, J is used to determine row length. Length N-J+1 */
1082 /* of the rows to swap back doesn't include diagonal element) */
1084 if (jp != jj && j <= *n) {
1086 dswap_(&i__1, &a[jp + j * a_dim1], lda, &a[jj + j * a_dim1], lda);
1092 /* Set KB to the number of columns factorized */
1098 /* Factorize the leading columns of A using the lower triangle */
1099 /* of A and working forwards, and compute the matrix W = L21*D */
1100 /* for use in updating A22 */
1102 /* K is the main loop index, increasing from 1 in steps of 1 or 2 */
1107 /* Exit from loop */
1109 if (k >= *nb && *nb < *n || k > *n) {
1113 /* Copy column K of A to column K of W and update it */
1116 dcopy_(&i__1, &a[k + k * a_dim1], &c__1, &w[k + k * w_dim1], &c__1);
1119 dgemv_("No transpose", &i__1, &i__2, &c_b8, &a[k + a_dim1], lda, &w[k
1120 + w_dim1], ldw, &c_b9, &w[k + k * w_dim1], &c__1);
1124 /* Determine rows and columns to be interchanged and whether */
1125 /* a 1-by-1 or 2-by-2 pivot block will be used */
1127 absakk = (d__1 = w[k + k * w_dim1], abs(d__1));
1129 /* IMAX is the row-index of the largest off-diagonal element in */
1130 /* column K, and COLMAX is its absolute value. */
1131 /* Determine both COLMAX and IMAX. */
1135 imax = k + idamax_(&i__1, &w[k + 1 + k * w_dim1], &c__1);
1136 colmax = (d__1 = w[imax + k * w_dim1], abs(d__1));
1141 if (f2cmax(absakk,colmax) == 0.) {
1143 /* Column K is zero or underflow: set INFO and continue */
1150 if (absakk >= alpha * colmax) {
1152 /* no interchange, use 1-by-1 pivot block */
1157 /* Copy column IMAX to column K+1 of W and update it */
1160 dcopy_(&i__1, &a[imax + k * a_dim1], lda, &w[k + (k + 1) *
1162 i__1 = *n - imax + 1;
1163 dcopy_(&i__1, &a[imax + imax * a_dim1], &c__1, &w[imax + (k +
1164 1) * w_dim1], &c__1);
1167 dgemv_("No transpose", &i__1, &i__2, &c_b8, &a[k + a_dim1],
1168 lda, &w[imax + w_dim1], ldw, &c_b9, &w[k + (k + 1) *
1171 /* JMAX is the column-index of the largest off-diagonal */
1172 /* element in row IMAX, and ROWMAX is its absolute value */
1175 jmax = k - 1 + idamax_(&i__1, &w[k + (k + 1) * w_dim1], &c__1)
1177 rowmax = (d__1 = w[jmax + (k + 1) * w_dim1], abs(d__1));
1180 jmax = imax + idamax_(&i__1, &w[imax + 1 + (k + 1) *
1183 d__2 = rowmax, d__3 = (d__1 = w[jmax + (k + 1) * w_dim1],
1185 rowmax = f2cmax(d__2,d__3);
1188 if (absakk >= alpha * colmax * (colmax / rowmax)) {
1190 /* no interchange, use 1-by-1 pivot block */
1193 } else if ((d__1 = w[imax + (k + 1) * w_dim1], abs(d__1)) >=
1196 /* interchange rows and columns K and IMAX, use 1-by-1 */
1201 /* copy column K+1 of W to column K of W */
1204 dcopy_(&i__1, &w[k + (k + 1) * w_dim1], &c__1, &w[k + k *
1208 /* interchange rows and columns K+1 and IMAX, use 2-by-2 */
1216 /* ============================================================ */
1218 /* KK is the column of A where pivoting step stopped */
1222 /* Interchange rows and columns KP and KK. */
1223 /* Updated column KP is already stored in column KK of W. */
1227 /* Copy non-updated column KK to column KP of submatrix A */
1228 /* at step K. No need to copy element into column K */
1229 /* (or K and K+1 for 2-by-2 pivot) of A, since these columns */
1230 /* will be later overwritten. */
1232 a[kp + kp * a_dim1] = a[kk + kk * a_dim1];
1234 dcopy_(&i__1, &a[kk + 1 + kk * a_dim1], &c__1, &a[kp + (kk +
1238 dcopy_(&i__1, &a[kp + 1 + kk * a_dim1], &c__1, &a[kp + 1
1239 + kp * a_dim1], &c__1);
1242 /* Interchange rows KK and KP in first K-1 columns of A */
1243 /* (columns K (or K and K+1 for 2-by-2 pivot) of A will be */
1244 /* later overwritten). Interchange rows KK and KP */
1245 /* in first KK columns of W. */
1249 dswap_(&i__1, &a[kk + a_dim1], lda, &a[kp + a_dim1], lda);
1251 dswap_(&kk, &w[kk + w_dim1], ldw, &w[kp + w_dim1], ldw);
1256 /* 1-by-1 pivot block D(k): column k of W now holds */
1258 /* W(k) = L(k)*D(k), */
1260 /* where L(k) is the k-th column of L */
1262 /* Store subdiag. elements of column L(k) */
1263 /* and 1-by-1 block D(k) in column k of A. */
1264 /* (NOTE: Diagonal element L(k,k) is a UNIT element */
1265 /* and not stored) */
1266 /* A(k,k) := D(k,k) = W(k,k) */
1267 /* A(k+1:N,k) := L(k+1:N,k) = W(k+1:N,k)/D(k,k) */
1270 dcopy_(&i__1, &w[k + k * w_dim1], &c__1, &a[k + k * a_dim1], &
1273 r1 = 1. / a[k + k * a_dim1];
1275 dscal_(&i__1, &r1, &a[k + 1 + k * a_dim1], &c__1);
1280 /* 2-by-2 pivot block D(k): columns k and k+1 of W now hold */
1282 /* ( W(k) W(k+1) ) = ( L(k) L(k+1) )*D(k) */
1284 /* where L(k) and L(k+1) are the k-th and (k+1)-th columns */
1287 /* Store L(k+2:N,k) and L(k+2:N,k+1) and 2-by-2 */
1288 /* block D(k:k+1,k:k+1) in columns k and k+1 of A. */
1289 /* (NOTE: 2-by-2 diagonal block L(k:k+1,k:k+1) is a UNIT */
1290 /* block and not stored) */
1291 /* A(k:k+1,k:k+1) := D(k:k+1,k:k+1) = W(k:k+1,k:k+1) */
1292 /* A(k+2:N,k:k+1) := L(k+2:N,k:k+1) = */
1293 /* = W(k+2:N,k:k+1) * ( D(k:k+1,k:k+1)**(-1) ) */
1297 /* Compose the columns of the inverse of 2-by-2 pivot */
1298 /* block D in the following way to reduce the number */
1299 /* of FLOPS when we myltiply panel ( W(k) W(k+1) ) by */
1302 /* D**(-1) = ( d11 d21 )**(-1) = */
1305 /* = 1/(d11*d22-d21**2) * ( ( d22 ) (-d21 ) ) = */
1306 /* ( (-d21 ) ( d11 ) ) */
1308 /* = 1/d21 * 1/((d11/d21)*(d22/d21)-1) * */
1310 /* * ( ( d22/d21 ) ( -1 ) ) = */
1311 /* ( ( -1 ) ( d11/d21 ) ) */
1313 /* = 1/d21 * 1/(D22*D11-1) * ( ( D11 ) ( -1 ) ) = */
1314 /* ( ( -1 ) ( D22 ) ) */
1316 /* = 1/d21 * T * ( ( D11 ) ( -1 ) ) */
1317 /* ( ( -1 ) ( D22 ) ) */
1319 /* = D21 * ( ( D11 ) ( -1 ) ) */
1320 /* ( ( -1 ) ( D22 ) ) */
1322 d21 = w[k + 1 + k * w_dim1];
1323 d11 = w[k + 1 + (k + 1) * w_dim1] / d21;
1324 d22 = w[k + k * w_dim1] / d21;
1325 t = 1. / (d11 * d22 - 1.);
1328 /* Update elements in columns A(k) and A(k+1) as */
1329 /* dot products of rows of ( W(k) W(k+1) ) and columns */
1333 for (j = k + 2; j <= i__1; ++j) {
1334 a[j + k * a_dim1] = d21 * (d11 * w[j + k * w_dim1] -
1335 w[j + (k + 1) * w_dim1]);
1336 a[j + (k + 1) * a_dim1] = d21 * (d22 * w[j + (k + 1) *
1337 w_dim1] - w[j + k * w_dim1]);
1342 /* Copy D(k) to A */
1344 a[k + k * a_dim1] = w[k + k * w_dim1];
1345 a[k + 1 + k * a_dim1] = w[k + 1 + k * w_dim1];
1346 a[k + 1 + (k + 1) * a_dim1] = w[k + 1 + (k + 1) * w_dim1];
1352 /* Store details of the interchanges in IPIV */
1361 /* Increase K and return to the start of the main loop */
1368 /* Update the lower triangle of A22 (= A(k:n,k:n)) as */
1370 /* A22 := A22 - L21*D*L21**T = A22 - L21*W**T */
1372 /* computing blocks of NB columns at a time */
1376 for (j = k; i__2 < 0 ? j >= i__1 : j <= i__1; j += i__2) {
1378 i__3 = *nb, i__4 = *n - j + 1;
1379 jb = f2cmin(i__3,i__4);
1381 /* Update the lower triangle of the diagonal block */
1384 for (jj = j; jj <= i__3; ++jj) {
1387 dgemv_("No transpose", &i__4, &i__5, &c_b8, &a[jj + a_dim1],
1388 lda, &w[jj + w_dim1], ldw, &c_b9, &a[jj + jj * a_dim1]
1393 /* Update the rectangular subdiagonal block */
1396 i__3 = *n - j - jb + 1;
1398 dgemm_("No transpose", "Transpose", &i__3, &jb, &i__4, &c_b8,
1399 &a[j + jb + a_dim1], lda, &w[j + w_dim1], ldw, &c_b9,
1400 &a[j + jb + j * a_dim1], lda);
1405 /* Put L21 in standard form by partially undoing the interchanges */
1406 /* of rows in columns 1:k-1 looping backwards from k-1 to 1 */
1411 /* Undo the interchanges (if any) of rows JJ and JP at each */
1414 /* (Here, J is a diagonal index) */
1419 /* (Here, J is a diagonal index) */
1422 /* (NOTE: Here, J is used to determine row length. Length J */
1423 /* of the rows to swap back doesn't include diagonal element) */
1425 if (jp != jj && j >= 1) {
1426 dswap_(&j, &a[jp + a_dim1], lda, &a[jj + a_dim1], lda);
1432 /* Set KB to the number of columns factorized */