/bionic/libm/upstream-freebsd/lib/msun/src/ |
k_cos.c | 26 * 3. cos(x) is approximated by a polynomial of degree 14 on
|
s_cbrt.c | 81 * where P(r) is a polynomial of degree 4 that approximates 1/cbrt(r)
|
s_exp2f.c | 84 * degree-4 minimax polynomial with maximum error under 1.4 * 2**-33.
|
e_lgamma_r.c | 31 * 2. Polynomial approximation of lgamma around its 37 * poly(z) is a 14 degree polynomial.
|
/external/fdlibm/ |
k_cos.c | 23 * 3. ieee_cos(x) is approximated by a polynomial of degree 14 on
|
k_tan.c | 23 * 3. ieee_tan(x) is approximated by a odd polynomial of degree 27 on
|
e_lgamma_r.c | 28 * 2. Polynomial approximation of lgamma around its 34 * poly(z) is a 14 degree polynomial.
|
/external/llvm/test/Analysis/ScalarEvolution/ |
trip-count10.ll | 78 ; Trip counts for non-polynomial iterations. It's theoretically possible
|
/external/quake/quake/src/QW/client/ |
crc.c | 25 // this is a 16 bit, non-reflected CRC using the polynomial 0x1021
|
/external/quake/quake/src/WinQuake/ |
crc.cpp | 25 // this is a 16 bit, non-reflected CRC using the polynomial 0x1021
|
/external/webrtc/src/modules/audio_coding/codecs/isac/main/source/ |
crc.c | 15 #define POLYNOMIAL 0x04c11db7L
|
/frameworks/av/media/libeffects/lvm/lib/SpectrumAnalyzer/src/ |
LVPSA_Tables.c | 164 /* Cosone polynomial coefficients */
|
LVPSA_Control.c | 514 * Calculate the cosine by a polynomial expansion using the equation: [all...] |
/external/opencv/cxcore/src/ |
cxutils.cpp | 442 * a polynomial of degree n are given as a[i] (i=0,i,..., n) where a[0] is 452 * Polynomial Equations," by K. W. Ellenberger, Commun. ACM 3 (Dec. 1960), 456 * ACM algorithm #30 - Numerical Solution of the Polynomial Equation 483 // Copy polynomial coefficients to working storage 558 d[2 + j] = h[2 + j] + r * d[2 + j - 1]; // Calculate polynomial at r 596 for (j = n; j >= 0; j--) { // Polynomial deflation by lin-nomial 631 for (j = n; j >= 0; j--) { // Polynomial deflation by quadratic [all...] |
/external/freetype/src/base/ |
ftbbox.c | 307 /* The polynomial is */ 424 /* of the range of the original polynomial coefficients. */
|
/external/libvorbis/lib/ |
lsp.c | 25 /* Note that the lpc-lsp conversion finds the roots of polynomial with 323 /* eval the polynomial and its first two derivatives */
|
/external/openssh/ |
acss.c | 138 * lfsr17: polynomial of degree 17, primitive modulo 2 (listed in Schneier) 140 * lfsr25: polynomial of degree 25, not know if primitive modulo 2
|
/external/openssl/crypto/modes/asm/ |
ghash-armv4.S | 318 vmov.i32 d5,#0xe1 @ our irreducible polynomial 341 vmov.i32 d5,#0xe1 @ our irreducible polynomial
|
/packages/apps/Camera/jni/feature_stab/db_vlvm/ |
db_utilities_poly.h | 30 * \defgroup LMPolynomial (LM) Polynomial utilities (solvers, arithmetic, evaluation, etc.) 259 degree polynomial goes first and the smaller ones
|
/packages/apps/Gallery2/jni_mosaic/feature_stab/db_vlvm/ |
db_utilities_poly.h | 30 * \defgroup LMPolynomial (LM) Polynomial utilities (solvers, arithmetic, evaluation, etc.) 259 degree polynomial goes first and the smaller ones
|
/packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/ |
db_utilities_poly.h | 30 * \defgroup LMPolynomial (LM) Polynomial utilities (solvers, arithmetic, evaluation, etc.) 259 degree polynomial goes first and the smaller ones
|
/external/compiler-rt/lib/ |
divdf3.c | 80 // polynomial approximation: reciprocal = 3/4 + 1/sqrt(2) - b/2. This
|
divsf3.c | 80 // polynomial approximation: reciprocal = 3/4 + 1/sqrt(2) - b/2. This
|
/external/flac/include/FLAC/ |
format.h | 269 FLAC__SUBFRAME_TYPE_FIXED = 2, /**< fixed polynomial prediction */ 302 /**< The polynomial order. */ 439 /**< CRC-8 (polynomial = x^8 + x^2 + x^1 + x^0, initialized with 0) 461 /**< CRC-16 (polynomial = x^16 + x^15 + x^2 + x^0, initialized with [all...] |
/external/openssl/crypto/ec/ |
ec_cvt.c | 67 * The elliptic curve binary polynomial software is originally written by
|