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> DPTSVX computes the solution to system of linear equations A * X = B for PT matrices</b> */
519 /* =========== DOCUMENTATION =========== */
521 /* Online html documentation available at */
522 /* http://www.netlib.org/lapack/explore-html/ */
525 /* > Download DPTSVX + dependencies */
526 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/dptsvx.
529 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/dptsvx.
532 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/dptsvx.
540 /* SUBROUTINE DPTSVX( FACT, N, NRHS, D, E, DF, EF, B, LDB, X, LDX, */
541 /* RCOND, FERR, BERR, WORK, INFO ) */
544 /* INTEGER INFO, LDB, LDX, N, NRHS */
545 /* DOUBLE PRECISION RCOND */
546 /* DOUBLE PRECISION B( LDB, * ), BERR( * ), D( * ), DF( * ), */
547 /* $ E( * ), EF( * ), FERR( * ), WORK( * ), */
551 /* > \par Purpose: */
556 /* > DPTSVX uses the factorization A = L*D*L**T to compute the solution */
557 /* > to a real system of linear equations A*X = B, where A is an N-by-N */
558 /* > symmetric positive definite tridiagonal matrix and X and B are */
559 /* > N-by-NRHS matrices. */
561 /* > Error bounds on the solution and a condition estimate are also */
565 /* > \par Description: */
566 /* ================= */
570 /* > The following steps are performed: */
572 /* > 1. If FACT = 'N', the matrix A is factored as A = L*D*L**T, where L */
573 /* > is a unit lower bidiagonal matrix and D is diagonal. The */
574 /* > factorization can also be regarded as having the form */
575 /* > A = U**T*D*U. */
577 /* > 2. If the leading i-by-i principal minor is not positive definite, */
578 /* > then the routine returns with INFO = i. Otherwise, the factored */
579 /* > form of A is used to estimate the condition number of the matrix */
580 /* > A. If the reciprocal of the condition number is less than machine */
581 /* > precision, INFO = N+1 is returned as a warning, but the routine */
582 /* > still goes on to solve for X and compute error bounds as */
583 /* > described below. */
585 /* > 3. The system of equations is solved for X using the factored form */
588 /* > 4. Iterative refinement is applied to improve the computed solution */
589 /* > matrix and calculate error bounds and backward error estimates */
596 /* > \param[in] FACT */
598 /* > FACT is CHARACTER*1 */
599 /* > Specifies whether or not the factored form of A has been */
600 /* > supplied on entry. */
601 /* > = 'F': On entry, DF and EF contain the factored form of A. */
602 /* > D, E, DF, and EF will not be modified. */
603 /* > = 'N': The matrix A will be copied to DF and EF and */
610 /* > The order of the matrix A. N >= 0. */
613 /* > \param[in] NRHS */
615 /* > NRHS is INTEGER */
616 /* > The number of right hand sides, i.e., the number of columns */
617 /* > of the matrices B and X. NRHS >= 0. */
622 /* > D is DOUBLE PRECISION array, dimension (N) */
623 /* > The n diagonal elements of the tridiagonal matrix A. */
628 /* > E is DOUBLE PRECISION array, dimension (N-1) */
629 /* > The (n-1) subdiagonal elements of the tridiagonal matrix A. */
632 /* > \param[in,out] DF */
634 /* > DF is DOUBLE PRECISION array, dimension (N) */
635 /* > If FACT = 'F', then DF is an input argument and on entry */
636 /* > contains the n diagonal elements of the diagonal matrix D */
637 /* > from the L*D*L**T factorization of A. */
638 /* > If FACT = 'N', then DF is an output argument and on exit */
639 /* > contains the n diagonal elements of the diagonal matrix D */
640 /* > from the L*D*L**T factorization of A. */
643 /* > \param[in,out] EF */
645 /* > EF is DOUBLE PRECISION array, dimension (N-1) */
646 /* > If FACT = 'F', then EF is an input argument and on entry */
647 /* > contains the (n-1) subdiagonal elements of the unit */
648 /* > bidiagonal factor L from the L*D*L**T factorization of A. */
649 /* > If FACT = 'N', then EF is an output argument and on exit */
650 /* > contains the (n-1) subdiagonal elements of the unit */
651 /* > bidiagonal factor L from the L*D*L**T factorization of A. */
656 /* > B is DOUBLE PRECISION array, dimension (LDB,NRHS) */
657 /* > The N-by-NRHS right hand side matrix B. */
660 /* > \param[in] LDB */
662 /* > LDB is INTEGER */
663 /* > The leading dimension of the array B. LDB >= f2cmax(1,N). */
666 /* > \param[out] X */
668 /* > X is DOUBLE PRECISION array, dimension (LDX,NRHS) */
669 /* > If INFO = 0 of INFO = N+1, the N-by-NRHS solution matrix X. */
672 /* > \param[in] LDX */
674 /* > LDX is INTEGER */
675 /* > The leading dimension of the array X. LDX >= f2cmax(1,N). */
678 /* > \param[out] RCOND */
680 /* > RCOND is DOUBLE PRECISION */
681 /* > The reciprocal condition number of the matrix A. If RCOND */
682 /* > is less than the machine precision (in particular, if */
683 /* > RCOND = 0), the matrix is singular to working precision. */
684 /* > This condition is indicated by a return code of INFO > 0. */
687 /* > \param[out] FERR */
689 /* > FERR is DOUBLE PRECISION array, dimension (NRHS) */
690 /* > The forward error bound for each solution vector */
691 /* > X(j) (the j-th column of the solution matrix X). */
692 /* > If XTRUE is the true solution corresponding to X(j), FERR(j) */
693 /* > is an estimated upper bound for the magnitude of the largest */
694 /* > element in (X(j) - XTRUE) divided by the magnitude of the */
695 /* > largest element in X(j). */
698 /* > \param[out] BERR */
700 /* > BERR is DOUBLE PRECISION array, dimension (NRHS) */
701 /* > The componentwise relative backward error of each solution */
702 /* > vector X(j) (i.e., the smallest relative change in any */
703 /* > element of A or B that makes X(j) an exact solution). */
706 /* > \param[out] WORK */
708 /* > WORK is DOUBLE PRECISION array, dimension (2*N) */
711 /* > \param[out] INFO */
713 /* > INFO is INTEGER */
714 /* > = 0: successful exit */
715 /* > < 0: if INFO = -i, the i-th argument had an illegal value */
716 /* > > 0: if INFO = i, and i is */
717 /* > <= N: the leading minor of order i of A is */
718 /* > not positive definite, so the factorization */
719 /* > could not be completed, and the solution has not */
720 /* > been computed. RCOND = 0 is returned. */
721 /* > = N+1: U is nonsingular, but RCOND is less than machine */
722 /* > precision, meaning that the matrix is singular */
723 /* > to working precision. Nevertheless, the */
724 /* > solution and error bounds are computed because */
725 /* > there are a number of situations where the */
726 /* > computed solution can be more accurate than the */
727 /* > value of RCOND would suggest. */
733 /* > \author Univ. of Tennessee */
734 /* > \author Univ. of California Berkeley */
735 /* > \author Univ. of Colorado Denver */
736 /* > \author NAG Ltd. */
738 /* > \date December 2016 */
740 /* > \ingroup doublePTsolve */
742 /* ===================================================================== */
743 /* Subroutine */ int dptsvx_(char *fact, integer *n, integer *nrhs,
744 doublereal *d__, doublereal *e, doublereal *df, doublereal *ef,
745 doublereal *b, integer *ldb, doublereal *x, integer *ldx, doublereal *
746 rcond, doublereal *ferr, doublereal *berr, doublereal *work, integer *
749 /* System generated locals */
750 integer b_dim1, b_offset, x_dim1, x_offset, i__1;
752 /* Local variables */
753 extern logical lsame_(char *, char *);
755 extern /* Subroutine */ int dcopy_(integer *, doublereal *, integer *,
756 doublereal *, integer *);
757 extern doublereal dlamch_(char *);
759 extern /* Subroutine */ int dlacpy_(char *, integer *, integer *,
760 doublereal *, integer *, doublereal *, integer *),
761 xerbla_(char *, integer *, ftnlen);
762 extern doublereal dlanst_(char *, integer *, doublereal *, doublereal *);
763 extern /* Subroutine */ int dptcon_(integer *, doublereal *, doublereal *,
764 doublereal *, doublereal *, doublereal *, integer *), dptrfs_(
765 integer *, integer *, doublereal *, doublereal *, doublereal *,
766 doublereal *, doublereal *, integer *, doublereal *, integer *,
767 doublereal *, doublereal *, doublereal *, integer *), dpttrf_(
768 integer *, doublereal *, doublereal *, integer *), dpttrs_(
769 integer *, integer *, doublereal *, doublereal *, doublereal *,
770 integer *, integer *);
773 /* -- LAPACK driver routine (version 3.7.0) -- */
774 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
775 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
779 /* ===================================================================== */
782 /* Test the input parameters. */
784 /* Parameter adjustments */
790 b_offset = 1 + b_dim1 * 1;
793 x_offset = 1 + x_dim1 * 1;
801 nofact = lsame_(fact, "N");
802 if (! nofact && ! lsame_(fact, "F")) {
806 } else if (*nrhs < 0) {
808 } else if (*ldb < f2cmax(1,*n)) {
810 } else if (*ldx < f2cmax(1,*n)) {
815 xerbla_("DPTSVX", &i__1, (ftnlen)6);
821 /* Compute the L*D*L**T (or U**T*D*U) factorization of A. */
823 dcopy_(n, &d__[1], &c__1, &df[1], &c__1);
826 dcopy_(&i__1, &e[1], &c__1, &ef[1], &c__1);
828 dpttrf_(n, &df[1], &ef[1], info);
830 /* Return if INFO is non-zero. */
838 /* Compute the norm of the matrix A. */
840 anorm = dlanst_("1", n, &d__[1], &e[1]);
842 /* Compute the reciprocal of the condition number of A. */
844 dptcon_(n, &df[1], &ef[1], &anorm, rcond, &work[1], info);
846 /* Compute the solution vectors X. */
848 dlacpy_("Full", n, nrhs, &b[b_offset], ldb, &x[x_offset], ldx);
849 dpttrs_(n, nrhs, &df[1], &ef[1], &x[x_offset], ldx, info);
851 /* Use iterative refinement to improve the computed solutions and */
852 /* compute error bounds and backward error estimates for them. */
854 dptrfs_(n, nrhs, &d__[1], &e[1], &df[1], &ef[1], &b[b_offset], ldb, &x[
855 x_offset], ldx, &ferr[1], &berr[1], &work[1], info);
857 /* Set INFO = N+1 if the matrix is singular to working precision. */
859 if (*rcond < dlamch_("Epsilon")) {