/* Subroutine */ int dgbsvx_(char *fact, char *trans, integer *n, integer *kl, integer *ku, integer *nrhs, doublereal *ab, integer *ldab, doublereal *afb, integer *ldafb, integer *ipiv, char *equed, doublereal *r__, doublereal *c__, doublereal *b, integer *ldb, doublereal *x, integer *ldx, doublereal *rcond, doublereal *ferr, doublereal *berr, doublereal *work, integer *iwork, integer *info) { /* System generated locals */ integer ab_dim1, ab_offset, afb_dim1, afb_offset, b_dim1, b_offset, x_dim1, x_offset, i__1, i__2, i__3, i__4, i__5; doublereal d__1, d__2, d__3; /* Local variables */ integer i__, j, j1, j2; doublereal amax; char norm[1]; doublereal rcmin, rcmax, anorm; logical equil; doublereal colcnd; logical nofact; doublereal bignum; integer infequ; logical colequ; doublereal rowcnd; logical notran; doublereal smlnum; logical rowequ; doublereal rpvgrw; /* -- LAPACK driver routine (version 3.2) -- */ /* November 2006 */ /* Purpose */ /* ======= */ /* DGBSVX uses the LU factorization to compute the solution to a real */ /* system of linear equations A * X = B, A**T * X = B, or A**H * X = B, */ /* where A is a band matrix of order N with KL subdiagonals and KU */ /* superdiagonals, and X and B are N-by-NRHS matrices. */ /* Error bounds on the solution and a condition estimate are also */ /* provided. */ /* Description */ /* =========== */ /* The following steps are performed by this subroutine: */ /* 1. If FACT = 'E', real scaling factors are computed to equilibrate */ /* the system: */ /* TRANS = 'N': diag(R)*A*diag(C) *inv(diag(C))*X = diag(R)*B */ /* TRANS = 'T': (diag(R)*A*diag(C))**T *inv(diag(R))*X = diag(C)*B */ /* TRANS = 'C': (diag(R)*A*diag(C))**H *inv(diag(R))*X = diag(C)*B */ /* Whether or not the system will be equilibrated depends on the */ /* scaling of the matrix A, but if equilibration is used, A is */ /* overwritten by diag(R)*A*diag(C) and B by diag(R)*B (if TRANS='N') */ /* or diag(C)*B (if TRANS = 'T' or 'C'). */ /* 2. If FACT = 'N' or 'E', the LU decomposition is used to factor the */ /* matrix A (after equilibration if FACT = 'E') as */ /* A = L * U, */ /* where L is a product of permutation and unit lower triangular */ /* matrices with KL subdiagonals, and U is upper triangular with */ /* KL+KU superdiagonals. */ /* 3. If some U(i,i)=0, so that U is exactly singular, then the routine */ /* returns with INFO = i. Otherwise, the factored form of A is used */ /* to estimate the condition number of the matrix A. If the */ /* reciprocal of the condition number is less than machine precision, */ /* INFO = N+1 is returned as a warning, but the routine still goes on */ /* to solve for X and compute error bounds as described below. */ /* 4. The system of equations is solved for X using the factored form */ /* of A. */ /* 5. Iterative refinement is applied to improve the computed solution */ /* matrix and calculate error bounds and backward error estimates */ /* for it. */ /* 6. If equilibration was used, the matrix X is premultiplied by */ /* diag(C) (if TRANS = 'N') or diag(R) (if TRANS = 'T' or 'C') so */ /* that it solves the original system before equilibration. */ /* Arguments */ /* ========= */ /* FACT (input) CHARACTER*1 */ /* Specifies whether or not the factored form of the matrix A is */ /* supplied on entry, and if not, whether the matrix A should be */ /* equilibrated before it is factored. */ /* = 'F': On entry, AFB and IPIV contain the factored form of */ /* A. If EQUED is not 'N', the matrix A has been */ /* equilibrated with scaling factors given by R and C. */ /* AB, AFB, and IPIV are not modified. */ /* = 'N': The matrix A will be copied to AFB and factored. */ /* = 'E': The matrix A will be equilibrated if necessary, then */ /* copied to AFB and factored. */ /* TRANS (input) CHARACTER*1 */ /* Specifies the form of the system of equations. */ /* = 'N': A * X = B (No transpose) */ /* = 'T': A**T * X = B (Transpose) */ /* = 'C': A**H * X = B (Transpose) */ /* N (input) INTEGER */ /* The number of linear equations, i.e., the order of the */ /* matrix A. N >= 0. */ /* KL (input) INTEGER */ /* The number of subdiagonals within the band of A. KL >= 0. */ /* KU (input) INTEGER */ /* The number of superdiagonals within the band of A. KU >= 0. */ /* NRHS (input) INTEGER */ /* The number of right hand sides, i.e., the number of columns */ /* of the matrices B and X. NRHS >= 0. */ /* AB (input/output) DOUBLE PRECISION array, dimension (LDAB,N) */ /* On entry, the matrix A in band storage, in rows 1 to KL+KU+1. */ /* The j-th column of A is stored in the j-th column of the */ /* array AB as follows: */ /* AB(KU+1+i-j,j) = A(i,j) for max(1,j-KU)<=i<=min(N,j+kl) */ /* If FACT = 'F' and EQUED is not 'N', then A must have been */ /* equilibrated by the scaling factors in R and/or C. AB is not */ /* modified if FACT = 'F' or 'N', or if FACT = 'E' and */ /* EQUED = 'N' on exit. */ /* On exit, if EQUED .ne. 'N', A is scaled as follows: */ /* EQUED = 'R': A := diag(R) * A */ /* EQUED = 'C': A := A * diag(C) */ /* EQUED = 'B': A := diag(R) * A * diag(C). */ /* LDAB (input) INTEGER */ /* The leading dimension of the array AB. LDAB >= KL+KU+1. */ /* AFB (input or output) DOUBLE PRECISION array, dimension (LDAFB,N) */ /* If FACT = 'F', then AFB is an input argument and on entry */ /* contains details of the LU factorization of the band matrix */ /* A, as computed by DGBTRF. U is stored as an upper triangular */ /* band matrix with KL+KU superdiagonals in rows 1 to KL+KU+1, */ /* and the multipliers used during the factorization are stored */ /* in rows KL+KU+2 to 2*KL+KU+1. If EQUED .ne. 'N', then AFB is */ /* the factored form of the equilibrated matrix A. */ /* If FACT = 'N', then AFB is an output argument and on exit */ /* returns details of the LU factorization of A. */ /* If FACT = 'E', then AFB is an output argument and on exit */ /* returns details of the LU factorization of the equilibrated */ /* matrix A (see the description of AB for the form of the */ /* equilibrated matrix). */ /* LDAFB (input) INTEGER */ /* The leading dimension of the array AFB. LDAFB >= 2*KL+KU+1. */ /* IPIV (input or output) INTEGER array, dimension (N) */ /* If FACT = 'F', then IPIV is an input argument and on entry */ /* contains the pivot indices from the factorization A = L*U */ /* as computed by DGBTRF; row i of the matrix was interchanged */ /* with row IPIV(i). */ /* If FACT = 'N', then IPIV is an output argument and on exit */ /* contains the pivot indices from the factorization A = L*U */ /* of the original matrix A. */ /* If FACT = 'E', then IPIV is an output argument and on exit */ /* contains the pivot indices from the factorization A = L*U */ /* of the equilibrated matrix A. */ /* EQUED (input or output) CHARACTER*1 */ /* Specifies the form of equilibration that was done. */ /* = 'N': No equilibration (always true if FACT = 'N'). */ /* = 'R': Row equilibration, i.e., A has been premultiplied by */ /* diag(R). */ /* = 'C': Column equilibration, i.e., A has been postmultiplied */ /* by diag(C). */ /* = 'B': Both row and column equilibration, i.e., A has been */ /* replaced by diag(R) * A * diag(C). */ /* EQUED is an input argument if FACT = 'F'; otherwise, it is an */ /* output argument. */ /* R (input or output) DOUBLE PRECISION array, dimension (N) */ /* The row scale factors for A. If EQUED = 'R' or 'B', A is */ /* multiplied on the left by diag(R); if EQUED = 'N' or 'C', R */ /* is not accessed. R is an input argument if FACT = 'F'; */ /* otherwise, R is an output argument. If FACT = 'F' and */ /* EQUED = 'R' or 'B', each element of R must be positive. */ /* C (input or output) DOUBLE PRECISION array, dimension (N) */ /* The column scale factors for A. If EQUED = 'C' or 'B', A is */ /* multiplied on the right by diag(C); if EQUED = 'N' or 'R', C */ /* is not accessed. C is an input argument if FACT = 'F'; */ /* otherwise, C is an output argument. If FACT = 'F' and */ /* EQUED = 'C' or 'B', each element of C must be positive. */ /* B (input/output) DOUBLE PRECISION array, dimension (LDB,NRHS) */ /* On entry, the right hand side matrix B. */ /* On exit, */ /* if EQUED = 'N', B is not modified; */ /* if TRANS = 'N' and EQUED = 'R' or 'B', B is overwritten by */ /* diag(R)*B; */ /* if TRANS = 'T' or 'C' and EQUED = 'C' or 'B', B is */ /* overwritten by diag(C)*B. */ /* LDB (input) INTEGER */ /* The leading dimension of the array B. LDB >= max(1,N). */ /* X (output) DOUBLE PRECISION array, dimension (LDX,NRHS) */ /* If INFO = 0 or INFO = N+1, the N-by-NRHS solution matrix X */ /* to the original system of equations. Note that A and B are */ /* modified on exit if EQUED .ne. 'N', and the solution to the */ /* equilibrated system is inv(diag(C))*X if TRANS = 'N' and */ /* EQUED = 'C' or 'B', or inv(diag(R))*X if TRANS = 'T' or 'C' */ /* and EQUED = 'R' or 'B'. */ /* LDX (input) INTEGER */ /* The leading dimension of the array X. LDX >= max(1,N). */ /* RCOND (output) DOUBLE PRECISION */ /* The estimate of the reciprocal condition number of the matrix */ /* A after equilibration (if done). If RCOND is less than the */ /* machine precision (in particular, if RCOND = 0), the matrix */ /* is singular to working precision. This condition is */ /* indicated by a return code of INFO > 0. */ /* FERR (output) DOUBLE PRECISION array, dimension (NRHS) */ /* The estimated forward error bound for each solution vector */ /* X(j) (the j-th column of the solution matrix X). */ /* If XTRUE is the true solution corresponding to X(j), FERR(j) */ /* is an estimated upper bound for the magnitude of the largest */ /* element in (X(j) - XTRUE) divided by the magnitude of the */ /* largest element in X(j). The estimate is as reliable as */ /* the estimate for RCOND, and is almost always a slight */ /* overestimate of the true error. */ /* BERR (output) DOUBLE PRECISION array, dimension (NRHS) */ /* The componentwise relative backward error of each solution */ /* vector X(j) (i.e., the smallest relative change in */ /* any element of A or B that makes X(j) an exact solution). */ /* WORK (workspace/output) DOUBLE PRECISION array, dimension (3*N) */ /* On exit, WORK(1) contains the reciprocal pivot growth */ /* factor norm(A)/norm(U). The "max absolute element" norm is */ /* used. If WORK(1) is much less than 1, then the stability */ /* of the LU factorization of the (equilibrated) matrix A */ /* could be poor. This also means that the solution X, condition */ /* estimator RCOND, and forward error bound FERR could be */ /* unreliable. If factorization fails with 0<INFO<=N, then */ /* WORK(1) contains the reciprocal pivot growth factor for the */ /* leading INFO columns of A. */ /* IWORK (workspace) INTEGER array, dimension (N) */ /* INFO (output) INTEGER */ /* = 0: successful exit */ /* < 0: if INFO = -i, the i-th argument had an illegal value */ /* > 0: if INFO = i, and i is */ /* <= N: U(i,i) is exactly zero. The factorization */ /* has been completed, but the factor U is exactly */ /* singular, so the solution and error bounds */ /* could not be computed. RCOND = 0 is returned. */ /* = N+1: U is nonsingular, but RCOND is less than machine */ /* precision, meaning that the matrix is singular */ /* to working precision. Nevertheless, the */ /* solution and error bounds are computed because */ /* there are a number of situations where the */ /* computed solution can be more accurate than the */ /* value of RCOND would suggest. */ /* ===================================================================== */ /* Parameter adjustments */ ab_dim1 = *ldab; ab_offset = 1 + ab_dim1; ab -= ab_offset; afb_dim1 = *ldafb; afb_offset = 1 + afb_dim1; afb -= afb_offset; --ipiv; --r__; --c__; b_dim1 = *ldb; b_offset = 1 + b_dim1; b -= b_offset; x_dim1 = *ldx; x_offset = 1 + x_dim1; x -= x_offset; --ferr; --berr; --work; --iwork; /* Function Body */ *info = 0; nofact = lsame_(fact, "N"); equil = lsame_(fact, "E"); notran = lsame_(trans, "N"); if (nofact || equil) { *(unsigned char *)equed = 'N'; rowequ = FALSE_; colequ = FALSE_; } else { rowequ = lsame_(equed, "R") || lsame_(equed, "B"); colequ = lsame_(equed, "C") || lsame_(equed, "B"); smlnum = dlamch_("Safe minimum"); bignum = 1. / smlnum; } /* Test the input parameters. */ if (! nofact && ! equil && ! lsame_(fact, "F")) { *info = -1; } else if (! notran && ! lsame_(trans, "T") && ! lsame_(trans, "C")) { *info = -2; } else if (*n < 0) { *info = -3; } else if (*kl < 0) { *info = -4; } else if (*ku < 0) { *info = -5; } else if (*nrhs < 0) { *info = -6; } else if (*ldab < *kl + *ku + 1) { *info = -8; } else if (*ldafb < (*kl << 1) + *ku + 1) { *info = -10; } else if (lsame_(fact, "F") && ! (rowequ || colequ || lsame_(equed, "N"))) { *info = -12; } else { if (rowequ) { rcmin = bignum; rcmax = 0.; i__1 = *n; for (j = 1; j <= i__1; ++j) { /* Computing MIN */ d__1 = rcmin, d__2 = r__[j]; rcmin = min(d__1,d__2); /* Computing MAX */ d__1 = rcmax, d__2 = r__[j]; rcmax = max(d__1,d__2); } if (rcmin <= 0.) { *info = -13; } else if (*n > 0) { rowcnd = max(rcmin,smlnum) / min(rcmax,bignum); } else { rowcnd = 1.; } } if (colequ && *info == 0) { rcmin = bignum; rcmax = 0.; i__1 = *n; for (j = 1; j <= i__1; ++j) { /* Computing MIN */ d__1 = rcmin, d__2 = c__[j]; rcmin = min(d__1,d__2); /* Computing MAX */ d__1 = rcmax, d__2 = c__[j]; rcmax = max(d__1,d__2); } if (rcmin <= 0.) { *info = -14; } else if (*n > 0) { colcnd = max(rcmin,smlnum) / min(rcmax,bignum); } else { colcnd = 1.; } } if (*info == 0) { if (*ldb < max(1,*n)) { *info = -16; } else if (*ldx < max(1,*n)) { *info = -18; } } } if (*info != 0) { i__1 = -(*info); xerbla_("DGBSVX", &i__1); return 0; } if (equil) { /* Compute row and column scalings to equilibrate the matrix A. */ dgbequ_(n, n, kl, ku, &ab[ab_offset], ldab, &r__[1], &c__[1], &rowcnd, &colcnd, &amax, &infequ); if (infequ == 0) { /* Equilibrate the matrix. */ dlaqgb_(n, n, kl, ku, &ab[ab_offset], ldab, &r__[1], &c__[1], & rowcnd, &colcnd, &amax, equed); rowequ = lsame_(equed, "R") || lsame_(equed, "B"); colequ = lsame_(equed, "C") || lsame_(equed, "B"); } } /* Scale the right hand side. */ if (notran) { if (rowequ) { i__1 = *nrhs; for (j = 1; j <= i__1; ++j) { i__2 = *n; for (i__ = 1; i__ <= i__2; ++i__) { b[i__ + j * b_dim1] = r__[i__] * b[i__ + j * b_dim1]; } } } } else if (colequ) { i__1 = *nrhs; for (j = 1; j <= i__1; ++j) { i__2 = *n; for (i__ = 1; i__ <= i__2; ++i__) { b[i__ + j * b_dim1] = c__[i__] * b[i__ + j * b_dim1]; } } } if (nofact || equil) { /* Compute the LU factorization of the band matrix A. */ i__1 = *n; for (j = 1; j <= i__1; ++j) { /* Computing MAX */ i__2 = j - *ku; j1 = max(i__2,1); /* Computing MIN */ i__2 = j + *kl; j2 = min(i__2,*n); i__2 = j2 - j1 + 1; dcopy_(&i__2, &ab[*ku + 1 - j + j1 + j * ab_dim1], &c__1, &afb[* kl + *ku + 1 - j + j1 + j * afb_dim1], &c__1); } dgbtrf_(n, n, kl, ku, &afb[afb_offset], ldafb, &ipiv[1], info); /* Return if INFO is non-zero. */ if (*info > 0) { /* Compute the reciprocal pivot growth factor of the */ /* leading rank-deficient INFO columns of A. */ anorm = 0.; i__1 = *info; for (j = 1; j <= i__1; ++j) { /* Computing MAX */ i__2 = *ku + 2 - j; /* Computing MIN */ i__4 = *n + *ku + 1 - j, i__5 = *kl + *ku + 1; i__3 = min(i__4,i__5); for (i__ = max(i__2,1); i__ <= i__3; ++i__) { /* Computing MAX */ d__2 = anorm, d__3 = (d__1 = ab[i__ + j * ab_dim1], abs( d__1)); anorm = max(d__2,d__3); } } /* Computing MIN */ i__3 = *info - 1, i__2 = *kl + *ku; i__1 = min(i__3,i__2); /* Computing MAX */ i__4 = 1, i__5 = *kl + *ku + 2 - *info; rpvgrw = dlantb_("M", "U", "N", info, &i__1, &afb[max(i__4, i__5) + afb_dim1], ldafb, &work[1]); if (rpvgrw == 0.) { rpvgrw = 1.; } else { rpvgrw = anorm / rpvgrw; } work[1] = rpvgrw; *rcond = 0.; return 0; } } /* Compute the norm of the matrix A and the */ /* reciprocal pivot growth factor RPVGRW. */ if (notran) { *(unsigned char *)norm = '1'; } else { *(unsigned char *)norm = 'I'; } anorm = dlangb_(norm, n, kl, ku, &ab[ab_offset], ldab, &work[1]); i__1 = *kl + *ku; rpvgrw = dlantb_("M", "U", "N", n, &i__1, &afb[afb_offset], ldafb, &work[ 1]); if (rpvgrw == 0.) { rpvgrw = 1.; } else { rpvgrw = dlangb_("M", n, kl, ku, &ab[ab_offset], ldab, &work[1]) / rpvgrw; } /* Compute the reciprocal of the condition number of A. */ dgbcon_(norm, n, kl, ku, &afb[afb_offset], ldafb, &ipiv[1], &anorm, rcond, &work[1], &iwork[1], info); /* Compute the solution matrix X. */ dlacpy_("Full", n, nrhs, &b[b_offset], ldb, &x[x_offset], ldx); dgbtrs_(trans, n, kl, ku, nrhs, &afb[afb_offset], ldafb, &ipiv[1], &x[ x_offset], ldx, info); /* Use iterative refinement to improve the computed solution and */ /* compute error bounds and backward error estimates for it. */ dgbrfs_(trans, n, kl, ku, nrhs, &ab[ab_offset], ldab, &afb[afb_offset], ldafb, &ipiv[1], &b[b_offset], ldb, &x[x_offset], ldx, &ferr[1], & berr[1], &work[1], &iwork[1], info); /* Transform the solution matrix X to a solution of the original */ /* system. */ if (notran) { if (colequ) { i__1 = *nrhs; for (j = 1; j <= i__1; ++j) { i__3 = *n; for (i__ = 1; i__ <= i__3; ++i__) { x[i__ + j * x_dim1] = c__[i__] * x[i__ + j * x_dim1]; } } i__1 = *nrhs; for (j = 1; j <= i__1; ++j) { ferr[j] /= colcnd; } } } else if (rowequ) { i__1 = *nrhs; for (j = 1; j <= i__1; ++j) { i__3 = *n; for (i__ = 1; i__ <= i__3; ++i__) { x[i__ + j * x_dim1] = r__[i__] * x[i__ + j * x_dim1]; } } i__1 = *nrhs; for (j = 1; j <= i__1; ++j) { ferr[j] /= rowcnd; } } /* Set INFO = N+1 if the matrix is singular to working precision. */ if (*rcond < dlamch_("Epsilon")) { *info = *n + 1; } work[1] = rpvgrw; return 0; /* End of DGBSVX */ } /* dgbsvx_ */
/* Subroutine */ int derrge_(char *path, integer *nunit) { /* Builtin functions */ integer s_wsle(cilist *), e_wsle(void); /* Subroutine */ int s_copy(char *, char *, ftnlen, ftnlen); /* Local variables */ doublereal a[16] /* was [4][4] */, b[4]; integer i__, j; doublereal w[12], x[4]; char c2[2]; doublereal r1[4], r2[4], af[16] /* was [4][4] */; integer ip[4], iw[4], info; doublereal anrm, ccond, rcond; extern /* Subroutine */ int dgbtf2_(integer *, integer *, integer *, integer *, doublereal *, integer *, integer *, integer *), dgetf2_(integer *, integer *, doublereal *, integer *, integer *, integer *), dgbcon_(char *, integer *, integer *, integer *, doublereal *, integer *, integer *, doublereal *, doublereal *, doublereal *, integer *, integer *), dgecon_(char *, integer *, doublereal *, integer *, doublereal *, doublereal *, doublereal *, integer *, integer *), alaesm_(char *, logical *, integer *), dgbequ_(integer *, integer *, integer *, integer *, doublereal *, integer *, doublereal *, doublereal *, doublereal *, doublereal *, doublereal *, integer *) , dgbrfs_(char *, integer *, integer *, integer *, integer *, doublereal *, integer *, doublereal *, integer *, integer *, doublereal *, integer *, doublereal *, integer *, doublereal *, doublereal *, doublereal *, integer *, integer *), dgbtrf_(integer *, integer *, integer *, integer *, doublereal *, integer *, integer *, integer *), dgeequ_(integer *, integer *, doublereal *, integer *, doublereal *, doublereal *, doublereal *, doublereal *, doublereal *, integer *), dgerfs_(char *, integer * , integer *, doublereal *, integer *, doublereal *, integer *, integer *, doublereal *, integer *, doublereal *, integer *, doublereal *, doublereal *, doublereal *, integer *, integer *), dgetrf_(integer *, integer *, doublereal *, integer *, integer *, integer *), dgetri_(integer *, doublereal *, integer *, integer *, doublereal *, integer *, integer *); extern logical lsamen_(integer *, char *, char *); extern /* Subroutine */ int chkxer_(char *, integer *, integer *, logical *, logical *), dgbtrs_(char *, integer *, integer *, integer *, integer *, doublereal *, integer *, integer *, doublereal *, integer *, integer *), dgetrs_(char *, integer *, integer *, doublereal *, integer *, integer *, doublereal *, integer *, integer *); /* Fortran I/O blocks */ static cilist io___1 = { 0, 0, 0, 0, 0 }; /* -- LAPACK test routine (version 3.1) -- */ /* Univ. of Tennessee, Univ. of California Berkeley and NAG Ltd.. */ /* November 2006 */ /* .. Scalar Arguments .. */ /* .. */ /* Purpose */ /* ======= */ /* DERRGE tests the error exits for the DOUBLE PRECISION routines */ /* for general matrices. */ /* Arguments */ /* ========= */ /* PATH (input) CHARACTER*3 */ /* The LAPACK path name for the routines to be tested. */ /* NUNIT (input) INTEGER */ /* The unit number for output. */ /* ===================================================================== */ /* .. Parameters .. */ /* .. */ /* .. Local Scalars .. */ /* .. */ /* .. Local Arrays .. */ /* .. */ /* .. External Functions .. */ /* .. */ /* .. External Subroutines .. */ /* .. */ /* .. Scalars in Common .. */ /* .. */ /* .. Common blocks .. */ /* .. */ /* .. Intrinsic Functions .. */ /* .. */ /* .. Executable Statements .. */ infoc_1.nout = *nunit; io___1.ciunit = infoc_1.nout; s_wsle(&io___1); e_wsle(); s_copy(c2, path + 1, (ftnlen)2, (ftnlen)2); /* Set the variables to innocuous values. */ for (j = 1; j <= 4; ++j) { for (i__ = 1; i__ <= 4; ++i__) { a[i__ + (j << 2) - 5] = 1. / (doublereal) (i__ + j); af[i__ + (j << 2) - 5] = 1. / (doublereal) (i__ + j); /* L10: */ } b[j - 1] = 0.; r1[j - 1] = 0.; r2[j - 1] = 0.; w[j - 1] = 0.; x[j - 1] = 0.; ip[j - 1] = j; iw[j - 1] = j; /* L20: */ } infoc_1.ok = TRUE_; if (lsamen_(&c__2, c2, "GE")) { /* Test error exits of the routines that use the LU decomposition */ /* of a general matrix. */ /* DGETRF */ s_copy(srnamc_1.srnamt, "DGETRF", (ftnlen)6, (ftnlen)6); infoc_1.infot = 1; dgetrf_(&c_n1, &c__0, a, &c__1, ip, &info); chkxer_("DGETRF", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 2; dgetrf_(&c__0, &c_n1, a, &c__1, ip, &info); chkxer_("DGETRF", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 4; dgetrf_(&c__2, &c__1, a, &c__1, ip, &info); chkxer_("DGETRF", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); /* DGETF2 */ s_copy(srnamc_1.srnamt, "DGETF2", (ftnlen)6, (ftnlen)6); infoc_1.infot = 1; dgetf2_(&c_n1, &c__0, a, &c__1, ip, &info); chkxer_("DGETF2", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 2; dgetf2_(&c__0, &c_n1, a, &c__1, ip, &info); chkxer_("DGETF2", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 4; dgetf2_(&c__2, &c__1, a, &c__1, ip, &info); chkxer_("DGETF2", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); /* DGETRI */ s_copy(srnamc_1.srnamt, "DGETRI", (ftnlen)6, (ftnlen)6); infoc_1.infot = 1; dgetri_(&c_n1, a, &c__1, ip, w, &c__12, &info); chkxer_("DGETRI", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 3; dgetri_(&c__2, a, &c__1, ip, w, &c__12, &info); chkxer_("DGETRI", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); /* DGETRS */ s_copy(srnamc_1.srnamt, "DGETRS", (ftnlen)6, (ftnlen)6); infoc_1.infot = 1; dgetrs_("/", &c__0, &c__0, a, &c__1, ip, b, &c__1, &info); chkxer_("DGETRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 2; dgetrs_("N", &c_n1, &c__0, a, &c__1, ip, b, &c__1, &info); chkxer_("DGETRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 3; dgetrs_("N", &c__0, &c_n1, a, &c__1, ip, b, &c__1, &info); chkxer_("DGETRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 5; dgetrs_("N", &c__2, &c__1, a, &c__1, ip, b, &c__2, &info); chkxer_("DGETRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 8; dgetrs_("N", &c__2, &c__1, a, &c__2, ip, b, &c__1, &info); chkxer_("DGETRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); /* DGERFS */ s_copy(srnamc_1.srnamt, "DGERFS", (ftnlen)6, (ftnlen)6); infoc_1.infot = 1; dgerfs_("/", &c__0, &c__0, a, &c__1, af, &c__1, ip, b, &c__1, x, & c__1, r1, r2, w, iw, &info); chkxer_("DGERFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 2; dgerfs_("N", &c_n1, &c__0, a, &c__1, af, &c__1, ip, b, &c__1, x, & c__1, r1, r2, w, iw, &info); chkxer_("DGERFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 3; dgerfs_("N", &c__0, &c_n1, a, &c__1, af, &c__1, ip, b, &c__1, x, & c__1, r1, r2, w, iw, &info); chkxer_("DGERFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 5; dgerfs_("N", &c__2, &c__1, a, &c__1, af, &c__2, ip, b, &c__2, x, & c__2, r1, r2, w, iw, &info); chkxer_("DGERFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 7; dgerfs_("N", &c__2, &c__1, a, &c__2, af, &c__1, ip, b, &c__2, x, & c__2, r1, r2, w, iw, &info); chkxer_("DGERFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 10; dgerfs_("N", &c__2, &c__1, a, &c__2, af, &c__2, ip, b, &c__1, x, & c__2, r1, r2, w, iw, &info); chkxer_("DGERFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 12; dgerfs_("N", &c__2, &c__1, a, &c__2, af, &c__2, ip, b, &c__2, x, & c__1, r1, r2, w, iw, &info); chkxer_("DGERFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); /* DGECON */ s_copy(srnamc_1.srnamt, "DGECON", (ftnlen)6, (ftnlen)6); infoc_1.infot = 1; dgecon_("/", &c__0, a, &c__1, &anrm, &rcond, w, iw, &info); chkxer_("DGECON", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 2; dgecon_("1", &c_n1, a, &c__1, &anrm, &rcond, w, iw, &info); chkxer_("DGECON", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 4; dgecon_("1", &c__2, a, &c__1, &anrm, &rcond, w, iw, &info); chkxer_("DGECON", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); /* DGEEQU */ s_copy(srnamc_1.srnamt, "DGEEQU", (ftnlen)6, (ftnlen)6); infoc_1.infot = 1; dgeequ_(&c_n1, &c__0, a, &c__1, r1, r2, &rcond, &ccond, &anrm, &info); chkxer_("DGEEQU", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 2; dgeequ_(&c__0, &c_n1, a, &c__1, r1, r2, &rcond, &ccond, &anrm, &info); chkxer_("DGEEQU", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 4; dgeequ_(&c__2, &c__2, a, &c__1, r1, r2, &rcond, &ccond, &anrm, &info); chkxer_("DGEEQU", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); } else if (lsamen_(&c__2, c2, "GB")) { /* Test error exits of the routines that use the LU decomposition */ /* of a general band matrix. */ /* DGBTRF */ s_copy(srnamc_1.srnamt, "DGBTRF", (ftnlen)6, (ftnlen)6); infoc_1.infot = 1; dgbtrf_(&c_n1, &c__0, &c__0, &c__0, a, &c__1, ip, &info); chkxer_("DGBTRF", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 2; dgbtrf_(&c__0, &c_n1, &c__0, &c__0, a, &c__1, ip, &info); chkxer_("DGBTRF", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 3; dgbtrf_(&c__1, &c__1, &c_n1, &c__0, a, &c__1, ip, &info); chkxer_("DGBTRF", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 4; dgbtrf_(&c__1, &c__1, &c__0, &c_n1, a, &c__1, ip, &info); chkxer_("DGBTRF", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 6; dgbtrf_(&c__2, &c__2, &c__1, &c__1, a, &c__3, ip, &info); chkxer_("DGBTRF", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); /* DGBTF2 */ s_copy(srnamc_1.srnamt, "DGBTF2", (ftnlen)6, (ftnlen)6); infoc_1.infot = 1; dgbtf2_(&c_n1, &c__0, &c__0, &c__0, a, &c__1, ip, &info); chkxer_("DGBTF2", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 2; dgbtf2_(&c__0, &c_n1, &c__0, &c__0, a, &c__1, ip, &info); chkxer_("DGBTF2", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 3; dgbtf2_(&c__1, &c__1, &c_n1, &c__0, a, &c__1, ip, &info); chkxer_("DGBTF2", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 4; dgbtf2_(&c__1, &c__1, &c__0, &c_n1, a, &c__1, ip, &info); chkxer_("DGBTF2", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 6; dgbtf2_(&c__2, &c__2, &c__1, &c__1, a, &c__3, ip, &info); chkxer_("DGBTF2", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); /* DGBTRS */ s_copy(srnamc_1.srnamt, "DGBTRS", (ftnlen)6, (ftnlen)6); infoc_1.infot = 1; dgbtrs_("/", &c__0, &c__0, &c__0, &c__1, a, &c__1, ip, b, &c__1, & info); chkxer_("DGBTRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 2; dgbtrs_("N", &c_n1, &c__0, &c__0, &c__1, a, &c__1, ip, b, &c__1, & info); chkxer_("DGBTRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 3; dgbtrs_("N", &c__1, &c_n1, &c__0, &c__1, a, &c__1, ip, b, &c__1, & info); chkxer_("DGBTRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 4; dgbtrs_("N", &c__1, &c__0, &c_n1, &c__1, a, &c__1, ip, b, &c__1, & info); chkxer_("DGBTRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 5; dgbtrs_("N", &c__1, &c__0, &c__0, &c_n1, a, &c__1, ip, b, &c__1, & info); chkxer_("DGBTRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 7; dgbtrs_("N", &c__2, &c__1, &c__1, &c__1, a, &c__3, ip, b, &c__2, & info); chkxer_("DGBTRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 10; dgbtrs_("N", &c__2, &c__0, &c__0, &c__1, a, &c__1, ip, b, &c__1, & info); chkxer_("DGBTRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); /* DGBRFS */ s_copy(srnamc_1.srnamt, "DGBRFS", (ftnlen)6, (ftnlen)6); infoc_1.infot = 1; dgbrfs_("/", &c__0, &c__0, &c__0, &c__0, a, &c__1, af, &c__1, ip, b, & c__1, x, &c__1, r1, r2, w, iw, &info); chkxer_("DGBRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 2; dgbrfs_("N", &c_n1, &c__0, &c__0, &c__0, a, &c__1, af, &c__1, ip, b, & c__1, x, &c__1, r1, r2, w, iw, &info); chkxer_("DGBRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 3; dgbrfs_("N", &c__1, &c_n1, &c__0, &c__0, a, &c__1, af, &c__1, ip, b, & c__1, x, &c__1, r1, r2, w, iw, &info); chkxer_("DGBRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 4; dgbrfs_("N", &c__1, &c__0, &c_n1, &c__0, a, &c__1, af, &c__1, ip, b, & c__1, x, &c__1, r1, r2, w, iw, &info); chkxer_("DGBRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 5; dgbrfs_("N", &c__1, &c__0, &c__0, &c_n1, a, &c__1, af, &c__1, ip, b, & c__1, x, &c__1, r1, r2, w, iw, &info); chkxer_("DGBRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 7; dgbrfs_("N", &c__2, &c__1, &c__1, &c__1, a, &c__2, af, &c__4, ip, b, & c__2, x, &c__2, r1, r2, w, iw, &info); chkxer_("DGBRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 9; dgbrfs_("N", &c__2, &c__1, &c__1, &c__1, a, &c__3, af, &c__3, ip, b, & c__2, x, &c__2, r1, r2, w, iw, &info); chkxer_("DGBRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 12; dgbrfs_("N", &c__2, &c__0, &c__0, &c__1, a, &c__1, af, &c__1, ip, b, & c__1, x, &c__2, r1, r2, w, iw, &info); chkxer_("DGBRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 14; dgbrfs_("N", &c__2, &c__0, &c__0, &c__1, a, &c__1, af, &c__1, ip, b, & c__2, x, &c__1, r1, r2, w, iw, &info); chkxer_("DGBRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); /* DGBCON */ s_copy(srnamc_1.srnamt, "DGBCON", (ftnlen)6, (ftnlen)6); infoc_1.infot = 1; dgbcon_("/", &c__0, &c__0, &c__0, a, &c__1, ip, &anrm, &rcond, w, iw, &info); chkxer_("DGBCON", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 2; dgbcon_("1", &c_n1, &c__0, &c__0, a, &c__1, ip, &anrm, &rcond, w, iw, &info); chkxer_("DGBCON", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 3; dgbcon_("1", &c__1, &c_n1, &c__0, a, &c__1, ip, &anrm, &rcond, w, iw, &info); chkxer_("DGBCON", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 4; dgbcon_("1", &c__1, &c__0, &c_n1, a, &c__1, ip, &anrm, &rcond, w, iw, &info); chkxer_("DGBCON", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 6; dgbcon_("1", &c__2, &c__1, &c__1, a, &c__3, ip, &anrm, &rcond, w, iw, &info); chkxer_("DGBCON", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); /* DGBEQU */ s_copy(srnamc_1.srnamt, "DGBEQU", (ftnlen)6, (ftnlen)6); infoc_1.infot = 1; dgbequ_(&c_n1, &c__0, &c__0, &c__0, a, &c__1, r1, r2, &rcond, &ccond, &anrm, &info); chkxer_("DGBEQU", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 2; dgbequ_(&c__0, &c_n1, &c__0, &c__0, a, &c__1, r1, r2, &rcond, &ccond, &anrm, &info); chkxer_("DGBEQU", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 3; dgbequ_(&c__1, &c__1, &c_n1, &c__0, a, &c__1, r1, r2, &rcond, &ccond, &anrm, &info); chkxer_("DGBEQU", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 4; dgbequ_(&c__1, &c__1, &c__0, &c_n1, a, &c__1, r1, r2, &rcond, &ccond, &anrm, &info); chkxer_("DGBEQU", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 6; dgbequ_(&c__2, &c__2, &c__1, &c__1, a, &c__2, r1, r2, &rcond, &ccond, &anrm, &info); chkxer_("DGBEQU", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); } /* Print a summary line. */ alaesm_(path, &infoc_1.ok, &infoc_1.nout); return 0; /* End of DERRGE */ } /* derrge_ */
/* Subroutine */ int dchkeq_(doublereal *thresh, integer *nout) { /* Format strings */ static char fmt_9999[] = "(1x,\002All tests for \002,a3,\002 routines pa" "ssed the threshold\002)"; static char fmt_9998[] = "(\002 DGEEQU failed test with value \002,d10" ".3,\002 exceeding\002,\002 threshold \002,d10.3)"; static char fmt_9997[] = "(\002 DGBEQU failed test with value \002,d10" ".3,\002 exceeding\002,\002 threshold \002,d10.3)"; static char fmt_9996[] = "(\002 DPOEQU failed test with value \002,d10" ".3,\002 exceeding\002,\002 threshold \002,d10.3)"; static char fmt_9995[] = "(\002 DPPEQU failed test with value \002,d10" ".3,\002 exceeding\002,\002 threshold \002,d10.3)"; static char fmt_9994[] = "(\002 DPBEQU failed test with value \002,d10" ".3,\002 exceeding\002,\002 threshold \002,d10.3)"; /* System generated locals */ integer i__1, i__2, i__3, i__4, i__5, i__6, i__7, i__8; doublereal d__1, d__2, d__3; /* Builtin functions */ /* Subroutine */ int s_copy(char *, char *, ftnlen, ftnlen); double pow_di(doublereal *, integer *); integer pow_ii(integer *, integer *), s_wsle(cilist *), e_wsle(void), s_wsfe(cilist *), do_fio(integer *, char *, ftnlen), e_wsfe(void); /* Local variables */ doublereal a[25] /* was [5][5] */, c__[5]; integer i__, j, m, n; doublereal r__[5], ab[65] /* was [13][5] */, ap[15]; integer kl; logical ok; integer ku; doublereal eps, pow[11]; integer info; char path[3]; doublereal norm, rpow[11], ccond, rcond, rcmin, rcmax, ratio; extern doublereal dlamch_(char *); extern /* Subroutine */ int dgbequ_(integer *, integer *, integer *, integer *, doublereal *, integer *, doublereal *, doublereal *, doublereal *, doublereal *, doublereal *, integer *), dgeequ_( integer *, integer *, doublereal *, integer *, doublereal *, doublereal *, doublereal *, doublereal *, doublereal *, integer *) , dpbequ_(char *, integer *, integer *, doublereal *, integer *, doublereal *, doublereal *, doublereal *, integer *), dpoequ_(integer *, doublereal *, integer *, doublereal *, doublereal *, doublereal *, integer *), dppequ_(char *, integer *, doublereal *, doublereal *, doublereal *, doublereal *, integer * ); doublereal reslts[5]; /* Fortran I/O blocks */ static cilist io___25 = { 0, 0, 0, 0, 0 }; static cilist io___26 = { 0, 0, 0, fmt_9999, 0 }; static cilist io___27 = { 0, 0, 0, fmt_9998, 0 }; static cilist io___28 = { 0, 0, 0, fmt_9997, 0 }; static cilist io___29 = { 0, 0, 0, fmt_9996, 0 }; static cilist io___30 = { 0, 0, 0, fmt_9995, 0 }; static cilist io___31 = { 0, 0, 0, fmt_9994, 0 }; /* -- LAPACK test routine (version 3.1) -- */ /* Univ. of Tennessee, Univ. of California Berkeley and NAG Ltd.. */ /* November 2006 */ /* .. Scalar Arguments .. */ /* .. */ /* Purpose */ /* ======= */ /* DCHKEQ tests DGEEQU, DGBEQU, DPOEQU, DPPEQU and DPBEQU */ /* Arguments */ /* ========= */ /* THRESH (input) DOUBLE PRECISION */ /* Threshold for testing routines. Should be between 2 and 10. */ /* NOUT (input) INTEGER */ /* The unit number for output. */ /* ===================================================================== */ /* .. Parameters .. */ /* .. */ /* .. Local Scalars .. */ /* .. */ /* .. Local Arrays .. */ /* .. */ /* .. External Functions .. */ /* .. */ /* .. External Subroutines .. */ /* .. */ /* .. Intrinsic Functions .. */ /* .. */ /* .. Executable Statements .. */ s_copy(path, "Double precision", (ftnlen)1, (ftnlen)16); s_copy(path + 1, "EQ", (ftnlen)2, (ftnlen)2); eps = dlamch_("P"); for (i__ = 1; i__ <= 5; ++i__) { reslts[i__ - 1] = 0.; /* L10: */ } for (i__ = 1; i__ <= 11; ++i__) { i__1 = i__ - 1; pow[i__ - 1] = pow_di(&c_b7, &i__1); rpow[i__ - 1] = 1. / pow[i__ - 1]; /* L20: */ } /* Test DGEEQU */ for (n = 0; n <= 5; ++n) { for (m = 0; m <= 5; ++m) { for (j = 1; j <= 5; ++j) { for (i__ = 1; i__ <= 5; ++i__) { if (i__ <= m && j <= n) { i__1 = i__ + j; a[i__ + j * 5 - 6] = pow[i__ + j] * pow_ii(&c_n1, & i__1); } else { a[i__ + j * 5 - 6] = 0.; } /* L30: */ } /* L40: */ } dgeequ_(&m, &n, a, &c__5, r__, c__, &rcond, &ccond, &norm, &info); if (info != 0) { reslts[0] = 1.; } else { if (n != 0 && m != 0) { /* Computing MAX */ d__2 = reslts[0], d__3 = (d__1 = (rcond - rpow[m - 1]) / rpow[m - 1], abs(d__1)); reslts[0] = max(d__2,d__3); /* Computing MAX */ d__2 = reslts[0], d__3 = (d__1 = (ccond - rpow[n - 1]) / rpow[n - 1], abs(d__1)); reslts[0] = max(d__2,d__3); /* Computing MAX */ d__2 = reslts[0], d__3 = (d__1 = (norm - pow[n + m]) / pow[n + m], abs(d__1)); reslts[0] = max(d__2,d__3); i__1 = m; for (i__ = 1; i__ <= i__1; ++i__) { /* Computing MAX */ d__2 = reslts[0], d__3 = (d__1 = (r__[i__ - 1] - rpow[ i__ + n]) / rpow[i__ + n], abs(d__1)); reslts[0] = max(d__2,d__3); /* L50: */ } i__1 = n; for (j = 1; j <= i__1; ++j) { /* Computing MAX */ d__2 = reslts[0], d__3 = (d__1 = (c__[j - 1] - pow[n - j]) / pow[n - j], abs(d__1)); reslts[0] = max(d__2,d__3); /* L60: */ } } } /* L70: */ } /* L80: */ } /* Test with zero rows and columns */ for (j = 1; j <= 5; ++j) { a[j * 5 - 2] = 0.; /* L90: */ } dgeequ_(&c__5, &c__5, a, &c__5, r__, c__, &rcond, &ccond, &norm, &info); if (info != 4) { reslts[0] = 1.; } for (j = 1; j <= 5; ++j) { a[j * 5 - 2] = 1.; /* L100: */ } for (i__ = 1; i__ <= 5; ++i__) { a[i__ + 14] = 0.; /* L110: */ } dgeequ_(&c__5, &c__5, a, &c__5, r__, c__, &rcond, &ccond, &norm, &info); if (info != 9) { reslts[0] = 1.; } reslts[0] /= eps; /* Test DGBEQU */ for (n = 0; n <= 5; ++n) { for (m = 0; m <= 5; ++m) { /* Computing MAX */ i__2 = m - 1; i__1 = max(i__2,0); for (kl = 0; kl <= i__1; ++kl) { /* Computing MAX */ i__3 = n - 1; i__2 = max(i__3,0); for (ku = 0; ku <= i__2; ++ku) { for (j = 1; j <= 5; ++j) { for (i__ = 1; i__ <= 13; ++i__) { ab[i__ + j * 13 - 14] = 0.; /* L120: */ } /* L130: */ } i__3 = n; for (j = 1; j <= i__3; ++j) { i__4 = m; for (i__ = 1; i__ <= i__4; ++i__) { /* Computing MIN */ i__5 = m, i__6 = j + kl; /* Computing MAX */ i__7 = 1, i__8 = j - ku; if (i__ <= min(i__5,i__6) && i__ >= max(i__7,i__8) && j <= n) { i__5 = i__ + j; ab[ku + 1 + i__ - j + j * 13 - 14] = pow[i__ + j] * pow_ii(&c_n1, &i__5); } /* L140: */ } /* L150: */ } dgbequ_(&m, &n, &kl, &ku, ab, &c__13, r__, c__, &rcond, & ccond, &norm, &info); if (info != 0) { if (! (n + kl < m && info == n + kl + 1 || m + ku < n && info == (m << 1) + ku + 1)) { reslts[1] = 1.; } } else { if (n != 0 && m != 0) { rcmin = r__[0]; rcmax = r__[0]; i__3 = m; for (i__ = 1; i__ <= i__3; ++i__) { /* Computing MIN */ d__1 = rcmin, d__2 = r__[i__ - 1]; rcmin = min(d__1,d__2); /* Computing MAX */ d__1 = rcmax, d__2 = r__[i__ - 1]; rcmax = max(d__1,d__2); /* L160: */ } ratio = rcmin / rcmax; /* Computing MAX */ d__2 = reslts[1], d__3 = (d__1 = (rcond - ratio) / ratio, abs(d__1)); reslts[1] = max(d__2,d__3); rcmin = c__[0]; rcmax = c__[0]; i__3 = n; for (j = 1; j <= i__3; ++j) { /* Computing MIN */ d__1 = rcmin, d__2 = c__[j - 1]; rcmin = min(d__1,d__2); /* Computing MAX */ d__1 = rcmax, d__2 = c__[j - 1]; rcmax = max(d__1,d__2); /* L170: */ } ratio = rcmin / rcmax; /* Computing MAX */ d__2 = reslts[1], d__3 = (d__1 = (ccond - ratio) / ratio, abs(d__1)); reslts[1] = max(d__2,d__3); /* Computing MAX */ d__2 = reslts[1], d__3 = (d__1 = (norm - pow[n + m]) / pow[n + m], abs(d__1)); reslts[1] = max(d__2,d__3); i__3 = m; for (i__ = 1; i__ <= i__3; ++i__) { rcmax = 0.; i__4 = n; for (j = 1; j <= i__4; ++j) { if (i__ <= j + kl && i__ >= j - ku) { ratio = (d__1 = r__[i__ - 1] * pow[ i__ + j] * c__[j - 1], abs( d__1)); rcmax = max(rcmax,ratio); } /* L180: */ } /* Computing MAX */ d__2 = reslts[1], d__3 = (d__1 = 1. - rcmax, abs(d__1)); reslts[1] = max(d__2,d__3); /* L190: */ } i__3 = n; for (j = 1; j <= i__3; ++j) { rcmax = 0.; i__4 = m; for (i__ = 1; i__ <= i__4; ++i__) { if (i__ <= j + kl && i__ >= j - ku) { ratio = (d__1 = r__[i__ - 1] * pow[ i__ + j] * c__[j - 1], abs( d__1)); rcmax = max(rcmax,ratio); } /* L200: */ } /* Computing MAX */ d__2 = reslts[1], d__3 = (d__1 = 1. - rcmax, abs(d__1)); reslts[1] = max(d__2,d__3); /* L210: */ } } } /* L220: */ } /* L230: */ } /* L240: */ } /* L250: */ } reslts[1] /= eps; /* Test DPOEQU */ for (n = 0; n <= 5; ++n) { for (i__ = 1; i__ <= 5; ++i__) { for (j = 1; j <= 5; ++j) { if (i__ <= n && j == i__) { i__1 = i__ + j; a[i__ + j * 5 - 6] = pow[i__ + j] * pow_ii(&c_n1, &i__1); } else { a[i__ + j * 5 - 6] = 0.; } /* L260: */ } /* L270: */ } dpoequ_(&n, a, &c__5, r__, &rcond, &norm, &info); if (info != 0) { reslts[2] = 1.; } else { if (n != 0) { /* Computing MAX */ d__2 = reslts[2], d__3 = (d__1 = (rcond - rpow[n - 1]) / rpow[ n - 1], abs(d__1)); reslts[2] = max(d__2,d__3); /* Computing MAX */ d__2 = reslts[2], d__3 = (d__1 = (norm - pow[n * 2]) / pow[n * 2], abs(d__1)); reslts[2] = max(d__2,d__3); i__1 = n; for (i__ = 1; i__ <= i__1; ++i__) { /* Computing MAX */ d__2 = reslts[2], d__3 = (d__1 = (r__[i__ - 1] - rpow[i__] ) / rpow[i__], abs(d__1)); reslts[2] = max(d__2,d__3); /* L280: */ } } } /* L290: */ } a[18] = -1.; dpoequ_(&c__5, a, &c__5, r__, &rcond, &norm, &info); if (info != 4) { reslts[2] = 1.; } reslts[2] /= eps; /* Test DPPEQU */ for (n = 0; n <= 5; ++n) { /* Upper triangular packed storage */ i__1 = n * (n + 1) / 2; for (i__ = 1; i__ <= i__1; ++i__) { ap[i__ - 1] = 0.; /* L300: */ } i__1 = n; for (i__ = 1; i__ <= i__1; ++i__) { ap[i__ * (i__ + 1) / 2 - 1] = pow[i__ * 2]; /* L310: */ } dppequ_("U", &n, ap, r__, &rcond, &norm, &info); if (info != 0) { reslts[3] = 1.; } else { if (n != 0) { /* Computing MAX */ d__2 = reslts[3], d__3 = (d__1 = (rcond - rpow[n - 1]) / rpow[ n - 1], abs(d__1)); reslts[3] = max(d__2,d__3); /* Computing MAX */ d__2 = reslts[3], d__3 = (d__1 = (norm - pow[n * 2]) / pow[n * 2], abs(d__1)); reslts[3] = max(d__2,d__3); i__1 = n; for (i__ = 1; i__ <= i__1; ++i__) { /* Computing MAX */ d__2 = reslts[3], d__3 = (d__1 = (r__[i__ - 1] - rpow[i__] ) / rpow[i__], abs(d__1)); reslts[3] = max(d__2,d__3); /* L320: */ } } } /* Lower triangular packed storage */ i__1 = n * (n + 1) / 2; for (i__ = 1; i__ <= i__1; ++i__) { ap[i__ - 1] = 0.; /* L330: */ } j = 1; i__1 = n; for (i__ = 1; i__ <= i__1; ++i__) { ap[j - 1] = pow[i__ * 2]; j += n - i__ + 1; /* L340: */ } dppequ_("L", &n, ap, r__, &rcond, &norm, &info); if (info != 0) { reslts[3] = 1.; } else { if (n != 0) { /* Computing MAX */ d__2 = reslts[3], d__3 = (d__1 = (rcond - rpow[n - 1]) / rpow[ n - 1], abs(d__1)); reslts[3] = max(d__2,d__3); /* Computing MAX */ d__2 = reslts[3], d__3 = (d__1 = (norm - pow[n * 2]) / pow[n * 2], abs(d__1)); reslts[3] = max(d__2,d__3); i__1 = n; for (i__ = 1; i__ <= i__1; ++i__) { /* Computing MAX */ d__2 = reslts[3], d__3 = (d__1 = (r__[i__ - 1] - rpow[i__] ) / rpow[i__], abs(d__1)); reslts[3] = max(d__2,d__3); /* L350: */ } } } /* L360: */ } i__ = 13; ap[i__ - 1] = -1.; dppequ_("L", &c__5, ap, r__, &rcond, &norm, &info); if (info != 4) { reslts[3] = 1.; } reslts[3] /= eps; /* Test DPBEQU */ for (n = 0; n <= 5; ++n) { /* Computing MAX */ i__2 = n - 1; i__1 = max(i__2,0); for (kl = 0; kl <= i__1; ++kl) { /* Test upper triangular storage */ for (j = 1; j <= 5; ++j) { for (i__ = 1; i__ <= 13; ++i__) { ab[i__ + j * 13 - 14] = 0.; /* L370: */ } /* L380: */ } i__2 = n; for (j = 1; j <= i__2; ++j) { ab[kl + 1 + j * 13 - 14] = pow[j * 2]; /* L390: */ } dpbequ_("U", &n, &kl, ab, &c__13, r__, &rcond, &norm, &info); if (info != 0) { reslts[4] = 1.; } else { if (n != 0) { /* Computing MAX */ d__2 = reslts[4], d__3 = (d__1 = (rcond - rpow[n - 1]) / rpow[n - 1], abs(d__1)); reslts[4] = max(d__2,d__3); /* Computing MAX */ d__2 = reslts[4], d__3 = (d__1 = (norm - pow[n * 2]) / pow[n * 2], abs(d__1)); reslts[4] = max(d__2,d__3); i__2 = n; for (i__ = 1; i__ <= i__2; ++i__) { /* Computing MAX */ d__2 = reslts[4], d__3 = (d__1 = (r__[i__ - 1] - rpow[ i__]) / rpow[i__], abs(d__1)); reslts[4] = max(d__2,d__3); /* L400: */ } } } if (n != 0) { /* Computing MAX */ i__2 = n - 1; ab[kl + 1 + max(i__2,1) * 13 - 14] = -1.; dpbequ_("U", &n, &kl, ab, &c__13, r__, &rcond, &norm, &info); /* Computing MAX */ i__2 = n - 1; if (info != max(i__2,1)) { reslts[4] = 1.; } } /* Test lower triangular storage */ for (j = 1; j <= 5; ++j) { for (i__ = 1; i__ <= 13; ++i__) { ab[i__ + j * 13 - 14] = 0.; /* L410: */ } /* L420: */ } i__2 = n; for (j = 1; j <= i__2; ++j) { ab[j * 13 - 13] = pow[j * 2]; /* L430: */ } dpbequ_("L", &n, &kl, ab, &c__13, r__, &rcond, &norm, &info); if (info != 0) { reslts[4] = 1.; } else { if (n != 0) { /* Computing MAX */ d__2 = reslts[4], d__3 = (d__1 = (rcond - rpow[n - 1]) / rpow[n - 1], abs(d__1)); reslts[4] = max(d__2,d__3); /* Computing MAX */ d__2 = reslts[4], d__3 = (d__1 = (norm - pow[n * 2]) / pow[n * 2], abs(d__1)); reslts[4] = max(d__2,d__3); i__2 = n; for (i__ = 1; i__ <= i__2; ++i__) { /* Computing MAX */ d__2 = reslts[4], d__3 = (d__1 = (r__[i__ - 1] - rpow[ i__]) / rpow[i__], abs(d__1)); reslts[4] = max(d__2,d__3); /* L440: */ } } } if (n != 0) { /* Computing MAX */ i__2 = n - 1; ab[max(i__2,1) * 13 - 13] = -1.; dpbequ_("L", &n, &kl, ab, &c__13, r__, &rcond, &norm, &info); /* Computing MAX */ i__2 = n - 1; if (info != max(i__2,1)) { reslts[4] = 1.; } } /* L450: */ } /* L460: */ } reslts[4] /= eps; ok = reslts[0] <= *thresh && reslts[1] <= *thresh && reslts[2] <= *thresh && reslts[3] <= *thresh && reslts[4] <= *thresh; io___25.ciunit = *nout; s_wsle(&io___25); e_wsle(); if (ok) { io___26.ciunit = *nout; s_wsfe(&io___26); do_fio(&c__1, path, (ftnlen)3); e_wsfe(); } else { if (reslts[0] > *thresh) { io___27.ciunit = *nout; s_wsfe(&io___27); do_fio(&c__1, (char *)&reslts[0], (ftnlen)sizeof(doublereal)); do_fio(&c__1, (char *)&(*thresh), (ftnlen)sizeof(doublereal)); e_wsfe(); } if (reslts[1] > *thresh) { io___28.ciunit = *nout; s_wsfe(&io___28); do_fio(&c__1, (char *)&reslts[1], (ftnlen)sizeof(doublereal)); do_fio(&c__1, (char *)&(*thresh), (ftnlen)sizeof(doublereal)); e_wsfe(); } if (reslts[2] > *thresh) { io___29.ciunit = *nout; s_wsfe(&io___29); do_fio(&c__1, (char *)&reslts[2], (ftnlen)sizeof(doublereal)); do_fio(&c__1, (char *)&(*thresh), (ftnlen)sizeof(doublereal)); e_wsfe(); } if (reslts[3] > *thresh) { io___30.ciunit = *nout; s_wsfe(&io___30); do_fio(&c__1, (char *)&reslts[3], (ftnlen)sizeof(doublereal)); do_fio(&c__1, (char *)&(*thresh), (ftnlen)sizeof(doublereal)); e_wsfe(); } if (reslts[4] > *thresh) { io___31.ciunit = *nout; s_wsfe(&io___31); do_fio(&c__1, (char *)&reslts[4], (ftnlen)sizeof(doublereal)); do_fio(&c__1, (char *)&(*thresh), (ftnlen)sizeof(doublereal)); e_wsfe(); } } return 0; /* End of DCHKEQ */ } /* dchkeq_ */