Searched refs:beta (Results 1 - 9 of 9) sorted by relevance

/barrelfish-2018-10-04/lib/msun/src/
H A Ds_ctanh.c39 * beta = 1/cos^2(y)
55 * beta rho s + I t
57 * 1 + beta s^2
78 double t, beta, s, rho, denom; local
131 beta = 1.0 + t * t; /* = 1 / cos^2(y) */
134 denom = 1 + beta * s * s;
135 return (CMPLX((beta * rho * s) / denom, t / denom));
H A Ds_ctanhf.c43 float t, beta, s, rho, denom; local
71 beta = 1.0 + t * t;
74 denom = 1 + beta * s * s;
75 return (CMPLXF((beta * rho * s) / denom, t / denom));
/barrelfish-2018-10-04/lib/openssl-1.0.0d/util/
H A Dmkrc.pl11 $beta = $ver&0xf;
13 if ($beta==0xf) { $version .= chr(ord('a')+$v4-1) if ($v4); }
14 elsif ($beta==0){ $version .= "-dev"; }
15 else { $version .= "-beta$beta"; }
/barrelfish-2018-10-04/usr/eclipseclp/Alog/src/
H A Dadjlogs.c653 ScaleDecomp - convert (a << p) = alpha d + beta, with beta < d
660 void ScaleDecomp( a, p, d, alpha, beta )
662 unsigned long a, d, *alpha, *beta;
681 *beta = r;
692 *beta = r << p;
746 Represent nv = alpha d + beta
748 void DivLong( n, d, v, alpha, beta )
750 unsigned long *alpha, *beta;
767 *beta
[all...]
/barrelfish-2018-10-04/lib/tommath/
H A Dtommath.tex285 A multiple precision integer of $n$-digits shall be denoted as $x = (x_{n-1}, \ldots, x_1, x_0)_{ \beta }$ and represent
286 the integer $x \equiv \sum_{i=0}^{n-1} x_i\beta^i$. The elements of the array $x$ are said to be the radix $\beta$ digits
308 The variable $\beta$ represents the radix of a single digit of a multiple precision integer and
310 the range $0 \le x < q \beta$ while a double precision variable must be able to represent integers in the range
311 $0 \le x < q \beta^2$. The extra radix-$q$ factor allows additions and subtractions to proceed without truncation of the
324 For example, if $\beta = 10^2$ a single precision data type may represent a value in the
628 it would represent the integer $a + b\beta + c\beta^2 + \ldots$
1057 For example, suppose the product of two integers was $x_n = (0x_{n-1}x_{n-2}...x_0)_{\beta}
[all...]
H A Dbn.tex1068 the polynomial basis representation of $z$ if $f(\beta) = z$ for a given radix $\beta$.
1400 where $R = \beta^n$, $n$ is the n number of digits in $m$ and $\beta$ is radix used (default is $2^{28}$).
1497 form $\beta^k - p$ for some $k \ge 0$ and $0 < p < \beta$ where $\beta$ is the radix (default to $2^{28}$).
1529 form $2^k - p$ for $0 < p < \beta$. In this sense the unrestricted reductions are more flexible as they
/barrelfish-2018-10-04/usr/bench/bomp_benchmark/
H A Dcg.c394 static double d, sum, rho, rho0, alpha, beta; local
551 c Obtain beta:
554 beta = rho / rho0;
557 c p = r + beta*p
561 p[j] = r[j] + beta*p[j];
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/
H A Dhttp_grammar.pl108 requ_head(from) --> ["Host"], [:], from. % HACK netscape 2.0beta !!!
/barrelfish-2018-10-04/usr/eclipseclp/Contrib/
H A Dxml_utilities.pl251 "Beta"-[914], % greek capital letter beta, U+0392
252 "beta"-[946], % greek small letter beta, U+03B2 ISOgrk3

Completed in 179 milliseconds