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 /* > \brief \b ZGTTS2 solves a system of linear equations with a tridiagonal matrix using the LU factorization
515 computed by sgttrf. */
517 /* =========== DOCUMENTATION =========== */
519 /* Online html documentation available at */
520 /* http://www.netlib.org/lapack/explore-html/ */
523 /* > Download ZGTTS2 + dependencies */
524 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zgtts2.
527 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zgtts2.
530 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zgtts2.
538 /* SUBROUTINE ZGTTS2( ITRANS, N, NRHS, DL, D, DU, DU2, IPIV, B, LDB ) */
540 /* INTEGER ITRANS, LDB, N, NRHS */
541 /* INTEGER IPIV( * ) */
542 /* COMPLEX*16 B( LDB, * ), D( * ), DL( * ), DU( * ), DU2( * ) */
545 /* > \par Purpose: */
550 /* > ZGTTS2 solves one of the systems of equations */
551 /* > A * X = B, A**T * X = B, or A**H * X = B, */
552 /* > with a tridiagonal matrix A using the LU factorization computed */
559 /* > \param[in] ITRANS */
561 /* > ITRANS is INTEGER */
562 /* > Specifies the form of the system of equations. */
563 /* > = 0: A * X = B (No transpose) */
564 /* > = 1: A**T * X = B (Transpose) */
565 /* > = 2: A**H * X = B (Conjugate transpose) */
571 /* > The order of the matrix A. */
574 /* > \param[in] NRHS */
576 /* > NRHS is INTEGER */
577 /* > The number of right hand sides, i.e., the number of columns */
578 /* > of the matrix B. NRHS >= 0. */
581 /* > \param[in] DL */
583 /* > DL is COMPLEX*16 array, dimension (N-1) */
584 /* > The (n-1) multipliers that define the matrix L from the */
585 /* > LU factorization of A. */
590 /* > D is COMPLEX*16 array, dimension (N) */
591 /* > The n diagonal elements of the upper triangular matrix U from */
592 /* > the LU factorization of A. */
595 /* > \param[in] DU */
597 /* > DU is COMPLEX*16 array, dimension (N-1) */
598 /* > The (n-1) elements of the first super-diagonal of U. */
601 /* > \param[in] DU2 */
603 /* > DU2 is COMPLEX*16 array, dimension (N-2) */
604 /* > The (n-2) elements of the second super-diagonal of U. */
607 /* > \param[in] IPIV */
609 /* > IPIV is INTEGER array, dimension (N) */
610 /* > The pivot indices; for 1 <= i <= n, row i of the matrix was */
611 /* > interchanged with row IPIV(i). IPIV(i) will always be either */
612 /* > i or i+1; IPIV(i) = i indicates a row interchange was not */
616 /* > \param[in,out] B */
618 /* > B is COMPLEX*16 array, dimension (LDB,NRHS) */
619 /* > On entry, the matrix of right hand side vectors B. */
620 /* > On exit, B is overwritten by the solution vectors X. */
623 /* > \param[in] LDB */
625 /* > LDB is INTEGER */
626 /* > The leading dimension of the array B. LDB >= f2cmax(1,N). */
632 /* > \author Univ. of Tennessee */
633 /* > \author Univ. of California Berkeley */
634 /* > \author Univ. of Colorado Denver */
635 /* > \author NAG Ltd. */
637 /* > \date December 2016 */
639 /* > \ingroup complex16GTcomputational */
641 /* ===================================================================== */
642 /* Subroutine */ int zgtts2_(integer *itrans, integer *n, integer *nrhs,
643 doublecomplex *dl, doublecomplex *d__, doublecomplex *du,
644 doublecomplex *du2, integer *ipiv, doublecomplex *b, integer *ldb)
646 /* System generated locals */
647 integer b_dim1, b_offset, i__1, i__2, i__3, i__4, i__5, i__6, i__7, i__8;
648 doublecomplex z__1, z__2, z__3, z__4, z__5, z__6, z__7, z__8;
650 /* Local variables */
655 /* -- LAPACK computational routine (version 3.7.0) -- */
656 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
657 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
661 /* ===================================================================== */
664 /* Quick return if possible */
666 /* Parameter adjustments */
673 b_offset = 1 + b_dim1 * 1;
677 if (*n == 0 || *nrhs == 0) {
683 /* Solve A*X = B using the LU factorization of A, */
684 /* overwriting each right hand side vector with its solution. */
693 for (i__ = 1; i__ <= i__1; ++i__) {
694 if (ipiv[i__] == i__) {
695 i__2 = i__ + 1 + j * b_dim1;
696 i__3 = i__ + 1 + j * b_dim1;
698 i__5 = i__ + j * b_dim1;
699 z__2.r = dl[i__4].r * b[i__5].r - dl[i__4].i * b[i__5].i,
700 z__2.i = dl[i__4].r * b[i__5].i + dl[i__4].i * b[
702 z__1.r = b[i__3].r - z__2.r, z__1.i = b[i__3].i - z__2.i;
703 b[i__2].r = z__1.r, b[i__2].i = z__1.i;
705 i__2 = i__ + j * b_dim1;
706 temp.r = b[i__2].r, temp.i = b[i__2].i;
707 i__2 = i__ + j * b_dim1;
708 i__3 = i__ + 1 + j * b_dim1;
709 b[i__2].r = b[i__3].r, b[i__2].i = b[i__3].i;
710 i__2 = i__ + 1 + j * b_dim1;
712 i__4 = i__ + j * b_dim1;
713 z__2.r = dl[i__3].r * b[i__4].r - dl[i__3].i * b[i__4].i,
714 z__2.i = dl[i__3].r * b[i__4].i + dl[i__3].i * b[
716 z__1.r = temp.r - z__2.r, z__1.i = temp.i - z__2.i;
717 b[i__2].r = z__1.r, b[i__2].i = z__1.i;
724 i__1 = *n + j * b_dim1;
725 z_div(&z__1, &b[*n + j * b_dim1], &d__[*n]);
726 b[i__1].r = z__1.r, b[i__1].i = z__1.i;
728 i__1 = *n - 1 + j * b_dim1;
729 i__2 = *n - 1 + j * b_dim1;
731 i__4 = *n + j * b_dim1;
732 z__3.r = du[i__3].r * b[i__4].r - du[i__3].i * b[i__4].i,
733 z__3.i = du[i__3].r * b[i__4].i + du[i__3].i * b[i__4]
735 z__2.r = b[i__2].r - z__3.r, z__2.i = b[i__2].i - z__3.i;
736 z_div(&z__1, &z__2, &d__[*n - 1]);
737 b[i__1].r = z__1.r, b[i__1].i = z__1.i;
739 for (i__ = *n - 2; i__ >= 1; --i__) {
740 i__1 = i__ + j * b_dim1;
741 i__2 = i__ + j * b_dim1;
743 i__4 = i__ + 1 + j * b_dim1;
744 z__4.r = du[i__3].r * b[i__4].r - du[i__3].i * b[i__4].i,
745 z__4.i = du[i__3].r * b[i__4].i + du[i__3].i * b[i__4]
747 z__3.r = b[i__2].r - z__4.r, z__3.i = b[i__2].i - z__4.i;
749 i__6 = i__ + 2 + j * b_dim1;
750 z__5.r = du2[i__5].r * b[i__6].r - du2[i__5].i * b[i__6].i,
751 z__5.i = du2[i__5].r * b[i__6].i + du2[i__5].i * b[
753 z__2.r = z__3.r - z__5.r, z__2.i = z__3.i - z__5.i;
754 z_div(&z__1, &z__2, &d__[i__]);
755 b[i__1].r = z__1.r, b[i__1].i = z__1.i;
764 for (j = 1; j <= i__1; ++j) {
769 for (i__ = 1; i__ <= i__2; ++i__) {
770 if (ipiv[i__] == i__) {
771 i__3 = i__ + 1 + j * b_dim1;
772 i__4 = i__ + 1 + j * b_dim1;
774 i__6 = i__ + j * b_dim1;
775 z__2.r = dl[i__5].r * b[i__6].r - dl[i__5].i * b[i__6]
776 .i, z__2.i = dl[i__5].r * b[i__6].i + dl[i__5]
778 z__1.r = b[i__4].r - z__2.r, z__1.i = b[i__4].i -
780 b[i__3].r = z__1.r, b[i__3].i = z__1.i;
782 i__3 = i__ + j * b_dim1;
783 temp.r = b[i__3].r, temp.i = b[i__3].i;
784 i__3 = i__ + j * b_dim1;
785 i__4 = i__ + 1 + j * b_dim1;
786 b[i__3].r = b[i__4].r, b[i__3].i = b[i__4].i;
787 i__3 = i__ + 1 + j * b_dim1;
789 i__5 = i__ + j * b_dim1;
790 z__2.r = dl[i__4].r * b[i__5].r - dl[i__4].i * b[i__5]
791 .i, z__2.i = dl[i__4].r * b[i__5].i + dl[i__4]
793 z__1.r = temp.r - z__2.r, z__1.i = temp.i - z__2.i;
794 b[i__3].r = z__1.r, b[i__3].i = z__1.i;
801 i__2 = *n + j * b_dim1;
802 z_div(&z__1, &b[*n + j * b_dim1], &d__[*n]);
803 b[i__2].r = z__1.r, b[i__2].i = z__1.i;
805 i__2 = *n - 1 + j * b_dim1;
806 i__3 = *n - 1 + j * b_dim1;
808 i__5 = *n + j * b_dim1;
809 z__3.r = du[i__4].r * b[i__5].r - du[i__4].i * b[i__5].i,
810 z__3.i = du[i__4].r * b[i__5].i + du[i__4].i * b[
812 z__2.r = b[i__3].r - z__3.r, z__2.i = b[i__3].i - z__3.i;
813 z_div(&z__1, &z__2, &d__[*n - 1]);
814 b[i__2].r = z__1.r, b[i__2].i = z__1.i;
816 for (i__ = *n - 2; i__ >= 1; --i__) {
817 i__2 = i__ + j * b_dim1;
818 i__3 = i__ + j * b_dim1;
820 i__5 = i__ + 1 + j * b_dim1;
821 z__4.r = du[i__4].r * b[i__5].r - du[i__4].i * b[i__5].i,
822 z__4.i = du[i__4].r * b[i__5].i + du[i__4].i * b[
824 z__3.r = b[i__3].r - z__4.r, z__3.i = b[i__3].i - z__4.i;
826 i__7 = i__ + 2 + j * b_dim1;
827 z__5.r = du2[i__6].r * b[i__7].r - du2[i__6].i * b[i__7]
828 .i, z__5.i = du2[i__6].r * b[i__7].i + du2[i__6]
830 z__2.r = z__3.r - z__5.r, z__2.i = z__3.i - z__5.i;
831 z_div(&z__1, &z__2, &d__[i__]);
832 b[i__2].r = z__1.r, b[i__2].i = z__1.i;
838 } else if (*itrans == 1) {
840 /* Solve A**T * X = B. */
846 /* Solve U**T * x = b. */
848 i__1 = j * b_dim1 + 1;
849 z_div(&z__1, &b[j * b_dim1 + 1], &d__[1]);
850 b[i__1].r = z__1.r, b[i__1].i = z__1.i;
852 i__1 = j * b_dim1 + 2;
853 i__2 = j * b_dim1 + 2;
854 i__3 = j * b_dim1 + 1;
855 z__3.r = du[1].r * b[i__3].r - du[1].i * b[i__3].i, z__3.i =
856 du[1].r * b[i__3].i + du[1].i * b[i__3].r;
857 z__2.r = b[i__2].r - z__3.r, z__2.i = b[i__2].i - z__3.i;
858 z_div(&z__1, &z__2, &d__[2]);
859 b[i__1].r = z__1.r, b[i__1].i = z__1.i;
862 for (i__ = 3; i__ <= i__1; ++i__) {
863 i__2 = i__ + j * b_dim1;
864 i__3 = i__ + j * b_dim1;
866 i__5 = i__ - 1 + j * b_dim1;
867 z__4.r = du[i__4].r * b[i__5].r - du[i__4].i * b[i__5].i,
868 z__4.i = du[i__4].r * b[i__5].i + du[i__4].i * b[i__5]
870 z__3.r = b[i__3].r - z__4.r, z__3.i = b[i__3].i - z__4.i;
872 i__7 = i__ - 2 + j * b_dim1;
873 z__5.r = du2[i__6].r * b[i__7].r - du2[i__6].i * b[i__7].i,
874 z__5.i = du2[i__6].r * b[i__7].i + du2[i__6].i * b[
876 z__2.r = z__3.r - z__5.r, z__2.i = z__3.i - z__5.i;
877 z_div(&z__1, &z__2, &d__[i__]);
878 b[i__2].r = z__1.r, b[i__2].i = z__1.i;
882 /* Solve L**T * x = b. */
884 for (i__ = *n - 1; i__ >= 1; --i__) {
885 if (ipiv[i__] == i__) {
886 i__1 = i__ + j * b_dim1;
887 i__2 = i__ + j * b_dim1;
889 i__4 = i__ + 1 + j * b_dim1;
890 z__2.r = dl[i__3].r * b[i__4].r - dl[i__3].i * b[i__4].i,
891 z__2.i = dl[i__3].r * b[i__4].i + dl[i__3].i * b[
893 z__1.r = b[i__2].r - z__2.r, z__1.i = b[i__2].i - z__2.i;
894 b[i__1].r = z__1.r, b[i__1].i = z__1.i;
896 i__1 = i__ + 1 + j * b_dim1;
897 temp.r = b[i__1].r, temp.i = b[i__1].i;
898 i__1 = i__ + 1 + j * b_dim1;
899 i__2 = i__ + j * b_dim1;
901 z__2.r = dl[i__3].r * temp.r - dl[i__3].i * temp.i,
902 z__2.i = dl[i__3].r * temp.i + dl[i__3].i *
904 z__1.r = b[i__2].r - z__2.r, z__1.i = b[i__2].i - z__2.i;
905 b[i__1].r = z__1.r, b[i__1].i = z__1.i;
906 i__1 = i__ + j * b_dim1;
907 b[i__1].r = temp.r, b[i__1].i = temp.i;
917 for (j = 1; j <= i__1; ++j) {
919 /* Solve U**T * x = b. */
921 i__2 = j * b_dim1 + 1;
922 z_div(&z__1, &b[j * b_dim1 + 1], &d__[1]);
923 b[i__2].r = z__1.r, b[i__2].i = z__1.i;
925 i__2 = j * b_dim1 + 2;
926 i__3 = j * b_dim1 + 2;
927 i__4 = j * b_dim1 + 1;
928 z__3.r = du[1].r * b[i__4].r - du[1].i * b[i__4].i,
929 z__3.i = du[1].r * b[i__4].i + du[1].i * b[i__4]
931 z__2.r = b[i__3].r - z__3.r, z__2.i = b[i__3].i - z__3.i;
932 z_div(&z__1, &z__2, &d__[2]);
933 b[i__2].r = z__1.r, b[i__2].i = z__1.i;
936 for (i__ = 3; i__ <= i__2; ++i__) {
937 i__3 = i__ + j * b_dim1;
938 i__4 = i__ + j * b_dim1;
940 i__6 = i__ - 1 + j * b_dim1;
941 z__4.r = du[i__5].r * b[i__6].r - du[i__5].i * b[i__6].i,
942 z__4.i = du[i__5].r * b[i__6].i + du[i__5].i * b[
944 z__3.r = b[i__4].r - z__4.r, z__3.i = b[i__4].i - z__4.i;
946 i__8 = i__ - 2 + j * b_dim1;
947 z__5.r = du2[i__7].r * b[i__8].r - du2[i__7].i * b[i__8]
948 .i, z__5.i = du2[i__7].r * b[i__8].i + du2[i__7]
950 z__2.r = z__3.r - z__5.r, z__2.i = z__3.i - z__5.i;
951 z_div(&z__1, &z__2, &d__[i__]);
952 b[i__3].r = z__1.r, b[i__3].i = z__1.i;
956 /* Solve L**T * x = b. */
958 for (i__ = *n - 1; i__ >= 1; --i__) {
959 if (ipiv[i__] == i__) {
960 i__2 = i__ + j * b_dim1;
961 i__3 = i__ + j * b_dim1;
963 i__5 = i__ + 1 + j * b_dim1;
964 z__2.r = dl[i__4].r * b[i__5].r - dl[i__4].i * b[i__5]
965 .i, z__2.i = dl[i__4].r * b[i__5].i + dl[i__4]
967 z__1.r = b[i__3].r - z__2.r, z__1.i = b[i__3].i -
969 b[i__2].r = z__1.r, b[i__2].i = z__1.i;
971 i__2 = i__ + 1 + j * b_dim1;
972 temp.r = b[i__2].r, temp.i = b[i__2].i;
973 i__2 = i__ + 1 + j * b_dim1;
974 i__3 = i__ + j * b_dim1;
976 z__2.r = dl[i__4].r * temp.r - dl[i__4].i * temp.i,
977 z__2.i = dl[i__4].r * temp.i + dl[i__4].i *
979 z__1.r = b[i__3].r - z__2.r, z__1.i = b[i__3].i -
981 b[i__2].r = z__1.r, b[i__2].i = z__1.i;
982 i__2 = i__ + j * b_dim1;
983 b[i__2].r = temp.r, b[i__2].i = temp.i;
992 /* Solve A**H * X = B. */
998 /* Solve U**H * x = b. */
1000 i__1 = j * b_dim1 + 1;
1001 d_cnjg(&z__2, &d__[1]);
1002 z_div(&z__1, &b[j * b_dim1 + 1], &z__2);
1003 b[i__1].r = z__1.r, b[i__1].i = z__1.i;
1005 i__1 = j * b_dim1 + 2;
1006 i__2 = j * b_dim1 + 2;
1007 d_cnjg(&z__4, &du[1]);
1008 i__3 = j * b_dim1 + 1;
1009 z__3.r = z__4.r * b[i__3].r - z__4.i * b[i__3].i, z__3.i =
1010 z__4.r * b[i__3].i + z__4.i * b[i__3].r;
1011 z__2.r = b[i__2].r - z__3.r, z__2.i = b[i__2].i - z__3.i;
1012 d_cnjg(&z__5, &d__[2]);
1013 z_div(&z__1, &z__2, &z__5);
1014 b[i__1].r = z__1.r, b[i__1].i = z__1.i;
1017 for (i__ = 3; i__ <= i__1; ++i__) {
1018 i__2 = i__ + j * b_dim1;
1019 i__3 = i__ + j * b_dim1;
1020 d_cnjg(&z__5, &du[i__ - 1]);
1021 i__4 = i__ - 1 + j * b_dim1;
1022 z__4.r = z__5.r * b[i__4].r - z__5.i * b[i__4].i, z__4.i =
1023 z__5.r * b[i__4].i + z__5.i * b[i__4].r;
1024 z__3.r = b[i__3].r - z__4.r, z__3.i = b[i__3].i - z__4.i;
1025 d_cnjg(&z__7, &du2[i__ - 2]);
1026 i__5 = i__ - 2 + j * b_dim1;
1027 z__6.r = z__7.r * b[i__5].r - z__7.i * b[i__5].i, z__6.i =
1028 z__7.r * b[i__5].i + z__7.i * b[i__5].r;
1029 z__2.r = z__3.r - z__6.r, z__2.i = z__3.i - z__6.i;
1030 d_cnjg(&z__8, &d__[i__]);
1031 z_div(&z__1, &z__2, &z__8);
1032 b[i__2].r = z__1.r, b[i__2].i = z__1.i;
1036 /* Solve L**H * x = b. */
1038 for (i__ = *n - 1; i__ >= 1; --i__) {
1039 if (ipiv[i__] == i__) {
1040 i__1 = i__ + j * b_dim1;
1041 i__2 = i__ + j * b_dim1;
1042 d_cnjg(&z__3, &dl[i__]);
1043 i__3 = i__ + 1 + j * b_dim1;
1044 z__2.r = z__3.r * b[i__3].r - z__3.i * b[i__3].i, z__2.i =
1045 z__3.r * b[i__3].i + z__3.i * b[i__3].r;
1046 z__1.r = b[i__2].r - z__2.r, z__1.i = b[i__2].i - z__2.i;
1047 b[i__1].r = z__1.r, b[i__1].i = z__1.i;
1049 i__1 = i__ + 1 + j * b_dim1;
1050 temp.r = b[i__1].r, temp.i = b[i__1].i;
1051 i__1 = i__ + 1 + j * b_dim1;
1052 i__2 = i__ + j * b_dim1;
1053 d_cnjg(&z__3, &dl[i__]);
1054 z__2.r = z__3.r * temp.r - z__3.i * temp.i, z__2.i =
1055 z__3.r * temp.i + z__3.i * temp.r;
1056 z__1.r = b[i__2].r - z__2.r, z__1.i = b[i__2].i - z__2.i;
1057 b[i__1].r = z__1.r, b[i__1].i = z__1.i;
1058 i__1 = i__ + j * b_dim1;
1059 b[i__1].r = temp.r, b[i__1].i = temp.i;
1069 for (j = 1; j <= i__1; ++j) {
1071 /* Solve U**H * x = b. */
1073 i__2 = j * b_dim1 + 1;
1074 d_cnjg(&z__2, &d__[1]);
1075 z_div(&z__1, &b[j * b_dim1 + 1], &z__2);
1076 b[i__2].r = z__1.r, b[i__2].i = z__1.i;
1078 i__2 = j * b_dim1 + 2;
1079 i__3 = j * b_dim1 + 2;
1080 d_cnjg(&z__4, &du[1]);
1081 i__4 = j * b_dim1 + 1;
1082 z__3.r = z__4.r * b[i__4].r - z__4.i * b[i__4].i, z__3.i =
1083 z__4.r * b[i__4].i + z__4.i * b[i__4].r;
1084 z__2.r = b[i__3].r - z__3.r, z__2.i = b[i__3].i - z__3.i;
1085 d_cnjg(&z__5, &d__[2]);
1086 z_div(&z__1, &z__2, &z__5);
1087 b[i__2].r = z__1.r, b[i__2].i = z__1.i;
1090 for (i__ = 3; i__ <= i__2; ++i__) {
1091 i__3 = i__ + j * b_dim1;
1092 i__4 = i__ + j * b_dim1;
1093 d_cnjg(&z__5, &du[i__ - 1]);
1094 i__5 = i__ - 1 + j * b_dim1;
1095 z__4.r = z__5.r * b[i__5].r - z__5.i * b[i__5].i, z__4.i =
1096 z__5.r * b[i__5].i + z__5.i * b[i__5].r;
1097 z__3.r = b[i__4].r - z__4.r, z__3.i = b[i__4].i - z__4.i;
1098 d_cnjg(&z__7, &du2[i__ - 2]);
1099 i__6 = i__ - 2 + j * b_dim1;
1100 z__6.r = z__7.r * b[i__6].r - z__7.i * b[i__6].i, z__6.i =
1101 z__7.r * b[i__6].i + z__7.i * b[i__6].r;
1102 z__2.r = z__3.r - z__6.r, z__2.i = z__3.i - z__6.i;
1103 d_cnjg(&z__8, &d__[i__]);
1104 z_div(&z__1, &z__2, &z__8);
1105 b[i__3].r = z__1.r, b[i__3].i = z__1.i;
1109 /* Solve L**H * x = b. */
1111 for (i__ = *n - 1; i__ >= 1; --i__) {
1112 if (ipiv[i__] == i__) {
1113 i__2 = i__ + j * b_dim1;
1114 i__3 = i__ + j * b_dim1;
1115 d_cnjg(&z__3, &dl[i__]);
1116 i__4 = i__ + 1 + j * b_dim1;
1117 z__2.r = z__3.r * b[i__4].r - z__3.i * b[i__4].i,
1118 z__2.i = z__3.r * b[i__4].i + z__3.i * b[i__4]
1120 z__1.r = b[i__3].r - z__2.r, z__1.i = b[i__3].i -
1122 b[i__2].r = z__1.r, b[i__2].i = z__1.i;
1124 i__2 = i__ + 1 + j * b_dim1;
1125 temp.r = b[i__2].r, temp.i = b[i__2].i;
1126 i__2 = i__ + 1 + j * b_dim1;
1127 i__3 = i__ + j * b_dim1;
1128 d_cnjg(&z__3, &dl[i__]);
1129 z__2.r = z__3.r * temp.r - z__3.i * temp.i, z__2.i =
1130 z__3.r * temp.i + z__3.i * temp.r;
1131 z__1.r = b[i__3].r - z__2.r, z__1.i = b[i__3].i -
1133 b[i__2].r = z__1.r, b[i__2].i = z__1.i;
1134 i__2 = i__ + j * b_dim1;
1135 b[i__2].r = temp.r, b[i__2].i = temp.i;