aboutsummaryrefslogtreecommitdiffstats
path: root/contrib/libs/clapack/claqhp.c
diff options
context:
space:
mode:
authorshmel1k <shmel1k@ydb.tech>2022-09-02 12:44:59 +0300
committershmel1k <shmel1k@ydb.tech>2022-09-02 12:44:59 +0300
commit90d450f74722da7859d6f510a869f6c6908fd12f (patch)
tree538c718dedc76cdfe37ad6d01ff250dd930d9278 /contrib/libs/clapack/claqhp.c
parent01f64c1ecd0d4ffa9e3a74478335f1745f26cc75 (diff)
downloadydb-90d450f74722da7859d6f510a869f6c6908fd12f.tar.gz
[] add metering mode to CLI
Diffstat (limited to 'contrib/libs/clapack/claqhp.c')
-rw-r--r--contrib/libs/clapack/claqhp.c189
1 files changed, 189 insertions, 0 deletions
diff --git a/contrib/libs/clapack/claqhp.c b/contrib/libs/clapack/claqhp.c
new file mode 100644
index 0000000000..2676a25fb0
--- /dev/null
+++ b/contrib/libs/clapack/claqhp.c
@@ -0,0 +1,189 @@
+/* claqhp.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"
+
+/* Subroutine */ int claqhp_(char *uplo, integer *n, complex *ap, real *s,
+ real *scond, real *amax, char *equed)
+{
+ /* System generated locals */
+ integer i__1, i__2, i__3, i__4;
+ real r__1;
+ complex q__1;
+
+ /* Local variables */
+ integer i__, j, jc;
+ real cj, large;
+ extern logical lsame_(char *, char *);
+ real small;
+ extern doublereal slamch_(char *);
+
+
+/* -- LAPACK auxiliary routine (version 3.2) -- */
+/* Univ. of Tennessee, Univ. of California Berkeley and NAG Ltd.. */
+/* November 2006 */
+
+/* .. Scalar Arguments .. */
+/* .. */
+/* .. Array Arguments .. */
+/* .. */
+
+/* Purpose */
+/* ======= */
+
+/* CLAQHP equilibrates a Hermitian matrix A using the scaling factors */
+/* in the vector S. */
+
+/* Arguments */
+/* ========= */
+
+/* UPLO (input) CHARACTER*1 */
+/* Specifies whether the upper or lower triangular part of the */
+/* Hermitian matrix A is stored. */
+/* = 'U': Upper triangular */
+/* = 'L': Lower triangular */
+
+/* N (input) INTEGER */
+/* The order of the matrix A. N >= 0. */
+
+/* AP (input/output) COMPLEX array, dimension (N*(N+1)/2) */
+/* On entry, the upper or lower triangle of the Hermitian matrix */
+/* A, packed columnwise in a linear array. The j-th column of A */
+/* is stored in the array AP as follows: */
+/* if UPLO = 'U', AP(i + (j-1)*j/2) = A(i,j) for 1<=i<=j; */
+/* if UPLO = 'L', AP(i + (j-1)*(2n-j)/2) = A(i,j) for j<=i<=n. */
+
+/* On exit, the equilibrated matrix: diag(S) * A * diag(S), in */
+/* the same storage format as A. */
+
+/* S (input) REAL array, dimension (N) */
+/* The scale factors for A. */
+
+/* SCOND (input) REAL */
+/* Ratio of the smallest S(i) to the largest S(i). */
+
+/* AMAX (input) REAL */
+/* Absolute value of largest matrix entry. */
+
+/* EQUED (output) CHARACTER*1 */
+/* Specifies whether or not equilibration was done. */
+/* = 'N': No equilibration. */
+/* = 'Y': Equilibration was done, i.e., A has been replaced by */
+/* diag(S) * A * diag(S). */
+
+/* Internal Parameters */
+/* =================== */
+
+/* THRESH is a threshold value used to decide if scaling should be done */
+/* based on the ratio of the scaling factors. If SCOND < THRESH, */
+/* scaling is done. */
+
+/* LARGE and SMALL are threshold values used to decide if scaling should */
+/* be done based on the absolute size of the largest matrix element. */
+/* If AMAX > LARGE or AMAX < SMALL, scaling is done. */
+
+/* ===================================================================== */
+
+/* .. Parameters .. */
+/* .. */
+/* .. Local Scalars .. */
+/* .. */
+/* .. External Functions .. */
+/* .. */
+/* .. Intrinsic Functions .. */
+/* .. */
+/* .. Executable Statements .. */
+
+/* Quick return if possible */
+
+ /* Parameter adjustments */
+ --s;
+ --ap;
+
+ /* Function Body */
+ if (*n <= 0) {
+ *(unsigned char *)equed = 'N';
+ return 0;
+ }
+
+/* Initialize LARGE and SMALL. */
+
+ small = slamch_("Safe minimum") / slamch_("Precision");
+ large = 1.f / small;
+
+ if (*scond >= .1f && *amax >= small && *amax <= large) {
+
+/* No equilibration */
+
+ *(unsigned char *)equed = 'N';
+ } else {
+
+/* Replace A by diag(S) * A * diag(S). */
+
+ if (lsame_(uplo, "U")) {
+
+/* Upper triangle of A is stored. */
+
+ jc = 1;
+ i__1 = *n;
+ for (j = 1; j <= i__1; ++j) {
+ cj = s[j];
+ i__2 = j - 1;
+ for (i__ = 1; i__ <= i__2; ++i__) {
+ i__3 = jc + i__ - 1;
+ r__1 = cj * s[i__];
+ i__4 = jc + i__ - 1;
+ q__1.r = r__1 * ap[i__4].r, q__1.i = r__1 * ap[i__4].i;
+ ap[i__3].r = q__1.r, ap[i__3].i = q__1.i;
+/* L10: */
+ }
+ i__2 = jc + j - 1;
+ i__3 = jc + j - 1;
+ r__1 = cj * cj * ap[i__3].r;
+ ap[i__2].r = r__1, ap[i__2].i = 0.f;
+ jc += j;
+/* L20: */
+ }
+ } else {
+
+/* Lower triangle of A is stored. */
+
+ jc = 1;
+ i__1 = *n;
+ for (j = 1; j <= i__1; ++j) {
+ cj = s[j];
+ i__2 = jc;
+ i__3 = jc;
+ r__1 = cj * cj * ap[i__3].r;
+ ap[i__2].r = r__1, ap[i__2].i = 0.f;
+ i__2 = *n;
+ for (i__ = j + 1; i__ <= i__2; ++i__) {
+ i__3 = jc + i__ - j;
+ r__1 = cj * s[i__];
+ i__4 = jc + i__ - j;
+ q__1.r = r__1 * ap[i__4].r, q__1.i = r__1 * ap[i__4].i;
+ ap[i__3].r = q__1.r, ap[i__3].i = q__1.i;
+/* L30: */
+ }
+ jc = jc + *n - j + 1;
+/* L40: */
+ }
+ }
+ *(unsigned char *)equed = 'Y';
+ }
+
+ return 0;
+
+/* End of CLAQHP */
+
+} /* claqhp_ */