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 complex c_b2 = {0.f,0.f};
518 /* > \brief \b CHETRI_3X */
520 /* =========== DOCUMENTATION =========== */
522 /* Online html documentation available at */
523 /* http://www.netlib.org/lapack/explore-html/ */
526 /* > Download CHETRI_3X + dependencies */
527 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/chetri_
530 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/chetri_
533 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/chetri_
541 /* SUBROUTINE CHETRI_3X( UPLO, N, A, LDA, E, IPIV, WORK, NB, INFO ) */
544 /* INTEGER INFO, LDA, N, NB */
545 /* INTEGER IPIV( * ) */
546 /* COMPLEX A( LDA, * ), E( * ), WORK( N+NB+1, * ) */
549 /* > \par Purpose: */
553 /* > CHETRI_3X computes the inverse of a complex Hermitian indefinite */
554 /* > matrix A using the factorization computed by CHETRF_RK or CHETRF_BK: */
556 /* > A = P*U*D*(U**H)*(P**T) or A = P*L*D*(L**H)*(P**T), */
558 /* > where U (or L) is unit upper (or lower) triangular matrix, */
559 /* > U**H (or L**H) is the conjugate of U (or L), P is a permutation */
560 /* > matrix, P**T is the transpose of P, and D is Hermitian and block */
561 /* > diagonal with 1-by-1 and 2-by-2 diagonal blocks. */
563 /* > This is the blocked version of the algorithm, calling Level 3 BLAS. */
569 /* > \param[in] UPLO */
571 /* > UPLO is CHARACTER*1 */
572 /* > Specifies whether the details of the factorization are */
573 /* > stored as an upper or lower triangular matrix. */
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 COMPLEX array, dimension (LDA,N) */
587 /* > On entry, diagonal of the block diagonal matrix D and */
588 /* > factors U or L as computed by CHETRF_RK and CHETRF_BK: */
589 /* > a) ONLY diagonal elements of the Hermitian block diagonal */
590 /* > matrix D on the diagonal of A, i.e. D(k,k) = A(k,k); */
591 /* > (superdiagonal (or subdiagonal) elements of D */
592 /* > should be provided on entry in array E), and */
593 /* > b) If UPLO = 'U': factor U in the superdiagonal part of A. */
594 /* > If UPLO = 'L': factor L in the subdiagonal part of A. */
596 /* > On exit, if INFO = 0, the Hermitian inverse of the original */
598 /* > If UPLO = 'U': the upper triangular part of the inverse */
599 /* > is formed and the part of A below the diagonal is not */
601 /* > If UPLO = 'L': the lower triangular part of the inverse */
602 /* > is formed and the part of A above the diagonal is not */
606 /* > \param[in] LDA */
608 /* > LDA is INTEGER */
609 /* > The leading dimension of the array A. LDA >= f2cmax(1,N). */
614 /* > E is COMPLEX array, dimension (N) */
615 /* > On entry, contains the superdiagonal (or subdiagonal) */
616 /* > elements of the Hermitian block diagonal matrix D */
617 /* > with 1-by-1 or 2-by-2 diagonal blocks, where */
618 /* > If UPLO = 'U': E(i) = D(i-1,i), i=2:N, E(1) not referenced; */
619 /* > If UPLO = 'L': E(i) = D(i+1,i), i=1:N-1, E(N) not referenced. */
621 /* > NOTE: For 1-by-1 diagonal block D(k), where */
622 /* > 1 <= k <= N, the element E(k) is not referenced in both */
623 /* > UPLO = 'U' or UPLO = 'L' cases. */
626 /* > \param[in] IPIV */
628 /* > IPIV is INTEGER array, dimension (N) */
629 /* > Details of the interchanges and the block structure of D */
630 /* > as determined by CHETRF_RK or CHETRF_BK. */
633 /* > \param[out] WORK */
635 /* > WORK is COMPLEX array, dimension (N+NB+1,NB+3). */
638 /* > \param[in] NB */
640 /* > NB is INTEGER */
644 /* > \param[out] INFO */
646 /* > INFO is INTEGER */
647 /* > = 0: successful exit */
648 /* > < 0: if INFO = -i, the i-th argument had an illegal value */
649 /* > > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its */
650 /* > inverse could not be computed. */
656 /* > \author Univ. of Tennessee */
657 /* > \author Univ. of California Berkeley */
658 /* > \author Univ. of Colorado Denver */
659 /* > \author NAG Ltd. */
661 /* > \date June 2017 */
663 /* > \ingroup complexHEcomputational */
665 /* > \par Contributors: */
666 /* ================== */
669 /* > June 2017, Igor Kozachenko, */
670 /* > Computer Science Division, */
671 /* > University of California, Berkeley */
675 /* ===================================================================== */
676 /* Subroutine */ int chetri_3x_(char *uplo, integer *n, complex *a, integer *
677 lda, complex *e, integer *ipiv, complex *work, integer *nb, integer *
680 /* System generated locals */
681 integer a_dim1, a_offset, work_dim1, work_offset, i__1, i__2, i__3, i__4,
684 complex q__1, q__2, q__3;
686 /* Local variables */
688 extern /* Subroutine */ int cheswapr_(char *, integer *, complex *,
689 integer *, integer *, integer *);
693 extern /* Subroutine */ int cgemm_(char *, char *, integer *, integer *,
694 integer *, complex *, complex *, integer *, complex *, integer *,
695 complex *, complex *, integer *);
696 extern logical lsame_(char *, char *);
697 extern /* Subroutine */ int ctrmm_(char *, char *, char *, char *,
698 integer *, integer *, complex *, complex *, integer *, complex *,
706 extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
708 extern /* Subroutine */ int ctrtri_(char *, char *, integer *, complex *,
709 integer *, integer *);
712 complex u01_ip1_j__, u11_ip1_j__;
715 /* -- LAPACK computational routine (version 3.7.1) -- */
716 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
717 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
721 /* ===================================================================== */
724 /* Test the input parameters. */
726 /* Parameter adjustments */
728 a_offset = 1 + a_dim1 * 1;
732 work_dim1 = *n + *nb + 1;
733 work_offset = 1 + work_dim1 * 1;
738 upper = lsame_(uplo, "U");
739 if (! upper && ! lsame_(uplo, "L")) {
743 } else if (*lda < f2cmax(1,*n)) {
747 /* Quick return if possible */
751 xerbla_("CHETRI_3X", &i__1, (ftnlen)9);
758 /* Workspace got Non-diag elements of D */
761 for (k = 1; k <= i__1; ++k) {
762 i__2 = k + work_dim1;
764 work[i__2].r = e[i__3].r, work[i__2].i = e[i__3].i;
767 /* Check that the diagonal matrix D is nonsingular. */
771 /* Upper triangular storage: examine D from bottom to top */
773 for (*info = *n; *info >= 1; --(*info)) {
774 i__1 = *info + *info * a_dim1;
775 if (ipiv[*info] > 0 && (a[i__1].r == 0.f && a[i__1].i == 0.f)) {
781 /* Lower triangular storage: examine D from top to bottom. */
784 for (*info = 1; *info <= i__1; ++(*info)) {
785 i__2 = *info + *info * a_dim1;
786 if (ipiv[*info] > 0 && (a[i__2].r == 0.f && a[i__2].i == 0.f)) {
794 /* Splitting Workspace */
795 /* U01 is a block ( N, NB+1 ) */
796 /* The first element of U01 is in WORK( 1, 1 ) */
797 /* U11 is a block ( NB+1, NB+1 ) */
798 /* The first element of U11 is in WORK( N+1, 1 ) */
802 /* INVD is a block ( N, 2 ) */
803 /* The first element of INVD is in WORK( 1, INVD ) */
810 /* invA = P * inv(U**H) * inv(D) * inv(U) * P**T. */
812 ctrtri_(uplo, "U", n, &a[a_offset], lda, info);
814 /* inv(D) and inv(D) * inv(U) */
819 /* 1 x 1 diagonal NNB */
820 i__1 = k + invd * work_dim1;
821 i__2 = k + k * a_dim1;
822 r__1 = 1.f / a[i__2].r;
823 work[i__1].r = r__1, work[i__1].i = 0.f;
824 i__1 = k + (invd + 1) * work_dim1;
825 work[i__1].r = 0.f, work[i__1].i = 0.f;
827 /* 2 x 2 diagonal NNB */
828 t = c_abs(&work[k + 1 + work_dim1]);
829 i__1 = k + k * a_dim1;
831 i__1 = k + 1 + (k + 1) * a_dim1;
832 akp1 = a[i__1].r / t;
833 i__1 = k + 1 + work_dim1;
834 q__1.r = work[i__1].r / t, q__1.i = work[i__1].i / t;
835 akkp1.r = q__1.r, akkp1.i = q__1.i;
837 q__2.r = r__1 - 1.f, q__2.i = 0.f;
838 q__1.r = t * q__2.r, q__1.i = t * q__2.i;
839 d__.r = q__1.r, d__.i = q__1.i;
840 i__1 = k + invd * work_dim1;
841 q__2.r = akp1, q__2.i = 0.f;
842 c_div(&q__1, &q__2, &d__);
843 work[i__1].r = q__1.r, work[i__1].i = q__1.i;
844 i__1 = k + 1 + (invd + 1) * work_dim1;
845 q__2.r = ak, q__2.i = 0.f;
846 c_div(&q__1, &q__2, &d__);
847 work[i__1].r = q__1.r, work[i__1].i = q__1.i;
848 i__1 = k + (invd + 1) * work_dim1;
849 q__2.r = -akkp1.r, q__2.i = -akkp1.i;
850 c_div(&q__1, &q__2, &d__);
851 work[i__1].r = q__1.r, work[i__1].i = q__1.i;
852 i__1 = k + 1 + invd * work_dim1;
853 r_cnjg(&q__1, &work[k + (invd + 1) * work_dim1]);
854 work[i__1].r = q__1.r, work[i__1].i = q__1.i;
860 /* inv(U**H) = (inv(U))**H */
862 /* inv(U**H) * inv(D) * inv(U) */
871 /* count negative elements, */
873 for (i__ = cut + 1 - nnb; i__ <= i__1; ++i__) {
878 /* need a even number for a clear cut */
879 if (icount % 2 == 1) {
888 for (i__ = 1; i__ <= i__1; ++i__) {
890 for (j = 1; j <= i__2; ++j) {
891 i__3 = i__ + j * work_dim1;
892 i__4 = i__ + (cut + j) * a_dim1;
893 work[i__3].r = a[i__4].r, work[i__3].i = a[i__4].i;
900 for (i__ = 1; i__ <= i__1; ++i__) {
901 i__2 = u11 + i__ + i__ * work_dim1;
902 work[i__2].r = 1.f, work[i__2].i = 0.f;
904 for (j = 1; j <= i__2; ++j) {
905 i__3 = u11 + i__ + j * work_dim1;
906 work[i__3].r = 0.f, work[i__3].i = 0.f;
909 for (j = i__ + 1; j <= i__2; ++j) {
910 i__3 = u11 + i__ + j * work_dim1;
911 i__4 = cut + i__ + (cut + j) * a_dim1;
912 work[i__3].r = a[i__4].r, work[i__3].i = a[i__4].i;
922 for (j = 1; j <= i__1; ++j) {
923 i__2 = i__ + j * work_dim1;
924 i__3 = i__ + invd * work_dim1;
925 i__4 = i__ + j * work_dim1;
926 q__1.r = work[i__3].r * work[i__4].r - work[i__3].i *
927 work[i__4].i, q__1.i = work[i__3].r * work[
928 i__4].i + work[i__3].i * work[i__4].r;
929 work[i__2].r = q__1.r, work[i__2].i = q__1.i;
933 for (j = 1; j <= i__1; ++j) {
934 i__2 = i__ + j * work_dim1;
935 u01_i_j__.r = work[i__2].r, u01_i_j__.i = work[i__2]
937 i__2 = i__ + 1 + j * work_dim1;
938 u01_ip1_j__.r = work[i__2].r, u01_ip1_j__.i = work[
940 i__2 = i__ + j * work_dim1;
941 i__3 = i__ + invd * work_dim1;
942 q__2.r = work[i__3].r * u01_i_j__.r - work[i__3].i *
943 u01_i_j__.i, q__2.i = work[i__3].r *
944 u01_i_j__.i + work[i__3].i * u01_i_j__.r;
945 i__4 = i__ + (invd + 1) * work_dim1;
946 q__3.r = work[i__4].r * u01_ip1_j__.r - work[i__4].i *
947 u01_ip1_j__.i, q__3.i = work[i__4].r *
948 u01_ip1_j__.i + work[i__4].i * u01_ip1_j__.r;
949 q__1.r = q__2.r + q__3.r, q__1.i = q__2.i + q__3.i;
950 work[i__2].r = q__1.r, work[i__2].i = q__1.i;
951 i__2 = i__ + 1 + j * work_dim1;
952 i__3 = i__ + 1 + invd * work_dim1;
953 q__2.r = work[i__3].r * u01_i_j__.r - work[i__3].i *
954 u01_i_j__.i, q__2.i = work[i__3].r *
955 u01_i_j__.i + work[i__3].i * u01_i_j__.r;
956 i__4 = i__ + 1 + (invd + 1) * work_dim1;
957 q__3.r = work[i__4].r * u01_ip1_j__.r - work[i__4].i *
958 u01_ip1_j__.i, q__3.i = work[i__4].r *
959 u01_ip1_j__.i + work[i__4].i * u01_ip1_j__.r;
960 q__1.r = q__2.r + q__3.r, q__1.i = q__2.i + q__3.i;
961 work[i__2].r = q__1.r, work[i__2].i = q__1.i;
972 if (ipiv[cut + i__] > 0) {
974 for (j = i__; j <= i__1; ++j) {
975 i__2 = u11 + i__ + j * work_dim1;
976 i__3 = cut + i__ + invd * work_dim1;
977 i__4 = u11 + i__ + j * work_dim1;
978 q__1.r = work[i__3].r * work[i__4].r - work[i__3].i *
979 work[i__4].i, q__1.i = work[i__3].r * work[
980 i__4].i + work[i__3].i * work[i__4].r;
981 work[i__2].r = q__1.r, work[i__2].i = q__1.i;
985 for (j = i__; j <= i__1; ++j) {
986 i__2 = u11 + i__ + j * work_dim1;
987 u11_i_j__.r = work[i__2].r, u11_i_j__.i = work[i__2]
989 i__2 = u11 + i__ + 1 + j * work_dim1;
990 u11_ip1_j__.r = work[i__2].r, u11_ip1_j__.i = work[
992 i__2 = u11 + i__ + j * work_dim1;
993 i__3 = cut + i__ + invd * work_dim1;
994 i__4 = u11 + i__ + j * work_dim1;
995 q__2.r = work[i__3].r * work[i__4].r - work[i__3].i *
996 work[i__4].i, q__2.i = work[i__3].r * work[
997 i__4].i + work[i__3].i * work[i__4].r;
998 i__5 = cut + i__ + (invd + 1) * work_dim1;
999 i__6 = u11 + i__ + 1 + j * work_dim1;
1000 q__3.r = work[i__5].r * work[i__6].r - work[i__5].i *
1001 work[i__6].i, q__3.i = work[i__5].r * work[
1002 i__6].i + work[i__5].i * work[i__6].r;
1003 q__1.r = q__2.r + q__3.r, q__1.i = q__2.i + q__3.i;
1004 work[i__2].r = q__1.r, work[i__2].i = q__1.i;
1005 i__2 = u11 + i__ + 1 + j * work_dim1;
1006 i__3 = cut + i__ + 1 + invd * work_dim1;
1007 q__2.r = work[i__3].r * u11_i_j__.r - work[i__3].i *
1008 u11_i_j__.i, q__2.i = work[i__3].r *
1009 u11_i_j__.i + work[i__3].i * u11_i_j__.r;
1010 i__4 = cut + i__ + 1 + (invd + 1) * work_dim1;
1011 q__3.r = work[i__4].r * u11_ip1_j__.r - work[i__4].i *
1012 u11_ip1_j__.i, q__3.i = work[i__4].r *
1013 u11_ip1_j__.i + work[i__4].i * u11_ip1_j__.r;
1014 q__1.r = q__2.r + q__3.r, q__1.i = q__2.i + q__3.i;
1015 work[i__2].r = q__1.r, work[i__2].i = q__1.i;
1022 /* U11**H * invD1 * U11 -> U11 */
1024 i__1 = *n + *nb + 1;
1025 ctrmm_("L", "U", "C", "U", &nnb, &nnb, &c_b1, &a[cut + 1 + (cut +
1026 1) * a_dim1], lda, &work[u11 + 1 + work_dim1], &i__1);
1029 for (i__ = 1; i__ <= i__1; ++i__) {
1031 for (j = i__; j <= i__2; ++j) {
1032 i__3 = cut + i__ + (cut + j) * a_dim1;
1033 i__4 = u11 + i__ + j * work_dim1;
1034 a[i__3].r = work[i__4].r, a[i__3].i = work[i__4].i;
1038 /* U01**H * invD * U01 -> A( CUT+I, CUT+J ) */
1040 i__1 = *n + *nb + 1;
1041 i__2 = *n + *nb + 1;
1042 cgemm_("C", "N", &nnb, &nnb, &cut, &c_b1, &a[(cut + 1) * a_dim1 +
1043 1], lda, &work[work_offset], &i__1, &c_b2, &work[u11 + 1
1044 + work_dim1], &i__2);
1046 /* U11 = U11**H * invD1 * U11 + U01**H * invD * U01 */
1049 for (i__ = 1; i__ <= i__1; ++i__) {
1051 for (j = i__; j <= i__2; ++j) {
1052 i__3 = cut + i__ + (cut + j) * a_dim1;
1053 i__4 = cut + i__ + (cut + j) * a_dim1;
1054 i__5 = u11 + i__ + j * work_dim1;
1055 q__1.r = a[i__4].r + work[i__5].r, q__1.i = a[i__4].i +
1057 a[i__3].r = q__1.r, a[i__3].i = q__1.i;
1061 /* U01 = U00**H * invD0 * U01 */
1063 i__1 = *n + *nb + 1;
1064 ctrmm_("L", uplo, "C", "U", &cut, &nnb, &c_b1, &a[a_offset], lda,
1065 &work[work_offset], &i__1);
1070 for (i__ = 1; i__ <= i__1; ++i__) {
1072 for (j = 1; j <= i__2; ++j) {
1073 i__3 = i__ + (cut + j) * a_dim1;
1074 i__4 = i__ + j * work_dim1;
1075 a[i__3].r = work[i__4].r, a[i__3].i = work[i__4].i;
1083 /* Apply PERMUTATIONS P and P**T: */
1084 /* P * inv(U**H) * inv(D) * inv(U) * P**T. */
1085 /* Interchange rows and columns I and IPIV(I) in reverse order */
1086 /* from the formation order of IPIV vector for Upper case. */
1088 /* ( We can use a loop over IPIV with increment 1, */
1089 /* since the ABS value of IPIV(I) represents the row (column) */
1090 /* index of the interchange with row (column) i in both 1x1 */
1091 /* and 2x2 pivot cases, i.e. we don't need separate code branches */
1092 /* for 1x1 and 2x2 pivot cases ) */
1095 for (i__ = 1; i__ <= i__1; ++i__) {
1096 ip = (i__2 = ipiv[i__], abs(i__2));
1099 cheswapr_(uplo, n, &a[a_offset], lda, &i__, &ip);
1102 cheswapr_(uplo, n, &a[a_offset], lda, &ip, &i__);
1111 /* inv A = P * inv(L**H) * inv(D) * inv(L) * P**T. */
1113 ctrtri_(uplo, "U", n, &a[a_offset], lda, info);
1115 /* inv(D) and inv(D) * inv(L) */
1120 /* 1 x 1 diagonal NNB */
1121 i__1 = k + invd * work_dim1;
1122 i__2 = k + k * a_dim1;
1123 r__1 = 1.f / a[i__2].r;
1124 work[i__1].r = r__1, work[i__1].i = 0.f;
1125 i__1 = k + (invd + 1) * work_dim1;
1126 work[i__1].r = 0.f, work[i__1].i = 0.f;
1128 /* 2 x 2 diagonal NNB */
1129 t = c_abs(&work[k - 1 + work_dim1]);
1130 i__1 = k - 1 + (k - 1) * a_dim1;
1132 i__1 = k + k * a_dim1;
1133 akp1 = a[i__1].r / t;
1134 i__1 = k - 1 + work_dim1;
1135 q__1.r = work[i__1].r / t, q__1.i = work[i__1].i / t;
1136 akkp1.r = q__1.r, akkp1.i = q__1.i;
1138 q__2.r = r__1 - 1.f, q__2.i = 0.f;
1139 q__1.r = t * q__2.r, q__1.i = t * q__2.i;
1140 d__.r = q__1.r, d__.i = q__1.i;
1141 i__1 = k - 1 + invd * work_dim1;
1142 q__2.r = akp1, q__2.i = 0.f;
1143 c_div(&q__1, &q__2, &d__);
1144 work[i__1].r = q__1.r, work[i__1].i = q__1.i;
1145 i__1 = k + invd * work_dim1;
1146 q__2.r = ak, q__2.i = 0.f;
1147 c_div(&q__1, &q__2, &d__);
1148 work[i__1].r = q__1.r, work[i__1].i = q__1.i;
1149 i__1 = k + (invd + 1) * work_dim1;
1150 q__2.r = -akkp1.r, q__2.i = -akkp1.i;
1151 c_div(&q__1, &q__2, &d__);
1152 work[i__1].r = q__1.r, work[i__1].i = q__1.i;
1153 i__1 = k - 1 + (invd + 1) * work_dim1;
1154 r_cnjg(&q__1, &work[k + (invd + 1) * work_dim1]);
1155 work[i__1].r = q__1.r, work[i__1].i = q__1.i;
1161 /* inv(L**H) = (inv(L))**H */
1163 /* inv(L**H) * inv(D) * inv(L) */
1168 if (cut + nnb > *n) {
1172 /* count negative elements, */
1174 for (i__ = cut + 1; i__ <= i__1; ++i__) {
1175 if (ipiv[i__] < 0) {
1179 /* need a even number for a clear cut */
1180 if (icount % 2 == 1) {
1187 i__1 = *n - cut - nnb;
1188 for (i__ = 1; i__ <= i__1; ++i__) {
1190 for (j = 1; j <= i__2; ++j) {
1191 i__3 = i__ + j * work_dim1;
1192 i__4 = cut + nnb + i__ + (cut + j) * a_dim1;
1193 work[i__3].r = a[i__4].r, work[i__3].i = a[i__4].i;
1200 for (i__ = 1; i__ <= i__1; ++i__) {
1201 i__2 = u11 + i__ + i__ * work_dim1;
1202 work[i__2].r = 1.f, work[i__2].i = 0.f;
1204 for (j = i__ + 1; j <= i__2; ++j) {
1205 i__3 = u11 + i__ + j * work_dim1;
1206 work[i__3].r = 0.f, work[i__3].i = 0.f;
1209 for (j = 1; j <= i__2; ++j) {
1210 i__3 = u11 + i__ + j * work_dim1;
1211 i__4 = cut + i__ + (cut + j) * a_dim1;
1212 work[i__3].r = a[i__4].r, work[i__3].i = a[i__4].i;
1218 i__ = *n - cut - nnb;
1220 if (ipiv[cut + nnb + i__] > 0) {
1222 for (j = 1; j <= i__1; ++j) {
1223 i__2 = i__ + j * work_dim1;
1224 i__3 = cut + nnb + i__ + invd * work_dim1;
1225 i__4 = i__ + j * work_dim1;
1226 q__1.r = work[i__3].r * work[i__4].r - work[i__3].i *
1227 work[i__4].i, q__1.i = work[i__3].r * work[
1228 i__4].i + work[i__3].i * work[i__4].r;
1229 work[i__2].r = q__1.r, work[i__2].i = q__1.i;
1233 for (j = 1; j <= i__1; ++j) {
1234 i__2 = i__ + j * work_dim1;
1235 u01_i_j__.r = work[i__2].r, u01_i_j__.i = work[i__2]
1237 i__2 = i__ - 1 + j * work_dim1;
1238 u01_ip1_j__.r = work[i__2].r, u01_ip1_j__.i = work[
1240 i__2 = i__ + j * work_dim1;
1241 i__3 = cut + nnb + i__ + invd * work_dim1;
1242 q__2.r = work[i__3].r * u01_i_j__.r - work[i__3].i *
1243 u01_i_j__.i, q__2.i = work[i__3].r *
1244 u01_i_j__.i + work[i__3].i * u01_i_j__.r;
1245 i__4 = cut + nnb + i__ + (invd + 1) * work_dim1;
1246 q__3.r = work[i__4].r * u01_ip1_j__.r - work[i__4].i *
1247 u01_ip1_j__.i, q__3.i = work[i__4].r *
1248 u01_ip1_j__.i + work[i__4].i * u01_ip1_j__.r;
1249 q__1.r = q__2.r + q__3.r, q__1.i = q__2.i + q__3.i;
1250 work[i__2].r = q__1.r, work[i__2].i = q__1.i;
1251 i__2 = i__ - 1 + j * work_dim1;
1252 i__3 = cut + nnb + i__ - 1 + (invd + 1) * work_dim1;
1253 q__2.r = work[i__3].r * u01_i_j__.r - work[i__3].i *
1254 u01_i_j__.i, q__2.i = work[i__3].r *
1255 u01_i_j__.i + work[i__3].i * u01_i_j__.r;
1256 i__4 = cut + nnb + i__ - 1 + invd * work_dim1;
1257 q__3.r = work[i__4].r * u01_ip1_j__.r - work[i__4].i *
1258 u01_ip1_j__.i, q__3.i = work[i__4].r *
1259 u01_ip1_j__.i + work[i__4].i * u01_ip1_j__.r;
1260 q__1.r = q__2.r + q__3.r, q__1.i = q__2.i + q__3.i;
1261 work[i__2].r = q__1.r, work[i__2].i = q__1.i;
1272 if (ipiv[cut + i__] > 0) {
1274 for (j = 1; j <= i__1; ++j) {
1275 i__2 = u11 + i__ + j * work_dim1;
1276 i__3 = cut + i__ + invd * work_dim1;
1277 i__4 = u11 + i__ + j * work_dim1;
1278 q__1.r = work[i__3].r * work[i__4].r - work[i__3].i *
1279 work[i__4].i, q__1.i = work[i__3].r * work[
1280 i__4].i + work[i__3].i * work[i__4].r;
1281 work[i__2].r = q__1.r, work[i__2].i = q__1.i;
1285 for (j = 1; j <= i__1; ++j) {
1286 i__2 = u11 + i__ + j * work_dim1;
1287 u11_i_j__.r = work[i__2].r, u11_i_j__.i = work[i__2]
1289 i__2 = u11 + i__ - 1 + j * work_dim1;
1290 u11_ip1_j__.r = work[i__2].r, u11_ip1_j__.i = work[
1292 i__2 = u11 + i__ + j * work_dim1;
1293 i__3 = cut + i__ + invd * work_dim1;
1294 i__4 = u11 + i__ + j * work_dim1;
1295 q__2.r = work[i__3].r * work[i__4].r - work[i__3].i *
1296 work[i__4].i, q__2.i = work[i__3].r * work[
1297 i__4].i + work[i__3].i * work[i__4].r;
1298 i__5 = cut + i__ + (invd + 1) * work_dim1;
1299 q__3.r = work[i__5].r * u11_ip1_j__.r - work[i__5].i *
1300 u11_ip1_j__.i, q__3.i = work[i__5].r *
1301 u11_ip1_j__.i + work[i__5].i * u11_ip1_j__.r;
1302 q__1.r = q__2.r + q__3.r, q__1.i = q__2.i + q__3.i;
1303 work[i__2].r = q__1.r, work[i__2].i = q__1.i;
1304 i__2 = u11 + i__ - 1 + j * work_dim1;
1305 i__3 = cut + i__ - 1 + (invd + 1) * work_dim1;
1306 q__2.r = work[i__3].r * u11_i_j__.r - work[i__3].i *
1307 u11_i_j__.i, q__2.i = work[i__3].r *
1308 u11_i_j__.i + work[i__3].i * u11_i_j__.r;
1309 i__4 = cut + i__ - 1 + invd * work_dim1;
1310 q__3.r = work[i__4].r * u11_ip1_j__.r - work[i__4].i *
1311 u11_ip1_j__.i, q__3.i = work[i__4].r *
1312 u11_ip1_j__.i + work[i__4].i * u11_ip1_j__.r;
1313 q__1.r = q__2.r + q__3.r, q__1.i = q__2.i + q__3.i;
1314 work[i__2].r = q__1.r, work[i__2].i = q__1.i;
1321 /* L11**H * invD1 * L11 -> L11 */
1323 i__1 = *n + *nb + 1;
1324 ctrmm_("L", uplo, "C", "U", &nnb, &nnb, &c_b1, &a[cut + 1 + (cut
1325 + 1) * a_dim1], lda, &work[u11 + 1 + work_dim1], &i__1);
1328 for (i__ = 1; i__ <= i__1; ++i__) {
1330 for (j = 1; j <= i__2; ++j) {
1331 i__3 = cut + i__ + (cut + j) * a_dim1;
1332 i__4 = u11 + i__ + j * work_dim1;
1333 a[i__3].r = work[i__4].r, a[i__3].i = work[i__4].i;
1337 if (cut + nnb < *n) {
1339 /* L21**H * invD2*L21 -> A( CUT+I, CUT+J ) */
1341 i__1 = *n - nnb - cut;
1342 i__2 = *n + *nb + 1;
1343 i__3 = *n + *nb + 1;
1344 cgemm_("C", "N", &nnb, &nnb, &i__1, &c_b1, &a[cut + nnb + 1 +
1345 (cut + 1) * a_dim1], lda, &work[work_offset], &i__2, &
1346 c_b2, &work[u11 + 1 + work_dim1], &i__3);
1348 /* L11 = L11**H * invD1 * L11 + U01**H * invD * U01 */
1351 for (i__ = 1; i__ <= i__1; ++i__) {
1353 for (j = 1; j <= i__2; ++j) {
1354 i__3 = cut + i__ + (cut + j) * a_dim1;
1355 i__4 = cut + i__ + (cut + j) * a_dim1;
1356 i__5 = u11 + i__ + j * work_dim1;
1357 q__1.r = a[i__4].r + work[i__5].r, q__1.i = a[i__4].i
1359 a[i__3].r = q__1.r, a[i__3].i = q__1.i;
1363 /* L01 = L22**H * invD2 * L21 */
1365 i__1 = *n - nnb - cut;
1366 i__2 = *n + *nb + 1;
1367 ctrmm_("L", uplo, "C", "U", &i__1, &nnb, &c_b1, &a[cut + nnb
1368 + 1 + (cut + nnb + 1) * a_dim1], lda, &work[
1369 work_offset], &i__2);
1373 i__1 = *n - cut - nnb;
1374 for (i__ = 1; i__ <= i__1; ++i__) {
1376 for (j = 1; j <= i__2; ++j) {
1377 i__3 = cut + nnb + i__ + (cut + j) * a_dim1;
1378 i__4 = i__ + j * work_dim1;
1379 a[i__3].r = work[i__4].r, a[i__3].i = work[i__4].i;
1385 /* L11 = L11**H * invD1 * L11 */
1388 for (i__ = 1; i__ <= i__1; ++i__) {
1390 for (j = 1; j <= i__2; ++j) {
1391 i__3 = cut + i__ + (cut + j) * a_dim1;
1392 i__4 = u11 + i__ + j * work_dim1;
1393 a[i__3].r = work[i__4].r, a[i__3].i = work[i__4].i;
1404 /* Apply PERMUTATIONS P and P**T: */
1405 /* P * inv(L**H) * inv(D) * inv(L) * P**T. */
1406 /* Interchange rows and columns I and IPIV(I) in reverse order */
1407 /* from the formation order of IPIV vector for Lower case. */
1409 /* ( We can use a loop over IPIV with increment -1, */
1410 /* since the ABS value of IPIV(I) represents the row (column) */
1411 /* index of the interchange with row (column) i in both 1x1 */
1412 /* and 2x2 pivot cases, i.e. we don't need separate code branches */
1413 /* for 1x1 and 2x2 pivot cases ) */
1415 for (i__ = *n; i__ >= 1; --i__) {
1416 ip = (i__1 = ipiv[i__], abs(i__1));
1419 cheswapr_(uplo, n, &a[a_offset], lda, &i__, &ip);
1422 cheswapr_(uplo, n, &a[a_offset], lda, &ip, &i__);
1431 /* End of CHETRI_3X */