| /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/interpolation/ |
| SplineInterpolator.java | 35 * x belongs and computing the value of the corresponding polynomial at <code>x - x[i] </code> where
|
| /external/boringssl/src/crypto/ec/ |
| example_mul.c | 64 * The elliptic curve binary polynomial software is originally written by
|
| /external/chromium-trace/catapult/third_party/gsutil/third_party/crcmod/ |
| README | 13 generate a Python function for the selected polynomial or an instance of the
|
| /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/guava/guava-tests/test/com/google/common/hash/ |
| Crc32cHashFunctionTest.java | 100 // From RFC 3720, Section 12.1, the polynomial generator is 0x11EDC6F41.
|
| /external/libchrome/base/metrics/ |
| bucket_ranges.cc | 70 // the reversed polynomial 0xedb88320L. This is nice and simple, and allows us
|
| /external/llvm/test/Analysis/ScalarEvolution/ |
| trip-count10.ll | 78 ; Trip counts for non-polynomial iterations. It's theoretically possible
|
| /external/webrtc/webrtc/modules/audio_coding/codecs/ilbc/ |
| poly_to_lsp.c | 46 (the sum and the diff polynomial)
|
| /external/webrtc/webrtc/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 */
|
| /ndk/sources/android/support/src/musl-math/ |
| libm.h | 157 /* polynomial evaluation */
|
| /prebuilts/go/darwin-x86/src/math/ |
| gamma.go | 94 // The polynomial is valid for 33 <= x <= 172.
|
| /prebuilts/go/linux-x86/src/math/ |
| gamma.go | 94 // The polynomial is valid for 33 <= x <= 172.
|
| /toolchain/binutils/binutils-2.25/include/ |
| os9k.h | 41 #define CRCCON 0x800063 /* CRC polynomial constant. */
|
| /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...] |
| /bionic/libm/x86/ |
| e_atan2.S | 50 //4. For 2^(-64) <= |Y/X| < 2^(-5), atan(|Y/X|) is approximated by a polynomial
51 // of the form Z + Z*E*polynomial(E), where Z = |Y/X| and E = Z*Z.
53 // calculated using the polynomial in 4 above.
59 // ~=~ tau + Z + Z*E*polynomial(E), where E = Z*Z.
63 // in a table. The polynomial is the one used in 4.
|
| /bionic/libm/x86_64/ |
| e_atan2.S | 50 //4. For 2^(-64) <= |Y/X| < 2^(-5), atan(|Y/X|) is approximated by a polynomial
51 // of the form Z + Z*E*polynomial(E), where Z = |Y/X| and E = Z*Z.
53 // calculated using the polynomial in 4 above.
59 // ~=~ tau + Z + Z*E*polynomial(E), where E = Z*Z.
63 // in a table. The polynomial is the one used in 4.
|
| /external/ceres-solver/internal/ceres/ |
| line_search.cc | 39 #include "ceres/polynomial.h"
148 // polynomial of degree defined by interpolation_type which interpolates all
184 // and minimizing the corresponding polynomial.
246 // minimizing polynomial, we can fit up to a quadratic without requiring the
732 // Polynomial interpolation requires inputs ordered according to step size,
[all...] |
| /external/webrtc/webrtc/modules/audio_processing/aec/ |
| aec_core_sse2.c | 235 // exp2(x) and log2(x) are calculated using polynomial approximations.
248 // five polynomial approximation. The coefficients have been
250 // polynomial has a maximum relative error of 0.00086%.
325 // polynomial approximation. The coefficients have been estimated
326 // with the Remez algorithm and the resulting polynomial has a
|
| /external/v8/src/base/ |
| ieee754.cc | 335 * 3. cos(x) is approximated by a polynomial of degree 14 on
710 * 3. sin(x) is approximated by a polynomial of degree 13 on
765 * 3. tan(x) is approximated by a odd polynomial of degree 27 on
[all...] |
| /bionic/libm/upstream-freebsd/lib/msun/src/ |
| e_lgamma_r.c | 29 * 2. Polynomial approximation of lgamma around its
35 * poly(z) is a 14 degree polynomial.
|
| /cts/tests/camera/src/android/hardware/camera2/cts/rs/ |
| raw_converter.rs | 41 float4 toneMapCoeffs; // Coefficients for a polynomial tonemapping curve
80 // Apply polynomial tonemapping curve to each color channel in RGB pixel.
|
| /development/perftests/panorama/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
|
