| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/tr1/ |
| poly_laguerre.tcc | 57 * @brief This routine returns the associated Laguerre polynomial
109 * @brief Evaluate the polynomial based on the confluent hypergeometric
153 * @brief This routine returns the associated Laguerre polynomial
165 * The associated Laguerre polynomial is defined for integral
170 * where the Laguerre polynomial is defined by:
214 * @brief This routine returns the associated Laguerre polynomial
225 * The associated Laguerre polynomial is defined for integral
230 * where the Laguerre polynomial is defined by:
275 * @brief This routine returns the associated Laguerre polynomial
278 * The associated Laguerre polynomial is defined for integra
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/tr1/ |
| poly_laguerre.tcc | 57 * @brief This routine returns the associated Laguerre polynomial
109 * @brief Evaluate the polynomial based on the confluent hypergeometric
153 * @brief This routine returns the associated Laguerre polynomial
165 * The associated Laguerre polynomial is defined for integral
170 * where the Laguerre polynomial is defined by:
214 * @brief This routine returns the associated Laguerre polynomial
225 * The associated Laguerre polynomial is defined for integral
230 * where the Laguerre polynomial is defined by:
275 * @brief This routine returns the associated Laguerre polynomial
278 * The associated Laguerre polynomial is defined for integra
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/ |
| ECFieldElement.java | 308 // * <code>F<sub>2<sup>m</sup></sub></code> in polynomial basis (PB)
309 // * representation. Both trinomial (TPB) and pentanomial (PPB) polynomial
347 // * x<sup>k</sup> + 1</code> represents the reduction polynomial
351 // * represents the reduction polynomial <code>f(z)</code>.<br>
359 // * represents the reduction polynomial <code>f(z)</code>.<br>
367 // * represents the reduction polynomial <code>f(z)</code>.<br>
377 // * represents the reduction polynomial <code>f(z)</code>.
380 // * represents the reduction polynomial <code>f(z)</code>.
383 // * represents the reduction polynomial <code>f(z)</code>.
432 // * polynomial <code>f(z)</code>
[all...] |
| ECCurve.java | 187 * x<sup>k</sup> + 1</code> represents the reduction polynomial
191 * represents the reduction polynomial <code>f(z)</code>.<br>
199 * represents the reduction polynomial <code>f(z)</code>.<br>
207 * represents the reduction polynomial <code>f(z)</code>.<br>
240 * Constructor for Trinomial Polynomial Basis (TPB).
245 * polynomial <code>f(z)</code>.
263 * Constructor for Trinomial Polynomial Basis (TPB).
268 * polynomial <code>f(z)</code>.
291 * Constructor for Pentanomial Polynomial Basis (PPB).
296 * represents the reduction polynomial <code>f(z)</code>
[all...] |
| /external/llvm/test/Transforms/LoopStrengthReduce/ |
| quadradic-exit-value.ll | 3 ; The value of %r is dependent on a polynomial iteration expression.
|
| /external/skia/include/effects/ |
| SkArithmeticMode.h | 18 * src and dst are treated as being [0.0 .. 1.0]. The polynomial is
|
| /external/skia/legacy/include/effects/ |
| SkArithmeticMode.h | 18 * src and dst are treated as being [0.0 .. 1.0]. The polynomial is
|
| /frameworks/av/media/libeffects/lvm/lib/Common/src/ |
| LVM_Polynomial.c | 27 /* This function performs polynomial expansion */
36 /* N is the polynomial order */
37 /* pCoefficients is the ptr to polynomial coefficients A0,A1.. in Q.31 */
41 /* The result of the polynomial expansion in Q1.31 format */
|
| LVM_FO_HPF.c | 40 /* polynomial expansion using a 9th order polynomial. It uses the */
41 /* following table of 32-bit integer polynomial coefficients: */
|
| LVM_FO_LPF.c | 40 /* polynomial expansion using a 9th order polynomial. It uses the */
41 /* following table of 32-bit integer polynomial coefficients: */
|
| LVM_Power10.c | 29 /* This function calculates 10X using an 11th order polynomial. It uses */
30 /* the following table of 32-bit integer polynomial coefficients: */
|
| /frameworks/ml/bordeaux/learning/stochastic_linear_ranker/native/ |
| stochastic_linear_ranker.h | 96 // polynomial kernel, it implies the degree of the polynomial. In case of
139 // polynomial kernel, it implies the degree of the polynomial. In case of
214 // kernel-specific. In case of polynomial kernel, it is the degree of the
215 // polynomial.
|
| /external/llvm/test/CodeGen/X86/ |
| scev-interchange.ll | 8 %"struct.PolynomialSpace<1>" = type { %"struct.std::vector<Polynomials::Polynomial<double>,std::allocator<Polynomials::Polynomial<double> > >", i32, %"struct.std::vector<int,std::allocator<int> >", %"struct.std::vector<int,std::allocator<int> >" }
9 %"struct.Polynomials::Polynomial<double>" = type { %struct.Subscriptor, %"struct.std::vector<double,std::allocator<double> >" }
17 %"struct.std::_Vector_base<Polynomials::Polynomial<double>,std::allocator<Polynomials::Polynomial<double> > >" = type { %"struct.std::_Vector_base<Polynomials::Polynomial<double>,std::allocator<Polynomials::Polynomial<double> > >::_Vector_impl" }
18 %"struct.std::_Vector_base<Polynomials::Polynomial<double>,std::allocator<Polynomials::Polynomial<double> > >::_Vector_impl" = type { %"struct.Polynomials::Polynomial<double>"*, %"struct.Polynomials::Polynomial<double>"*, %"struct.Polynomials::Polynomial<double>"*
[all...] |
| /external/srtp/test/ |
| lfsr.c | 36 printf("polynomial: %s\t", v32_bit_string(mask));
167 * code generated by the polynomial poly
266 printf("polynomial: %s\tperiod: %d\n",
279 printf("polynomial: %s\tperiod: %d\n",
296 printf("polynomial: %s\tweight: %d\tperiod: %d\n",
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x9/ |
| X9FieldID.java | 42 * represents the reduction polynomial <code>f(z)</code>.
45 * represents the reduction polynomial <code>f(z)</code>.
48 * represents the reduction polynomial <code>f(z)</code>..
|
| /external/flac/libFLAC/include/private/ |
| crc.h | 38 ** polynomial = x^8 + x^2 + x^1 + x^0
48 ** polynomial = x^16 + x^15 + x^2 + x^0
|
| /frameworks/av/media/libeffects/lvm/lib/Reverb/src/ |
| LVREV_Tables.c | 54 size parameters. These polynomial coefficients are calculated experimentally.
66 first values is used to get polynomial set for given room size,
|
| /external/ceres-solver/internal/ceres/ |
| dogleg_strategy.cc | 294 // polynomial in y, which can be solved using e.g. the companion matrix.
317 LOG(WARNING) << "Failed to compute polynomial roots. "
362 // Build the polynomial that defines the optimal Lagrange multipliers.
403 // So (7) is a polynomial in y of degree four.
421 Vector polynomial(5);
422 polynomial(0) = r2;
423 polynomial(1) = 2.0 * r2 * trB;
424 polynomial(2) = r2 * ( trB * trB + 2.0 * detB ) - subspace_g_.squaredNorm();
425 polynomial(3) = -2.0 * ( subspace_g_.transpose() * B_adj * subspace_g_
427 polynomial(4) = r2 * detB * detB - (B_adj * subspace_g_).squaredNorm()
473 const Vector polynomial = MakePolynomialForBoundaryConstrainedProblem(); local
[all...] |
| polynomial_solver_test.cc | 48 // Return the constant polynomial p(x) = 1.23.
55 // Return the polynomial p(x) = poly(x) * (x - root).
64 // Return the polynomial
84 // Run a test with the polynomial defined by the N real roots in roots_real.
|
| /bionic/libm/upstream-freebsd/lib/msun/src/ |
| k_sin.c | 26 * odd polynomial is not evaluated in a way that preserves -0.
28 * 3. sin(x) is approximated by a polynomial of degree 13 on
|
| k_log.h | 23 * term of the polynomial are done by the caller for increased accuracy
36 * a polynomial of degree 14 to approximate R The maximum error
37 * of this polynomial approximation is bounded by 2**-58.45. In
|
| /external/jsilver/src/com/google/clearsilver/jsilver/functions/string/ |
| CrcFunction.java | 38 // This function produces a 'standard' CRC-32 (IV -1, reflected polynomial,
|
| /system/core/libsparse/ |
| sparse_format.h | 31 /* as 0. Standard 802.3 polynomial, use a Public Domain */
|
| /frameworks/ml/bordeaux/learning/stochastic_linear_ranker/jni/ |
| jni_stochastic_linear_ranker.h | 53 /* Three differnt kernels are supported: Linear "LINEAR", Polynomial "POLY", and RBF "RBF"
57 /* Kernel param is kernel-specific. In case of polynomial kernel, it is the degree of the
58 polynomial. In case of RBF kernel, it implies the sigma parameter. In case of linear
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jcajce/provider/asymmetric/ec/ |
| ECUtil.java | 36 * Returns a sorted array of middle terms of the reduction polynomial.
37 * @param k The unsorted array of middle terms of the reduction polynomial
39 * @return the sorted array of middle terms of the reduction polynomial.
|
