HomeSort by relevance Sort by last modified time
    Searched full:polynomial (Results 76 - 100 of 228) sorted by null

1 2 34 5 6 7 8 910

  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/tr1/
legendre_function.tcc 62 * @brief Return the Legendre polynomial by recursion on order
71 * @param l The order of the Legendre polynomial. @f$l >= 0@f$.
72 * @param x The argument of the Legendre polynomial. @f$|x| <= 1@f$.
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/tr1/
legendre_function.tcc 62 * @brief Return the Legendre polynomial by recursion on order
71 * @param l The order of the Legendre polynomial. @f$l >= 0@f$.
72 * @param x The argument of the Legendre polynomial. @f$|x| <= 1@f$.
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/tr1/
legendre_function.tcc 62 * @brief Return the Legendre polynomial by recursion on order
71 * @param l The order of the Legendre polynomial. @f$l >= 0@f$.
72 * @param x The argument of the Legendre polynomial. @f$|x| <= 1@f$.
  /bionic/libm/upstream-freebsd/lib/msun/src/
k_tanf.c 45 * Split up the polynomial into small independent terms to give
e_exp.c 34 * a polynomial of degree 5 to approximate R. The maximum error
35 * of this polynomial approximation is bounded by 2**-59. In
s_log1p.c 35 * a polynomial of degree 14 to approximate R The maximum error
36 * of this polynomial approximation is bounded by 2**-58.45. In
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
  /external/fdlibm/
k_sin.c 23 * 3. ieee_sin(x) is approximated by a polynomial of degree 13 on
e_exp.c 31 * a polynomial of degree 5 to approximate R. The maximum error
32 * of this polynomial approximation is bounded by 2**-59. In
e_log.c 27 * a polynomial of degree 14 to approximate R The maximum error
28 * of this polynomial approximation is bounded by 2**-58.45. In
s_log1p.c 33 * a polynomial of degree 14 to approximate R The maximum error
34 * of this polynomial approximation is bounded by 2**-58.45. In
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/webkit/Source/WebCore/platform/graphics/
UnitBezier.h 36 // Calculate the polynomial coefficients, implicit first and last control points are (0,0) and (1,1).
  /frameworks/av/media/libeffects/lvm/lib/Eq/src/
LVEQNB_Tables.c 128 /* Filter polynomial coefficients */
LVEQNB_CalcCoef.c 136 * Calculate the cosine error by a polynomial expansion using the equation:
267 * Calculate the cosine by a polynomial expansion using the equation:
  /frameworks/av/media/libstagefright/codecs/amrwbenc/src/
az_isp.c 99 * Chebyshev polynomial evaluation. *
198 * Evaluates the Chebishev polynomial series *
201 * The polynomial order is *
203 * The polynomial is given by *
  /external/qemu/distrib/sdl-1.2.15/src/video/
e_log.h 30 * a polynomial of degree 14 to approximate R The maximum error
31 * of this polynomial approximation is bounded by 2**-58.45. In
  /frameworks/base/include/androidfw/
VelocityTracker.h 43 // Polynomial coefficients describing motion in X and Y.
46 // Polynomial degree (number of coefficients), or zero if no information is
  /prebuilts/tools/common/m2/repository/org/bouncycastle/bcprov-jdk15on/1.48/
bcprov-jdk15on-1.48-sources.jar 
  /external/apache-harmony/security/src/test/api/java/org/apache/harmony/security/tests/java/security/spec/
ECFieldF2mTest.java 454 * Assertion: returns mid terms of reduction polynomial
477 * Assertion: returns mid terms of reduction polynomial
488 * Assertion: returns reduction polynomial
  /external/dropbear/libtommath/
tommath.out 62 \BOOKMARK [1][-]{section.4.4}{Polynomial Basis Operations}{chapter.4}
74 \BOOKMARK [2][-]{subsection.5.2.3}{Polynomial Basis Multiplication}{section.5.2}
81 \BOOKMARK [2][-]{subsection.5.3.3}{Polynomial Basis Squaring}{section.5.3}
  /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
  /external/openssl/crypto/ec/
eck_prn.c 294 /* print the polynomial */
295 if ((p != NULL) && !ASN1_bn_print(bp, "Polynomial:", p, buffer,
  /external/srec/portable/src/
pcrc.c 34 #define POLYNOMIAL 0x04C11DB7
78 #define POLYNOMIAL 0x8005
  /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) )
359 The roots of F1(z) and F2(z) are found using Chebyshev polynomial evaluation.

Completed in 1167 milliseconds

1 2 34 5 6 7 8 910