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)
511 /* -- translated by f2c (version 20000121).
512 You must link the resulting object file with the libraries:
513 -lf2c -lm (in that order)
518 /* -- translated by f2c (version 20000121).
519 You must link the resulting object file with the libraries:
520 -lf2c -lm (in that order)
525 /* Table of constant values */
527 static integer c__1 = 1;
529 /* > \brief <b> CGBSVX computes the solution to system of linear equations A * X = B for GB matrices</b> */
531 /* =========== DOCUMENTATION =========== */
533 /* Online html documentation available at */
534 /* http://www.netlib.org/lapack/explore-html/ */
537 /* > Download CGBSVX + dependencies */
538 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/cgbsvx.
541 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/cgbsvx.
544 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/cgbsvx.
552 /* SUBROUTINE CGBSVX( FACT, TRANS, N, KL, KU, NRHS, AB, LDAB, AFB, */
553 /* LDAFB, IPIV, EQUED, R, C, B, LDB, X, LDX, */
554 /* RCOND, FERR, BERR, WORK, RWORK, INFO ) */
556 /* CHARACTER EQUED, FACT, TRANS */
557 /* INTEGER INFO, KL, KU, LDAB, LDAFB, LDB, LDX, N, NRHS */
559 /* INTEGER IPIV( * ) */
560 /* REAL BERR( * ), C( * ), FERR( * ), R( * ), */
562 /* COMPLEX AB( LDAB, * ), AFB( LDAFB, * ), B( LDB, * ), */
563 /* $ WORK( * ), X( LDX, * ) */
566 /* > \par Purpose: */
571 /* > CGBSVX uses the LU factorization to compute the solution to a complex */
572 /* > system of linear equations A * X = B, A**T * X = B, or A**H * X = B, */
573 /* > where A is a band matrix of order N with KL subdiagonals and KU */
574 /* > superdiagonals, and X and B are N-by-NRHS matrices. */
576 /* > Error bounds on the solution and a condition estimate are also */
580 /* > \par Description: */
581 /* ================= */
585 /* > The following steps are performed by this subroutine: */
587 /* > 1. If FACT = 'E', real scaling factors are computed to equilibrate */
589 /* > TRANS = 'N': diag(R)*A*diag(C) *inv(diag(C))*X = diag(R)*B */
590 /* > TRANS = 'T': (diag(R)*A*diag(C))**T *inv(diag(R))*X = diag(C)*B */
591 /* > TRANS = 'C': (diag(R)*A*diag(C))**H *inv(diag(R))*X = diag(C)*B */
592 /* > Whether or not the system will be equilibrated depends on the */
593 /* > scaling of the matrix A, but if equilibration is used, A is */
594 /* > overwritten by diag(R)*A*diag(C) and B by diag(R)*B (if TRANS='N') */
595 /* > or diag(C)*B (if TRANS = 'T' or 'C'). */
597 /* > 2. If FACT = 'N' or 'E', the LU decomposition is used to factor the */
598 /* > matrix A (after equilibration if FACT = 'E') as */
600 /* > where L is a product of permutation and unit lower triangular */
601 /* > matrices with KL subdiagonals, and U is upper triangular with */
602 /* > KL+KU superdiagonals. */
604 /* > 3. If some U(i,i)=0, so that U is exactly singular, then the routine */
605 /* > returns with INFO = i. Otherwise, the factored form of A is used */
606 /* > to estimate the condition number of the matrix A. If the */
607 /* > reciprocal of the condition number is less than machine precision, */
608 /* > INFO = N+1 is returned as a warning, but the routine still goes on */
609 /* > to solve for X and compute error bounds as described below. */
611 /* > 4. The system of equations is solved for X using the factored form */
614 /* > 5. Iterative refinement is applied to improve the computed solution */
615 /* > matrix and calculate error bounds and backward error estimates */
618 /* > 6. If equilibration was used, the matrix X is premultiplied by */
619 /* > diag(C) (if TRANS = 'N') or diag(R) (if TRANS = 'T' or 'C') so */
620 /* > that it solves the original system before equilibration. */
626 /* > \param[in] FACT */
628 /* > FACT is CHARACTER*1 */
629 /* > Specifies whether or not the factored form of the matrix A is */
630 /* > supplied on entry, and if not, whether the matrix A should be */
631 /* > equilibrated before it is factored. */
632 /* > = 'F': On entry, AFB and IPIV contain the factored form of */
633 /* > A. If EQUED is not 'N', the matrix A has been */
634 /* > equilibrated with scaling factors given by R and C. */
635 /* > AB, AFB, and IPIV are not modified. */
636 /* > = 'N': The matrix A will be copied to AFB and factored. */
637 /* > = 'E': The matrix A will be equilibrated if necessary, then */
638 /* > copied to AFB and factored. */
641 /* > \param[in] TRANS */
643 /* > TRANS is CHARACTER*1 */
644 /* > Specifies the form of the system of equations. */
645 /* > = 'N': A * X = B (No transpose) */
646 /* > = 'T': A**T * X = B (Transpose) */
647 /* > = 'C': A**H * X = B (Conjugate transpose) */
653 /* > The number of linear equations, i.e., the order of the */
654 /* > matrix A. N >= 0. */
657 /* > \param[in] KL */
659 /* > KL is INTEGER */
660 /* > The number of subdiagonals within the band of A. KL >= 0. */
663 /* > \param[in] KU */
665 /* > KU is INTEGER */
666 /* > The number of superdiagonals within the band of A. KU >= 0. */
669 /* > \param[in] NRHS */
671 /* > NRHS is INTEGER */
672 /* > The number of right hand sides, i.e., the number of columns */
673 /* > of the matrices B and X. NRHS >= 0. */
676 /* > \param[in,out] AB */
678 /* > AB is COMPLEX array, dimension (LDAB,N) */
679 /* > On entry, the matrix A in band storage, in rows 1 to KL+KU+1. */
680 /* > The j-th column of A is stored in the j-th column of the */
681 /* > array AB as follows: */
682 /* > AB(KU+1+i-j,j) = A(i,j) for f2cmax(1,j-KU)<=i<=f2cmin(N,j+kl) */
684 /* > If FACT = 'F' and EQUED is not 'N', then A must have been */
685 /* > equilibrated by the scaling factors in R and/or C. AB is not */
686 /* > modified if FACT = 'F' or 'N', or if FACT = 'E' and */
687 /* > EQUED = 'N' on exit. */
689 /* > On exit, if EQUED .ne. 'N', A is scaled as follows: */
690 /* > EQUED = 'R': A := diag(R) * A */
691 /* > EQUED = 'C': A := A * diag(C) */
692 /* > EQUED = 'B': A := diag(R) * A * diag(C). */
695 /* > \param[in] LDAB */
697 /* > LDAB is INTEGER */
698 /* > The leading dimension of the array AB. LDAB >= KL+KU+1. */
701 /* > \param[in,out] AFB */
703 /* > AFB is COMPLEX array, dimension (LDAFB,N) */
704 /* > If FACT = 'F', then AFB is an input argument and on entry */
705 /* > contains details of the LU factorization of the band matrix */
706 /* > A, as computed by CGBTRF. U is stored as an upper triangular */
707 /* > band matrix with KL+KU superdiagonals in rows 1 to KL+KU+1, */
708 /* > and the multipliers used during the factorization are stored */
709 /* > in rows KL+KU+2 to 2*KL+KU+1. If EQUED .ne. 'N', then AFB is */
710 /* > the factored form of the equilibrated matrix A. */
712 /* > If FACT = 'N', then AFB is an output argument and on exit */
713 /* > returns details of the LU factorization of A. */
715 /* > If FACT = 'E', then AFB is an output argument and on exit */
716 /* > returns details of the LU factorization of the equilibrated */
717 /* > matrix A (see the description of AB for the form of the */
718 /* > equilibrated matrix). */
721 /* > \param[in] LDAFB */
723 /* > LDAFB is INTEGER */
724 /* > The leading dimension of the array AFB. LDAFB >= 2*KL+KU+1. */
727 /* > \param[in,out] IPIV */
729 /* > IPIV is INTEGER array, dimension (N) */
730 /* > If FACT = 'F', then IPIV is an input argument and on entry */
731 /* > contains the pivot indices from the factorization A = L*U */
732 /* > as computed by CGBTRF; row i of the matrix was interchanged */
733 /* > with row IPIV(i). */
735 /* > If FACT = 'N', then IPIV is an output argument and on exit */
736 /* > contains the pivot indices from the factorization A = L*U */
737 /* > of the original matrix A. */
739 /* > If FACT = 'E', then IPIV is an output argument and on exit */
740 /* > contains the pivot indices from the factorization A = L*U */
741 /* > of the equilibrated matrix A. */
744 /* > \param[in,out] EQUED */
746 /* > EQUED is CHARACTER*1 */
747 /* > Specifies the form of equilibration that was done. */
748 /* > = 'N': No equilibration (always true if FACT = 'N'). */
749 /* > = 'R': Row equilibration, i.e., A has been premultiplied by */
751 /* > = 'C': Column equilibration, i.e., A has been postmultiplied */
753 /* > = 'B': Both row and column equilibration, i.e., A has been */
754 /* > replaced by diag(R) * A * diag(C). */
755 /* > EQUED is an input argument if FACT = 'F'; otherwise, it is an */
756 /* > output argument. */
759 /* > \param[in,out] R */
761 /* > R is REAL array, dimension (N) */
762 /* > The row scale factors for A. If EQUED = 'R' or 'B', A is */
763 /* > multiplied on the left by diag(R); if EQUED = 'N' or 'C', R */
764 /* > is not accessed. R is an input argument if FACT = 'F'; */
765 /* > otherwise, R is an output argument. If FACT = 'F' and */
766 /* > EQUED = 'R' or 'B', each element of R must be positive. */
769 /* > \param[in,out] C */
771 /* > C is REAL array, dimension (N) */
772 /* > The column scale factors for A. If EQUED = 'C' or 'B', A is */
773 /* > multiplied on the right by diag(C); if EQUED = 'N' or 'R', C */
774 /* > is not accessed. C is an input argument if FACT = 'F'; */
775 /* > otherwise, C is an output argument. If FACT = 'F' and */
776 /* > EQUED = 'C' or 'B', each element of C must be positive. */
779 /* > \param[in,out] B */
781 /* > B is COMPLEX array, dimension (LDB,NRHS) */
782 /* > On entry, the right hand side matrix B. */
784 /* > if EQUED = 'N', B is not modified; */
785 /* > if TRANS = 'N' and EQUED = 'R' or 'B', B is overwritten by */
787 /* > if TRANS = 'T' or 'C' and EQUED = 'C' or 'B', B is */
788 /* > overwritten by diag(C)*B. */
791 /* > \param[in] LDB */
793 /* > LDB is INTEGER */
794 /* > The leading dimension of the array B. LDB >= f2cmax(1,N). */
797 /* > \param[out] X */
799 /* > X is COMPLEX array, dimension (LDX,NRHS) */
800 /* > If INFO = 0 or INFO = N+1, the N-by-NRHS solution matrix X */
801 /* > to the original system of equations. Note that A and B are */
802 /* > modified on exit if EQUED .ne. 'N', and the solution to the */
803 /* > equilibrated system is inv(diag(C))*X if TRANS = 'N' and */
804 /* > EQUED = 'C' or 'B', or inv(diag(R))*X if TRANS = 'T' or 'C' */
805 /* > and EQUED = 'R' or 'B'. */
808 /* > \param[in] LDX */
810 /* > LDX is INTEGER */
811 /* > The leading dimension of the array X. LDX >= f2cmax(1,N). */
814 /* > \param[out] RCOND */
816 /* > RCOND is REAL */
817 /* > The estimate of the reciprocal condition number of the matrix */
818 /* > A after equilibration (if done). If RCOND is less than the */
819 /* > machine precision (in particular, if RCOND = 0), the matrix */
820 /* > is singular to working precision. This condition is */
821 /* > indicated by a return code of INFO > 0. */
824 /* > \param[out] FERR */
826 /* > FERR is REAL array, dimension (NRHS) */
827 /* > The estimated forward error bound for each solution vector */
828 /* > X(j) (the j-th column of the solution matrix X). */
829 /* > If XTRUE is the true solution corresponding to X(j), FERR(j) */
830 /* > is an estimated upper bound for the magnitude of the largest */
831 /* > element in (X(j) - XTRUE) divided by the magnitude of the */
832 /* > largest element in X(j). The estimate is as reliable as */
833 /* > the estimate for RCOND, and is almost always a slight */
834 /* > overestimate of the true error. */
837 /* > \param[out] BERR */
839 /* > BERR is REAL array, dimension (NRHS) */
840 /* > The componentwise relative backward error of each solution */
841 /* > vector X(j) (i.e., the smallest relative change in */
842 /* > any element of A or B that makes X(j) an exact solution). */
845 /* > \param[out] WORK */
847 /* > WORK is COMPLEX array, dimension (2*N) */
850 /* > \param[out] RWORK */
852 /* > RWORK is REAL array, dimension (N) */
853 /* > On exit, RWORK(1) contains the reciprocal pivot growth */
854 /* > factor norm(A)/norm(U). The "f2cmax absolute element" norm is */
855 /* > used. If RWORK(1) is much less than 1, then the stability */
856 /* > of the LU factorization of the (equilibrated) matrix A */
857 /* > could be poor. This also means that the solution X, condition */
858 /* > estimator RCOND, and forward error bound FERR could be */
859 /* > unreliable. If factorization fails with 0<INFO<=N, then */
860 /* > RWORK(1) contains the reciprocal pivot growth factor for the */
861 /* > leading INFO columns of A. */
864 /* > \param[out] INFO */
866 /* > INFO is INTEGER */
867 /* > = 0: successful exit */
868 /* > < 0: if INFO = -i, the i-th argument had an illegal value */
869 /* > > 0: if INFO = i, and i is */
870 /* > <= N: U(i,i) is exactly zero. The factorization */
871 /* > has been completed, but the factor U is exactly */
872 /* > singular, so the solution and error bounds */
873 /* > could not be computed. RCOND = 0 is returned. */
874 /* > = N+1: U is nonsingular, but RCOND is less than machine */
875 /* > precision, meaning that the matrix is singular */
876 /* > to working precision. Nevertheless, the */
877 /* > solution and error bounds are computed because */
878 /* > there are a number of situations where the */
879 /* > computed solution can be more accurate than the */
880 /* > value of RCOND would suggest. */
886 /* > \author Univ. of Tennessee */
887 /* > \author Univ. of California Berkeley */
888 /* > \author Univ. of Colorado Denver */
889 /* > \author NAG Ltd. */
891 /* > \date April 2012 */
893 /* > \ingroup complexGBsolve */
895 /* ===================================================================== */
896 /* Subroutine */ int cgbsvx_(char *fact, char *trans, integer *n, integer *kl,
897 integer *ku, integer *nrhs, complex *ab, integer *ldab, complex *afb,
898 integer *ldafb, integer *ipiv, char *equed, real *r__, real *c__,
899 complex *b, integer *ldb, complex *x, integer *ldx, real *rcond, real
900 *ferr, real *berr, complex *work, real *rwork, integer *info)
902 /* System generated locals */
903 integer ab_dim1, ab_offset, afb_dim1, afb_offset, b_dim1, b_offset,
904 x_dim1, x_offset, i__1, i__2, i__3, i__4, i__5;
908 /* Local variables */
912 extern logical lsame_(char *, char *);
913 real rcmin, rcmax, anorm;
914 extern /* Subroutine */ int ccopy_(integer *, complex *, integer *,
915 complex *, integer *);
918 extern real clangb_(char *, integer *, integer *, integer *, complex *,
920 extern /* Subroutine */ int claqgb_(integer *, integer *, integer *,
921 integer *, complex *, integer *, real *, real *, real *, real *,
922 real *, char *), cgbcon_(char *, integer *, integer *,
923 integer *, complex *, integer *, integer *, real *, real *,
924 complex *, real *, integer *);
926 extern real clantb_(char *, char *, char *, integer *, integer *, complex
927 *, integer *, real *);
928 extern /* Subroutine */ int cgbequ_(integer *, integer *, integer *,
929 integer *, complex *, integer *, real *, real *, real *, real *,
931 extern real slamch_(char *);
932 extern /* Subroutine */ int cgbrfs_(char *, integer *, integer *, integer
933 *, integer *, complex *, integer *, complex *, integer *, integer
934 *, complex *, integer *, complex *, integer *, real *, real *,
935 complex *, real *, integer *), cgbtrf_(integer *, integer
936 *, integer *, integer *, complex *, integer *, integer *, integer
939 extern /* Subroutine */ int clacpy_(char *, integer *, integer *, complex
940 *, integer *, complex *, integer *), xerbla_(char *,
943 extern /* Subroutine */ int cgbtrs_(char *, integer *, integer *, integer
944 *, integer *, complex *, integer *, integer *, complex *, integer
955 /* -- LAPACK driver routine (version 3.7.0) -- */
956 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
957 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
961 /* ===================================================================== */
962 /* Moved setting of INFO = N+1 so INFO does not subsequently get */
963 /* overwritten. Sven, 17 Mar 05. */
964 /* ===================================================================== */
967 /* Parameter adjustments */
969 ab_offset = 1 + ab_dim1 * 1;
972 afb_offset = 1 + afb_dim1 * 1;
978 b_offset = 1 + b_dim1 * 1;
981 x_offset = 1 + x_dim1 * 1;
990 nofact = lsame_(fact, "N");
991 equil = lsame_(fact, "E");
992 notran = lsame_(trans, "N");
993 if (nofact || equil) {
994 *(unsigned char *)equed = 'N';
998 rowequ = lsame_(equed, "R") || lsame_(equed,
1000 colequ = lsame_(equed, "C") || lsame_(equed,
1002 smlnum = slamch_("Safe minimum");
1003 bignum = 1.f / smlnum;
1006 /* Test the input parameters. */
1008 if (! nofact && ! equil && ! lsame_(fact, "F")) {
1010 } else if (! notran && ! lsame_(trans, "T") && !
1011 lsame_(trans, "C")) {
1013 } else if (*n < 0) {
1015 } else if (*kl < 0) {
1017 } else if (*ku < 0) {
1019 } else if (*nrhs < 0) {
1021 } else if (*ldab < *kl + *ku + 1) {
1023 } else if (*ldafb < (*kl << 1) + *ku + 1) {
1025 } else if (lsame_(fact, "F") && ! (rowequ || colequ
1026 || lsame_(equed, "N"))) {
1033 for (j = 1; j <= i__1; ++j) {
1035 r__1 = rcmin, r__2 = r__[j];
1036 rcmin = f2cmin(r__1,r__2);
1038 r__1 = rcmax, r__2 = r__[j];
1039 rcmax = f2cmax(r__1,r__2);
1044 } else if (*n > 0) {
1045 rowcnd = f2cmax(rcmin,smlnum) / f2cmin(rcmax,bignum);
1050 if (colequ && *info == 0) {
1054 for (j = 1; j <= i__1; ++j) {
1056 r__1 = rcmin, r__2 = c__[j];
1057 rcmin = f2cmin(r__1,r__2);
1059 r__1 = rcmax, r__2 = c__[j];
1060 rcmax = f2cmax(r__1,r__2);
1065 } else if (*n > 0) {
1066 colcnd = f2cmax(rcmin,smlnum) / f2cmin(rcmax,bignum);
1072 if (*ldb < f2cmax(1,*n)) {
1074 } else if (*ldx < f2cmax(1,*n)) {
1082 xerbla_("CGBSVX", &i__1, (ftnlen)6);
1088 /* Compute row and column scalings to equilibrate the matrix A. */
1090 cgbequ_(n, n, kl, ku, &ab[ab_offset], ldab, &r__[1], &c__[1], &rowcnd,
1091 &colcnd, &amax, &infequ);
1094 /* Equilibrate the matrix. */
1096 claqgb_(n, n, kl, ku, &ab[ab_offset], ldab, &r__[1], &c__[1], &
1097 rowcnd, &colcnd, &amax, equed);
1098 rowequ = lsame_(equed, "R") || lsame_(equed,
1100 colequ = lsame_(equed, "C") || lsame_(equed,
1105 /* Scale the right hand side. */
1110 for (j = 1; j <= i__1; ++j) {
1112 for (i__ = 1; i__ <= i__2; ++i__) {
1113 i__3 = i__ + j * b_dim1;
1115 i__5 = i__ + j * b_dim1;
1116 q__1.r = r__[i__4] * b[i__5].r, q__1.i = r__[i__4] * b[
1118 b[i__3].r = q__1.r, b[i__3].i = q__1.i;
1124 } else if (colequ) {
1126 for (j = 1; j <= i__1; ++j) {
1128 for (i__ = 1; i__ <= i__2; ++i__) {
1129 i__3 = i__ + j * b_dim1;
1131 i__5 = i__ + j * b_dim1;
1132 q__1.r = c__[i__4] * b[i__5].r, q__1.i = c__[i__4] * b[i__5]
1134 b[i__3].r = q__1.r, b[i__3].i = q__1.i;
1141 if (nofact || equil) {
1143 /* Compute the LU factorization of the band matrix A. */
1146 for (j = 1; j <= i__1; ++j) {
1149 j1 = f2cmax(i__2,1);
1152 j2 = f2cmin(i__2,*n);
1154 ccopy_(&i__2, &ab[*ku + 1 - j + j1 + j * ab_dim1], &c__1, &afb[*
1155 kl + *ku + 1 - j + j1 + j * afb_dim1], &c__1);
1159 cgbtrf_(n, n, kl, ku, &afb[afb_offset], ldafb, &ipiv[1], info);
1161 /* Return if INFO is non-zero. */
1165 /* Compute the reciprocal pivot growth factor of the */
1166 /* leading rank-deficient INFO columns of A. */
1170 for (j = 1; j <= i__1; ++j) {
1174 i__4 = *n + *ku + 1 - j, i__5 = *kl + *ku + 1;
1175 i__3 = f2cmin(i__4,i__5);
1176 for (i__ = f2cmax(i__2,1); i__ <= i__3; ++i__) {
1178 r__1 = anorm, r__2 = c_abs(&ab[i__ + j * ab_dim1]);
1179 anorm = f2cmax(r__1,r__2);
1185 i__3 = *info - 1, i__2 = *kl + *ku;
1186 i__1 = f2cmin(i__3,i__2);
1188 i__4 = 1, i__5 = *kl + *ku + 2 - *info;
1189 rpvgrw = clantb_("M", "U", "N", info, &i__1, &afb[f2cmax(i__4,i__5)
1190 + afb_dim1], ldafb, &rwork[1]);
1191 if (rpvgrw == 0.f) {
1194 rpvgrw = anorm / rpvgrw;
1202 /* Compute the norm of the matrix A and the */
1203 /* reciprocal pivot growth factor RPVGRW. */
1206 *(unsigned char *)norm = '1';
1208 *(unsigned char *)norm = 'I';
1210 anorm = clangb_(norm, n, kl, ku, &ab[ab_offset], ldab, &rwork[1]);
1212 rpvgrw = clantb_("M", "U", "N", n, &i__1, &afb[afb_offset], ldafb, &rwork[
1214 if (rpvgrw == 0.f) {
1217 rpvgrw = clangb_("M", n, kl, ku, &ab[ab_offset], ldab, &rwork[1]) / rpvgrw;
1220 /* Compute the reciprocal of the condition number of A. */
1222 cgbcon_(norm, n, kl, ku, &afb[afb_offset], ldafb, &ipiv[1], &anorm, rcond,
1223 &work[1], &rwork[1], info);
1225 /* Compute the solution matrix X. */
1227 clacpy_("Full", n, nrhs, &b[b_offset], ldb, &x[x_offset], ldx);
1228 cgbtrs_(trans, n, kl, ku, nrhs, &afb[afb_offset], ldafb, &ipiv[1], &x[
1229 x_offset], ldx, info);
1231 /* Use iterative refinement to improve the computed solution and */
1232 /* compute error bounds and backward error estimates for it. */
1234 cgbrfs_(trans, n, kl, ku, nrhs, &ab[ab_offset], ldab, &afb[afb_offset],
1235 ldafb, &ipiv[1], &b[b_offset], ldb, &x[x_offset], ldx, &ferr[1], &
1236 berr[1], &work[1], &rwork[1], info);
1238 /* Transform the solution matrix X to a solution of the original */
1244 for (j = 1; j <= i__1; ++j) {
1246 for (i__ = 1; i__ <= i__3; ++i__) {
1247 i__2 = i__ + j * x_dim1;
1249 i__5 = i__ + j * x_dim1;
1250 q__1.r = c__[i__4] * x[i__5].r, q__1.i = c__[i__4] * x[
1252 x[i__2].r = q__1.r, x[i__2].i = q__1.i;
1258 for (j = 1; j <= i__1; ++j) {
1263 } else if (rowequ) {
1265 for (j = 1; j <= i__1; ++j) {
1267 for (i__ = 1; i__ <= i__3; ++i__) {
1268 i__2 = i__ + j * x_dim1;
1270 i__5 = i__ + j * x_dim1;
1271 q__1.r = r__[i__4] * x[i__5].r, q__1.i = r__[i__4] * x[i__5]
1273 x[i__2].r = q__1.r, x[i__2].i = q__1.i;
1279 for (j = 1; j <= i__1; ++j) {
1285 /* Set INFO = N+1 if the matrix is singular to working precision. */
1287 if (*rcond < slamch_("Epsilon")) {