| /external/eigen/unsupported/doc/examples/ |
| PolynomialUtils1.cpp | 11 Eigen::Matrix<double,5,1> polynomial; local
12 roots_to_monicPolynomial( roots, polynomial );
13 cout << "Polynomial: ";
14 for( int i=0; i<4; ++i ){ cout << polynomial[i] << ".x^" << i << "+ "; }
15 cout << polynomial[4] << ".x^4" << endl;
18 evaluation[i] = poly_eval( polynomial, roots[i] ); }
19 cout << "Evaluation of the polynomial at the roots: " << evaluation.transpose();
|
| 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;
|
| /external/eigen/unsupported/Eigen/src/Polynomials/ |
| PolynomialUtils.h | 16 * \returns the evaluation of the polynomial at x using Horner algorithm.
18 * \param[in] poly : the vector of coefficients of the polynomial ordered
19 * by degrees i.e. poly[i] is the coefficient of degree i of the polynomial
21 * \param[in] x : the value to evaluate the polynomial at.
37 * \returns the evaluation of the polynomial at x using stabilized Horner algorithm.
39 * \param[in] poly : the vector of coefficients of the polynomial ordered
40 * by degrees i.e. poly[i] is the coefficient of degree i of the polynomial
42 * \param[in] x : the value to evaluate the polynomial at.
64 * \returns a maximum bound for the absolute value of any root of the polynomial.
66 * \param[in] poly : the vector of coefficients of the polynomial ordere
[all...] |
| 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
302 * \brief A polynomial solver
304 * Computes the complex roots of a real polynomial.
306 * \param _Scalar the scalar type, i.e., the type of the polynomial coefficients
307 * \param _Deg the degree of the polynomial, can be a compile time value or Dynamic.
308 * Notice that the number of polynomial coefficients is _Deg+1.
310 * This class implements a polynomial solver and provides convenient methods such as
316 * WARNING: this polynomial solver is experimental, part of the unsuported Eigen modules
[all...] |
| /external/ceres-solver/internal/ceres/ |
| polynomial_test.cc | 32 #include "ceres/polynomial.h"
49 // Return the constant polynomial p(x) = 1.23.
56 // Return the polynomial p(x) = poly(x) * (x - root).
65 // Return the polynomial
85 // Run a test with the polynomial defined by the N real roots in roots_real.
118 TEST(Polynomial, InvalidPolynomialOfZeroLengthIsRejected) {
129 TEST(Polynomial, ConstantPolynomialReturnsNoRoots) {
140 TEST(Polynomial, LinearPolynomialWithPositiveRootWorks) {
145 TEST(Polynomial, LinearPolynomialWithNegativeRootWorks) {
150 TEST(Polynomial, QuadraticPolynomialWithPositiveRootsWorks)
321 const Vector polynomial = FindInterpolatingPolynomial(samples); local
339 const Vector polynomial = FindInterpolatingPolynomial(samples); local
367 Vector polynomial = FindInterpolatingPolynomial(samples); local
397 const Vector polynomial = FindInterpolatingPolynomial(samples); local
440 const Vector polynomial = FindInterpolatingPolynomial(samples); local
477 const Vector polynomial = FindInterpolatingPolynomial(samples); local
508 const Vector polynomial = FindInterpolatingPolynomial(samples); local
[all...] |
| polynomial.cc | 32 #include "ceres/polynomial.h"
101 void BuildCompanionMatrix(const Vector& polynomial,
106 const int degree = polynomial.size() - 1;
111 companion_matrix.col(degree - 1) = -polynomial.reverse().head(degree);
128 LOG(ERROR) << "Invalid polynomial of size 0 passed to FindPolynomialRoots";
132 Vector polynomial = RemoveLeadingZeros(polynomial_in); local
133 const int degree = polynomial.size() - 1;
135 // Is the polynomial constant?
138 << "polynomial in FindPolynomialRoots";
143 const double leading_term = polynomial(0)
302 const Vector polynomial = FindInterpolatingPolynomial(samples); local
[all...] |
| polynomial.h | 44 // sum_{i=0}^N polynomial(i) x^{N-i}.
48 // Evaluate the polynomial at x using the Horner scheme.
49 inline double EvaluatePolynomial(const Vector& polynomial, double x) {
51 for (int i = 0; i < polynomial.size(); ++i) {
52 v = v * x + polynomial(i);
58 // polynomial.
61 // Failure indicates that the polynomial is invalid (of size 0) or
66 bool FindPolynomialRoots(const Vector& polynomial,
70 // Return the derivative of the given polynomial. It is assumed that
71 // the input polynomial is at least of degree zero
[all...] |
| /external/eigen/unsupported/Eigen/ |
| Polynomials | 24 * \brief This module provides a QR based polynomial solver.
39 and a QR based polynomial solver.
43 polynomials, computing estimates about polynomials and next the QR based polynomial
50 void roots_to_monicPolynomial( const RootVector& rv, Polynomial& poly )
63 evaluates a polynomial at a given point using stabilized Hörner method.
65 The following code: first computes the coefficients in the monomial basis of the monic polynomial that has the provided roots;
66 then, it evaluates the computed polynomial, using a stabilized Hörner method.
74 Real cauchy_max_bound( const Polynomial& poly )
76 provides a maximum bound (the Cauchy one: \f$C(p)\f$) for the absolute value of a root of the given polynomial i.e.
84 Real cauchy_min_bound( const Polynomial& poly
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/tr1/ |
| poly_hermite.tcc | 55 * @brief This routine returns the Hermite polynomial
58 * The Hermite polynomial is defined by:
63 * @param __n The order of the Hermite polynomial.
64 * @param __x The argument of the Hermite polynomial.
65 * @return The value of the Hermite polynomial of order n
97 * @brief This routine returns the Hermite polynomial
100 * The Hermite polynomial is defined by:
105 * @param __n The order of the Hermite polynomial.
106 * @param __x The argument of the Hermite polynomial.
107 * @return The value of the Hermite polynomial of order
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/tr1/ |
| poly_hermite.tcc | 55 * @brief This routine returns the Hermite polynomial
58 * The Hermite polynomial is defined by:
63 * @param __n The order of the Hermite polynomial.
64 * @param __x The argument of the Hermite polynomial.
65 * @return The value of the Hermite polynomial of order n
97 * @brief This routine returns the Hermite polynomial
100 * The Hermite polynomial is defined by:
105 * @param __n The order of the Hermite polynomial.
106 * @param __x The argument of the Hermite polynomial.
107 * @return The value of the Hermite polynomial of order
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/tr1/ |
| poly_hermite.tcc | 55 * @brief This routine returns the Hermite polynomial
58 * The Hermite polynomial is defined by:
63 * @param __n The order of the Hermite polynomial.
64 * @param __x The argument of the Hermite polynomial.
65 * @return The value of the Hermite polynomial of order n
97 * @brief This routine returns the Hermite polynomial
100 * The Hermite polynomial is defined by:
105 * @param __n The order of the Hermite polynomial.
106 * @param __x The argument of the Hermite polynomial.
107 * @return The value of the Hermite polynomial of order
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/tr1/ |
| poly_hermite.tcc | 55 * @brief This routine returns the Hermite polynomial
58 * The Hermite polynomial is defined by:
63 * @param __n The order of the Hermite polynomial.
64 * @param __x The argument of the Hermite polynomial.
65 * @return The value of the Hermite polynomial of order n
97 * @brief This routine returns the Hermite polynomial
100 * The Hermite polynomial is defined by:
105 * @param __n The order of the Hermite polynomial.
106 * @param __x The argument of the Hermite polynomial.
107 * @return The value of the Hermite polynomial of order
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/tr1/ |
| poly_hermite.tcc | 55 * @brief This routine returns the Hermite polynomial
58 * The Hermite polynomial is defined by:
63 * @param __n The order of the Hermite polynomial.
64 * @param __x The argument of the Hermite polynomial.
65 * @return The value of the Hermite polynomial of order n
97 * @brief This routine returns the Hermite polynomial
100 * The Hermite polynomial is defined by:
105 * @param __n The order of the Hermite polynomial.
106 * @param __x The argument of the Hermite polynomial.
107 * @return The value of the Hermite polynomial of order
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/tr1/ |
| poly_hermite.tcc | 55 * @brief This routine returns the Hermite polynomial
58 * The Hermite polynomial is defined by:
63 * @param __n The order of the Hermite polynomial.
64 * @param __x The argument of the Hermite polynomial.
65 * @return The value of the Hermite polynomial of order n
97 * @brief This routine returns the Hermite polynomial
100 * The Hermite polynomial is defined by:
105 * @param __n The order of the Hermite polynomial.
106 * @param __x The argument of the Hermite polynomial.
107 * @return The value of the Hermite polynomial of order
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/tr1/ |
| poly_hermite.tcc | 55 * @brief This routine returns the Hermite polynomial
58 * The Hermite polynomial is defined by:
63 * @param __n The order of the Hermite polynomial.
64 * @param __x The argument of the Hermite polynomial.
65 * @return The value of the Hermite polynomial of order n
97 * @brief This routine returns the Hermite polynomial
100 * The Hermite polynomial is defined by:
105 * @param __n The order of the Hermite polynomial.
106 * @param __x The argument of the Hermite polynomial.
107 * @return The value of the Hermite polynomial of order
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/tr1/ |
| poly_hermite.tcc | 55 * @brief This routine returns the Hermite polynomial
58 * The Hermite polynomial is defined by:
63 * @param __n The order of the Hermite polynomial.
64 * @param __x The argument of the Hermite polynomial.
65 * @return The value of the Hermite polynomial of order n
97 * @brief This routine returns the Hermite polynomial
100 * The Hermite polynomial is defined by:
105 * @param __n The order of the Hermite polynomial.
106 * @param __x The argument of the Hermite polynomial.
107 * @return The value of the Hermite polynomial of order
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/tr1/ |
| poly_hermite.tcc | 55 * @brief This routine returns the Hermite polynomial
58 * The Hermite polynomial is defined by:
63 * @param __n The order of the Hermite polynomial.
64 * @param __x The argument of the Hermite polynomial.
65 * @return The value of the Hermite polynomial of order n
97 * @brief This routine returns the Hermite polynomial
100 * The Hermite polynomial is defined by:
105 * @param __n The order of the Hermite polynomial.
106 * @param __x The argument of the Hermite polynomial.
107 * @return The value of the Hermite polynomial of order
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/tr1/ |
| poly_hermite.tcc | 55 * @brief This routine returns the Hermite polynomial
58 * The Hermite polynomial is defined by:
63 * @param __n The order of the Hermite polynomial.
64 * @param __x The argument of the Hermite polynomial.
65 * @return The value of the Hermite polynomial of order n
97 * @brief This routine returns the Hermite polynomial
100 * The Hermite polynomial is defined by:
105 * @param __n The order of the Hermite polynomial.
106 * @param __x The argument of the Hermite polynomial.
107 * @return The value of the Hermite polynomial of order
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/tr1/ |
| poly_hermite.tcc | 55 * @brief This routine returns the Hermite polynomial
58 * The Hermite polynomial is defined by:
63 * @param __n The order of the Hermite polynomial.
64 * @param __x The argument of the Hermite polynomial.
65 * @return The value of the Hermite polynomial of order n
97 * @brief This routine returns the Hermite polynomial
100 * The Hermite polynomial is defined by:
105 * @param __n The order of the Hermite polynomial.
106 * @param __x The argument of the Hermite polynomial.
107 * @return The value of the Hermite polynomial of order
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/tr1/ |
| poly_hermite.tcc | 54 * @brief This routine returns the Hermite polynomial
57 * The Hermite polynomial is defined by:
62 * @param __n The order of the Hermite polynomial.
63 * @param __x The argument of the Hermite polynomial.
64 * @return The value of the Hermite polynomial of order n
96 * @brief This routine returns the Hermite polynomial
99 * The Hermite polynomial is defined by:
104 * @param __n The order of the Hermite polynomial.
105 * @param __x The argument of the Hermite polynomial.
106 * @return The value of the Hermite polynomial of order
[all...] |
| /external/eigen/unsupported/test/ |
| polynomialsolver.cpp | 30 template<int Deg, typename POLYNOMIAL, typename SOLVER>
31 bool aux_evalSolver( const POLYNOMIAL& pols, SOLVER& psolve )
33 typedef typename POLYNOMIAL::Index Index;
34 typedef typename POLYNOMIAL::Scalar Scalar;
51 cerr << "Polynomial: " << pols.transpose() << endl;
53 cerr << "Abs value of the polynomial at the roots: " << evr.transpose() << endl;
78 template<int Deg, typename POLYNOMIAL>
79 void evalSolver( const POLYNOMIAL& pols )
81 typedef typename POLYNOMIAL::Scalar Scalar;
86 aux_evalSolver<Deg, POLYNOMIAL, PolynomialSolverType>( pols, psolve )
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/gallivm/ |
| f.cpp | 13 * This file allows to compute the minimax polynomial coefficients we use
34 * - For example, to compute exp2 5th order polynomial between [0, 1] do:
44 * - To compute log2 4th order polynomial between [0, 1/9] do:
58 #include <boost/math/tools/polynomial.hpp>
88 const boost::math::tools::polynomial<boost::math::ntl::RR>& n,
89 const boost::math::tools::polynomial<boost::math::ntl::RR>& d,
|
| /external/mesa3d/src/gallium/auxiliary/gallivm/ |
| f.cpp | 13 * This file allows to compute the minimax polynomial coefficients we use
34 * - For example, to compute exp2 5th order polynomial between [0, 1] do:
44 * - To compute log2 4th order polynomial between [0, 1/9] do:
58 #include <boost/math/tools/polynomial.hpp>
88 const boost::math::tools::polynomial<boost::math::ntl::RR>& n,
89 const boost::math::tools::polynomial<boost::math::ntl::RR>& d,
|
| /libcore/luni/src/main/java/java/security/spec/ |
| ECFieldF2m.java | 38 // Reduction polynomial
40 // Mid term(s) of reduction polynomial
62 * Creates a new {@code ECFieldF2m} with {@code 2^m} elements with a polynomial
63 * basis and the reduction polynomial based on {@code rp}.
65 * The reduction polynomial must be either <i>trinomial</i> or
71 * the base of the reduction polynomial with the n-th bit
73 * polynomial.
109 * a polynomial basis and the reduction polynomial based on {@code ks}.
111 * The reduction polynomial must be either <i>trinomial</i> o
[all...] |
| /external/chromium_org/third_party/opus/src/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 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...] |
