diff options
author | shmel1k <shmel1k@ydb.tech> | 2022-09-02 12:44:59 +0300 |
---|---|---|
committer | shmel1k <shmel1k@ydb.tech> | 2022-09-02 12:44:59 +0300 |
commit | 90d450f74722da7859d6f510a869f6c6908fd12f (patch) | |
tree | 538c718dedc76cdfe37ad6d01ff250dd930d9278 /contrib/libs/clapack/spbcon.c | |
parent | 01f64c1ecd0d4ffa9e3a74478335f1745f26cc75 (diff) | |
download | ydb-90d450f74722da7859d6f510a869f6c6908fd12f.tar.gz |
[] add metering mode to CLI
Diffstat (limited to 'contrib/libs/clapack/spbcon.c')
-rw-r--r-- | contrib/libs/clapack/spbcon.c | 232 |
1 files changed, 232 insertions, 0 deletions
diff --git a/contrib/libs/clapack/spbcon.c b/contrib/libs/clapack/spbcon.c new file mode 100644 index 00000000000..620291ee007 --- /dev/null +++ b/contrib/libs/clapack/spbcon.c @@ -0,0 +1,232 @@ +/* spbcon.f -- translated by f2c (version 20061008). + You must link the resulting object file with libf2c: + on Microsoft Windows system, link with libf2c.lib; + on Linux or Unix systems, link with .../path/to/libf2c.a -lm + or, if you install libf2c.a in a standard place, with -lf2c -lm + -- in that order, at the end of the command line, as in + cc *.o -lf2c -lm + Source for libf2c is in /netlib/f2c/libf2c.zip, e.g., + + http://www.netlib.org/f2c/libf2c.zip +*/ + +#include "f2c.h" +#include "blaswrap.h" + +/* Table of constant values */ + +static integer c__1 = 1; + +/* Subroutine */ int spbcon_(char *uplo, integer *n, integer *kd, real *ab, + integer *ldab, real *anorm, real *rcond, real *work, integer *iwork, + integer *info) +{ + /* System generated locals */ + integer ab_dim1, ab_offset, i__1; + real r__1; + + /* Local variables */ + integer ix, kase; + real scale; + extern logical lsame_(char *, char *); + integer isave[3]; + extern /* Subroutine */ int srscl_(integer *, real *, real *, integer *); + logical upper; + extern /* Subroutine */ int slacn2_(integer *, real *, real *, integer *, + real *, integer *, integer *); + real scalel; + extern doublereal slamch_(char *); + real scaleu; + extern /* Subroutine */ int xerbla_(char *, integer *); + extern integer isamax_(integer *, real *, integer *); + real ainvnm; + extern /* Subroutine */ int slatbs_(char *, char *, char *, char *, + integer *, integer *, real *, integer *, real *, real *, real *, + integer *); + char normin[1]; + real smlnum; + + +/* -- LAPACK routine (version 3.2) -- */ +/* Univ. of Tennessee, Univ. of California Berkeley and NAG Ltd.. */ +/* November 2006 */ + +/* Modified to call SLACN2 in place of SLACON, 7 Feb 03, SJH. */ + +/* .. Scalar Arguments .. */ +/* .. */ +/* .. Array Arguments .. */ +/* .. */ + +/* Purpose */ +/* ======= */ + +/* SPBCON estimates the reciprocal of the condition number (in the */ +/* 1-norm) of a real symmetric positive definite band matrix using the */ +/* Cholesky factorization A = U**T*U or A = L*L**T computed by SPBTRF. */ + +/* 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 subdiagonals if UPLO = 'L'. KD >= 0. */ + +/* AB (input) REAL array, dimension (LDAB,N) */ +/* The triangular factor U or L from the Cholesky factorization */ +/* A = U**T*U or A = L*L**T 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 symmetric 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) REAL array, dimension (3*N) */ + +/* IWORK (workspace) INTEGER 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 .. */ +/* .. */ +/* .. Executable Statements .. */ + +/* Test the input parameters. */ + + /* Parameter adjustments */ + ab_dim1 = *ldab; + ab_offset = 1 + ab_dim1; + ab -= ab_offset; + --work; + --iwork; + + /* 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_("SPBCON", &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: + slacn2_(n, &work[*n + 1], &work[1], &iwork[1], &ainvnm, &kase, isave); + if (kase != 0) { + if (upper) { + +/* Multiply by inv(U'). */ + + slatbs_("Upper", "Transpose", "Non-unit", normin, n, kd, &ab[ + ab_offset], ldab, &work[1], &scalel, &work[(*n << 1) + 1], + info); + *(unsigned char *)normin = 'Y'; + +/* Multiply by inv(U). */ + + slatbs_("Upper", "No transpose", "Non-unit", normin, n, kd, &ab[ + ab_offset], ldab, &work[1], &scaleu, &work[(*n << 1) + 1], + info); + } else { + +/* Multiply by inv(L). */ + + slatbs_("Lower", "No transpose", "Non-unit", normin, n, kd, &ab[ + ab_offset], ldab, &work[1], &scalel, &work[(*n << 1) + 1], + info); + *(unsigned char *)normin = 'Y'; + +/* Multiply by inv(L'). */ + + slatbs_("Lower", "Transpose", "Non-unit", normin, n, kd, &ab[ + ab_offset], ldab, &work[1], &scaleu, &work[(*n << 1) + 1], + info); + } + +/* Multiply by 1/SCALE if doing so will not cause overflow. */ + + scale = scalel * scaleu; + if (scale != 1.f) { + ix = isamax_(n, &work[1], &c__1); + if (scale < (r__1 = work[ix], dabs(r__1)) * smlnum || scale == + 0.f) { + goto L20; + } + srscl_(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 SPBCON */ + +} /* spbcon_ */ |