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 integer c__1 = 1;
517 /* > \brief <b> CPBSVX computes the solution to system of linear equations A * X = B for OTHER matrices</b> */
519 /* =========== DOCUMENTATION =========== */
521 /* Online html documentation available at */
522 /* http://www.netlib.org/lapack/explore-html/ */
525 /* > Download CPBSVX + dependencies */
526 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/cpbsvx.
529 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/cpbsvx.
532 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/cpbsvx.
540 /* SUBROUTINE CPBSVX( FACT, UPLO, N, KD, NRHS, AB, LDAB, AFB, LDAFB, */
541 /* EQUED, S, B, LDB, X, LDX, RCOND, FERR, BERR, */
542 /* WORK, RWORK, INFO ) */
544 /* CHARACTER EQUED, FACT, UPLO */
545 /* INTEGER INFO, KD, LDAB, LDAFB, LDB, LDX, N, NRHS */
547 /* REAL BERR( * ), FERR( * ), RWORK( * ), S( * ) */
548 /* COMPLEX AB( LDAB, * ), AFB( LDAFB, * ), B( LDB, * ), */
549 /* $ WORK( * ), X( LDX, * ) */
552 /* > \par Purpose: */
557 /* > CPBSVX uses the Cholesky factorization A = U**H*U or A = L*L**H to */
558 /* > compute the solution to a complex system of linear equations */
560 /* > where A is an N-by-N Hermitian positive definite band matrix and X */
561 /* > and B are N-by-NRHS matrices. */
563 /* > Error bounds on the solution and a condition estimate are also */
567 /* > \par Description: */
568 /* ================= */
572 /* > The following steps are performed: */
574 /* > 1. If FACT = 'E', real scaling factors are computed to equilibrate */
576 /* > diag(S) * A * diag(S) * inv(diag(S)) * X = diag(S) * B */
577 /* > Whether or not the system will be equilibrated depends on the */
578 /* > scaling of the matrix A, but if equilibration is used, A is */
579 /* > overwritten by diag(S)*A*diag(S) and B by diag(S)*B. */
581 /* > 2. If FACT = 'N' or 'E', the Cholesky decomposition is used to */
582 /* > factor the matrix A (after equilibration if FACT = 'E') as */
583 /* > A = U**H * U, if UPLO = 'U', or */
584 /* > A = L * L**H, if UPLO = 'L', */
585 /* > where U is an upper triangular band matrix, and L is a lower */
586 /* > triangular band matrix. */
588 /* > 3. If the leading i-by-i principal minor is not positive definite, */
589 /* > then the routine returns with INFO = i. Otherwise, the factored */
590 /* > form of A is used to estimate the condition number of the matrix */
591 /* > A. If the reciprocal of the condition number is less than machine */
592 /* > precision, INFO = N+1 is returned as a warning, but the routine */
593 /* > still goes on to solve for X and compute error bounds as */
594 /* > described below. */
596 /* > 4. The system of equations is solved for X using the factored form */
599 /* > 5. Iterative refinement is applied to improve the computed solution */
600 /* > matrix and calculate error bounds and backward error estimates */
603 /* > 6. If equilibration was used, the matrix X is premultiplied by */
604 /* > diag(S) so that it solves the original system before */
605 /* > equilibration. */
611 /* > \param[in] FACT */
613 /* > FACT is CHARACTER*1 */
614 /* > Specifies whether or not the factored form of the matrix A is */
615 /* > supplied on entry, and if not, whether the matrix A should be */
616 /* > equilibrated before it is factored. */
617 /* > = 'F': On entry, AFB contains the factored form of A. */
618 /* > If EQUED = 'Y', the matrix A has been equilibrated */
619 /* > with scaling factors given by S. AB and AFB will not */
621 /* > = 'N': The matrix A will be copied to AFB and factored. */
622 /* > = 'E': The matrix A will be equilibrated if necessary, then */
623 /* > copied to AFB and factored. */
626 /* > \param[in] UPLO */
628 /* > UPLO is CHARACTER*1 */
629 /* > = 'U': Upper triangle of A is stored; */
630 /* > = 'L': Lower triangle of A is stored. */
636 /* > The number of linear equations, i.e., the order of the */
637 /* > matrix A. N >= 0. */
640 /* > \param[in] KD */
642 /* > KD is INTEGER */
643 /* > The number of superdiagonals of the matrix A if UPLO = 'U', */
644 /* > or the number of subdiagonals if UPLO = 'L'. KD >= 0. */
647 /* > \param[in] NRHS */
649 /* > NRHS is INTEGER */
650 /* > The number of right-hand sides, i.e., the number of columns */
651 /* > of the matrices B and X. NRHS >= 0. */
654 /* > \param[in,out] AB */
656 /* > AB is COMPLEX array, dimension (LDAB,N) */
657 /* > On entry, the upper or lower triangle of the Hermitian band */
658 /* > matrix A, stored in the first KD+1 rows of the array, except */
659 /* > if FACT = 'F' and EQUED = 'Y', then A must contain the */
660 /* > equilibrated matrix diag(S)*A*diag(S). The j-th column of A */
661 /* > is stored in the j-th column of the array AB as follows: */
662 /* > if UPLO = 'U', AB(KD+1+i-j,j) = A(i,j) for f2cmax(1,j-KD)<=i<=j; */
663 /* > if UPLO = 'L', AB(1+i-j,j) = A(i,j) for j<=i<=f2cmin(N,j+KD). */
664 /* > See below for further details. */
666 /* > On exit, if FACT = 'E' and EQUED = 'Y', A is overwritten by */
667 /* > diag(S)*A*diag(S). */
670 /* > \param[in] LDAB */
672 /* > LDAB is INTEGER */
673 /* > The leading dimension of the array A. LDAB >= KD+1. */
676 /* > \param[in,out] AFB */
678 /* > AFB is COMPLEX array, dimension (LDAFB,N) */
679 /* > If FACT = 'F', then AFB is an input argument and on entry */
680 /* > contains the triangular factor U or L from the Cholesky */
681 /* > factorization A = U**H*U or A = L*L**H of the band matrix */
682 /* > A, in the same storage format as A (see AB). If EQUED = 'Y', */
683 /* > then AFB is the factored form of the equilibrated matrix A. */
685 /* > If FACT = 'N', then AFB is an output argument and on exit */
686 /* > returns the triangular factor U or L from the Cholesky */
687 /* > factorization A = U**H*U or A = L*L**H. */
689 /* > If FACT = 'E', then AFB is an output argument and on exit */
690 /* > returns the triangular factor U or L from the Cholesky */
691 /* > factorization A = U**H*U or A = L*L**H of the equilibrated */
692 /* > matrix A (see the description of A for the form of the */
693 /* > equilibrated matrix). */
696 /* > \param[in] LDAFB */
698 /* > LDAFB is INTEGER */
699 /* > The leading dimension of the array AFB. LDAFB >= KD+1. */
702 /* > \param[in,out] EQUED */
704 /* > EQUED is CHARACTER*1 */
705 /* > Specifies the form of equilibration that was done. */
706 /* > = 'N': No equilibration (always true if FACT = 'N'). */
707 /* > = 'Y': Equilibration was done, i.e., A has been replaced by */
708 /* > diag(S) * A * diag(S). */
709 /* > EQUED is an input argument if FACT = 'F'; otherwise, it is an */
710 /* > output argument. */
713 /* > \param[in,out] S */
715 /* > S is REAL array, dimension (N) */
716 /* > The scale factors for A; not accessed if EQUED = 'N'. S is */
717 /* > an input argument if FACT = 'F'; otherwise, S is an output */
718 /* > argument. If FACT = 'F' and EQUED = 'Y', each element of S */
719 /* > must be positive. */
722 /* > \param[in,out] B */
724 /* > B is COMPLEX array, dimension (LDB,NRHS) */
725 /* > On entry, the N-by-NRHS right hand side matrix B. */
726 /* > On exit, if EQUED = 'N', B is not modified; if EQUED = 'Y', */
727 /* > B is overwritten by diag(S) * B. */
730 /* > \param[in] LDB */
732 /* > LDB is INTEGER */
733 /* > The leading dimension of the array B. LDB >= f2cmax(1,N). */
736 /* > \param[out] X */
738 /* > X is COMPLEX array, dimension (LDX,NRHS) */
739 /* > If INFO = 0 or INFO = N+1, the N-by-NRHS solution matrix X to */
740 /* > the original system of equations. Note that if EQUED = 'Y', */
741 /* > A and B are modified on exit, and the solution to the */
742 /* > equilibrated system is inv(diag(S))*X. */
745 /* > \param[in] LDX */
747 /* > LDX is INTEGER */
748 /* > The leading dimension of the array X. LDX >= f2cmax(1,N). */
751 /* > \param[out] RCOND */
753 /* > RCOND is REAL */
754 /* > The estimate of the reciprocal condition number of the matrix */
755 /* > A after equilibration (if done). If RCOND is less than the */
756 /* > machine precision (in particular, if RCOND = 0), the matrix */
757 /* > is singular to working precision. This condition is */
758 /* > indicated by a return code of INFO > 0. */
761 /* > \param[out] FERR */
763 /* > FERR is REAL array, dimension (NRHS) */
764 /* > The estimated forward error bound for each solution vector */
765 /* > X(j) (the j-th column of the solution matrix X). */
766 /* > If XTRUE is the true solution corresponding to X(j), FERR(j) */
767 /* > is an estimated upper bound for the magnitude of the largest */
768 /* > element in (X(j) - XTRUE) divided by the magnitude of the */
769 /* > largest element in X(j). The estimate is as reliable as */
770 /* > the estimate for RCOND, and is almost always a slight */
771 /* > overestimate of the true error. */
774 /* > \param[out] BERR */
776 /* > BERR is REAL array, dimension (NRHS) */
777 /* > The componentwise relative backward error of each solution */
778 /* > vector X(j) (i.e., the smallest relative change in */
779 /* > any element of A or B that makes X(j) an exact solution). */
782 /* > \param[out] WORK */
784 /* > WORK is COMPLEX array, dimension (2*N) */
787 /* > \param[out] RWORK */
789 /* > RWORK is REAL array, dimension (N) */
792 /* > \param[out] INFO */
794 /* > INFO is INTEGER */
795 /* > = 0: successful exit */
796 /* > < 0: if INFO = -i, the i-th argument had an illegal value */
797 /* > > 0: if INFO = i, and i is */
798 /* > <= N: the leading minor of order i of A is */
799 /* > not positive definite, so the factorization */
800 /* > could not be completed, and the solution has not */
801 /* > been computed. RCOND = 0 is returned. */
802 /* > = N+1: U is nonsingular, but RCOND is less than machine */
803 /* > precision, meaning that the matrix is singular */
804 /* > to working precision. Nevertheless, the */
805 /* > solution and error bounds are computed because */
806 /* > there are a number of situations where the */
807 /* > computed solution can be more accurate than the */
808 /* > value of RCOND would suggest. */
814 /* > \author Univ. of Tennessee */
815 /* > \author Univ. of California Berkeley */
816 /* > \author Univ. of Colorado Denver */
817 /* > \author NAG Ltd. */
819 /* > \date April 2012 */
821 /* > \ingroup complexOTHERsolve */
823 /* > \par Further Details: */
824 /* ===================== */
828 /* > The band storage scheme is illustrated by the following example, when */
829 /* > N = 6, KD = 2, and UPLO = 'U': */
831 /* > Two-dimensional storage of the Hermitian matrix A: */
838 /* > (aij=conjg(aji)) a66 */
840 /* > Band storage of the upper triangle of A: */
842 /* > * * a13 a24 a35 a46 */
843 /* > * a12 a23 a34 a45 a56 */
844 /* > a11 a22 a33 a44 a55 a66 */
846 /* > Similarly, if UPLO = 'L' the format of A is as follows: */
848 /* > a11 a22 a33 a44 a55 a66 */
849 /* > a21 a32 a43 a54 a65 * */
850 /* > a31 a42 a53 a64 * * */
852 /* > Array elements marked * are not used by the routine. */
855 /* ===================================================================== */
856 /* Subroutine */ int cpbsvx_(char *fact, char *uplo, integer *n, integer *kd,
857 integer *nrhs, complex *ab, integer *ldab, complex *afb, integer *
858 ldafb, char *equed, real *s, complex *b, integer *ldb, complex *x,
859 integer *ldx, real *rcond, real *ferr, real *berr, complex *work,
860 real *rwork, integer *info)
862 /* System generated locals */
863 integer ab_dim1, ab_offset, afb_dim1, afb_offset, b_dim1, b_offset,
864 x_dim1, x_offset, i__1, i__2, i__3, i__4, i__5;
868 /* Local variables */
869 real amax, smin, smax;
871 extern logical lsame_(char *, char *);
873 extern /* Subroutine */ int ccopy_(integer *, complex *, integer *,
874 complex *, integer *);
875 logical equil, rcequ, upper;
877 extern real clanhb_(char *, char *, integer *, integer *, complex *,
879 extern /* Subroutine */ int claqhb_(char *, integer *, integer *, complex
880 *, integer *, real *, real *, real *, char *),
881 cpbcon_(char *, integer *, integer *, complex *, integer *, real *
882 , real *, complex *, real *, integer *);
883 extern real slamch_(char *);
885 extern /* Subroutine */ int clacpy_(char *, integer *, integer *, complex
886 *, integer *, complex *, integer *), xerbla_(char *,
887 integer *, ftnlen), cpbequ_(char *, integer *, integer *, complex
888 *, integer *, real *, real *, real *, integer *), cpbrfs_(
889 char *, integer *, integer *, integer *, complex *, integer *,
890 complex *, integer *, complex *, integer *, complex *, integer *,
891 real *, real *, complex *, real *, integer *);
893 extern /* Subroutine */ int cpbtrf_(char *, integer *, integer *, complex
894 *, integer *, integer *);
896 extern /* Subroutine */ int cpbtrs_(char *, integer *, integer *, integer
897 *, complex *, integer *, complex *, integer *, integer *);
901 /* -- LAPACK driver routine (version 3.7.0) -- */
902 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
903 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
907 /* ===================================================================== */
910 /* Parameter adjustments */
912 ab_offset = 1 + ab_dim1 * 1;
915 afb_offset = 1 + afb_dim1 * 1;
919 b_offset = 1 + b_dim1 * 1;
922 x_offset = 1 + x_dim1 * 1;
931 nofact = lsame_(fact, "N");
932 equil = lsame_(fact, "E");
933 upper = lsame_(uplo, "U");
934 if (nofact || equil) {
935 *(unsigned char *)equed = 'N';
938 rcequ = lsame_(equed, "Y");
939 smlnum = slamch_("Safe minimum");
940 bignum = 1.f / smlnum;
943 /* Test the input parameters. */
945 if (! nofact && ! equil && ! lsame_(fact, "F")) {
947 } else if (! upper && ! lsame_(uplo, "L")) {
951 } else if (*kd < 0) {
953 } else if (*nrhs < 0) {
955 } else if (*ldab < *kd + 1) {
957 } else if (*ldafb < *kd + 1) {
959 } else if (lsame_(fact, "F") && ! (rcequ || lsame_(
967 for (j = 1; j <= i__1; ++j) {
969 r__1 = smin, r__2 = s[j];
970 smin = f2cmin(r__1,r__2);
972 r__1 = smax, r__2 = s[j];
973 smax = f2cmax(r__1,r__2);
979 scond = f2cmax(smin,smlnum) / f2cmin(smax,bignum);
985 if (*ldb < f2cmax(1,*n)) {
987 } else if (*ldx < f2cmax(1,*n)) {
995 xerbla_("CPBSVX", &i__1, (ftnlen)6);
1001 /* Compute row and column scalings to equilibrate the matrix A. */
1003 cpbequ_(uplo, n, kd, &ab[ab_offset], ldab, &s[1], &scond, &amax, &
1007 /* Equilibrate the matrix. */
1009 claqhb_(uplo, n, kd, &ab[ab_offset], ldab, &s[1], &scond, &amax,
1011 rcequ = lsame_(equed, "Y");
1015 /* Scale the right-hand side. */
1019 for (j = 1; j <= i__1; ++j) {
1021 for (i__ = 1; i__ <= i__2; ++i__) {
1022 i__3 = i__ + j * b_dim1;
1024 i__5 = i__ + j * b_dim1;
1025 q__1.r = s[i__4] * b[i__5].r, q__1.i = s[i__4] * b[i__5].i;
1026 b[i__3].r = q__1.r, b[i__3].i = q__1.i;
1033 if (nofact || equil) {
1035 /* Compute the Cholesky factorization A = U**H *U or A = L*L**H. */
1039 for (j = 1; j <= i__1; ++j) {
1042 j1 = f2cmax(i__2,1);
1044 ccopy_(&i__2, &ab[*kd + 1 - j + j1 + j * ab_dim1], &c__1, &
1045 afb[*kd + 1 - j + j1 + j * afb_dim1], &c__1);
1050 for (j = 1; j <= i__1; ++j) {
1053 j2 = f2cmin(i__2,*n);
1055 ccopy_(&i__2, &ab[j * ab_dim1 + 1], &c__1, &afb[j * afb_dim1
1061 cpbtrf_(uplo, n, kd, &afb[afb_offset], ldafb, info);
1063 /* Return if INFO is non-zero. */
1071 /* Compute the norm of the matrix A. */
1073 anorm = clanhb_("1", uplo, n, kd, &ab[ab_offset], ldab, &rwork[1]);
1075 /* Compute the reciprocal of the condition number of A. */
1077 cpbcon_(uplo, n, kd, &afb[afb_offset], ldafb, &anorm, rcond, &work[1], &
1080 /* Compute the solution matrix X. */
1082 clacpy_("Full", n, nrhs, &b[b_offset], ldb, &x[x_offset], ldx);
1083 cpbtrs_(uplo, n, kd, nrhs, &afb[afb_offset], ldafb, &x[x_offset], ldx,
1086 /* Use iterative refinement to improve the computed solution and */
1087 /* compute error bounds and backward error estimates for it. */
1089 cpbrfs_(uplo, n, kd, nrhs, &ab[ab_offset], ldab, &afb[afb_offset], ldafb,
1090 &b[b_offset], ldb, &x[x_offset], ldx, &ferr[1], &berr[1], &work[1]
1093 /* Transform the solution matrix X to a solution of the original */
1098 for (j = 1; j <= i__1; ++j) {
1100 for (i__ = 1; i__ <= i__2; ++i__) {
1101 i__3 = i__ + j * x_dim1;
1103 i__5 = i__ + j * x_dim1;
1104 q__1.r = s[i__4] * x[i__5].r, q__1.i = s[i__4] * x[i__5].i;
1105 x[i__3].r = q__1.r, x[i__3].i = q__1.i;
1111 for (j = 1; j <= i__1; ++j) {
1117 /* Set INFO = N+1 if the matrix is singular to working precision. */
1119 if (*rcond < slamch_("Epsilon")) {