Lines Matching defs:degree
57 const int degree = companion_matrix.rows();
71 for (int i = 0; i < degree; ++i) {
107 const int degree = polynomial.size() - 1;
109 companion_matrix.resize(degree, degree);
112 companion_matrix.col(degree - 1) = -polynomial.reverse().head(degree);
191 const int degree = polynomial.size() - 1;
199 if (degree == 0) {
209 if (degree == 1) {
215 if (degree == 2) {
220 // The degree is now known to be at least 3. For cubic or higher
228 Matrix companion_matrix(degree, degree);
254 const int degree = polynomial.rows() - 1;
255 CHECK_GE(degree, 0);
258 // not result in a smaller degree polynomial, just a degree zero
260 if (degree == 0) {
264 Vector derivative(degree);
265 for (int i = 0; i < degree; ++i) {
266 derivative(i) = (degree - i) * polynomial(i);
344 const int degree = num_constraints - 1;
353 for (int j = 0; j <= degree; ++j) {
354 lhs(row, j) = pow(sample.x, degree - j);
361 for (int j = 0; j < degree; ++j) {
362 lhs(row, j) = (degree - j) * pow(sample.x, degree - j - 1);