/* Subroutine */ int cgesvx_(char *fact, char *trans, integer *n, integer * nrhs, complex *a, integer *lda, complex *af, integer *ldaf, integer * ipiv, char *equed, real *r__, real *c__, complex *b, integer *ldb, complex *x, integer *ldx, real *rcond, real *ferr, real *berr, complex *work, real *rwork, integer *info) { /* System generated locals */ integer a_dim1, a_offset, af_dim1, af_offset, b_dim1, b_offset, x_dim1, x_offset, i__1, i__2, i__3, i__4, i__5; real r__1, r__2; complex q__1; /* Local variables */ integer i__, j; real amax; char norm[1]; extern logical lsame_(char *, char *); real rcmin, rcmax, anorm; logical equil; extern doublereal clange_(char *, integer *, integer *, complex *, integer *, real *); extern /* Subroutine */ int claqge_(integer *, integer *, complex *, integer *, real *, real *, real *, real *, real *, char *) , cgecon_(char *, integer *, complex *, integer *, real *, real *, complex *, real *, integer *); real colcnd; extern doublereal slamch_(char *); extern /* Subroutine */ int cgeequ_(integer *, integer *, complex *, integer *, real *, real *, real *, real *, real *, integer *); logical nofact; extern /* Subroutine */ int cgerfs_(char *, integer *, integer *, complex *, integer *, complex *, integer *, integer *, complex *, integer *, complex *, integer *, real *, real *, complex *, real *, integer *), cgetrf_(integer *, integer *, complex *, integer *, integer *, integer *), clacpy_(char *, integer *, integer *, complex *, integer *, complex *, integer *), xerbla_(char *, integer *); real bignum; extern doublereal clantr_(char *, char *, char *, integer *, integer *, complex *, integer *, real *); integer infequ; logical colequ; extern /* Subroutine */ int cgetrs_(char *, integer *, integer *, complex *, integer *, integer *, complex *, integer *, integer *); real rowcnd; logical notran; real smlnum; logical rowequ; real rpvgrw; /* -- LAPACK driver routine (version 3.2) -- */ /* Univ. of Tennessee, Univ. of California Berkeley and NAG Ltd.. */ /* November 2006 */ /* .. Scalar Arguments .. */ /* .. */ /* .. Array Arguments .. */ /* .. */ /* Purpose */ /* ======= */ /* CGESVX uses the LU factorization to compute the solution to a complex */ /* system of linear equations */ /* A * X = B, */ /* where A is an N-by-N matrix 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: */ /* 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 = P * L * U, */ /* where P is a permutation matrix, L is a unit lower triangular */ /* matrix, and U is upper triangular. */ /* 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, AF 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. */ /* A, AF, and IPIV are not modified. */ /* = 'N': The matrix A will be copied to AF and factored. */ /* = 'E': The matrix A will be equilibrated if necessary, then */ /* copied to AF 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 (Conjugate transpose) */ /* N (input) INTEGER */ /* The number of linear equations, i.e., the order of the */ /* matrix A. N >= 0. */ /* NRHS (input) INTEGER */ /* The number of right hand sides, i.e., the number of columns */ /* of the matrices B and X. NRHS >= 0. */ /* A (input/output) COMPLEX array, dimension (LDA,N) */ /* On entry, the N-by-N matrix A. If FACT = 'F' and EQUED is */ /* not 'N', then A must have been equilibrated by the scaling */ /* factors in R and/or C. A 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). */ /* LDA (input) INTEGER */ /* The leading dimension of the array A. LDA >= max(1,N). */ /* AF (input or output) COMPLEX array, dimension (LDAF,N) */ /* If FACT = 'F', then AF is an input argument and on entry */ /* contains the factors L and U from the factorization */ /* A = P*L*U as computed by CGETRF. If EQUED .ne. 'N', then */ /* AF is the factored form of the equilibrated matrix A. */ /* If FACT = 'N', then AF is an output argument and on exit */ /* returns the factors L and U from the factorization A = P*L*U */ /* of the original matrix A. */ /* If FACT = 'E', then AF is an output argument and on exit */ /* returns the factors L and U from the factorization A = P*L*U */ /* of the equilibrated matrix A (see the description of A for */ /* the form of the equilibrated matrix). */ /* LDAF (input) INTEGER */ /* The leading dimension of the array AF. LDAF >= max(1,N). */ /* 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 = P*L*U */ /* as computed by CGETRF; 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 = P*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 = P*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) REAL 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) REAL 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) COMPLEX array, dimension (LDB,NRHS) */ /* On entry, the N-by-NRHS 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) COMPLEX 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) REAL */ /* 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) REAL 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) REAL 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) COMPLEX array, dimension (2*N) */ /* RWORK (workspace/output) REAL array, dimension (2*N) */ /* On exit, RWORK(1) contains the reciprocal pivot growth */ /* factor norm(A)/norm(U). The "max absolute element" norm is */ /* used. If RWORK(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 */ /* RWORK(1) contains the reciprocal pivot growth factor for the */ /* leading INFO columns of A. */ /* 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. */ /* ===================================================================== */ /* .. Parameters .. */ /* .. */ /* .. Local Scalars .. */ /* .. */ /* .. External Functions .. */ /* .. */ /* .. External Subroutines .. */ /* .. */ /* .. Intrinsic Functions .. */ /* .. */ /* .. Executable Statements .. */ /* Parameter adjustments */ a_dim1 = *lda; a_offset = 1 + a_dim1; a -= a_offset; af_dim1 = *ldaf; af_offset = 1 + af_dim1; af -= af_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; --rwork; /* 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 = slamch_("Safe minimum"); bignum = 1.f / 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 (*nrhs < 0) { *info = -4; } else if (*lda < max(1,*n)) { *info = -6; } else if (*ldaf < max(1,*n)) { *info = -8; } else if (lsame_(fact, "F") && ! (rowequ || colequ || lsame_(equed, "N"))) { *info = -10; } else { if (rowequ) { rcmin = bignum; rcmax = 0.f; i__1 = *n; for (j = 1; j <= i__1; ++j) { /* Computing MIN */ r__1 = rcmin, r__2 = r__[j]; rcmin = dmin(r__1,r__2); /* Computing MAX */ r__1 = rcmax, r__2 = r__[j]; rcmax = dmax(r__1,r__2); /* L10: */ } if (rcmin <= 0.f) { *info = -11; } else if (*n > 0) { rowcnd = dmax(rcmin,smlnum) / dmin(rcmax,bignum); } else { rowcnd = 1.f; } } if (colequ && *info == 0) { rcmin = bignum; rcmax = 0.f; i__1 = *n; for (j = 1; j <= i__1; ++j) { /* Computing MIN */ r__1 = rcmin, r__2 = c__[j]; rcmin = dmin(r__1,r__2); /* Computing MAX */ r__1 = rcmax, r__2 = c__[j]; rcmax = dmax(r__1,r__2); /* L20: */ } if (rcmin <= 0.f) { *info = -12; } else if (*n > 0) { colcnd = dmax(rcmin,smlnum) / dmin(rcmax,bignum); } else { colcnd = 1.f; } } if (*info == 0) { if (*ldb < max(1,*n)) { *info = -14; } else if (*ldx < max(1,*n)) { *info = -16; } } } if (*info != 0) { i__1 = -(*info); xerbla_("CGESVX", &i__1); return 0; } if (equil) { /* Compute row and column scalings to equilibrate the matrix A. */ cgeequ_(n, n, &a[a_offset], lda, &r__[1], &c__[1], &rowcnd, &colcnd, & amax, &infequ); if (infequ == 0) { /* Equilibrate the matrix. */ claqge_(n, n, &a[a_offset], lda, &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__) { i__3 = i__ + j * b_dim1; i__4 = i__; i__5 = i__ + j * b_dim1; q__1.r = r__[i__4] * b[i__5].r, q__1.i = r__[i__4] * b[ i__5].i; b[i__3].r = q__1.r, b[i__3].i = q__1.i; /* L30: */ } /* L40: */ } } } else if (colequ) { i__1 = *nrhs; for (j = 1; j <= i__1; ++j) { i__2 = *n; for (i__ = 1; i__ <= i__2; ++i__) { i__3 = i__ + j * b_dim1; i__4 = i__; i__5 = i__ + j * b_dim1; q__1.r = c__[i__4] * b[i__5].r, q__1.i = c__[i__4] * b[i__5] .i; b[i__3].r = q__1.r, b[i__3].i = q__1.i; /* L50: */ } /* L60: */ } } if (nofact || equil) { /* Compute the LU factorization of A. */ clacpy_("Full", n, n, &a[a_offset], lda, &af[af_offset], ldaf); cgetrf_(n, n, &af[af_offset], ldaf, &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. */ rpvgrw = clantr_("M", "U", "N", info, info, &af[af_offset], ldaf, &rwork[1]); if (rpvgrw == 0.f) { rpvgrw = 1.f; } else { rpvgrw = clange_("M", n, info, &a[a_offset], lda, &rwork[1]) / rpvgrw; } rwork[1] = rpvgrw; *rcond = 0.f; 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 = clange_(norm, n, n, &a[a_offset], lda, &rwork[1]); rpvgrw = clantr_("M", "U", "N", n, n, &af[af_offset], ldaf, &rwork[1]); if (rpvgrw == 0.f) { rpvgrw = 1.f; } else { rpvgrw = clange_("M", n, n, &a[a_offset], lda, &rwork[1]) / rpvgrw; } /* Compute the reciprocal of the condition number of A. */ cgecon_(norm, n, &af[af_offset], ldaf, &anorm, rcond, &work[1], &rwork[1], info); /* Compute the solution matrix X. */ clacpy_("Full", n, nrhs, &b[b_offset], ldb, &x[x_offset], ldx); cgetrs_(trans, n, nrhs, &af[af_offset], ldaf, &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. */ cgerfs_(trans, n, nrhs, &a[a_offset], lda, &af[af_offset], ldaf, &ipiv[1], &b[b_offset], ldb, &x[x_offset], ldx, &ferr[1], &berr[1], &work[ 1], &rwork[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__2 = *n; for (i__ = 1; i__ <= i__2; ++i__) { i__3 = i__ + j * x_dim1; i__4 = i__; i__5 = i__ + j * x_dim1; q__1.r = c__[i__4] * x[i__5].r, q__1.i = c__[i__4] * x[ i__5].i; x[i__3].r = q__1.r, x[i__3].i = q__1.i; /* L70: */ } /* L80: */ } i__1 = *nrhs; for (j = 1; j <= i__1; ++j) { ferr[j] /= colcnd; /* L90: */ } } } else if (rowequ) { i__1 = *nrhs; for (j = 1; j <= i__1; ++j) { i__2 = *n; for (i__ = 1; i__ <= i__2; ++i__) { i__3 = i__ + j * x_dim1; i__4 = i__; i__5 = i__ + j * x_dim1; q__1.r = r__[i__4] * x[i__5].r, q__1.i = r__[i__4] * x[i__5] .i; x[i__3].r = q__1.r, x[i__3].i = q__1.i; /* L100: */ } /* L110: */ } i__1 = *nrhs; for (j = 1; j <= i__1; ++j) { ferr[j] /= rowcnd; /* L120: */ } } /* Set INFO = N+1 if the matrix is singular to working precision. */ if (*rcond < slamch_("Epsilon")) { *info = *n + 1; } rwork[1] = rpvgrw; return 0; /* End of CGESVX */ } /* cgesvx_ */
/* Subroutine */ int cgesvx_(char *fact, char *trans, integer *n, integer * nrhs, complex *a, integer *lda, complex *af, integer *ldaf, integer * ipiv, char *equed, real *r__, real *c__, complex *b, integer *ldb, complex *x, integer *ldx, real *rcond, real *ferr, real *berr, complex *work, real *rwork, integer *info) { /* System generated locals */ integer a_dim1, a_offset, af_dim1, af_offset, b_dim1, b_offset, x_dim1, x_offset, i__1, i__2, i__3, i__4, i__5; real r__1, r__2; complex q__1; /* Local variables */ integer i__, j; real amax; char norm[1]; extern logical lsame_(char *, char *); real rcmin, rcmax, anorm; logical equil; extern real clange_(char *, integer *, integer *, complex *, integer *, real *); extern /* Subroutine */ int claqge_(integer *, integer *, complex *, integer *, real *, real *, real *, real *, real *, char *) , cgecon_(char *, integer *, complex *, integer *, real *, real *, complex *, real *, integer *); real colcnd; extern real slamch_(char *); extern /* Subroutine */ int cgeequ_(integer *, integer *, complex *, integer *, real *, real *, real *, real *, real *, integer *); logical nofact; extern /* Subroutine */ int cgerfs_(char *, integer *, integer *, complex *, integer *, complex *, integer *, integer *, complex *, integer *, complex *, integer *, real *, real *, complex *, real *, integer *), cgetrf_(integer *, integer *, complex *, integer *, integer *, integer *), clacpy_(char *, integer *, integer *, complex *, integer *, complex *, integer *), xerbla_(char *, integer *); real bignum; extern real clantr_(char *, char *, char *, integer *, integer *, complex *, integer *, real *); integer infequ; logical colequ; extern /* Subroutine */ int cgetrs_(char *, integer *, integer *, complex *, integer *, integer *, complex *, integer *, integer *); real rowcnd; logical notran; real smlnum; logical rowequ; real rpvgrw; /* -- LAPACK driver routine (version 3.4.1) -- */ /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */ /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */ /* April 2012 */ /* .. Scalar Arguments .. */ /* .. */ /* .. Array Arguments .. */ /* .. */ /* ===================================================================== */ /* .. Parameters .. */ /* .. */ /* .. Local Scalars .. */ /* .. */ /* .. External Functions .. */ /* .. */ /* .. External Subroutines .. */ /* .. */ /* .. Intrinsic Functions .. */ /* .. */ /* .. Executable Statements .. */ /* Parameter adjustments */ a_dim1 = *lda; a_offset = 1 + a_dim1; a -= a_offset; af_dim1 = *ldaf; af_offset = 1 + af_dim1; af -= af_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; --rwork; /* 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 = slamch_("Safe minimum"); bignum = 1.f / 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 (*nrhs < 0) { *info = -4; } else if (*lda < max(1,*n)) { *info = -6; } else if (*ldaf < max(1,*n)) { *info = -8; } else if (lsame_(fact, "F") && ! (rowequ || colequ || lsame_(equed, "N"))) { *info = -10; } else { if (rowequ) { rcmin = bignum; rcmax = 0.f; i__1 = *n; for (j = 1; j <= i__1; ++j) { /* Computing MIN */ r__1 = rcmin; r__2 = r__[j]; // , expr subst rcmin = min(r__1,r__2); /* Computing MAX */ r__1 = rcmax; r__2 = r__[j]; // , expr subst rcmax = max(r__1,r__2); /* L10: */ } if (rcmin <= 0.f) { *info = -11; } else if (*n > 0) { rowcnd = max(rcmin,smlnum) / min(rcmax,bignum); } else { rowcnd = 1.f; } } if (colequ && *info == 0) { rcmin = bignum; rcmax = 0.f; i__1 = *n; for (j = 1; j <= i__1; ++j) { /* Computing MIN */ r__1 = rcmin; r__2 = c__[j]; // , expr subst rcmin = min(r__1,r__2); /* Computing MAX */ r__1 = rcmax; r__2 = c__[j]; // , expr subst rcmax = max(r__1,r__2); /* L20: */ } if (rcmin <= 0.f) { *info = -12; } else if (*n > 0) { colcnd = max(rcmin,smlnum) / min(rcmax,bignum); } else { colcnd = 1.f; } } if (*info == 0) { if (*ldb < max(1,*n)) { *info = -14; } else if (*ldx < max(1,*n)) { *info = -16; } } } if (*info != 0) { i__1 = -(*info); xerbla_("CGESVX", &i__1); return 0; } if (equil) { /* Compute row and column scalings to equilibrate the matrix A. */ cgeequ_(n, n, &a[a_offset], lda, &r__[1], &c__[1], &rowcnd, &colcnd, & amax, &infequ); if (infequ == 0) { /* Equilibrate the matrix. */ claqge_(n, n, &a[a_offset], lda, &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__) { i__3 = i__ + j * b_dim1; i__4 = i__; i__5 = i__ + j * b_dim1; q__1.r = r__[i__4] * b[i__5].r; q__1.i = r__[i__4] * b[ i__5].i; // , expr subst b[i__3].r = q__1.r; b[i__3].i = q__1.i; // , expr subst /* L30: */ } /* L40: */ } } } else if (colequ) { i__1 = *nrhs; for (j = 1; j <= i__1; ++j) { i__2 = *n; for (i__ = 1; i__ <= i__2; ++i__) { i__3 = i__ + j * b_dim1; i__4 = i__; i__5 = i__ + j * b_dim1; q__1.r = c__[i__4] * b[i__5].r; q__1.i = c__[i__4] * b[i__5] .i; // , expr subst b[i__3].r = q__1.r; b[i__3].i = q__1.i; // , expr subst /* L50: */ } /* L60: */ } } if (nofact || equil) { /* Compute the LU factorization of A. */ clacpy_("Full", n, n, &a[a_offset], lda, &af[af_offset], ldaf); cgetrf_(n, n, &af[af_offset], ldaf, &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. */ rpvgrw = clantr_("M", "U", "N", info, info, &af[af_offset], ldaf, &rwork[1]); if (rpvgrw == 0.f) { rpvgrw = 1.f; } else { rpvgrw = clange_("M", n, info, &a[a_offset], lda, &rwork[1]) / rpvgrw; } rwork[1] = rpvgrw; *rcond = 0.f; 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 = clange_(norm, n, n, &a[a_offset], lda, &rwork[1]); rpvgrw = clantr_("M", "U", "N", n, n, &af[af_offset], ldaf, &rwork[1]); if (rpvgrw == 0.f) { rpvgrw = 1.f; } else { rpvgrw = clange_("M", n, n, &a[a_offset], lda, &rwork[1]) / rpvgrw; } /* Compute the reciprocal of the condition number of A. */ cgecon_(norm, n, &af[af_offset], ldaf, &anorm, rcond, &work[1], &rwork[1], info); /* Compute the solution matrix X. */ clacpy_("Full", n, nrhs, &b[b_offset], ldb, &x[x_offset], ldx); cgetrs_(trans, n, nrhs, &af[af_offset], ldaf, &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. */ cgerfs_(trans, n, nrhs, &a[a_offset], lda, &af[af_offset], ldaf, &ipiv[1], &b[b_offset], ldb, &x[x_offset], ldx, &ferr[1], &berr[1], &work[ 1], &rwork[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__2 = *n; for (i__ = 1; i__ <= i__2; ++i__) { i__3 = i__ + j * x_dim1; i__4 = i__; i__5 = i__ + j * x_dim1; q__1.r = c__[i__4] * x[i__5].r; q__1.i = c__[i__4] * x[ i__5].i; // , expr subst x[i__3].r = q__1.r; x[i__3].i = q__1.i; // , expr subst /* L70: */ } /* L80: */ } i__1 = *nrhs; for (j = 1; j <= i__1; ++j) { ferr[j] /= colcnd; /* L90: */ } } } else if (rowequ) { i__1 = *nrhs; for (j = 1; j <= i__1; ++j) { i__2 = *n; for (i__ = 1; i__ <= i__2; ++i__) { i__3 = i__ + j * x_dim1; i__4 = i__; i__5 = i__ + j * x_dim1; q__1.r = r__[i__4] * x[i__5].r; q__1.i = r__[i__4] * x[i__5] .i; // , expr subst x[i__3].r = q__1.r; x[i__3].i = q__1.i; // , expr subst /* L100: */ } /* L110: */ } i__1 = *nrhs; for (j = 1; j <= i__1; ++j) { ferr[j] /= rowcnd; /* L120: */ } } /* Set INFO = N+1 if the matrix is singular to working precision. */ if (*rcond < slamch_("Epsilon")) { *info = *n + 1; } rwork[1] = rpvgrw; return 0; /* End of CGESVX */ }
/* Subroutine */ int cerrge_(char *path, integer *nunit) { /* System generated locals */ integer i__1; real r__1, r__2; complex q__1; /* Local variables */ complex a[16] /* was [4][4] */, b[4]; integer i__, j; real r__[4]; complex w[8], x[4]; char c2[2]; real r1[4], r2[4]; complex af[16] /* was [4][4] */; integer ip[4], info; real anrm, ccond, rcond; /* 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 */ /* ======= */ /* CERRGE tests the error exits for the COMPLEX 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__) { i__1 = i__ + (j << 2) - 5; r__1 = 1.f / (real) (i__ + j); r__2 = -1.f / (real) (i__ + j); q__1.r = r__1, q__1.i = r__2; a[i__1].r = q__1.r, a[i__1].i = q__1.i; i__1 = i__ + (j << 2) - 5; r__1 = 1.f / (real) (i__ + j); r__2 = -1.f / (real) (i__ + j); q__1.r = r__1, q__1.i = r__2; af[i__1].r = q__1.r, af[i__1].i = q__1.i; /* L10: */ } i__1 = j - 1; b[i__1].r = 0.f, b[i__1].i = 0.f; r1[j - 1] = 0.f; r2[j - 1] = 0.f; i__1 = j - 1; w[i__1].r = 0.f, w[i__1].i = 0.f; i__1 = j - 1; x[i__1].r = 0.f, x[i__1].i = 0.f; ip[j - 1] = j; /* L20: */ } infoc_1.ok = TRUE_; /* Test error exits of the routines that use the LU decomposition */ /* of a general matrix. */ if (lsamen_(&c__2, c2, "GE")) { /* CGETRF */ s_copy(srnamc_1.srnamt, "CGETRF", (ftnlen)32, (ftnlen)6); infoc_1.infot = 1; cgetrf_(&c_n1, &c__0, a, &c__1, ip, &info); chkxer_("CGETRF", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 2; cgetrf_(&c__0, &c_n1, a, &c__1, ip, &info); chkxer_("CGETRF", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 4; cgetrf_(&c__2, &c__1, a, &c__1, ip, &info); chkxer_("CGETRF", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); /* CGETF2 */ s_copy(srnamc_1.srnamt, "CGETF2", (ftnlen)32, (ftnlen)6); infoc_1.infot = 1; cgetf2_(&c_n1, &c__0, a, &c__1, ip, &info); chkxer_("CGETF2", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 2; cgetf2_(&c__0, &c_n1, a, &c__1, ip, &info); chkxer_("CGETF2", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 4; cgetf2_(&c__2, &c__1, a, &c__1, ip, &info); chkxer_("CGETF2", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); /* CGETRI */ s_copy(srnamc_1.srnamt, "CGETRI", (ftnlen)32, (ftnlen)6); infoc_1.infot = 1; cgetri_(&c_n1, a, &c__1, ip, w, &c__1, &info); chkxer_("CGETRI", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 3; cgetri_(&c__2, a, &c__1, ip, w, &c__2, &info); chkxer_("CGETRI", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 6; cgetri_(&c__2, a, &c__2, ip, w, &c__1, &info); chkxer_("CGETRI", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); /* CGETRS */ s_copy(srnamc_1.srnamt, "CGETRS", (ftnlen)32, (ftnlen)6); infoc_1.infot = 1; cgetrs_("/", &c__0, &c__0, a, &c__1, ip, b, &c__1, &info); chkxer_("CGETRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 2; cgetrs_("N", &c_n1, &c__0, a, &c__1, ip, b, &c__1, &info); chkxer_("CGETRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 3; cgetrs_("N", &c__0, &c_n1, a, &c__1, ip, b, &c__1, &info); chkxer_("CGETRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 5; cgetrs_("N", &c__2, &c__1, a, &c__1, ip, b, &c__2, &info); chkxer_("CGETRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 8; cgetrs_("N", &c__2, &c__1, a, &c__2, ip, b, &c__1, &info); chkxer_("CGETRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); /* CGERFS */ s_copy(srnamc_1.srnamt, "CGERFS", (ftnlen)32, (ftnlen)6); infoc_1.infot = 1; cgerfs_("/", &c__0, &c__0, a, &c__1, af, &c__1, ip, b, &c__1, x, & c__1, r1, r2, w, r__, &info); chkxer_("CGERFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 2; cgerfs_("N", &c_n1, &c__0, a, &c__1, af, &c__1, ip, b, &c__1, x, & c__1, r1, r2, w, r__, &info); chkxer_("CGERFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 3; cgerfs_("N", &c__0, &c_n1, a, &c__1, af, &c__1, ip, b, &c__1, x, & c__1, r1, r2, w, r__, &info); chkxer_("CGERFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 5; cgerfs_("N", &c__2, &c__1, a, &c__1, af, &c__2, ip, b, &c__2, x, & c__2, r1, r2, w, r__, &info); chkxer_("CGERFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 7; cgerfs_("N", &c__2, &c__1, a, &c__2, af, &c__1, ip, b, &c__2, x, & c__2, r1, r2, w, r__, &info); chkxer_("CGERFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 10; cgerfs_("N", &c__2, &c__1, a, &c__2, af, &c__2, ip, b, &c__1, x, & c__2, r1, r2, w, r__, &info); chkxer_("CGERFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 12; cgerfs_("N", &c__2, &c__1, a, &c__2, af, &c__2, ip, b, &c__2, x, & c__1, r1, r2, w, r__, &info); chkxer_("CGERFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); /* CGECON */ s_copy(srnamc_1.srnamt, "CGECON", (ftnlen)32, (ftnlen)6); infoc_1.infot = 1; cgecon_("/", &c__0, a, &c__1, &anrm, &rcond, w, r__, &info) ; chkxer_("CGECON", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 2; cgecon_("1", &c_n1, a, &c__1, &anrm, &rcond, w, r__, &info) ; chkxer_("CGECON", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 4; cgecon_("1", &c__2, a, &c__1, &anrm, &rcond, w, r__, &info) ; chkxer_("CGECON", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); /* CGEEQU */ s_copy(srnamc_1.srnamt, "CGEEQU", (ftnlen)32, (ftnlen)6); infoc_1.infot = 1; cgeequ_(&c_n1, &c__0, a, &c__1, r1, r2, &rcond, &ccond, &anrm, &info); chkxer_("CGEEQU", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 2; cgeequ_(&c__0, &c_n1, a, &c__1, r1, r2, &rcond, &ccond, &anrm, &info); chkxer_("CGEEQU", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 4; cgeequ_(&c__2, &c__2, a, &c__1, r1, r2, &rcond, &ccond, &anrm, &info); chkxer_("CGEEQU", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); /* Test error exits of the routines that use the LU decomposition */ /* of a general band matrix. */ } else if (lsamen_(&c__2, c2, "GB")) { /* CGBTRF */ s_copy(srnamc_1.srnamt, "CGBTRF", (ftnlen)32, (ftnlen)6); infoc_1.infot = 1; cgbtrf_(&c_n1, &c__0, &c__0, &c__0, a, &c__1, ip, &info); chkxer_("CGBTRF", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 2; cgbtrf_(&c__0, &c_n1, &c__0, &c__0, a, &c__1, ip, &info); chkxer_("CGBTRF", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 3; cgbtrf_(&c__1, &c__1, &c_n1, &c__0, a, &c__1, ip, &info); chkxer_("CGBTRF", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 4; cgbtrf_(&c__1, &c__1, &c__0, &c_n1, a, &c__1, ip, &info); chkxer_("CGBTRF", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 6; cgbtrf_(&c__2, &c__2, &c__1, &c__1, a, &c__3, ip, &info); chkxer_("CGBTRF", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); /* CGBTF2 */ s_copy(srnamc_1.srnamt, "CGBTF2", (ftnlen)32, (ftnlen)6); infoc_1.infot = 1; cgbtf2_(&c_n1, &c__0, &c__0, &c__0, a, &c__1, ip, &info); chkxer_("CGBTF2", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 2; cgbtf2_(&c__0, &c_n1, &c__0, &c__0, a, &c__1, ip, &info); chkxer_("CGBTF2", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 3; cgbtf2_(&c__1, &c__1, &c_n1, &c__0, a, &c__1, ip, &info); chkxer_("CGBTF2", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 4; cgbtf2_(&c__1, &c__1, &c__0, &c_n1, a, &c__1, ip, &info); chkxer_("CGBTF2", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 6; cgbtf2_(&c__2, &c__2, &c__1, &c__1, a, &c__3, ip, &info); chkxer_("CGBTF2", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); /* CGBTRS */ s_copy(srnamc_1.srnamt, "CGBTRS", (ftnlen)32, (ftnlen)6); infoc_1.infot = 1; cgbtrs_("/", &c__0, &c__0, &c__0, &c__1, a, &c__1, ip, b, &c__1, & info); chkxer_("CGBTRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 2; cgbtrs_("N", &c_n1, &c__0, &c__0, &c__1, a, &c__1, ip, b, &c__1, & info); chkxer_("CGBTRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 3; cgbtrs_("N", &c__1, &c_n1, &c__0, &c__1, a, &c__1, ip, b, &c__1, & info); chkxer_("CGBTRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 4; cgbtrs_("N", &c__1, &c__0, &c_n1, &c__1, a, &c__1, ip, b, &c__1, & info); chkxer_("CGBTRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 5; cgbtrs_("N", &c__1, &c__0, &c__0, &c_n1, a, &c__1, ip, b, &c__1, & info); chkxer_("CGBTRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 7; cgbtrs_("N", &c__2, &c__1, &c__1, &c__1, a, &c__3, ip, b, &c__2, & info); chkxer_("CGBTRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 10; cgbtrs_("N", &c__2, &c__0, &c__0, &c__1, a, &c__1, ip, b, &c__1, & info); chkxer_("CGBTRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); /* CGBRFS */ s_copy(srnamc_1.srnamt, "CGBRFS", (ftnlen)32, (ftnlen)6); infoc_1.infot = 1; cgbrfs_("/", &c__0, &c__0, &c__0, &c__0, a, &c__1, af, &c__1, ip, b, & c__1, x, &c__1, r1, r2, w, r__, &info); chkxer_("CGBRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 2; cgbrfs_("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, r__, &info); chkxer_("CGBRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 3; cgbrfs_("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, r__, &info); chkxer_("CGBRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 4; cgbrfs_("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, r__, &info); chkxer_("CGBRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 5; cgbrfs_("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, r__, &info); chkxer_("CGBRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 7; cgbrfs_("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, r__, &info); chkxer_("CGBRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 9; cgbrfs_("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, r__, &info); chkxer_("CGBRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 12; cgbrfs_("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, r__, &info); chkxer_("CGBRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 14; cgbrfs_("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, r__, &info); chkxer_("CGBRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); /* CGBCON */ s_copy(srnamc_1.srnamt, "CGBCON", (ftnlen)32, (ftnlen)6); infoc_1.infot = 1; cgbcon_("/", &c__0, &c__0, &c__0, a, &c__1, ip, &anrm, &rcond, w, r__, &info); chkxer_("CGBCON", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 2; cgbcon_("1", &c_n1, &c__0, &c__0, a, &c__1, ip, &anrm, &rcond, w, r__, &info); chkxer_("CGBCON", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 3; cgbcon_("1", &c__1, &c_n1, &c__0, a, &c__1, ip, &anrm, &rcond, w, r__, &info); chkxer_("CGBCON", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 4; cgbcon_("1", &c__1, &c__0, &c_n1, a, &c__1, ip, &anrm, &rcond, w, r__, &info); chkxer_("CGBCON", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 6; cgbcon_("1", &c__2, &c__1, &c__1, a, &c__3, ip, &anrm, &rcond, w, r__, &info); chkxer_("CGBCON", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); /* CGBEQU */ s_copy(srnamc_1.srnamt, "CGBEQU", (ftnlen)32, (ftnlen)6); infoc_1.infot = 1; cgbequ_(&c_n1, &c__0, &c__0, &c__0, a, &c__1, r1, r2, &rcond, &ccond, &anrm, &info); chkxer_("CGBEQU", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 2; cgbequ_(&c__0, &c_n1, &c__0, &c__0, a, &c__1, r1, r2, &rcond, &ccond, &anrm, &info); chkxer_("CGBEQU", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 3; cgbequ_(&c__1, &c__1, &c_n1, &c__0, a, &c__1, r1, r2, &rcond, &ccond, &anrm, &info); chkxer_("CGBEQU", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 4; cgbequ_(&c__1, &c__1, &c__0, &c_n1, a, &c__1, r1, r2, &rcond, &ccond, &anrm, &info); chkxer_("CGBEQU", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 6; cgbequ_(&c__2, &c__2, &c__1, &c__1, a, &c__2, r1, r2, &rcond, &ccond, &anrm, &info); chkxer_("CGBEQU", &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 CERRGE */ } /* cerrge_ */
/* Subroutine */ int cchkeq_(real *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 CGEEQU failed test with value \002,e10" ".3,\002 exceeding\002,\002 threshold \002,e10.3)"; static char fmt_9997[] = "(\002 CGBEQU failed test with value \002,e10" ".3,\002 exceeding\002,\002 threshold \002,e10.3)"; static char fmt_9996[] = "(\002 CPOEQU failed test with value \002,e10" ".3,\002 exceeding\002,\002 threshold \002,e10.3)"; static char fmt_9995[] = "(\002 CPPEQU failed test with value \002,e10" ".3,\002 exceeding\002,\002 threshold \002,e10.3)"; static char fmt_9994[] = "(\002 CPBEQU failed test with value \002,e10" ".3,\002 exceeding\002,\002 threshold \002,e10.3)"; /* System generated locals */ integer i__1, i__2, i__3, i__4, i__5, i__6, i__7, i__8; real r__1, r__2, r__3; complex q__1; /* Builtin functions */ /* Subroutine */ int s_copy(char *, char *, ftnlen, ftnlen); double pow_ri(real *, 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 */ complex a[25] /* was [5][5] */; real c__[5]; integer i__, j, m, n; real r__[5]; complex ab[65] /* was [13][5] */, ap[15]; integer kl; logical ok; integer ku; real eps, pow[11]; integer info; char path[3]; real norm, rpow[11], ccond, rcond, rcmin, rcmax, ratio; extern /* Subroutine */ int cgbequ_(integer *, integer *, integer *, integer *, complex *, integer *, real *, real *, real *, real *, real *, integer *); extern doublereal slamch_(char *); extern /* Subroutine */ int cgeequ_(integer *, integer *, complex *, integer *, real *, real *, real *, real *, real *, integer *), cpbequ_(char *, integer *, integer *, complex *, integer *, real * , real *, real *, integer *), cpoequ_(integer *, complex * , integer *, real *, real *, real *, integer *), cppequ_(char *, integer *, complex *, real *, real *, real *, integer *); real 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 */ /* ======= */ /* CCHKEQ tests CGEEQU, CGBEQU, CPOEQU, CPPEQU and CPBEQU */ /* Arguments */ /* ========= */ /* THRESH (input) REAL */ /* 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, "Complex precision", (ftnlen)1, (ftnlen)17); s_copy(path + 1, "EQ", (ftnlen)2, (ftnlen)2); eps = slamch_("P"); for (i__ = 1; i__ <= 5; ++i__) { reslts[i__ - 1] = 0.f; /* L10: */ } for (i__ = 1; i__ <= 11; ++i__) { i__1 = i__ - 1; pow[i__ - 1] = pow_ri(&c_b9, &i__1); rpow[i__ - 1] = 1.f / pow[i__ - 1]; /* L20: */ } /* Test CGEEQU */ 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 * 5 - 6; i__2 = i__ + j; r__1 = pow[i__ + j] * pow_ii(&c_n1, &i__2); a[i__1].r = r__1, a[i__1].i = 0.f; } else { i__1 = i__ + j * 5 - 6; a[i__1].r = 0.f, a[i__1].i = 0.f; } /* L30: */ } /* L40: */ } cgeequ_(&m, &n, a, &c__5, r__, c__, &rcond, &ccond, &norm, &info); if (info != 0) { reslts[0] = 1.f; } else { if (n != 0 && m != 0) { /* Computing MAX */ r__2 = reslts[0], r__3 = (r__1 = (rcond - rpow[m - 1]) / rpow[m - 1], dabs(r__1)); reslts[0] = dmax(r__2,r__3); /* Computing MAX */ r__2 = reslts[0], r__3 = (r__1 = (ccond - rpow[n - 1]) / rpow[n - 1], dabs(r__1)); reslts[0] = dmax(r__2,r__3); /* Computing MAX */ r__2 = reslts[0], r__3 = (r__1 = (norm - pow[n + m]) / pow[n + m], dabs(r__1)); reslts[0] = dmax(r__2,r__3); i__1 = m; for (i__ = 1; i__ <= i__1; ++i__) { /* Computing MAX */ r__2 = reslts[0], r__3 = (r__1 = (r__[i__ - 1] - rpow[ i__ + n]) / rpow[i__ + n], dabs(r__1)); reslts[0] = dmax(r__2,r__3); /* L50: */ } i__1 = n; for (j = 1; j <= i__1; ++j) { /* Computing MAX */ r__2 = reslts[0], r__3 = (r__1 = (c__[j - 1] - pow[n - j]) / pow[n - j], dabs(r__1)); reslts[0] = dmax(r__2,r__3); /* L60: */ } } } /* L70: */ } /* L80: */ } /* Test with zero rows and columns */ for (j = 1; j <= 5; ++j) { i__1 = j * 5 - 2; a[i__1].r = 0.f, a[i__1].i = 0.f; /* L90: */ } cgeequ_(&c__5, &c__5, a, &c__5, r__, c__, &rcond, &ccond, &norm, &info); if (info != 4) { reslts[0] = 1.f; } for (j = 1; j <= 5; ++j) { i__1 = j * 5 - 2; a[i__1].r = 1.f, a[i__1].i = 0.f; /* L100: */ } for (i__ = 1; i__ <= 5; ++i__) { i__1 = i__ + 14; a[i__1].r = 0.f, a[i__1].i = 0.f; /* L110: */ } cgeequ_(&c__5, &c__5, a, &c__5, r__, c__, &rcond, &ccond, &norm, &info); if (info != 9) { reslts[0] = 1.f; } reslts[0] /= eps; /* Test CGBEQU */ 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__) { i__3 = i__ + j * 13 - 14; ab[i__3].r = 0.f, ab[i__3].i = 0.f; /* 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 = ku + 1 + i__ - j + j * 13 - 14; i__6 = i__ + j; r__1 = pow[i__ + j] * pow_ii(&c_n1, &i__6); ab[i__5].r = r__1, ab[i__5].i = 0.f; } /* L140: */ } /* L150: */ } cgbequ_(&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.f; } } else { if (n != 0 && m != 0) { rcmin = r__[0]; rcmax = r__[0]; i__3 = m; for (i__ = 1; i__ <= i__3; ++i__) { /* Computing MIN */ r__1 = rcmin, r__2 = r__[i__ - 1]; rcmin = dmin(r__1,r__2); /* Computing MAX */ r__1 = rcmax, r__2 = r__[i__ - 1]; rcmax = dmax(r__1,r__2); /* L160: */ } ratio = rcmin / rcmax; /* Computing MAX */ r__2 = reslts[1], r__3 = (r__1 = (rcond - ratio) / ratio, dabs(r__1)); reslts[1] = dmax(r__2,r__3); rcmin = c__[0]; rcmax = c__[0]; i__3 = n; for (j = 1; j <= i__3; ++j) { /* Computing MIN */ r__1 = rcmin, r__2 = c__[j - 1]; rcmin = dmin(r__1,r__2); /* Computing MAX */ r__1 = rcmax, r__2 = c__[j - 1]; rcmax = dmax(r__1,r__2); /* L170: */ } ratio = rcmin / rcmax; /* Computing MAX */ r__2 = reslts[1], r__3 = (r__1 = (ccond - ratio) / ratio, dabs(r__1)); reslts[1] = dmax(r__2,r__3); /* Computing MAX */ r__2 = reslts[1], r__3 = (r__1 = (norm - pow[n + m]) / pow[n + m], dabs(r__1)); reslts[1] = dmax(r__2,r__3); i__3 = m; for (i__ = 1; i__ <= i__3; ++i__) { rcmax = 0.f; i__4 = n; for (j = 1; j <= i__4; ++j) { if (i__ <= j + kl && i__ >= j - ku) { ratio = (r__1 = r__[i__ - 1] * pow[ i__ + j] * c__[j - 1], dabs( r__1)); rcmax = dmax(rcmax,ratio); } /* L180: */ } /* Computing MAX */ r__2 = reslts[1], r__3 = (r__1 = 1.f - rcmax, dabs(r__1)); reslts[1] = dmax(r__2,r__3); /* L190: */ } i__3 = n; for (j = 1; j <= i__3; ++j) { rcmax = 0.f; i__4 = m; for (i__ = 1; i__ <= i__4; ++i__) { if (i__ <= j + kl && i__ >= j - ku) { ratio = (r__1 = r__[i__ - 1] * pow[ i__ + j] * c__[j - 1], dabs( r__1)); rcmax = dmax(rcmax,ratio); } /* L200: */ } /* Computing MAX */ r__2 = reslts[1], r__3 = (r__1 = 1.f - rcmax, dabs(r__1)); reslts[1] = dmax(r__2,r__3); /* L210: */ } } } /* L220: */ } /* L230: */ } /* L240: */ } /* L250: */ } reslts[1] /= eps; /* Test CPOEQU */ 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 * 5 - 6; i__2 = i__ + j; r__1 = pow[i__ + j] * pow_ii(&c_n1, &i__2); a[i__1].r = r__1, a[i__1].i = 0.f; } else { i__1 = i__ + j * 5 - 6; a[i__1].r = 0.f, a[i__1].i = 0.f; } /* L260: */ } /* L270: */ } cpoequ_(&n, a, &c__5, r__, &rcond, &norm, &info); if (info != 0) { reslts[2] = 1.f; } else { if (n != 0) { /* Computing MAX */ r__2 = reslts[2], r__3 = (r__1 = (rcond - rpow[n - 1]) / rpow[ n - 1], dabs(r__1)); reslts[2] = dmax(r__2,r__3); /* Computing MAX */ r__2 = reslts[2], r__3 = (r__1 = (norm - pow[n * 2]) / pow[n * 2], dabs(r__1)); reslts[2] = dmax(r__2,r__3); i__1 = n; for (i__ = 1; i__ <= i__1; ++i__) { /* Computing MAX */ r__2 = reslts[2], r__3 = (r__1 = (r__[i__ - 1] - rpow[i__] ) / rpow[i__], dabs(r__1)); reslts[2] = dmax(r__2,r__3); /* L280: */ } } } /* L290: */ } q__1.r = -1.f, q__1.i = -0.f; a[18].r = q__1.r, a[18].i = q__1.i; cpoequ_(&c__5, a, &c__5, r__, &rcond, &norm, &info); if (info != 4) { reslts[2] = 1.f; } reslts[2] /= eps; /* Test CPPEQU */ for (n = 0; n <= 5; ++n) { /* Upper triangular packed storage */ i__1 = n * (n + 1) / 2; for (i__ = 1; i__ <= i__1; ++i__) { i__2 = i__ - 1; ap[i__2].r = 0.f, ap[i__2].i = 0.f; /* L300: */ } i__1 = n; for (i__ = 1; i__ <= i__1; ++i__) { i__2 = i__ * (i__ + 1) / 2 - 1; i__3 = i__ << 1; ap[i__2].r = pow[i__3], ap[i__2].i = 0.f; /* L310: */ } cppequ_("U", &n, ap, r__, &rcond, &norm, &info); if (info != 0) { reslts[3] = 1.f; } else { if (n != 0) { /* Computing MAX */ r__2 = reslts[3], r__3 = (r__1 = (rcond - rpow[n - 1]) / rpow[ n - 1], dabs(r__1)); reslts[3] = dmax(r__2,r__3); /* Computing MAX */ r__2 = reslts[3], r__3 = (r__1 = (norm - pow[n * 2]) / pow[n * 2], dabs(r__1)); reslts[3] = dmax(r__2,r__3); i__1 = n; for (i__ = 1; i__ <= i__1; ++i__) { /* Computing MAX */ r__2 = reslts[3], r__3 = (r__1 = (r__[i__ - 1] - rpow[i__] ) / rpow[i__], dabs(r__1)); reslts[3] = dmax(r__2,r__3); /* L320: */ } } } /* Lower triangular packed storage */ i__1 = n * (n + 1) / 2; for (i__ = 1; i__ <= i__1; ++i__) { i__2 = i__ - 1; ap[i__2].r = 0.f, ap[i__2].i = 0.f; /* L330: */ } j = 1; i__1 = n; for (i__ = 1; i__ <= i__1; ++i__) { i__2 = j - 1; i__3 = i__ << 1; ap[i__2].r = pow[i__3], ap[i__2].i = 0.f; j += n - i__ + 1; /* L340: */ } cppequ_("L", &n, ap, r__, &rcond, &norm, &info); if (info != 0) { reslts[3] = 1.f; } else { if (n != 0) { /* Computing MAX */ r__2 = reslts[3], r__3 = (r__1 = (rcond - rpow[n - 1]) / rpow[ n - 1], dabs(r__1)); reslts[3] = dmax(r__2,r__3); /* Computing MAX */ r__2 = reslts[3], r__3 = (r__1 = (norm - pow[n * 2]) / pow[n * 2], dabs(r__1)); reslts[3] = dmax(r__2,r__3); i__1 = n; for (i__ = 1; i__ <= i__1; ++i__) { /* Computing MAX */ r__2 = reslts[3], r__3 = (r__1 = (r__[i__ - 1] - rpow[i__] ) / rpow[i__], dabs(r__1)); reslts[3] = dmax(r__2,r__3); /* L350: */ } } } /* L360: */ } i__ = 13; i__1 = i__ - 1; q__1.r = -1.f, q__1.i = -0.f; ap[i__1].r = q__1.r, ap[i__1].i = q__1.i; cppequ_("L", &c__5, ap, r__, &rcond, &norm, &info); if (info != 4) { reslts[3] = 1.f; } reslts[3] /= eps; /* Test CPBEQU */ 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__) { i__2 = i__ + j * 13 - 14; ab[i__2].r = 0.f, ab[i__2].i = 0.f; /* L370: */ } /* L380: */ } i__2 = n; for (j = 1; j <= i__2; ++j) { i__3 = kl + 1 + j * 13 - 14; i__4 = j << 1; ab[i__3].r = pow[i__4], ab[i__3].i = 0.f; /* L390: */ } cpbequ_("U", &n, &kl, ab, &c__13, r__, &rcond, &norm, &info); if (info != 0) { reslts[4] = 1.f; } else { if (n != 0) { /* Computing MAX */ r__2 = reslts[4], r__3 = (r__1 = (rcond - rpow[n - 1]) / rpow[n - 1], dabs(r__1)); reslts[4] = dmax(r__2,r__3); /* Computing MAX */ r__2 = reslts[4], r__3 = (r__1 = (norm - pow[n * 2]) / pow[n * 2], dabs(r__1)); reslts[4] = dmax(r__2,r__3); i__2 = n; for (i__ = 1; i__ <= i__2; ++i__) { /* Computing MAX */ r__2 = reslts[4], r__3 = (r__1 = (r__[i__ - 1] - rpow[ i__]) / rpow[i__], dabs(r__1)); reslts[4] = dmax(r__2,r__3); /* L400: */ } } } if (n != 0) { /* Computing MAX */ i__3 = n - 1; i__2 = kl + 1 + max(i__3,1) * 13 - 14; q__1.r = -1.f, q__1.i = -0.f; ab[i__2].r = q__1.r, ab[i__2].i = q__1.i; cpbequ_("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.f; } } /* Test lower triangular storage */ for (j = 1; j <= 5; ++j) { for (i__ = 1; i__ <= 13; ++i__) { i__2 = i__ + j * 13 - 14; ab[i__2].r = 0.f, ab[i__2].i = 0.f; /* L410: */ } /* L420: */ } i__2 = n; for (j = 1; j <= i__2; ++j) { i__3 = j * 13 - 13; i__4 = j << 1; ab[i__3].r = pow[i__4], ab[i__3].i = 0.f; /* L430: */ } cpbequ_("L", &n, &kl, ab, &c__13, r__, &rcond, &norm, &info); if (info != 0) { reslts[4] = 1.f; } else { if (n != 0) { /* Computing MAX */ r__2 = reslts[4], r__3 = (r__1 = (rcond - rpow[n - 1]) / rpow[n - 1], dabs(r__1)); reslts[4] = dmax(r__2,r__3); /* Computing MAX */ r__2 = reslts[4], r__3 = (r__1 = (norm - pow[n * 2]) / pow[n * 2], dabs(r__1)); reslts[4] = dmax(r__2,r__3); i__2 = n; for (i__ = 1; i__ <= i__2; ++i__) { /* Computing MAX */ r__2 = reslts[4], r__3 = (r__1 = (r__[i__ - 1] - rpow[ i__]) / rpow[i__], dabs(r__1)); reslts[4] = dmax(r__2,r__3); /* L440: */ } } } if (n != 0) { /* Computing MAX */ i__3 = n - 1; i__2 = max(i__3,1) * 13 - 13; q__1.r = -1.f, q__1.i = -0.f; ab[i__2].r = q__1.r, ab[i__2].i = q__1.i; cpbequ_("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.f; } } /* 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(real)); do_fio(&c__1, (char *)&(*thresh), (ftnlen)sizeof(real)); e_wsfe(); } if (reslts[1] > *thresh) { io___28.ciunit = *nout; s_wsfe(&io___28); do_fio(&c__1, (char *)&reslts[1], (ftnlen)sizeof(real)); do_fio(&c__1, (char *)&(*thresh), (ftnlen)sizeof(real)); e_wsfe(); } if (reslts[2] > *thresh) { io___29.ciunit = *nout; s_wsfe(&io___29); do_fio(&c__1, (char *)&reslts[2], (ftnlen)sizeof(real)); do_fio(&c__1, (char *)&(*thresh), (ftnlen)sizeof(real)); e_wsfe(); } if (reslts[3] > *thresh) { io___30.ciunit = *nout; s_wsfe(&io___30); do_fio(&c__1, (char *)&reslts[3], (ftnlen)sizeof(real)); do_fio(&c__1, (char *)&(*thresh), (ftnlen)sizeof(real)); e_wsfe(); } if (reslts[4] > *thresh) { io___31.ciunit = *nout; s_wsfe(&io___31); do_fio(&c__1, (char *)&reslts[4], (ftnlen)sizeof(real)); do_fio(&c__1, (char *)&(*thresh), (ftnlen)sizeof(real)); e_wsfe(); } } return 0; /* End of CCHKEQ */ } /* cchkeq_ */