/* Subroutine */ int ctbcon_(char *norm, char *uplo, char *diag, integer *n, integer *kd, complex *ab, integer *ldab, real *rcond, complex *work, real *rwork, integer *info) { /* System generated locals */ integer ab_dim1, ab_offset, i__1; real r__1, r__2; /* Builtin functions */ double r_imag(complex *); /* Local variables */ integer ix, kase, kase1; real scale; extern logical lsame_(char *, char *); integer isave[3]; real anorm; logical upper; extern /* Subroutine */ int clacn2_(integer *, complex *, complex *, real *, integer *, integer *); real xnorm; extern integer icamax_(integer *, complex *, integer *); extern doublereal clantb_(char *, char *, char *, integer *, integer *, complex *, integer *, real *), slamch_( char *); extern /* Subroutine */ int clatbs_(char *, char *, char *, char *, integer *, integer *, complex *, integer *, complex *, real *, real *, integer *), xerbla_(char * , integer *); real ainvnm; extern /* Subroutine */ int csrscl_(integer *, real *, complex *, integer *); logical onenrm; char normin[1]; real smlnum; logical nounit; /* -- LAPACK routine (version 3.2) -- */ /* Univ. of Tennessee, Univ. of California Berkeley and NAG Ltd.. */ /* November 2006 */ /* Modified to call CLACN2 in place of CLACON, 10 Feb 03, SJH. */ /* .. Scalar Arguments .. */ /* .. */ /* .. Array Arguments .. */ /* .. */ /* Purpose */ /* ======= */ /* CTBCON estimates the reciprocal of the condition number of a */ /* triangular band matrix A, in either the 1-norm or the infinity-norm. */ /* The norm of A is computed and an estimate is obtained for */ /* norm(inv(A)), then the reciprocal of the condition number is */ /* computed as */ /* RCOND = 1 / ( norm(A) * norm(inv(A)) ). */ /* Arguments */ /* ========= */ /* NORM (input) CHARACTER*1 */ /* Specifies whether the 1-norm condition number or the */ /* infinity-norm condition number is required: */ /* = '1' or 'O': 1-norm; */ /* = 'I': Infinity-norm. */ /* UPLO (input) CHARACTER*1 */ /* = 'U': A is upper triangular; */ /* = 'L': A is lower triangular. */ /* DIAG (input) CHARACTER*1 */ /* = 'N': A is non-unit triangular; */ /* = 'U': A is unit triangular. */ /* N (input) INTEGER */ /* The order of the matrix A. N >= 0. */ /* KD (input) INTEGER */ /* The number of superdiagonals or subdiagonals of the */ /* triangular band matrix A. KD >= 0. */ /* AB (input) COMPLEX array, dimension (LDAB,N) */ /* The upper or lower triangular band matrix A, stored in the */ /* first kd+1 rows of the array. The j-th column of A is stored */ /* in the j-th column of the array AB as follows: */ /* if UPLO = 'U', AB(kd+1+i-j,j) = A(i,j) for max(1,j-kd)<=i<=j; */ /* if UPLO = 'L', AB(1+i-j,j) = A(i,j) for j<=i<=min(n,j+kd). */ /* If DIAG = 'U', the diagonal elements of A are not referenced */ /* and are assumed to be 1. */ /* LDAB (input) INTEGER */ /* The leading dimension of the array AB. LDAB >= KD+1. */ /* RCOND (output) REAL */ /* The reciprocal of the condition number of the matrix A, */ /* computed as RCOND = 1/(norm(A) * norm(inv(A))). */ /* WORK (workspace) COMPLEX array, dimension (2*N) */ /* RWORK (workspace) REAL array, dimension (N) */ /* INFO (output) INTEGER */ /* = 0: successful exit */ /* < 0: if INFO = -i, the i-th argument had an illegal value */ /* ===================================================================== */ /* .. Parameters .. */ /* .. */ /* .. Local Scalars .. */ /* .. */ /* .. Local Arrays .. */ /* .. */ /* .. External Functions .. */ /* .. */ /* .. External Subroutines .. */ /* .. */ /* .. Intrinsic Functions .. */ /* .. */ /* .. Statement Functions .. */ /* .. */ /* .. Statement Function definitions .. */ /* .. */ /* .. Executable Statements .. */ /* Test the input parameters. */ /* Parameter adjustments */ ab_dim1 = *ldab; ab_offset = 1 + ab_dim1; ab -= ab_offset; --work; --rwork; /* Function Body */ *info = 0; upper = lsame_(uplo, "U"); onenrm = *(unsigned char *)norm == '1' || lsame_(norm, "O"); nounit = lsame_(diag, "N"); if (! onenrm && ! lsame_(norm, "I")) { *info = -1; } else if (! upper && ! lsame_(uplo, "L")) { *info = -2; } else if (! nounit && ! lsame_(diag, "U")) { *info = -3; } else if (*n < 0) { *info = -4; } else if (*kd < 0) { *info = -5; } else if (*ldab < *kd + 1) { *info = -7; } if (*info != 0) { i__1 = -(*info); xerbla_("CTBCON", &i__1); return 0; } /* Quick return if possible */ if (*n == 0) { *rcond = 1.f; return 0; } *rcond = 0.f; smlnum = slamch_("Safe minimum") * (real) max(*n,1); /* Compute the 1-norm of the triangular matrix A or A'. */ anorm = clantb_(norm, uplo, diag, n, kd, &ab[ab_offset], ldab, &rwork[1]); /* Continue only if ANORM > 0. */ if (anorm > 0.f) { /* Estimate the 1-norm of the inverse of A. */ ainvnm = 0.f; *(unsigned char *)normin = 'N'; if (onenrm) { kase1 = 1; } else { kase1 = 2; } kase = 0; L10: clacn2_(n, &work[*n + 1], &work[1], &ainvnm, &kase, isave); if (kase != 0) { if (kase == kase1) { /* Multiply by inv(A). */ clatbs_(uplo, "No transpose", diag, normin, n, kd, &ab[ ab_offset], ldab, &work[1], &scale, &rwork[1], info); } else { /* Multiply by inv(A'). */ clatbs_(uplo, "Conjugate transpose", diag, normin, n, kd, &ab[ ab_offset], ldab, &work[1], &scale, &rwork[1], info); } *(unsigned char *)normin = 'Y'; /* Multiply by 1/SCALE if doing so will not cause overflow. */ if (scale != 1.f) { ix = icamax_(n, &work[1], &c__1); i__1 = ix; xnorm = (r__1 = work[i__1].r, dabs(r__1)) + (r__2 = r_imag(& work[ix]), dabs(r__2)); if (scale < xnorm * smlnum || scale == 0.f) { goto L20; } csrscl_(n, &scale, &work[1], &c__1); } goto L10; } /* Compute the estimate of the reciprocal condition number. */ if (ainvnm != 0.f) { *rcond = 1.f / anorm / ainvnm; } } L20: return 0; /* End of CTBCON */ } /* ctbcon_ */
/* Subroutine */ int cpbcon_(char *uplo, integer *n, integer *kd, complex *ab, integer *ldab, real *anorm, real *rcond, complex *work, real *rwork, integer *info) { /* -- LAPACK routine (version 2.0) -- Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., Courant Institute, Argonne National Lab, and Rice University September 30, 1994 Purpose ======= CPBCON estimates the reciprocal of the condition number (in the 1-norm) of a complex Hermitian positive definite band matrix using the Cholesky factorization A = U**H*U or A = L*L**H computed by CPBTRF. An estimate is obtained for norm(inv(A)), and the reciprocal of the condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))). Arguments ========= UPLO (input) CHARACTER*1 = 'U': Upper triangular factor stored in AB; = 'L': Lower triangular factor stored in AB. N (input) INTEGER The order of the matrix A. N >= 0. KD (input) INTEGER The number of superdiagonals of the matrix A if UPLO = 'U', or the number of sub-diagonals if UPLO = 'L'. KD >= 0. AB (input) COMPLEX array, dimension (LDAB,N) The triangular factor U or L from the Cholesky factorization A = U**H*U or A = L*L**H of the band matrix A, stored in the first KD+1 rows of the array. The j-th column of U or L is stored in the j-th column of the array AB as follows: if UPLO ='U', AB(kd+1+i-j,j) = U(i,j) for max(1,j-kd)<=i<=j; if UPLO ='L', AB(1+i-j,j) = L(i,j) for j<=i<=min(n,j+kd). LDAB (input) INTEGER The leading dimension of the array AB. LDAB >= KD+1. ANORM (input) REAL The 1-norm (or infinity-norm) of the Hermitian band matrix A. RCOND (output) REAL The reciprocal of the condition number of the matrix A, computed as RCOND = 1/(ANORM * AINVNM), where AINVNM is an estimate of the 1-norm of inv(A) computed in this routine. WORK (workspace) COMPLEX array, dimension (2*N) RWORK (workspace) REAL array, dimension (N) INFO (output) INTEGER = 0: successful exit < 0: if INFO = -i, the i-th argument had an illegal value ===================================================================== Test the input parameters. Parameter adjustments Function Body */ /* Table of constant values */ static integer c__1 = 1; /* System generated locals */ integer ab_dim1, ab_offset, i__1; real r__1, r__2; /* Builtin functions */ double r_imag(complex *); /* Local variables */ static integer kase; static real scale; extern logical lsame_(char *, char *); static logical upper; extern /* Subroutine */ int clacon_(integer *, complex *, complex *, real *, integer *); static integer ix; extern integer icamax_(integer *, complex *, integer *); static real scalel; extern doublereal slamch_(char *); extern /* Subroutine */ int clatbs_(char *, char *, char *, char *, integer *, integer *, complex *, integer *, complex *, real *, real *, integer *); static real scaleu; extern /* Subroutine */ int xerbla_(char *, integer *); static real ainvnm; extern /* Subroutine */ int csrscl_(integer *, real *, complex *, integer *); static char normin[1]; static real smlnum; #define WORK(I) work[(I)-1] #define RWORK(I) rwork[(I)-1] #define AB(I,J) ab[(I)-1 + ((J)-1)* ( *ldab)] *info = 0; upper = lsame_(uplo, "U"); if (! upper && ! lsame_(uplo, "L")) { *info = -1; } else if (*n < 0) { *info = -2; } else if (*kd < 0) { *info = -3; } else if (*ldab < *kd + 1) { *info = -5; } else if (*anorm < 0.f) { *info = -6; } if (*info != 0) { i__1 = -(*info); xerbla_("CPBCON", &i__1); return 0; } /* Quick return if possible */ *rcond = 0.f; if (*n == 0) { *rcond = 1.f; return 0; } else if (*anorm == 0.f) { return 0; } smlnum = slamch_("Safe minimum"); /* Estimate the 1-norm of the inverse. */ kase = 0; *(unsigned char *)normin = 'N'; L10: clacon_(n, &WORK(*n + 1), &WORK(1), &ainvnm, &kase); if (kase != 0) { if (upper) { /* Multiply by inv(U'). */ clatbs_("Upper", "Conjugate transpose", "Non-unit", normin, n, kd, &AB(1,1), ldab, &WORK(1), &scalel, &RWORK(1), info); *(unsigned char *)normin = 'Y'; /* Multiply by inv(U). */ clatbs_("Upper", "No transpose", "Non-unit", normin, n, kd, &AB(1,1), ldab, &WORK(1), &scaleu, &RWORK(1), info); } else { /* Multiply by inv(L). */ clatbs_("Lower", "No transpose", "Non-unit", normin, n, kd, &AB(1,1), ldab, &WORK(1), &scalel, &RWORK(1), info); *(unsigned char *)normin = 'Y'; /* Multiply by inv(L'). */ clatbs_("Lower", "Conjugate transpose", "Non-unit", normin, n, kd, &AB(1,1), ldab, &WORK(1), &scaleu, &RWORK(1), info); } /* Multiply by 1/SCALE if doing so will not cause overflow. */ scale = scalel * scaleu; if (scale != 1.f) { ix = icamax_(n, &WORK(1), &c__1); i__1 = ix; if (scale < ((r__1 = WORK(ix).r, dabs(r__1)) + (r__2 = r_imag(& WORK(ix)), dabs(r__2))) * smlnum || scale == 0.f) { goto L20; } csrscl_(n, &scale, &WORK(1), &c__1); } goto L10; } /* Compute the estimate of the reciprocal condition number. */ if (ainvnm != 0.f) { *rcond = 1.f / ainvnm / *anorm; } L20: return 0; /* End of CPBCON */ } /* cpbcon_ */
/* Subroutine */ int cgbcon_(char *norm, integer *n, integer *kl, integer *ku, complex *ab, integer *ldab, integer *ipiv, real *anorm, real *rcond, complex *work, real *rwork, integer *info) { /* System generated locals */ integer ab_dim1, ab_offset, i__1, i__2, i__3; real r__1, r__2; complex q__1, q__2; /* Local variables */ integer j; complex t; integer kd, lm, jp, ix, kase, kase1; real scale; integer isave[3]; logical lnoti; real ainvnm; logical onenrm; char normin[1]; real smlnum; /* -- LAPACK routine (version 3.2) -- */ /* November 2006 */ /* Modified to call CLACN2 in place of CLACON, 10 Feb 03, SJH. */ /* Purpose */ /* ======= */ /* CGBCON estimates the reciprocal of the condition number of a complex */ /* general band matrix A, in either the 1-norm or the infinity-norm, */ /* using the LU factorization computed by CGBTRF. */ /* An estimate is obtained for norm(inv(A)), and the reciprocal of the */ /* condition number is computed as */ /* RCOND = 1 / ( norm(A) * norm(inv(A)) ). */ /* Arguments */ /* ========= */ /* NORM (input) CHARACTER*1 */ /* Specifies whether the 1-norm condition number or the */ /* infinity-norm condition number is required: */ /* = '1' or 'O': 1-norm; */ /* = 'I': Infinity-norm. */ /* N (input) INTEGER */ /* 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. */ /* AB (input) COMPLEX array, dimension (LDAB,N) */ /* Details of the LU factorization of the band matrix A, as */ /* computed by CGBTRF. 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. */ /* LDAB (input) INTEGER */ /* The leading dimension of the array AB. LDAB >= 2*KL+KU+1. */ /* IPIV (input) INTEGER array, dimension (N) */ /* The pivot indices; for 1 <= i <= N, row i of the matrix was */ /* interchanged with row IPIV(i). */ /* ANORM (input) REAL */ /* If NORM = '1' or 'O', the 1-norm of the original matrix A. */ /* If NORM = 'I', the infinity-norm of the original matrix A. */ /* RCOND (output) REAL */ /* The reciprocal of the condition number of the matrix A, */ /* computed as RCOND = 1/(norm(A) * norm(inv(A))). */ /* WORK (workspace) COMPLEX array, dimension (2*N) */ /* RWORK (workspace) REAL array, dimension (N) */ /* INFO (output) INTEGER */ /* = 0: successful exit */ /* < 0: if INFO = -i, the i-th argument had an illegal value */ /* ===================================================================== */ /* Test the input parameters. */ /* Parameter adjustments */ ab_dim1 = *ldab; ab_offset = 1 + ab_dim1; ab -= ab_offset; --ipiv; --work; --rwork; /* Function Body */ *info = 0; onenrm = *(unsigned char *)norm == '1' || lsame_(norm, "O"); if (! onenrm && ! lsame_(norm, "I")) { *info = -1; } else if (*n < 0) { *info = -2; } else if (*kl < 0) { *info = -3; } else if (*ku < 0) { *info = -4; } else if (*ldab < (*kl << 1) + *ku + 1) { *info = -6; } else if (*anorm < 0.f) { *info = -8; } if (*info != 0) { i__1 = -(*info); xerbla_("CGBCON", &i__1); return 0; } /* Quick return if possible */ *rcond = 0.f; if (*n == 0) { *rcond = 1.f; return 0; } else if (*anorm == 0.f) { return 0; } smlnum = slamch_("Safe minimum"); /* Estimate the norm of inv(A). */ ainvnm = 0.f; *(unsigned char *)normin = 'N'; if (onenrm) { kase1 = 1; } else { kase1 = 2; } kd = *kl + *ku + 1; lnoti = *kl > 0; kase = 0; L10: clacn2_(n, &work[*n + 1], &work[1], &ainvnm, &kase, isave); if (kase != 0) { if (kase == kase1) { /* Multiply by inv(L). */ if (lnoti) { i__1 = *n - 1; for (j = 1; j <= i__1; ++j) { /* Computing MIN */ i__2 = *kl, i__3 = *n - j; lm = min(i__2,i__3); jp = ipiv[j]; i__2 = jp; t.r = work[i__2].r, t.i = work[i__2].i; if (jp != j) { i__2 = jp; i__3 = j; work[i__2].r = work[i__3].r, work[i__2].i = work[i__3] .i; i__2 = j; work[i__2].r = t.r, work[i__2].i = t.i; } q__1.r = -t.r, q__1.i = -t.i; caxpy_(&lm, &q__1, &ab[kd + 1 + j * ab_dim1], &c__1, & work[j + 1], &c__1); } } /* Multiply by inv(U). */ i__1 = *kl + *ku; clatbs_("Upper", "No transpose", "Non-unit", normin, n, &i__1, & ab[ab_offset], ldab, &work[1], &scale, &rwork[1], info); } else { /* Multiply by inv(U'). */ i__1 = *kl + *ku; clatbs_("Upper", "Conjugate transpose", "Non-unit", normin, n, & i__1, &ab[ab_offset], ldab, &work[1], &scale, &rwork[1], info); /* Multiply by inv(L'). */ if (lnoti) { for (j = *n - 1; j >= 1; --j) { /* Computing MIN */ i__1 = *kl, i__2 = *n - j; lm = min(i__1,i__2); i__1 = j; i__2 = j; cdotc_(&q__2, &lm, &ab[kd + 1 + j * ab_dim1], &c__1, & work[j + 1], &c__1); q__1.r = work[i__2].r - q__2.r, q__1.i = work[i__2].i - q__2.i; work[i__1].r = q__1.r, work[i__1].i = q__1.i; jp = ipiv[j]; if (jp != j) { i__1 = jp; t.r = work[i__1].r, t.i = work[i__1].i; i__1 = jp; i__2 = j; work[i__1].r = work[i__2].r, work[i__1].i = work[i__2] .i; i__1 = j; work[i__1].r = t.r, work[i__1].i = t.i; } } } } /* Divide X by 1/SCALE if doing so will not cause overflow. */ *(unsigned char *)normin = 'Y'; if (scale != 1.f) { ix = icamax_(n, &work[1], &c__1); i__1 = ix; if (scale < ((r__1 = work[i__1].r, dabs(r__1)) + (r__2 = r_imag(& work[ix]), dabs(r__2))) * smlnum || scale == 0.f) { goto L40; } csrscl_(n, &scale, &work[1], &c__1); } goto L10; } /* Compute the estimate of the reciprocal condition number. */ if (ainvnm != 0.f) { *rcond = 1.f / ainvnm / *anorm; } L40: return 0; /* End of CGBCON */ } /* cgbcon_ */
/* Subroutine */ int cchktb_(logical *dotype, integer *nn, integer *nval, integer *nns, integer *nsval, real *thresh, logical *tsterr, integer * nmax, complex *ab, complex *ainv, complex *b, complex *x, complex * xact, complex *work, real *rwork, integer *nout) { /* Initialized data */ static integer iseedy[4] = { 1988,1989,1990,1991 }; static char uplos[1*2] = "U" "L"; static char transs[1*3] = "N" "T" "C"; /* Format strings */ static char fmt_9999[] = "(\002 UPLO='\002,a1,\002', TRANS='\002,a1,\002" "', DIAG='\002,a1,\002', N=\002,i5,\002, K" "D=\002,i5,\002, NRHS=\002,i5,\002, type \002,i2,\002, test(\002," "i2,\002)=\002,g12.5)"; static char fmt_9998[] = "(1x,a,\002( '\002,a1,\002', '\002,a1,\002', " "'\002,a1,\002',\002,i5,\002,\002,i5,\002, ... ), type \002,i2" ",\002, test(\002,i2,\002)=\002,g12.5)"; static char fmt_9997[] = "(1x,a,\002( '\002,a1,\002', '\002,a1,\002', " "'\002,a1,\002', '\002,a1,\002',\002,i5,\002,\002,i5,\002, ... )" ", type \002,i2,\002, test(\002,i1,\002)=\002,g12.5)"; /* System generated locals */ address a__1[3], a__2[4]; integer i__1, i__2, i__3, i__4, i__5, i__6[3], i__7[4]; char ch__1[3], ch__2[4]; /* Builtin functions */ /* Subroutine */ int s_copy(char *, char *, ftnlen, ftnlen), s_cat(char *, char **, integer *, integer *, ftnlen); integer s_wsfe(cilist *), do_fio(integer *, char *, ftnlen), e_wsfe(void); /* Local variables */ integer i__, j, k, n, kd, ik, in, nk, lda, ldab; char diag[1]; integer imat, info; char path[3]; integer irhs, nrhs; char norm[1], uplo[1]; integer nrun; extern /* Subroutine */ int alahd_(integer *, char *); integer idiag; extern /* Subroutine */ int cget04_(integer *, integer *, complex *, integer *, complex *, integer *, real *, real *); real scale; integer nfail, iseed[4]; extern /* Subroutine */ int ctbt02_(char *, char *, char *, integer *, integer *, integer *, complex *, integer *, complex *, integer *, complex *, integer *, complex *, real *, real *), ctbt03_(char *, char *, char *, integer *, integer *, integer *, complex *, integer *, real *, real *, real *, complex * , integer *, complex *, integer *, complex *, real *); extern logical lsame_(char *, char *); extern /* Subroutine */ int ctbt05_(char *, char *, char *, integer *, integer *, integer *, complex *, integer *, complex *, integer *, complex *, integer *, complex *, integer *, real *, real *, real * ), ctbt06_(real *, real *, char *, char *, integer *, integer *, complex *, integer *, real *, real *); real rcond; integer nimat; real anorm; integer itran; extern /* Subroutine */ int ccopy_(integer *, complex *, integer *, complex *, integer *), ctbsv_(char *, char *, char *, integer *, integer *, complex *, integer *, complex *, integer *); char trans[1]; integer iuplo, nerrs; char xtype[1]; integer nimat2; extern /* Subroutine */ int alaerh_(char *, char *, integer *, integer *, char *, integer *, integer *, integer *, integer *, integer *, integer *, integer *, integer *, integer *); extern doublereal clantb_(char *, char *, char *, integer *, integer *, complex *, integer *, real *); real rcondc; extern /* Subroutine */ int clatbs_(char *, char *, char *, char *, integer *, integer *, complex *, integer *, complex *, real *, real *, integer *), clattb_( integer *, char *, char *, char *, integer *, integer *, integer * , complex *, integer *, complex *, complex *, real *, integer *), clacpy_(char *, integer *, integer *, complex *, integer *, complex *, integer *), clarhs_(char *, char *, char *, char *, integer *, integer *, integer *, integer *, integer *, complex *, integer *, complex *, integer *, complex *, integer *, integer *, integer *), claset_(char *, integer *, integer *, complex *, complex *, complex *, integer *); real rcondi; extern /* Subroutine */ int ctbcon_(char *, char *, char *, integer *, integer *, complex *, integer *, real *, complex *, real *, integer *); extern doublereal clantr_(char *, char *, char *, integer *, integer *, complex *, integer *, real *); real rcondo; extern /* Subroutine */ int alasum_(char *, integer *, integer *, integer *, integer *), ctbrfs_(char *, char *, char *, integer *, integer *, integer *, complex *, integer *, complex *, integer *, complex *, integer *, real *, real *, complex *, real *, integer * ); real ainvnm; extern /* Subroutine */ int cerrtr_(char *, integer *), ctbtrs_( char *, char *, char *, integer *, integer *, integer *, complex * , integer *, complex *, integer *, integer *); real result[8]; /* Fortran I/O blocks */ static cilist io___39 = { 0, 0, 0, fmt_9999, 0 }; static cilist io___41 = { 0, 0, 0, fmt_9998, 0 }; static cilist io___43 = { 0, 0, 0, fmt_9997, 0 }; static cilist io___44 = { 0, 0, 0, fmt_9997, 0 }; /* -- LAPACK test routine (version 3.1) -- */ /* Univ. of Tennessee, Univ. of California Berkeley and NAG Ltd.. */ /* November 2006 */ /* .. Scalar Arguments .. */ /* .. */ /* .. Array Arguments .. */ /* .. */ /* Purpose */ /* ======= */ /* CCHKTB tests CTBTRS, -RFS, and -CON, and CLATBS. */ /* Arguments */ /* ========= */ /* DOTYPE (input) LOGICAL array, dimension (NTYPES) */ /* The matrix types to be used for testing. Matrices of type j */ /* (for 1 <= j <= NTYPES) are used for testing if DOTYPE(j) = */ /* .TRUE.; if DOTYPE(j) = .FALSE., then type j is not used. */ /* NN (input) INTEGER */ /* The number of values of N contained in the vector NVAL. */ /* NVAL (input) INTEGER array, dimension (NN) */ /* The values of the matrix column dimension N. */ /* NNS (input) INTEGER */ /* The number of values of NRHS contained in the vector NSVAL. */ /* NSVAL (input) INTEGER array, dimension (NNS) */ /* The values of the number of right hand sides NRHS. */ /* THRESH (input) REAL */ /* The threshold value for the test ratios. A result is */ /* included in the output file if RESULT >= THRESH. To have */ /* every test ratio printed, use THRESH = 0. */ /* TSTERR (input) LOGICAL */ /* Flag that indicates whether error exits are to be tested. */ /* NMAX (input) INTEGER */ /* The leading dimension of the work arrays. */ /* NMAX >= the maximum value of N in NVAL. */ /* AB (workspace) COMPLEX array, dimension (NMAX*NMAX) */ /* AINV (workspace) COMPLEX array, dimension (NMAX*NMAX) */ /* B (workspace) COMPLEX array, dimension (NMAX*NSMAX) */ /* where NSMAX is the largest entry in NSVAL. */ /* X (workspace) COMPLEX array, dimension (NMAX*NSMAX) */ /* XACT (workspace) COMPLEX array, dimension (NMAX*NSMAX) */ /* WORK (workspace) COMPLEX array, dimension */ /* (NMAX*max(3,NSMAX)) */ /* RWORK (workspace) REAL array, dimension */ /* (max(NMAX,2*NSMAX)) */ /* NOUT (input) INTEGER */ /* The unit number for output. */ /* ===================================================================== */ /* .. Parameters .. */ /* .. */ /* .. Local Scalars .. */ /* .. */ /* .. Local Arrays .. */ /* .. */ /* .. External Functions .. */ /* .. */ /* .. External Subroutines .. */ /* .. */ /* .. Scalars in Common .. */ /* .. */ /* .. Common blocks .. */ /* .. */ /* .. Intrinsic Functions .. */ /* .. */ /* .. Data statements .. */ /* Parameter adjustments */ --rwork; --work; --xact; --x; --b; --ainv; --ab; --nsval; --nval; --dotype; /* Function Body */ /* .. */ /* .. Executable Statements .. */ /* Initialize constants and the random number seed. */ s_copy(path, "Complex precision", (ftnlen)1, (ftnlen)17); s_copy(path + 1, "TB", (ftnlen)2, (ftnlen)2); nrun = 0; nfail = 0; nerrs = 0; for (i__ = 1; i__ <= 4; ++i__) { iseed[i__ - 1] = iseedy[i__ - 1]; /* L10: */ } /* Test the error exits */ if (*tsterr) { cerrtr_(path, nout); } infoc_1.infot = 0; i__1 = *nn; for (in = 1; in <= i__1; ++in) { /* Do for each value of N in NVAL */ n = nval[in]; lda = max(1,n); *(unsigned char *)xtype = 'N'; nimat = 9; nimat2 = 17; if (n <= 0) { nimat = 1; nimat2 = 10; } /* Computing MIN */ i__2 = n + 1; nk = min(i__2,4); i__2 = nk; for (ik = 1; ik <= i__2; ++ik) { /* Do for KD = 0, N, (3N-1)/4, and (N+1)/4. This order makes */ /* it easier to skip redundant values for small values of N. */ if (ik == 1) { kd = 0; } else if (ik == 2) { kd = max(n,0); } else if (ik == 3) { kd = (n * 3 - 1) / 4; } else if (ik == 4) { kd = (n + 1) / 4; } ldab = kd + 1; i__3 = nimat; for (imat = 1; imat <= i__3; ++imat) { /* Do the tests only if DOTYPE( IMAT ) is true. */ if (! dotype[imat]) { goto L90; } for (iuplo = 1; iuplo <= 2; ++iuplo) { /* Do first for UPLO = 'U', then for UPLO = 'L' */ *(unsigned char *)uplo = *(unsigned char *)&uplos[iuplo - 1]; /* Call CLATTB to generate a triangular test matrix. */ s_copy(srnamc_1.srnamt, "CLATTB", (ftnlen)32, (ftnlen)6); clattb_(&imat, uplo, "No transpose", diag, iseed, &n, &kd, &ab[1], &ldab, &x[1], &work[1], &rwork[1], &info); /* Set IDIAG = 1 for non-unit matrices, 2 for unit. */ if (lsame_(diag, "N")) { idiag = 1; } else { idiag = 2; } /* Form the inverse of A so we can get a good estimate */ /* of RCONDC = 1/(norm(A) * norm(inv(A))). */ claset_("Full", &n, &n, &c_b14, &c_b15, &ainv[1], &lda); if (lsame_(uplo, "U")) { i__4 = n; for (j = 1; j <= i__4; ++j) { ctbsv_(uplo, "No transpose", diag, &j, &kd, &ab[1] , &ldab, &ainv[(j - 1) * lda + 1], &c__1); /* L20: */ } } else { i__4 = n; for (j = 1; j <= i__4; ++j) { i__5 = n - j + 1; ctbsv_(uplo, "No transpose", diag, &i__5, &kd, & ab[(j - 1) * ldab + 1], &ldab, &ainv[(j - 1) * lda + j], &c__1); /* L30: */ } } /* Compute the 1-norm condition number of A. */ anorm = clantb_("1", uplo, diag, &n, &kd, &ab[1], &ldab, & rwork[1]); ainvnm = clantr_("1", uplo, diag, &n, &n, &ainv[1], &lda, &rwork[1]); if (anorm <= 0.f || ainvnm <= 0.f) { rcondo = 1.f; } else { rcondo = 1.f / anorm / ainvnm; } /* Compute the infinity-norm condition number of A. */ anorm = clantb_("I", uplo, diag, &n, &kd, &ab[1], &ldab, & rwork[1]); ainvnm = clantr_("I", uplo, diag, &n, &n, &ainv[1], &lda, &rwork[1]); if (anorm <= 0.f || ainvnm <= 0.f) { rcondi = 1.f; } else { rcondi = 1.f / anorm / ainvnm; } i__4 = *nns; for (irhs = 1; irhs <= i__4; ++irhs) { nrhs = nsval[irhs]; *(unsigned char *)xtype = 'N'; for (itran = 1; itran <= 3; ++itran) { /* Do for op(A) = A, A**T, or A**H. */ *(unsigned char *)trans = *(unsigned char *)& transs[itran - 1]; if (itran == 1) { *(unsigned char *)norm = 'O'; rcondc = rcondo; } else { *(unsigned char *)norm = 'I'; rcondc = rcondi; } /* + TEST 1 */ /* Solve and compute residual for op(A)*x = b. */ s_copy(srnamc_1.srnamt, "CLARHS", (ftnlen)32, ( ftnlen)6); clarhs_(path, xtype, uplo, trans, &n, &n, &kd, & idiag, &nrhs, &ab[1], &ldab, &xact[1], & lda, &b[1], &lda, iseed, &info); *(unsigned char *)xtype = 'C'; clacpy_("Full", &n, &nrhs, &b[1], &lda, &x[1], & lda); s_copy(srnamc_1.srnamt, "CTBTRS", (ftnlen)32, ( ftnlen)6); ctbtrs_(uplo, trans, diag, &n, &kd, &nrhs, &ab[1], &ldab, &x[1], &lda, &info); /* Check error code from CTBTRS. */ if (info != 0) { /* Writing concatenation */ i__6[0] = 1, a__1[0] = uplo; i__6[1] = 1, a__1[1] = trans; i__6[2] = 1, a__1[2] = diag; s_cat(ch__1, a__1, i__6, &c__3, (ftnlen)3); alaerh_(path, "CTBTRS", &info, &c__0, ch__1, & n, &n, &kd, &kd, &nrhs, &imat, &nfail, &nerrs, nout); } ctbt02_(uplo, trans, diag, &n, &kd, &nrhs, &ab[1], &ldab, &x[1], &lda, &b[1], &lda, &work[1] , &rwork[1], result); /* + TEST 2 */ /* Check solution from generated exact solution. */ cget04_(&n, &nrhs, &x[1], &lda, &xact[1], &lda, & rcondc, &result[1]); /* + TESTS 3, 4, and 5 */ /* Use iterative refinement to improve the solution */ /* and compute error bounds. */ s_copy(srnamc_1.srnamt, "CTBRFS", (ftnlen)32, ( ftnlen)6); ctbrfs_(uplo, trans, diag, &n, &kd, &nrhs, &ab[1], &ldab, &b[1], &lda, &x[1], &lda, &rwork[ 1], &rwork[nrhs + 1], &work[1], &rwork[( nrhs << 1) + 1], &info); /* Check error code from CTBRFS. */ if (info != 0) { /* Writing concatenation */ i__6[0] = 1, a__1[0] = uplo; i__6[1] = 1, a__1[1] = trans; i__6[2] = 1, a__1[2] = diag; s_cat(ch__1, a__1, i__6, &c__3, (ftnlen)3); alaerh_(path, "CTBRFS", &info, &c__0, ch__1, & n, &n, &kd, &kd, &nrhs, &imat, &nfail, &nerrs, nout); } cget04_(&n, &nrhs, &x[1], &lda, &xact[1], &lda, & rcondc, &result[2]); ctbt05_(uplo, trans, diag, &n, &kd, &nrhs, &ab[1], &ldab, &b[1], &lda, &x[1], &lda, &xact[1] , &lda, &rwork[1], &rwork[nrhs + 1], & result[3]); /* Print information about the tests that did not */ /* pass the threshold. */ for (k = 1; k <= 5; ++k) { if (result[k - 1] >= *thresh) { if (nfail == 0 && nerrs == 0) { alahd_(nout, path); } io___39.ciunit = *nout; s_wsfe(&io___39); do_fio(&c__1, uplo, (ftnlen)1); do_fio(&c__1, trans, (ftnlen)1); do_fio(&c__1, diag, (ftnlen)1); do_fio(&c__1, (char *)&n, (ftnlen)sizeof( integer)); do_fio(&c__1, (char *)&kd, (ftnlen)sizeof( integer)); do_fio(&c__1, (char *)&nrhs, (ftnlen) sizeof(integer)); do_fio(&c__1, (char *)&imat, (ftnlen) sizeof(integer)); do_fio(&c__1, (char *)&k, (ftnlen)sizeof( integer)); do_fio(&c__1, (char *)&result[k - 1], ( ftnlen)sizeof(real)); e_wsfe(); ++nfail; } /* L40: */ } nrun += 5; /* L50: */ } /* L60: */ } /* + TEST 6 */ /* Get an estimate of RCOND = 1/CNDNUM. */ for (itran = 1; itran <= 2; ++itran) { if (itran == 1) { *(unsigned char *)norm = 'O'; rcondc = rcondo; } else { *(unsigned char *)norm = 'I'; rcondc = rcondi; } s_copy(srnamc_1.srnamt, "CTBCON", (ftnlen)32, (ftnlen) 6); ctbcon_(norm, uplo, diag, &n, &kd, &ab[1], &ldab, & rcond, &work[1], &rwork[1], &info); /* Check error code from CTBCON. */ if (info != 0) { /* Writing concatenation */ i__6[0] = 1, a__1[0] = norm; i__6[1] = 1, a__1[1] = uplo; i__6[2] = 1, a__1[2] = diag; s_cat(ch__1, a__1, i__6, &c__3, (ftnlen)3); alaerh_(path, "CTBCON", &info, &c__0, ch__1, &n, & n, &kd, &kd, &c_n1, &imat, &nfail, &nerrs, nout); } ctbt06_(&rcond, &rcondc, uplo, diag, &n, &kd, &ab[1], &ldab, &rwork[1], &result[5]); /* Print the test ratio if it is .GE. THRESH. */ if (result[5] >= *thresh) { if (nfail == 0 && nerrs == 0) { alahd_(nout, path); } io___41.ciunit = *nout; s_wsfe(&io___41); do_fio(&c__1, "CTBCON", (ftnlen)6); do_fio(&c__1, norm, (ftnlen)1); do_fio(&c__1, uplo, (ftnlen)1); do_fio(&c__1, diag, (ftnlen)1); do_fio(&c__1, (char *)&n, (ftnlen)sizeof(integer)) ; do_fio(&c__1, (char *)&kd, (ftnlen)sizeof(integer) ); do_fio(&c__1, (char *)&imat, (ftnlen)sizeof( integer)); do_fio(&c__1, (char *)&c__6, (ftnlen)sizeof( integer)); do_fio(&c__1, (char *)&result[5], (ftnlen)sizeof( real)); e_wsfe(); ++nfail; } ++nrun; /* L70: */ } /* L80: */ } L90: ; } /* Use pathological test matrices to test CLATBS. */ i__3 = nimat2; for (imat = 10; imat <= i__3; ++imat) { /* Do the tests only if DOTYPE( IMAT ) is true. */ if (! dotype[imat]) { goto L120; } for (iuplo = 1; iuplo <= 2; ++iuplo) { /* Do first for UPLO = 'U', then for UPLO = 'L' */ *(unsigned char *)uplo = *(unsigned char *)&uplos[iuplo - 1]; for (itran = 1; itran <= 3; ++itran) { /* Do for op(A) = A, A**T, and A**H. */ *(unsigned char *)trans = *(unsigned char *)&transs[ itran - 1]; /* Call CLATTB to generate a triangular test matrix. */ s_copy(srnamc_1.srnamt, "CLATTB", (ftnlen)32, (ftnlen) 6); clattb_(&imat, uplo, trans, diag, iseed, &n, &kd, &ab[ 1], &ldab, &x[1], &work[1], &rwork[1], &info); /* + TEST 7 */ /* Solve the system op(A)*x = b */ s_copy(srnamc_1.srnamt, "CLATBS", (ftnlen)32, (ftnlen) 6); ccopy_(&n, &x[1], &c__1, &b[1], &c__1); clatbs_(uplo, trans, diag, "N", &n, &kd, &ab[1], & ldab, &b[1], &scale, &rwork[1], &info); /* Check error code from CLATBS. */ if (info != 0) { /* Writing concatenation */ i__7[0] = 1, a__2[0] = uplo; i__7[1] = 1, a__2[1] = trans; i__7[2] = 1, a__2[2] = diag; i__7[3] = 1, a__2[3] = "N"; s_cat(ch__2, a__2, i__7, &c__4, (ftnlen)4); alaerh_(path, "CLATBS", &info, &c__0, ch__2, &n, & n, &kd, &kd, &c_n1, &imat, &nfail, &nerrs, nout); } ctbt03_(uplo, trans, diag, &n, &kd, &c__1, &ab[1], & ldab, &scale, &rwork[1], &c_b90, &b[1], &lda, &x[1], &lda, &work[1], &result[6]); /* + TEST 8 */ /* Solve op(A)*x = b again with NORMIN = 'Y'. */ ccopy_(&n, &x[1], &c__1, &b[1], &c__1); clatbs_(uplo, trans, diag, "Y", &n, &kd, &ab[1], & ldab, &b[1], &scale, &rwork[1], &info); /* Check error code from CLATBS. */ if (info != 0) { /* Writing concatenation */ i__7[0] = 1, a__2[0] = uplo; i__7[1] = 1, a__2[1] = trans; i__7[2] = 1, a__2[2] = diag; i__7[3] = 1, a__2[3] = "Y"; s_cat(ch__2, a__2, i__7, &c__4, (ftnlen)4); alaerh_(path, "CLATBS", &info, &c__0, ch__2, &n, & n, &kd, &kd, &c_n1, &imat, &nfail, &nerrs, nout); } ctbt03_(uplo, trans, diag, &n, &kd, &c__1, &ab[1], & ldab, &scale, &rwork[1], &c_b90, &b[1], &lda, &x[1], &lda, &work[1], &result[7]); /* Print information about the tests that did not pass */ /* the threshold. */ if (result[6] >= *thresh) { if (nfail == 0 && nerrs == 0) { alahd_(nout, path); } io___43.ciunit = *nout; s_wsfe(&io___43); do_fio(&c__1, "CLATBS", (ftnlen)6); do_fio(&c__1, uplo, (ftnlen)1); do_fio(&c__1, trans, (ftnlen)1); do_fio(&c__1, diag, (ftnlen)1); do_fio(&c__1, "N", (ftnlen)1); do_fio(&c__1, (char *)&n, (ftnlen)sizeof(integer)) ; do_fio(&c__1, (char *)&kd, (ftnlen)sizeof(integer) ); do_fio(&c__1, (char *)&imat, (ftnlen)sizeof( integer)); do_fio(&c__1, (char *)&c__7, (ftnlen)sizeof( integer)); do_fio(&c__1, (char *)&result[6], (ftnlen)sizeof( real)); e_wsfe(); ++nfail; } if (result[7] >= *thresh) { if (nfail == 0 && nerrs == 0) { alahd_(nout, path); } io___44.ciunit = *nout; s_wsfe(&io___44); do_fio(&c__1, "CLATBS", (ftnlen)6); do_fio(&c__1, uplo, (ftnlen)1); do_fio(&c__1, trans, (ftnlen)1); do_fio(&c__1, diag, (ftnlen)1); do_fio(&c__1, "Y", (ftnlen)1); do_fio(&c__1, (char *)&n, (ftnlen)sizeof(integer)) ; do_fio(&c__1, (char *)&kd, (ftnlen)sizeof(integer) ); do_fio(&c__1, (char *)&imat, (ftnlen)sizeof( integer)); do_fio(&c__1, (char *)&c__8, (ftnlen)sizeof( integer)); do_fio(&c__1, (char *)&result[7], (ftnlen)sizeof( real)); e_wsfe(); ++nfail; } nrun += 2; /* L100: */ } /* L110: */ } L120: ; } /* L130: */ } /* L140: */ } /* Print a summary of the results. */ alasum_(path, nout, &nfail, &nrun, &nerrs); return 0; /* End of CCHKTB */ } /* cchktb_ */
/* Subroutine */ int cerrtr_(char *path, integer *nunit) { /* Local variables */ complex a[4] /* was [2][2] */, b[2], w[2], x[2]; char c2[2]; real r1[2], r2[2], rw[2]; integer info; real scale, 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 */ /* ======= */ /* CERRTR tests the error exits for the COMPLEX triangular routines. */ /* 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 .. */ /* .. */ /* .. 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); a[0].r = 1.f, a[0].i = 0.f; a[2].r = 2.f, a[2].i = 0.f; a[3].r = 3.f, a[3].i = 0.f; a[1].r = 4.f, a[1].i = 0.f; infoc_1.ok = TRUE_; /* Test error exits for the general triangular routines. */ if (lsamen_(&c__2, c2, "TR")) { /* CTRTRI */ s_copy(srnamc_1.srnamt, "CTRTRI", (ftnlen)32, (ftnlen)6); infoc_1.infot = 1; ctrtri_("/", "N", &c__0, a, &c__1, &info); chkxer_("CTRTRI", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 2; ctrtri_("U", "/", &c__0, a, &c__1, &info); chkxer_("CTRTRI", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 3; ctrtri_("U", "N", &c_n1, a, &c__1, &info); chkxer_("CTRTRI", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 5; ctrtri_("U", "N", &c__2, a, &c__1, &info); chkxer_("CTRTRI", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); /* CTRTI2 */ s_copy(srnamc_1.srnamt, "CTRTI2", (ftnlen)32, (ftnlen)6); infoc_1.infot = 1; ctrti2_("/", "N", &c__0, a, &c__1, &info); chkxer_("CTRTI2", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 2; ctrti2_("U", "/", &c__0, a, &c__1, &info); chkxer_("CTRTI2", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 3; ctrti2_("U", "N", &c_n1, a, &c__1, &info); chkxer_("CTRTI2", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 5; ctrti2_("U", "N", &c__2, a, &c__1, &info); chkxer_("CTRTI2", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); /* CTRTRS */ s_copy(srnamc_1.srnamt, "CTRTRS", (ftnlen)32, (ftnlen)6); infoc_1.infot = 1; ctrtrs_("/", "N", "N", &c__0, &c__0, a, &c__1, x, &c__1, &info); chkxer_("CTRTRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 2; ctrtrs_("U", "/", "N", &c__0, &c__0, a, &c__1, x, &c__1, &info); chkxer_("CTRTRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 3; ctrtrs_("U", "N", "/", &c__0, &c__0, a, &c__1, x, &c__1, &info); chkxer_("CTRTRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 4; ctrtrs_("U", "N", "N", &c_n1, &c__0, a, &c__1, x, &c__1, &info); chkxer_("CTRTRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 5; ctrtrs_("U", "N", "N", &c__0, &c_n1, a, &c__1, x, &c__1, &info); chkxer_("CTRTRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 7; /* CTRRFS */ s_copy(srnamc_1.srnamt, "CTRRFS", (ftnlen)32, (ftnlen)6); infoc_1.infot = 1; ctrrfs_("/", "N", "N", &c__0, &c__0, a, &c__1, b, &c__1, x, &c__1, r1, r2, w, rw, &info); chkxer_("CTRRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 2; ctrrfs_("U", "/", "N", &c__0, &c__0, a, &c__1, b, &c__1, x, &c__1, r1, r2, w, rw, &info); chkxer_("CTRRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 3; ctrrfs_("U", "N", "/", &c__0, &c__0, a, &c__1, b, &c__1, x, &c__1, r1, r2, w, rw, &info); chkxer_("CTRRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 4; ctrrfs_("U", "N", "N", &c_n1, &c__0, a, &c__1, b, &c__1, x, &c__1, r1, r2, w, rw, &info); chkxer_("CTRRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 5; ctrrfs_("U", "N", "N", &c__0, &c_n1, a, &c__1, b, &c__1, x, &c__1, r1, r2, w, rw, &info); chkxer_("CTRRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 7; ctrrfs_("U", "N", "N", &c__2, &c__1, a, &c__1, b, &c__2, x, &c__2, r1, r2, w, rw, &info); chkxer_("CTRRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 9; ctrrfs_("U", "N", "N", &c__2, &c__1, a, &c__2, b, &c__1, x, &c__2, r1, r2, w, rw, &info); chkxer_("CTRRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 11; ctrrfs_("U", "N", "N", &c__2, &c__1, a, &c__2, b, &c__2, x, &c__1, r1, r2, w, rw, &info); chkxer_("CTRRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); /* CTRCON */ s_copy(srnamc_1.srnamt, "CTRCON", (ftnlen)32, (ftnlen)6); infoc_1.infot = 1; ctrcon_("/", "U", "N", &c__0, a, &c__1, &rcond, w, rw, &info); chkxer_("CTRCON", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 2; ctrcon_("1", "/", "N", &c__0, a, &c__1, &rcond, w, rw, &info); chkxer_("CTRCON", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 3; ctrcon_("1", "U", "/", &c__0, a, &c__1, &rcond, w, rw, &info); chkxer_("CTRCON", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 4; ctrcon_("1", "U", "N", &c_n1, a, &c__1, &rcond, w, rw, &info); chkxer_("CTRCON", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 6; ctrcon_("1", "U", "N", &c__2, a, &c__1, &rcond, w, rw, &info); chkxer_("CTRCON", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); /* CLATRS */ s_copy(srnamc_1.srnamt, "CLATRS", (ftnlen)32, (ftnlen)6); infoc_1.infot = 1; clatrs_("/", "N", "N", "N", &c__0, a, &c__1, x, &scale, rw, &info); chkxer_("CLATRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 2; clatrs_("U", "/", "N", "N", &c__0, a, &c__1, x, &scale, rw, &info); chkxer_("CLATRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 3; clatrs_("U", "N", "/", "N", &c__0, a, &c__1, x, &scale, rw, &info); chkxer_("CLATRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 4; clatrs_("U", "N", "N", "/", &c__0, a, &c__1, x, &scale, rw, &info); chkxer_("CLATRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 5; clatrs_("U", "N", "N", "N", &c_n1, a, &c__1, x, &scale, rw, &info); chkxer_("CLATRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 7; clatrs_("U", "N", "N", "N", &c__2, a, &c__1, x, &scale, rw, &info); chkxer_("CLATRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); /* Test error exits for the packed triangular routines. */ } else if (lsamen_(&c__2, c2, "TP")) { /* CTPTRI */ s_copy(srnamc_1.srnamt, "CTPTRI", (ftnlen)32, (ftnlen)6); infoc_1.infot = 1; ctptri_("/", "N", &c__0, a, &info); chkxer_("CTPTRI", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 2; ctptri_("U", "/", &c__0, a, &info); chkxer_("CTPTRI", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 3; ctptri_("U", "N", &c_n1, a, &info); chkxer_("CTPTRI", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); /* CTPTRS */ s_copy(srnamc_1.srnamt, "CTPTRS", (ftnlen)32, (ftnlen)6); infoc_1.infot = 1; ctptrs_("/", "N", "N", &c__0, &c__0, a, x, &c__1, &info); chkxer_("CTPTRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 2; ctptrs_("U", "/", "N", &c__0, &c__0, a, x, &c__1, &info); chkxer_("CTPTRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 3; ctptrs_("U", "N", "/", &c__0, &c__0, a, x, &c__1, &info); chkxer_("CTPTRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 4; ctptrs_("U", "N", "N", &c_n1, &c__0, a, x, &c__1, &info); chkxer_("CTPTRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 5; ctptrs_("U", "N", "N", &c__0, &c_n1, a, x, &c__1, &info); chkxer_("CTPTRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 8; ctptrs_("U", "N", "N", &c__2, &c__1, a, x, &c__1, &info); chkxer_("CTPTRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); /* CTPRFS */ s_copy(srnamc_1.srnamt, "CTPRFS", (ftnlen)32, (ftnlen)6); infoc_1.infot = 1; ctprfs_("/", "N", "N", &c__0, &c__0, a, b, &c__1, x, &c__1, r1, r2, w, rw, &info); chkxer_("CTPRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 2; ctprfs_("U", "/", "N", &c__0, &c__0, a, b, &c__1, x, &c__1, r1, r2, w, rw, &info); chkxer_("CTPRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 3; ctprfs_("U", "N", "/", &c__0, &c__0, a, b, &c__1, x, &c__1, r1, r2, w, rw, &info); chkxer_("CTPRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 4; ctprfs_("U", "N", "N", &c_n1, &c__0, a, b, &c__1, x, &c__1, r1, r2, w, rw, &info); chkxer_("CTPRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 5; ctprfs_("U", "N", "N", &c__0, &c_n1, a, b, &c__1, x, &c__1, r1, r2, w, rw, &info); chkxer_("CTPRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 8; ctprfs_("U", "N", "N", &c__2, &c__1, a, b, &c__1, x, &c__2, r1, r2, w, rw, &info); chkxer_("CTPRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 10; ctprfs_("U", "N", "N", &c__2, &c__1, a, b, &c__2, x, &c__1, r1, r2, w, rw, &info); chkxer_("CTPRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); /* CTPCON */ s_copy(srnamc_1.srnamt, "CTPCON", (ftnlen)32, (ftnlen)6); infoc_1.infot = 1; ctpcon_("/", "U", "N", &c__0, a, &rcond, w, rw, &info); chkxer_("CTPCON", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 2; ctpcon_("1", "/", "N", &c__0, a, &rcond, w, rw, &info); chkxer_("CTPCON", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 3; ctpcon_("1", "U", "/", &c__0, a, &rcond, w, rw, &info); chkxer_("CTPCON", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 4; ctpcon_("1", "U", "N", &c_n1, a, &rcond, w, rw, &info); chkxer_("CTPCON", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); /* CLATPS */ s_copy(srnamc_1.srnamt, "CLATPS", (ftnlen)32, (ftnlen)6); infoc_1.infot = 1; clatps_("/", "N", "N", "N", &c__0, a, x, &scale, rw, &info); chkxer_("CLATPS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 2; clatps_("U", "/", "N", "N", &c__0, a, x, &scale, rw, &info); chkxer_("CLATPS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 3; clatps_("U", "N", "/", "N", &c__0, a, x, &scale, rw, &info); chkxer_("CLATPS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 4; clatps_("U", "N", "N", "/", &c__0, a, x, &scale, rw, &info); chkxer_("CLATPS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 5; clatps_("U", "N", "N", "N", &c_n1, a, x, &scale, rw, &info); chkxer_("CLATPS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); /* Test error exits for the banded triangular routines. */ } else if (lsamen_(&c__2, c2, "TB")) { /* CTBTRS */ s_copy(srnamc_1.srnamt, "CTBTRS", (ftnlen)32, (ftnlen)6); infoc_1.infot = 1; ctbtrs_("/", "N", "N", &c__0, &c__0, &c__0, a, &c__1, x, &c__1, &info); chkxer_("CTBTRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 2; ctbtrs_("U", "/", "N", &c__0, &c__0, &c__0, a, &c__1, x, &c__1, &info); chkxer_("CTBTRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 3; ctbtrs_("U", "N", "/", &c__0, &c__0, &c__0, a, &c__1, x, &c__1, &info); chkxer_("CTBTRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 4; ctbtrs_("U", "N", "N", &c_n1, &c__0, &c__0, a, &c__1, x, &c__1, &info); chkxer_("CTBTRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 5; ctbtrs_("U", "N", "N", &c__0, &c_n1, &c__0, a, &c__1, x, &c__1, &info); chkxer_("CTBTRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 6; ctbtrs_("U", "N", "N", &c__0, &c__0, &c_n1, a, &c__1, x, &c__1, &info); chkxer_("CTBTRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 8; ctbtrs_("U", "N", "N", &c__2, &c__1, &c__1, a, &c__1, x, &c__2, &info); chkxer_("CTBTRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 10; ctbtrs_("U", "N", "N", &c__2, &c__0, &c__1, a, &c__1, x, &c__1, &info); chkxer_("CTBTRS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); /* CTBRFS */ s_copy(srnamc_1.srnamt, "CTBRFS", (ftnlen)32, (ftnlen)6); infoc_1.infot = 1; ctbrfs_("/", "N", "N", &c__0, &c__0, &c__0, a, &c__1, b, &c__1, x, & c__1, r1, r2, w, rw, &info); chkxer_("CTBRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 2; ctbrfs_("U", "/", "N", &c__0, &c__0, &c__0, a, &c__1, b, &c__1, x, & c__1, r1, r2, w, rw, &info); chkxer_("CTBRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 3; ctbrfs_("U", "N", "/", &c__0, &c__0, &c__0, a, &c__1, b, &c__1, x, & c__1, r1, r2, w, rw, &info); chkxer_("CTBRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 4; ctbrfs_("U", "N", "N", &c_n1, &c__0, &c__0, a, &c__1, b, &c__1, x, & c__1, r1, r2, w, rw, &info); chkxer_("CTBRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 5; ctbrfs_("U", "N", "N", &c__0, &c_n1, &c__0, a, &c__1, b, &c__1, x, & c__1, r1, r2, w, rw, &info); chkxer_("CTBRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 6; ctbrfs_("U", "N", "N", &c__0, &c__0, &c_n1, a, &c__1, b, &c__1, x, & c__1, r1, r2, w, rw, &info); chkxer_("CTBRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 8; ctbrfs_("U", "N", "N", &c__2, &c__1, &c__1, a, &c__1, b, &c__2, x, & c__2, r1, r2, w, rw, &info); chkxer_("CTBRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 10; ctbrfs_("U", "N", "N", &c__2, &c__1, &c__1, a, &c__2, b, &c__1, x, & c__2, r1, r2, w, rw, &info); chkxer_("CTBRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 12; ctbrfs_("U", "N", "N", &c__2, &c__1, &c__1, a, &c__2, b, &c__2, x, & c__1, r1, r2, w, rw, &info); chkxer_("CTBRFS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); /* CTBCON */ s_copy(srnamc_1.srnamt, "CTBCON", (ftnlen)32, (ftnlen)6); infoc_1.infot = 1; ctbcon_("/", "U", "N", &c__0, &c__0, a, &c__1, &rcond, w, rw, &info); chkxer_("CTBCON", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 2; ctbcon_("1", "/", "N", &c__0, &c__0, a, &c__1, &rcond, w, rw, &info); chkxer_("CTBCON", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 3; ctbcon_("1", "U", "/", &c__0, &c__0, a, &c__1, &rcond, w, rw, &info); chkxer_("CTBCON", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 4; ctbcon_("1", "U", "N", &c_n1, &c__0, a, &c__1, &rcond, w, rw, &info); chkxer_("CTBCON", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 5; ctbcon_("1", "U", "N", &c__0, &c_n1, a, &c__1, &rcond, w, rw, &info); chkxer_("CTBCON", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 7; ctbcon_("1", "U", "N", &c__2, &c__1, a, &c__1, &rcond, w, rw, &info); chkxer_("CTBCON", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); /* CLATBS */ s_copy(srnamc_1.srnamt, "CLATBS", (ftnlen)32, (ftnlen)6); infoc_1.infot = 1; clatbs_("/", "N", "N", "N", &c__0, &c__0, a, &c__1, x, &scale, rw, & info); chkxer_("CLATBS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 2; clatbs_("U", "/", "N", "N", &c__0, &c__0, a, &c__1, x, &scale, rw, & info); chkxer_("CLATBS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 3; clatbs_("U", "N", "/", "N", &c__0, &c__0, a, &c__1, x, &scale, rw, & info); chkxer_("CLATBS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 4; clatbs_("U", "N", "N", "/", &c__0, &c__0, a, &c__1, x, &scale, rw, & info); chkxer_("CLATBS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 5; clatbs_("U", "N", "N", "N", &c_n1, &c__0, a, &c__1, x, &scale, rw, & info); chkxer_("CLATBS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 6; clatbs_("U", "N", "N", "N", &c__1, &c_n1, a, &c__1, x, &scale, rw, & info); chkxer_("CLATBS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, & infoc_1.ok); infoc_1.infot = 8; clatbs_("U", "N", "N", "N", &c__2, &c__1, a, &c__1, x, &scale, rw, & info); chkxer_("CLATBS", &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 CERRTR */ } /* cerrtr_ */
int cpbcon_(char *uplo, int *n, int *kd, complex *ab, int *ldab, float *anorm, float *rcond, complex *work, float *rwork, int *info) { /* System generated locals */ int ab_dim1, ab_offset, i__1; float r__1, r__2; /* Builtin functions */ double r_imag(complex *); /* Local variables */ int ix, kase; float scale; extern int lsame_(char *, char *); int isave[3]; int upper; extern int clacn2_(int *, complex *, complex *, float *, int *, int *); extern int icamax_(int *, complex *, int *); float scalel; extern double slamch_(char *); extern int clatbs_(char *, char *, char *, char *, int *, int *, complex *, int *, complex *, float *, float *, int *); float scaleu; extern int xerbla_(char *, int *); float ainvnm; extern int csrscl_(int *, float *, complex *, int *); char normin[1]; float smlnum; /* -- LAPACK routine (version 3.2) -- */ /* Univ. of Tennessee, Univ. of California Berkeley and NAG Ltd.. */ /* November 2006 */ /* Modified to call CLACN2 in place of CLACON, 10 Feb 03, SJH. */ /* .. Scalar Arguments .. */ /* .. */ /* .. Array Arguments .. */ /* .. */ /* Purpose */ /* ======= */ /* CPBCON estimates the reciprocal of the condition number (in the */ /* 1-norm) of a complex Hermitian positive definite band matrix using */ /* the Cholesky factorization A = U**H*U or A = L*L**H computed by */ /* CPBTRF. */ /* An estimate is obtained for norm(inv(A)), and the reciprocal of the */ /* condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))). */ /* Arguments */ /* ========= */ /* UPLO (input) CHARACTER*1 */ /* = 'U': Upper triangular factor stored in AB; */ /* = 'L': Lower triangular factor stored in AB. */ /* N (input) INTEGER */ /* The order of the matrix A. N >= 0. */ /* KD (input) INTEGER */ /* The number of superdiagonals of the matrix A if UPLO = 'U', */ /* or the number of sub-diagonals if UPLO = 'L'. KD >= 0. */ /* AB (input) COMPLEX array, dimension (LDAB,N) */ /* The triangular factor U or L from the Cholesky factorization */ /* A = U**H*U or A = L*L**H of the band matrix A, stored in the */ /* first KD+1 rows of the array. The j-th column of U or L is */ /* stored in the j-th column of the array AB as follows: */ /* if UPLO ='U', AB(kd+1+i-j,j) = U(i,j) for MAX(1,j-kd)<=i<=j; */ /* if UPLO ='L', AB(1+i-j,j) = L(i,j) for j<=i<=MIN(n,j+kd). */ /* LDAB (input) INTEGER */ /* The leading dimension of the array AB. LDAB >= KD+1. */ /* ANORM (input) REAL */ /* The 1-norm (or infinity-norm) of the Hermitian band matrix A. */ /* RCOND (output) REAL */ /* The reciprocal of the condition number of the matrix A, */ /* computed as RCOND = 1/(ANORM * AINVNM), where AINVNM is an */ /* estimate of the 1-norm of inv(A) computed in this routine. */ /* WORK (workspace) COMPLEX array, dimension (2*N) */ /* RWORK (workspace) REAL array, dimension (N) */ /* INFO (output) INTEGER */ /* = 0: successful exit */ /* < 0: if INFO = -i, the i-th argument had an illegal value */ /* ===================================================================== */ /* .. Parameters .. */ /* .. */ /* .. Local Scalars .. */ /* .. */ /* .. Local Arrays .. */ /* .. */ /* .. External Functions .. */ /* .. */ /* .. External Subroutines .. */ /* .. */ /* .. Intrinsic Functions .. */ /* .. */ /* .. Statement Functions .. */ /* .. */ /* .. Statement Function definitions .. */ /* .. */ /* .. Executable Statements .. */ /* Test the input parameters. */ /* Parameter adjustments */ ab_dim1 = *ldab; ab_offset = 1 + ab_dim1; ab -= ab_offset; --work; --rwork; /* Function Body */ *info = 0; upper = lsame_(uplo, "U"); if (! upper && ! lsame_(uplo, "L")) { *info = -1; } else if (*n < 0) { *info = -2; } else if (*kd < 0) { *info = -3; } else if (*ldab < *kd + 1) { *info = -5; } else if (*anorm < 0.f) { *info = -6; } if (*info != 0) { i__1 = -(*info); xerbla_("CPBCON", &i__1); return 0; } /* Quick return if possible */ *rcond = 0.f; if (*n == 0) { *rcond = 1.f; return 0; } else if (*anorm == 0.f) { return 0; } smlnum = slamch_("Safe minimum"); /* Estimate the 1-norm of the inverse. */ kase = 0; *(unsigned char *)normin = 'N'; L10: clacn2_(n, &work[*n + 1], &work[1], &ainvnm, &kase, isave); if (kase != 0) { if (upper) { /* Multiply by inv(U'). */ clatbs_("Upper", "Conjugate transpose", "Non-unit", normin, n, kd, &ab[ab_offset], ldab, &work[1], &scalel, &rwork[1], info); *(unsigned char *)normin = 'Y'; /* Multiply by inv(U). */ clatbs_("Upper", "No transpose", "Non-unit", normin, n, kd, &ab[ ab_offset], ldab, &work[1], &scaleu, &rwork[1], info); } else { /* Multiply by inv(L). */ clatbs_("Lower", "No transpose", "Non-unit", normin, n, kd, &ab[ ab_offset], ldab, &work[1], &scalel, &rwork[1], info); *(unsigned char *)normin = 'Y'; /* Multiply by inv(L'). */ clatbs_("Lower", "Conjugate transpose", "Non-unit", normin, n, kd, &ab[ab_offset], ldab, &work[1], &scaleu, &rwork[1], info); } /* Multiply by 1/SCALE if doing so will not cause overflow. */ scale = scalel * scaleu; if (scale != 1.f) { ix = icamax_(n, &work[1], &c__1); i__1 = ix; if (scale < ((r__1 = work[i__1].r, ABS(r__1)) + (r__2 = r_imag(& work[ix]), ABS(r__2))) * smlnum || scale == 0.f) { goto L20; } csrscl_(n, &scale, &work[1], &c__1); } goto L10; } /* Compute the estimate of the reciprocal condition number. */ if (ainvnm != 0.f) { *rcond = 1.f / ainvnm / *anorm; } L20: return 0; /* End of CPBCON */ } /* cpbcon_ */