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 /* > \brief <b> CGTSV computes the solution to system of linear equations A * X = B for GT matrices </b> */
515 /* =========== DOCUMENTATION =========== */
517 /* Online html documentation available at */
518 /* http://www.netlib.org/lapack/explore-html/ */
521 /* > Download CGTSV + dependencies */
522 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/cgtsv.f
525 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/cgtsv.f
528 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/cgtsv.f
536 /* SUBROUTINE CGTSV( N, NRHS, DL, D, DU, B, LDB, INFO ) */
538 /* INTEGER INFO, LDB, N, NRHS */
539 /* COMPLEX B( LDB, * ), D( * ), DL( * ), DU( * ) */
542 /* > \par Purpose: */
547 /* > CGTSV solves the equation */
551 /* > where A is an N-by-N tridiagonal matrix, by Gaussian elimination with */
552 /* > partial pivoting. */
554 /* > Note that the equation A**T *X = B may be solved by interchanging the */
555 /* > order of the arguments DU and DL. */
564 /* > The order of the matrix A. N >= 0. */
567 /* > \param[in] NRHS */
569 /* > NRHS is INTEGER */
570 /* > The number of right hand sides, i.e., the number of columns */
571 /* > of the matrix B. NRHS >= 0. */
574 /* > \param[in,out] DL */
576 /* > DL is COMPLEX array, dimension (N-1) */
577 /* > On entry, DL must contain the (n-1) subdiagonal elements of */
579 /* > On exit, DL is overwritten by the (n-2) elements of the */
580 /* > second superdiagonal of the upper triangular matrix U from */
581 /* > the LU factorization of A, in DL(1), ..., DL(n-2). */
584 /* > \param[in,out] D */
586 /* > D is COMPLEX array, dimension (N) */
587 /* > On entry, D must contain the diagonal elements of A. */
588 /* > On exit, D is overwritten by the n diagonal elements of U. */
591 /* > \param[in,out] DU */
593 /* > DU is COMPLEX array, dimension (N-1) */
594 /* > On entry, DU must contain the (n-1) superdiagonal elements */
596 /* > On exit, DU is overwritten by the (n-1) elements of the first */
597 /* > superdiagonal of U. */
600 /* > \param[in,out] B */
602 /* > B is COMPLEX array, dimension (LDB,NRHS) */
603 /* > On entry, the N-by-NRHS right hand side matrix B. */
604 /* > On exit, if INFO = 0, the N-by-NRHS solution matrix X. */
607 /* > \param[in] LDB */
609 /* > LDB is INTEGER */
610 /* > The leading dimension of the array B. LDB >= f2cmax(1,N). */
613 /* > \param[out] INFO */
615 /* > INFO is INTEGER */
616 /* > = 0: successful exit */
617 /* > < 0: if INFO = -i, the i-th argument had an illegal value */
618 /* > > 0: if INFO = i, U(i,i) is exactly zero, and the solution */
619 /* > has not been computed. The factorization has not been */
620 /* > completed unless i = N. */
626 /* > \author Univ. of Tennessee */
627 /* > \author Univ. of California Berkeley */
628 /* > \author Univ. of Colorado Denver */
629 /* > \author NAG Ltd. */
631 /* > \date December 2016 */
633 /* > \ingroup complexGTsolve */
635 /* ===================================================================== */
636 /* Subroutine */ int cgtsv_(integer *n, integer *nrhs, complex *dl, complex *
637 d__, complex *du, complex *b, integer *ldb, integer *info)
639 /* System generated locals */
640 integer b_dim1, b_offset, i__1, i__2, i__3, i__4, i__5, i__6, i__7;
641 real r__1, r__2, r__3, r__4;
642 complex q__1, q__2, q__3, q__4, q__5;
644 /* Local variables */
647 extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
650 /* -- LAPACK driver routine (version 3.7.0) -- */
651 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
652 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
656 /* ===================================================================== */
659 /* Parameter adjustments */
664 b_offset = 1 + b_dim1 * 1;
671 } else if (*nrhs < 0) {
673 } else if (*ldb < f2cmax(1,*n)) {
678 xerbla_("CGTSV ", &i__1, (ftnlen)6);
687 for (k = 1; k <= i__1; ++k) {
689 if (dl[i__2].r == 0.f && dl[i__2].i == 0.f) {
691 /* Subdiagonal is zero, no elimination is required. */
694 if (d__[i__2].r == 0.f && d__[i__2].i == 0.f) {
696 /* Diagonal is zero: set INFO = K and return; a unique */
697 /* solution can not be found. */
702 } else /* if(complicated condition) */ {
705 if ((r__1 = d__[i__2].r, abs(r__1)) + (r__2 = r_imag(&d__[k]),
706 abs(r__2)) >= (r__3 = dl[i__3].r, abs(r__3)) + (r__4 =
707 r_imag(&dl[k]), abs(r__4))) {
709 /* No row interchange required */
711 c_div(&q__1, &dl[k], &d__[k]);
712 mult.r = q__1.r, mult.i = q__1.i;
716 q__2.r = mult.r * du[i__4].r - mult.i * du[i__4].i, q__2.i =
717 mult.r * du[i__4].i + mult.i * du[i__4].r;
718 q__1.r = d__[i__3].r - q__2.r, q__1.i = d__[i__3].i - q__2.i;
719 d__[i__2].r = q__1.r, d__[i__2].i = q__1.i;
721 for (j = 1; j <= i__2; ++j) {
722 i__3 = k + 1 + j * b_dim1;
723 i__4 = k + 1 + j * b_dim1;
724 i__5 = k + j * b_dim1;
725 q__2.r = mult.r * b[i__5].r - mult.i * b[i__5].i, q__2.i =
726 mult.r * b[i__5].i + mult.i * b[i__5].r;
727 q__1.r = b[i__4].r - q__2.r, q__1.i = b[i__4].i - q__2.i;
728 b[i__3].r = q__1.r, b[i__3].i = q__1.i;
733 dl[i__2].r = 0.f, dl[i__2].i = 0.f;
737 /* Interchange rows K and K+1 */
739 c_div(&q__1, &d__[k], &dl[k]);
740 mult.r = q__1.r, mult.i = q__1.i;
743 d__[i__2].r = dl[i__3].r, d__[i__2].i = dl[i__3].i;
745 temp.r = d__[i__2].r, temp.i = d__[i__2].i;
748 q__2.r = mult.r * temp.r - mult.i * temp.i, q__2.i = mult.r *
749 temp.i + mult.i * temp.r;
750 q__1.r = du[i__3].r - q__2.r, q__1.i = du[i__3].i - q__2.i;
751 d__[i__2].r = q__1.r, d__[i__2].i = q__1.i;
755 dl[i__2].r = du[i__3].r, dl[i__2].i = du[i__3].i;
757 q__2.r = -mult.r, q__2.i = -mult.i;
759 q__1.r = q__2.r * dl[i__3].r - q__2.i * dl[i__3].i,
760 q__1.i = q__2.r * dl[i__3].i + q__2.i * dl[i__3]
762 du[i__2].r = q__1.r, du[i__2].i = q__1.i;
765 du[i__2].r = temp.r, du[i__2].i = temp.i;
767 for (j = 1; j <= i__2; ++j) {
768 i__3 = k + j * b_dim1;
769 temp.r = b[i__3].r, temp.i = b[i__3].i;
770 i__3 = k + j * b_dim1;
771 i__4 = k + 1 + j * b_dim1;
772 b[i__3].r = b[i__4].r, b[i__3].i = b[i__4].i;
773 i__3 = k + 1 + j * b_dim1;
774 i__4 = k + 1 + j * b_dim1;
775 q__2.r = mult.r * b[i__4].r - mult.i * b[i__4].i, q__2.i =
776 mult.r * b[i__4].i + mult.i * b[i__4].r;
777 q__1.r = temp.r - q__2.r, q__1.i = temp.i - q__2.i;
778 b[i__3].r = q__1.r, b[i__3].i = q__1.i;
786 if (d__[i__1].r == 0.f && d__[i__1].i == 0.f) {
791 /* Back solve with the matrix U from the factorization. */
794 for (j = 1; j <= i__1; ++j) {
795 i__2 = *n + j * b_dim1;
796 c_div(&q__1, &b[*n + j * b_dim1], &d__[*n]);
797 b[i__2].r = q__1.r, b[i__2].i = q__1.i;
799 i__2 = *n - 1 + j * b_dim1;
800 i__3 = *n - 1 + j * b_dim1;
802 i__5 = *n + j * b_dim1;
803 q__3.r = du[i__4].r * b[i__5].r - du[i__4].i * b[i__5].i, q__3.i =
804 du[i__4].r * b[i__5].i + du[i__4].i * b[i__5].r;
805 q__2.r = b[i__3].r - q__3.r, q__2.i = b[i__3].i - q__3.i;
806 c_div(&q__1, &q__2, &d__[*n - 1]);
807 b[i__2].r = q__1.r, b[i__2].i = q__1.i;
809 for (k = *n - 2; k >= 1; --k) {
810 i__2 = k + j * b_dim1;
811 i__3 = k + j * b_dim1;
813 i__5 = k + 1 + j * b_dim1;
814 q__4.r = du[i__4].r * b[i__5].r - du[i__4].i * b[i__5].i, q__4.i =
815 du[i__4].r * b[i__5].i + du[i__4].i * b[i__5].r;
816 q__3.r = b[i__3].r - q__4.r, q__3.i = b[i__3].i - q__4.i;
818 i__7 = k + 2 + j * b_dim1;
819 q__5.r = dl[i__6].r * b[i__7].r - dl[i__6].i * b[i__7].i, q__5.i =
820 dl[i__6].r * b[i__7].i + dl[i__6].i * b[i__7].r;
821 q__2.r = q__3.r - q__5.r, q__2.i = q__3.i - q__5.i;
822 c_div(&q__1, &q__2, &d__[k]);
823 b[i__2].r = q__1.r, b[i__2].i = q__1.i;