Lines Matching full:polynomial
39 #include "ceres/polynomial.h"
299 // polynomial in y, which can be solved using e.g. the companion matrix.
322 LOG(WARNING) << "Failed to compute polynomial roots. "
367 // Build the polynomial that defines the optimal Lagrange multipliers.
408 // So (7) is a polynomial in y of degree four.
426 Vector polynomial(5);
427 polynomial(0) = r2;
428 polynomial(1) = 2.0 * r2 * trB;
429 polynomial(2) = r2 * (trB * trB + 2.0 * detB) - subspace_g_.squaredNorm();
430 polynomial(3) = -2.0 * (subspace_g_.transpose() * B_adj * subspace_g_
432 polynomial(4) = r2 * detB * detB - (B_adj * subspace_g_).squaredNorm();
434 return polynomial;
464 // This is done by finding the roots of a fourth degree polynomial. If the
476 // Create the fourth-degree polynomial that is a necessary condition for
478 const Vector polynomial = MakePolynomialForBoundaryConstrainedProblem();
482 if (!FindPolynomialRoots(polynomial, &roots_real, NULL)) {
483 // Failed to find the roots of the polynomial, i.e. the candidate
490 // the polynomial is r^2 and therefore non-zero. However, as some roots
