HomeSort by relevance Sort by last modified time
    Searched full:polynomial (Results 151 - 175 of 408) sorted by null

1 2 3 4 5 67 8 91011>>

  /prebuilts/go/darwin-x86/src/math/
log1p.go 41 // a polynomial of degree 14 to approximate R The maximum error
42 // of this polynomial approximation is bounded by 2**-58.45. In
sin.go 30 // Two polynomial approximating functions are employed.
61 // Two polynomial approximating functions are employed.
expm1.go 44 // a polynomial of degree 5 in r*r to approximate R1. The
45 // maximum error of this polynomial approximation is bounded
  /prebuilts/go/linux-x86/src/math/
exp.go 48 // a polynomial of degree 5 to approximate R. The maximum error
49 // of this polynomial approximation is bounded by 2**-59. In
log1p.go 41 // a polynomial of degree 14 to approximate R The maximum error
42 // of this polynomial approximation is bounded by 2**-58.45. In
sin.go 30 // Two polynomial approximating functions are employed.
61 // Two polynomial approximating functions are employed.
expm1.go 44 // a polynomial of degree 5 in r*r to approximate R1. The
45 // maximum error of this polynomial approximation is bounded
  /prebuilts/tools/common/m2/repository/org/bouncycastle/bcprov-jdk15on/1.48/
bcprov-jdk15on-1.48-sources.jar 
  /prebuilts/tools/common/offline-m2/org/bouncycastle/bcprov-jdk15on/1.48/
bcprov-jdk15on-1.48-sources.jar 
  /bionic/libc/upstream-netbsd/common/lib/libc/stdlib/
random.c 92 * state information, which will allow a degree seven polynomial. (Note:
100 * have period 2^deg - 1 (where deg is the degree of the polynomial being
101 * used, assuming that the polynomial is irreducible and primitive). The
140 * for the polynomial (actually a trinomial) that the R.N.G. is based on, and
240 * type of the current generator, the degree of the current polynomial being
  /external/webrtc/webrtc/modules/audio_processing/aec/
aec_core_neon.c 269 // exp2(x) and log2(x) are calculated using polynomial approximations.
282 // five polynomial approximation. The coefficients have been
284 // polynomial has a maximum relative error of 0.00086%.
345 // polynomial approximation. The coefficients have been estimated
346 // with the Remez algorithm and the resulting polynomial has a
  /external/ImageMagick/MagickCore/
distort.c 129 * Polynomial Term Defining Functions
132 * the 2 number_valuesal polynomial function...
143 * Note the slight re-ordering of the terms for a quadratic polynomial
144 * which is to allow the use of a bi-linear (order=1.5) polynomial.
149 /* Return the number of terms for a 2d polynomial */
152 return 0; /* invalid polynomial order */
158 /* Return the result for this polynomial term */
186 /* return the result for this polynomial term */
214 /* polynomial term for x derivative */
242 /* polynomial term for y derivative *
    [all...]
  /external/apache-harmony/security/src/test/api/java/org/apache/harmony/security/tests/java/security/spec/
ECFieldF2mTest.java 453 * Assertion: returns mid terms of reduction polynomial
476 * Assertion: returns mid terms of reduction polynomial
487 * Assertion: returns reduction polynomial
  /libcore/luni/src/test/java/tests/security/spec/
ECFieldF2mTest.java 487 * Assertion: returns mid terms of reduction polynomial
510 * Assertion: returns mid terms of reduction polynomial
521 * Assertion: returns reduction polynomial
  /bionic/libm/upstream-freebsd/lib/msun/src/
s_expm1.c 39 * a polynomial of degree 5 in r*r to approximate R1. The
40 * maximum error of this polynomial approximation is bounded
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 85 * degree-4 minimax polynomial with maximum error under 1.4 * 2**-33.
  /external/chromium-trace/catapult/third_party/gsutil/third_party/crcmod/docs/source/
crcmod.predefined.rst 15 individual polynomial, reflection, and initial and final-XOR parameters.
23 Name Polynomial Reversed? Init-value XOR-out Check
  /external/fdlibm/
s_expm1.c 36 * a polynomial of degree 5 in r*r to approximate R1. The
37 * maximum error of this polynomial approximation is bounded
  /external/llvm/lib/Target/Hexagon/
HexagonIntrinsicsV4.td 41 // Vector polynomial multiply halfwords
47 // Polynomial multiply words
  /external/lzma/xz-embedded/
xz.h 278 * Update CRC32 value using the polynomial from IEEE-802.3. To start a new
293 * Update CRC64 value using the polynomial from ECMA-182. To start a new
  /external/skia/src/utils/
SkPatchUtils.cpp 15 * Forward differences is a method for evaluating a nth degree polynomial at a uniform step by only
23 * For the cubic case the first difference gives as a result a quadratic polynomial to which we can
  /frameworks/av/media/libstagefright/codecs/amrnb/common/src/
az_lsp.cpp 127 f = polynomial (Word16)
128 n = polynomial order (Word16)
136 cheb = Chebyshev polynomial for the input value x.(Word16)
147 This module evaluates the Chebyshev polynomial series.
148 - The polynomial order is n = m/2 = 5
149 - The polynomial F(z) (F1(z) or F2(z)) is given by
154 polynomial ( x=cos(w) )
361 The roots of F1(z) and F2(z) are found using Chebyshev polynomial evaluation.
  /bionic/libm/upstream-freebsd/lib/msun/ld128/
k_tanl.c 28 * See ../ld80/k_cosl.c for more details about the polynomial.

Completed in 872 milliseconds

1 2 3 4 5 67 8 91011>>