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

1 2 3 4 56 7 8 91011>>

  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/tr1/
legendre_function.tcc 61 * @brief Return the Legendre polynomial by recursion on order
70 * @param l The order of the Legendre polynomial. @f$l >= 0@f$.
71 * @param x The argument of the Legendre polynomial. @f$|x| <= 1@f$.
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/tr1/
legendre_function.tcc 61 * @brief Return the Legendre polynomial by recursion on order
70 * @param l The order of the Legendre polynomial. @f$l >= 0@f$.
71 * @param x The argument of the Legendre polynomial. @f$|x| <= 1@f$.
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/tr1/
legendre_function.tcc 61 * @brief Return the Legendre polynomial by recursion on order
70 * @param l The order of the Legendre polynomial. @f$l >= 0@f$.
71 * @param x The argument of the Legendre polynomial. @f$|x| <= 1@f$.
  /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/tr1/
legendre_function.tcc 61 * @brief Return the Legendre polynomial by recursion on order
70 * @param l The order of the Legendre polynomial. @f$l >= 0@f$.
71 * @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
e_log.c 30 * a polynomial of degree 14 to approximate R The maximum error
31 * of this polynomial approximation is bounded by 2**-58.45. 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
  /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
  /external/fec/
encode_rs_8.c 74 * These are the low half of the coefficients. Since the generator polynomial is
  /external/fio/crc/
crc7.c 10 /* Table for CRC-7 (polynomial x^7 + x^3 + 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 *
  /prebuilts/go/darwin-x86/src/crypto/cipher/
gcm.go 191 // irreducible polynomial so the result has to be reduced. The
192 // irreducible polynomial is 1+x+x^2+x^7+x^128. We can subtract that to
241 // updateBlocks extends y with more polynomial terms from blocks, based on
252 // update extends y with more polynomial terms from data. If data is not a
  /prebuilts/go/linux-x86/src/crypto/cipher/
gcm.go 191 // irreducible polynomial so the result has to be reduced. The
192 // irreducible polynomial is 1+x+x^2+x^7+x^128. We can subtract that to
241 // updateBlocks extends y with more polynomial terms from blocks, based on
252 // update extends y with more polynomial terms from data. If data is not a
  /system/extras/verity/fec/
image.h 50 /* the number of Reed-Solomon generator polynomial roots, also the number
  /external/ceres-solver/internal/ceres/
CMakeLists.txt 85 polynomial.cc
269 CERES_TEST(polynomial)
  /external/libopus/silk/
NLSF2A.c 45 opus_int32 *out, /* O intermediate polynomial, QA [dd+1] */
47 opus_int dd /* I polynomial order (= 1/2 * filter order) */
  /external/webrtc/webrtc/modules/video_processing/test/
createTable.m 13 % is a second-order polynomial intersecting the points (0,0)
15 % 2. From r0 to r1, the compander is a third-order polynomial
  /frameworks/native/include/input/
VelocityTracker.h 43 // Polynomial coefficients describing motion in X and Y.
46 // Polynomial degree (number of coefficients), or zero if no information is
  /prebuilts/go/darwin-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

Completed in 350 milliseconds

1 2 3 4 56 7 8 91011>>