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 doublecomplex c_b1 = {1.,0.};
518 /* > \brief \b ZHETRS2 */
520 /* =========== DOCUMENTATION =========== */
522 /* Online html documentation available at */
523 /* http://www.netlib.org/lapack/explore-html/ */
526 /* > Download ZHETRS2 + dependencies */
527 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zhetrs2
530 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zhetrs2
533 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zhetrs2
541 /* SUBROUTINE ZHETRS2( UPLO, N, NRHS, A, LDA, IPIV, B, LDB, */
545 /* INTEGER INFO, LDA, LDB, N, NRHS */
546 /* INTEGER IPIV( * ) */
547 /* COMPLEX*16 A( LDA, * ), B( LDB, * ), WORK( * ) */
550 /* > \par Purpose: */
555 /* > ZHETRS2 solves a system of linear equations A*X = B with a complex */
556 /* > Hermitian matrix A using the factorization A = U*D*U**H or */
557 /* > A = L*D*L**H computed by ZHETRF and converted by ZSYCONV. */
563 /* > \param[in] UPLO */
565 /* > UPLO is CHARACTER*1 */
566 /* > Specifies whether the details of the factorization are stored */
567 /* > as an upper or lower triangular matrix. */
568 /* > = 'U': Upper triangular, form is A = U*D*U**H; */
569 /* > = 'L': Lower triangular, form is A = L*D*L**H. */
575 /* > The order of the matrix A. N >= 0. */
578 /* > \param[in] NRHS */
580 /* > NRHS is INTEGER */
581 /* > The number of right hand sides, i.e., the number of columns */
582 /* > of the matrix B. NRHS >= 0. */
587 /* > A is COMPLEX*16 array, dimension (LDA,N) */
588 /* > The block diagonal matrix D and the multipliers used to */
589 /* > obtain the factor U or L as computed by ZHETRF. */
592 /* > \param[in] LDA */
594 /* > LDA is INTEGER */
595 /* > The leading dimension of the array A. LDA >= f2cmax(1,N). */
598 /* > \param[in] IPIV */
600 /* > IPIV is INTEGER array, dimension (N) */
601 /* > Details of the interchanges and the block structure of D */
602 /* > as determined by ZHETRF. */
605 /* > \param[in,out] B */
607 /* > B is COMPLEX*16 array, dimension (LDB,NRHS) */
608 /* > On entry, the right hand side matrix B. */
609 /* > On exit, the solution matrix X. */
612 /* > \param[in] LDB */
614 /* > LDB is INTEGER */
615 /* > The leading dimension of the array B. LDB >= f2cmax(1,N). */
618 /* > \param[out] WORK */
620 /* > WORK is COMPLEX*16 array, dimension (N) */
623 /* > \param[out] INFO */
625 /* > INFO is INTEGER */
626 /* > = 0: successful exit */
627 /* > < 0: if INFO = -i, the i-th argument had an illegal value */
633 /* > \author Univ. of Tennessee */
634 /* > \author Univ. of California Berkeley */
635 /* > \author Univ. of Colorado Denver */
636 /* > \author NAG Ltd. */
638 /* > \date June 2016 */
640 /* > \ingroup complex16HEcomputational */
642 /* ===================================================================== */
643 /* Subroutine */ int zhetrs2_(char *uplo, integer *n, integer *nrhs,
644 doublecomplex *a, integer *lda, integer *ipiv, doublecomplex *b,
645 integer *ldb, doublecomplex *work, integer *info)
647 /* System generated locals */
648 integer a_dim1, a_offset, b_dim1, b_offset, i__1, i__2;
649 doublecomplex z__1, z__2, z__3;
651 /* Local variables */
655 extern logical lsame_(char *, char *);
659 extern /* Subroutine */ int zswap_(integer *, doublecomplex *, integer *,
660 doublecomplex *, integer *), ztrsm_(char *, char *, char *, char *
661 , integer *, integer *, doublecomplex *, doublecomplex *, integer
662 *, doublecomplex *, integer *);
663 doublecomplex ak, bk;
665 extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen), zdscal_(
666 integer *, doublereal *, doublecomplex *, integer *);
667 doublecomplex akm1, bkm1;
668 extern /* Subroutine */ int zsyconv_(char *, char *, integer *,
669 doublecomplex *, integer *, integer *, doublecomplex *, integer *);
672 /* -- LAPACK computational routine (version 3.7.0) -- */
673 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
674 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
678 /* ===================================================================== */
681 /* Parameter adjustments */
683 a_offset = 1 + a_dim1 * 1;
687 b_offset = 1 + b_dim1 * 1;
693 upper = lsame_(uplo, "U");
694 if (! upper && ! lsame_(uplo, "L")) {
698 } else if (*nrhs < 0) {
700 } else if (*lda < f2cmax(1,*n)) {
702 } else if (*ldb < f2cmax(1,*n)) {
707 xerbla_("ZHETRS2", &i__1, (ftnlen)7);
711 /* Quick return if possible */
713 if (*n == 0 || *nrhs == 0) {
719 zsyconv_(uplo, "C", n, &a[a_offset], lda, &ipiv[1], &work[1], &iinfo);
723 /* Solve A*X = B, where A = U*D*U**H. */
729 /* 1 x 1 diagonal block */
730 /* Interchange rows K and IPIV(K). */
733 zswap_(nrhs, &b[k + b_dim1], ldb, &b[kp + b_dim1], ldb);
737 /* 2 x 2 diagonal block */
738 /* Interchange rows K-1 and -IPIV(K). */
740 if (kp == -ipiv[k - 1]) {
741 zswap_(nrhs, &b[k - 1 + b_dim1], ldb, &b[kp + b_dim1],
748 /* Compute (U \P**T * B) -> B [ (U \P**T * B) ] */
750 ztrsm_("L", "U", "N", "U", n, nrhs, &c_b1, &a[a_offset], lda, &b[
753 /* Compute D \ B -> B [ D \ (U \P**T * B) ] */
758 i__1 = i__ + i__ * a_dim1;
760 zdscal_(nrhs, &s, &b[i__ + b_dim1], ldb);
761 } else if (i__ > 1) {
762 if (ipiv[i__ - 1] == ipiv[i__]) {
764 akm1k.r = work[i__1].r, akm1k.i = work[i__1].i;
765 z_div(&z__1, &a[i__ - 1 + (i__ - 1) * a_dim1], &akm1k);
766 akm1.r = z__1.r, akm1.i = z__1.i;
767 d_cnjg(&z__2, &akm1k);
768 z_div(&z__1, &a[i__ + i__ * a_dim1], &z__2);
769 ak.r = z__1.r, ak.i = z__1.i;
770 z__2.r = akm1.r * ak.r - akm1.i * ak.i, z__2.i = akm1.r *
771 ak.i + akm1.i * ak.r;
772 z__1.r = z__2.r - 1., z__1.i = z__2.i + 0.;
773 denom.r = z__1.r, denom.i = z__1.i;
775 for (j = 1; j <= i__1; ++j) {
776 z_div(&z__1, &b[i__ - 1 + j * b_dim1], &akm1k);
777 bkm1.r = z__1.r, bkm1.i = z__1.i;
778 d_cnjg(&z__2, &akm1k);
779 z_div(&z__1, &b[i__ + j * b_dim1], &z__2);
780 bk.r = z__1.r, bk.i = z__1.i;
781 i__2 = i__ - 1 + j * b_dim1;
782 z__3.r = ak.r * bkm1.r - ak.i * bkm1.i, z__3.i = ak.r
783 * bkm1.i + ak.i * bkm1.r;
784 z__2.r = z__3.r - bk.r, z__2.i = z__3.i - bk.i;
785 z_div(&z__1, &z__2, &denom);
786 b[i__2].r = z__1.r, b[i__2].i = z__1.i;
787 i__2 = i__ + j * b_dim1;
788 z__3.r = akm1.r * bk.r - akm1.i * bk.i, z__3.i =
789 akm1.r * bk.i + akm1.i * bk.r;
790 z__2.r = z__3.r - bkm1.r, z__2.i = z__3.i - bkm1.i;
791 z_div(&z__1, &z__2, &denom);
792 b[i__2].r = z__1.r, b[i__2].i = z__1.i;
801 /* Compute (U**H \ B) -> B [ U**H \ (D \ (U \P**T * B) ) ] */
803 ztrsm_("L", "U", "C", "U", n, nrhs, &c_b1, &a[a_offset], lda, &b[
806 /* P * B [ P * (U**H \ (D \ (U \P**T * B) )) ] */
811 /* 1 x 1 diagonal block */
812 /* Interchange rows K and IPIV(K). */
815 zswap_(nrhs, &b[k + b_dim1], ldb, &b[kp + b_dim1], ldb);
819 /* 2 x 2 diagonal block */
820 /* Interchange rows K-1 and -IPIV(K). */
822 if (k < *n && kp == -ipiv[k + 1]) {
823 zswap_(nrhs, &b[k + b_dim1], ldb, &b[kp + b_dim1], ldb);
831 /* Solve A*X = B, where A = L*D*L**H. */
837 /* 1 x 1 diagonal block */
838 /* Interchange rows K and IPIV(K). */
841 zswap_(nrhs, &b[k + b_dim1], ldb, &b[kp + b_dim1], ldb);
845 /* 2 x 2 diagonal block */
846 /* Interchange rows K and -IPIV(K+1). */
848 if (kp == -ipiv[k]) {
849 zswap_(nrhs, &b[k + 1 + b_dim1], ldb, &b[kp + b_dim1],
856 /* Compute (L \P**T * B) -> B [ (L \P**T * B) ] */
858 ztrsm_("L", "L", "N", "U", n, nrhs, &c_b1, &a[a_offset], lda, &b[
861 /* Compute D \ B -> B [ D \ (L \P**T * B) ] */
866 i__1 = i__ + i__ * a_dim1;
868 zdscal_(nrhs, &s, &b[i__ + b_dim1], ldb);
871 akm1k.r = work[i__1].r, akm1k.i = work[i__1].i;
872 d_cnjg(&z__2, &akm1k);
873 z_div(&z__1, &a[i__ + i__ * a_dim1], &z__2);
874 akm1.r = z__1.r, akm1.i = z__1.i;
875 z_div(&z__1, &a[i__ + 1 + (i__ + 1) * a_dim1], &akm1k);
876 ak.r = z__1.r, ak.i = z__1.i;
877 z__2.r = akm1.r * ak.r - akm1.i * ak.i, z__2.i = akm1.r *
878 ak.i + akm1.i * ak.r;
879 z__1.r = z__2.r - 1., z__1.i = z__2.i + 0.;
880 denom.r = z__1.r, denom.i = z__1.i;
882 for (j = 1; j <= i__1; ++j) {
883 d_cnjg(&z__2, &akm1k);
884 z_div(&z__1, &b[i__ + j * b_dim1], &z__2);
885 bkm1.r = z__1.r, bkm1.i = z__1.i;
886 z_div(&z__1, &b[i__ + 1 + j * b_dim1], &akm1k);
887 bk.r = z__1.r, bk.i = z__1.i;
888 i__2 = i__ + j * b_dim1;
889 z__3.r = ak.r * bkm1.r - ak.i * bkm1.i, z__3.i = ak.r *
890 bkm1.i + ak.i * bkm1.r;
891 z__2.r = z__3.r - bk.r, z__2.i = z__3.i - bk.i;
892 z_div(&z__1, &z__2, &denom);
893 b[i__2].r = z__1.r, b[i__2].i = z__1.i;
894 i__2 = i__ + 1 + j * b_dim1;
895 z__3.r = akm1.r * bk.r - akm1.i * bk.i, z__3.i = akm1.r *
896 bk.i + akm1.i * bk.r;
897 z__2.r = z__3.r - bkm1.r, z__2.i = z__3.i - bkm1.i;
898 z_div(&z__1, &z__2, &denom);
899 b[i__2].r = z__1.r, b[i__2].i = z__1.i;
907 /* Compute (L**H \ B) -> B [ L**H \ (D \ (L \P**T * B) ) ] */
909 ztrsm_("L", "L", "C", "U", n, nrhs, &c_b1, &a[a_offset], lda, &b[
912 /* P * B [ P * (L**H \ (D \ (L \P**T * B) )) ] */
917 /* 1 x 1 diagonal block */
918 /* Interchange rows K and IPIV(K). */
921 zswap_(nrhs, &b[k + b_dim1], ldb, &b[kp + b_dim1], ldb);
925 /* 2 x 2 diagonal block */
926 /* Interchange rows K-1 and -IPIV(K). */
928 if (k > 1 && kp == -ipiv[k - 1]) {
929 zswap_(nrhs, &b[k + b_dim1], ldb, &b[kp + b_dim1], ldb);
939 zsyconv_(uplo, "R", n, &a[a_offset], lda, &ipiv[1], &work[1], &iinfo);