Searched refs:polynomial (Results 1 – 15 of 15) sorted by relevance
| /external/ceres-solver/internal/ceres/ |
| D | polynomial_solver.cc | 98 void BuildCompanionMatrix(const Vector& polynomial, in BuildCompanionMatrix() argument
103 const int degree = polynomial.size() - 1; in BuildCompanionMatrix()
108 companion_matrix.col(degree - 1) = -polynomial.reverse().head(degree); in BuildCompanionMatrix()
129 Vector polynomial = RemoveLeadingZeros(polynomial_in); in FindPolynomialRoots() local
130 const int degree = polynomial.size() - 1; in FindPolynomialRoots()
140 const double leading_term = polynomial(0); in FindPolynomialRoots()
141 polynomial /= leading_term; in FindPolynomialRoots()
147 (*real)(0) = -polynomial(1); in FindPolynomialRoots()
158 BuildCompanionMatrix(polynomial, &companion_matrix); in FindPolynomialRoots()
|
| D | polynomial_solver.h | 49 bool FindPolynomialRoots(const Vector& polynomial,
54 inline double EvaluatePolynomial(const Vector& polynomial, double x) { in EvaluatePolynomial() argument
56 for (int i = 0; i < polynomial.size(); ++i) { in EvaluatePolynomial()
57 v = v * x + polynomial(i); in EvaluatePolynomial()
|
| D | dogleg_strategy.cc | 421 Vector polynomial(5); in MakePolynomialForBoundaryConstrainedProblem() local
422 polynomial(0) = r2; in MakePolynomialForBoundaryConstrainedProblem()
423 polynomial(1) = 2.0 * r2 * trB; in MakePolynomialForBoundaryConstrainedProblem()
424 polynomial(2) = r2 * ( trB * trB + 2.0 * detB ) - subspace_g_.squaredNorm(); in MakePolynomialForBoundaryConstrainedProblem()
425 polynomial(3) = -2.0 * ( subspace_g_.transpose() * B_adj * subspace_g_ in MakePolynomialForBoundaryConstrainedProblem()
427 polynomial(4) = r2 * detB * detB - (B_adj * subspace_g_).squaredNorm(); in MakePolynomialForBoundaryConstrainedProblem()
429 return polynomial; in MakePolynomialForBoundaryConstrainedProblem()
473 const Vector polynomial = MakePolynomialForBoundaryConstrainedProblem(); in FindMinimumOnTrustRegionBoundary() local
477 if (!FindPolynomialRoots(polynomial, &roots_real, NULL)) { in FindMinimumOnTrustRegionBoundary()
|
| /external/eigen/unsupported/doc/examples/ |
| D | PolynomialUtils1.cpp | 11 Eigen::Matrix<double,5,1> polynomial; in main() local
12 roots_to_monicPolynomial( roots, polynomial ); in main()
14 for( int i=0; i<4; ++i ){ cout << polynomial[i] << ".x^" << i << "+ "; } in main()
15 cout << polynomial[4] << ".x^4" << endl; in main()
18 evaluation[i] = poly_eval( polynomial, roots[i] ); } in main()
|
| D | PolynomialSolver1.cpp | 14 Eigen::Matrix<double,6,1> polynomial; in main() local
15 roots_to_monicPolynomial( roots, polynomial ); in main()
17 PolynomialSolver<double,5> psolve( polynomial ); in main()
|
| /external/eigen/unsupported/Eigen/ |
| D | 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
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 …
66 then, it evaluates the computed polynomial, using a stabilized Hörner method.
76 …um bound (the Cauchy one: \f$C(p)\f$) for the absolute value of a root of the given polynomial i.e.
86 …(the Cauchy one: \f$c(p)\f$) for the absolute value of a non zero root of the given polynomial i.e.
93 \section QR polynomial solver class
94 …Computes the complex roots of a polynomial by computing the eigenvalues of the associated companio…
[all …]
|
| /external/llvm/test/Transforms/LoopStrengthReduce/ |
| D | quadradic-exit-value.ll | 3 ; The value of %r is dependent on a polynomial iteration expression.
|
| /external/llvm/test/Analysis/ScalarEvolution/ |
| D | trip-count10.ll | 78 ; Trip counts for non-polynomial iterations. It's theoretically possible
|
| /external/openssl/crypto/modes/asm/ |
| D | ghash-armv4.S | 318 vmov.i32 d5,#0xe1 @ our irreducible polynomial
341 vmov.i32 d5,#0xe1 @ our irreducible polynomial
|
| /external/clang/include/clang/Basic/ |
| D | arm_neon.td | 122 // P: polynomial
|
| /external/dropbear/libtommath/ |
| D | bn.tex | 1066 ``polynomial basis''. This simply means a field element is stored by divisions of a radix. For ex…
1068 the polynomial basis representation of $z$ if $f(\beta) = z$ for a given radix $\beta$.
1070 To multiply by the polynomial $g(x) = x$ all you have todo is shift the digits of the basis left on…
|
| /external/libogg/doc/ |
| D | rfc3533.txt | 583 The generator polynomial is 0x04c11db7.
|
| /external/llvm/lib/Target/Hexagon/ |
| D | HexagonInstrInfoV4.td | 2488 // Vector polynomial multiply halfwords
|
| /external/llvm/lib/Target/ARM/ |
| D | ARMInstrNEON.td | 3976 // VMUL : Vector Multiply (integer, polynomial and floating-point)
4055 // VMULL : Vector Multiply Long (integer and polynomial) (Q = D * D)
|
| /external/dropbear/libtomcrypt/ |
| D | changes | 1435 -- Library now has polynomial-basis GF(2^w) routines I wrote myself. Can be used to perform
|