| /external/webrtc/webrtc/modules/audio_coding/codecs/ilbc/ |
| chebyshev.h | 25 * Calculate the Chevyshev polynomial series
28 * T_i(x) is the i:th order Chebyshev polynomial
33 int16_t x, /* (i) Value to the Chevyshev polynomial */
34 int16_t *f /* (i) The coefficients in the polynomial */
|
| chebyshev.c | 23 * Calculate the Chevyshev polynomial series
26 * T_i(x) is the i:th order Chebyshev polynomial
31 int16_t x, /* (i) Value to the Chevyshev polynomial */
32 int16_t *f /* (i) The coefficients in the polynomial */
|
| /libcore/ojluni/src/main/java/java/security/spec/ |
| ECFieldF2m.java | 65 * polynomial basis.
66 * The reduction polynomial for this field is based
68 * the i-th coefficient of the reduction polynomial.<p>
69 * Note: A valid reduction polynomial is either a
78 * the i-th coefficient of the reduction polynomial.
82 * a valid reduction polynomial.
95 ("rp does not represent a valid reduction polynomial");
110 * polynomial basis. The reduction polynomial for this
113 * reduction polynomial
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/polynomials/ |
| PolynomialFunctionNewtonForm.java | 25 * Implements the representation of a real polynomial function in
29 * The formula of polynomial in Newton form is
40 * The coefficients of the polynomial, ordered by degree -- i.e.
42 * coefficient of x^n where n is the degree of the polynomial.
47 * Centers of the Newton polynomial.
52 * When all c[i] = 0, a[] becomes normal polynomial coefficients,
58 * Whether the polynomial coefficients are available.
63 * Construct a Newton polynomial with the given a[] and c[]. The order of
97 * Returns the degree of the polynomial.
99 * @return the degree of the polynomial
[all...] |
| PolynomialFunctionLagrangeForm.java | 27 * Implements the representation of a real polynomial function in
32 * The approximated function should be smooth enough for Lagrange polynomial
41 * The coefficients of the polynomial, ordered by degree -- i.e.
43 * coefficient of x^n where n is the degree of the polynomial.
58 * Whether the polynomial coefficients are available.
63 * Construct a Lagrange polynomial with the given abscissas and function
93 * Returns the degree of the polynomial.
95 * @return the degree of the polynomial
104 * Changes made to the returned copy will not affect the polynomial.</p>
117 * Changes made to the returned copy will not affect the polynomial.</p
[all...] |
| PolynomialSplineFunction.java | 28 * Represents a polynomial spline function.
30 * A <strong>polynomial spline function</strong> consists of a set of
43 * The domain of the polynomial spline function is
48 * The value of the polynomial spline function for an argument <code>x</code>
68 * The polynomial functions that make up the spline. The first element
84 * Construct a polynomial spline function with the given segment delimiters
91 * @param polynomials polynomial functions that make up the spline
142 //then we will use the last polynomial to calculate the value.
150 * Returns the derivative of the polynomial spline function as a UnivariateRealFunction
158 * Returns the derivative of the polynomial spline function as a PolynomialSplineFunctio
[all...] |
| /external/libopus/silk/ |
| A2NLSF.c | 48 opus_int32 *p, /* I/O Polynomial */
49 const opus_int dd /* I Polynomial order (= filter order / 2 ) */
62 /* Polynomial evaluation */
63 static OPUS_INLINE opus_int32 silk_A2NLSF_eval_poly( /* return the polynomial evaluation, in Q16 */
64 opus_int32 *p, /* I Polynomial, Q16 */
136 p = P; /* Pointer to polynomial */
144 p = Q; /* Pointer to polynomial */
154 /* Evaluate polynomial */
170 /* Evaluate polynomial */
208 /* Alternate pointer to polynomial */
[all...] |
| /external/eigen/unsupported/doc/examples/ |
| PolynomialSolver1.cpp | 14 Eigen::Matrix<double,6,1> polynomial; local
15 roots_to_monicPolynomial( roots, polynomial );
17 PolynomialSolver<double,5> psolve( polynomial );
31 cout << "Hard case polynomial defined by floats: " << hardCase_polynomial.transpose() << endl;
36 cout << "Norms of the evaluations of the polynomial at the roots: " << evals.transpose() << endl << endl;
47 cout << "Norms of the evaluations of the polynomial at the roots: " << evals.transpose() << endl << endl;
|
| /system/extras/libfec/include/fec/ |
| ecc.h | 32 0x11d, /* field generator polynomial coefficients */ \
34 1, /* primitive element to generate polynomial roots */ \
35 (roots), /* polynomial degree (number of roots) */ \
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/field/ |
| GF2Polynomial.java | 5 class GF2Polynomial implements Polynomial
|
| FiniteFields.java | 20 throw new IllegalArgumentException("Polynomial exponents must be montonically increasing");
|
| /external/fec/ |
| encode_rs.h | 8 * NROOTS - the number of roots in the RS code generator polynomial,
15 * elements in index (log) form to polynomial form. Read only.
17 * elements in polynomial form to index (log) form. Read only.
19 * GENPOLY - an array of NROOTS+1 elements containing the generator polynomial in index form
|
| rs-common.h | 12 data_t *genpoly; /* Generator polynomial */
|
| /external/vboot_reference/firmware/2lib/include/ |
| 2crc8.h | 12 * Calculate CRC-8 of the data, using x^8 + x^2 + x + 1 polynomial.
|
| /prebuilts/go/darwin-x86/src/hash/crc32/ |
| example_test.go | 13 // In this package, the CRC polynomial is represented in reversed notation,
20 // For example, CRC32-Q, as defined by the following polynomial,
|
| /prebuilts/go/linux-x86/src/hash/crc32/ |
| example_test.go | 13 // In this package, the CRC polynomial is represented in reversed notation,
20 // For example, CRC32-Q, as defined by the following polynomial,
|
| /external/eigen/unsupported/Eigen/src/Polynomials/ |
| PolynomialSolver.h | 18 * \brief Defined to be inherited by polynomial solvers: it provides
54 /** \returns the complex roots of the polynomial */
58 /** Clear and fills the back insertion sequence with the real roots of the polynomial
305 * \brief A polynomial solver
307 * Computes the complex roots of a real polynomial.
309 * \param _Scalar the scalar type, i.e., the type of the polynomial coefficients
310 * \param _Deg the degree of the polynomial, can be a compile time value or Dynamic.
311 * Notice that the number of polynomial coefficients is _Deg+1.
313 * This class implements a polynomial solver and provides convenient methods such as
319 * WARNING: this polynomial solver is experimental, part of the unsuported Eigen modules
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/tr1/ |
| poly_laguerre.tcc | 56 * @brief This routine returns the associated Laguerre polynomial
107 * @brief Evaluate the polynomial based on the confluent hypergeometric
150 * @brief This routine returns the associated Laguerre polynomial
162 * The associated Laguerre polynomial is defined for integral
167 * where the Laguerre polynomial is defined by:
210 * @brief This routine returns the associated Laguerre polynomial
221 * The associated Laguerre polynomial is defined for integral
226 * where the Laguerre polynomial is defined by:
270 * @brief This routine returns the associated Laguerre polynomial
273 * The associated Laguerre polynomial is defined for integra
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/tr1/ |
| poly_laguerre.tcc | 56 * @brief This routine returns the associated Laguerre polynomial
107 * @brief Evaluate the polynomial based on the confluent hypergeometric
150 * @brief This routine returns the associated Laguerre polynomial
162 * The associated Laguerre polynomial is defined for integral
167 * where the Laguerre polynomial is defined by:
210 * @brief This routine returns the associated Laguerre polynomial
221 * The associated Laguerre polynomial is defined for integral
226 * where the Laguerre polynomial is defined by:
270 * @brief This routine returns the associated Laguerre polynomial
273 * The associated Laguerre polynomial is defined for integra
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/tr1/ |
| poly_laguerre.tcc | 56 * @brief This routine returns the associated Laguerre polynomial
107 * @brief Evaluate the polynomial based on the confluent hypergeometric
150 * @brief This routine returns the associated Laguerre polynomial
162 * The associated Laguerre polynomial is defined for integral
167 * where the Laguerre polynomial is defined by:
210 * @brief This routine returns the associated Laguerre polynomial
221 * The associated Laguerre polynomial is defined for integral
226 * where the Laguerre polynomial is defined by:
270 * @brief This routine returns the associated Laguerre polynomial
273 * The associated Laguerre polynomial is defined for integra
[all...] |
| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/tr1/ |
| poly_laguerre.tcc | 56 * @brief This routine returns the associated Laguerre polynomial
107 * @brief Evaluate the polynomial based on the confluent hypergeometric
150 * @brief This routine returns the associated Laguerre polynomial
162 * The associated Laguerre polynomial is defined for integral
167 * where the Laguerre polynomial is defined by:
210 * @brief This routine returns the associated Laguerre polynomial
221 * The associated Laguerre polynomial is defined for integral
226 * where the Laguerre polynomial is defined by:
270 * @brief This routine returns the associated Laguerre polynomial
273 * The associated Laguerre polynomial is defined for integra
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x9/ |
| X9FieldID.java | 42 * represents the reduction polynomial <code>f(z)</code>.
56 * represents the reduction polynomial <code>f(z)</code>.
59 * represents the reduction polynomial <code>f(z)</code>.
62 * represents the reduction polynomial <code>f(z)</code>..
|
| /external/lzma/Java/Tukaani/src/org/tukaani/xz/lz/ |
| CRC32Hash.java | 14 * Provides a CRC32 table using the polynomial from IEEE 802.3.
|
| /external/vboot_reference/firmware/lib/ |
| crc8.c | 11 * Return CRC-8 of the data, using x^8 + x^2 + x + 1 polynomial. A table-based
|
| /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 */
|
