OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:polynomial
(Results
1 - 7
of
7
) sorted by null
/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/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
...]
dogleg_strategy.cc
39
#include "ceres/
polynomial
.h"
295
//
polynomial
in y, which can be solved using e.g. the companion matrix.
318
LOG(WARNING) << "Failed to compute
polynomial
roots. "
363
// Build the
polynomial
that defines the optimal Lagrange multipliers.
404
// So (7) is a
polynomial
in y of degree four.
422
Vector
polynomial
(5);
423
polynomial
(0) = r2;
424
polynomial
(1) = 2.0 * r2 * trB;
425
polynomial
(2) = r2 * (trB * trB + 2.0 * detB) - subspace_g_.squaredNorm();
426
polynomial
(3) = -2.0 * (subspace_g_.transpose() * B_adj * subspace_g
474
const Vector
polynomial
= MakePolynomialForBoundaryConstrainedProblem();
local
[
all
...]
/prebuilts/devtools/tools/lib/
bcprov-jdk15on-1.48.jar
/prebuilts/tools/common/m2/repository/org/bouncycastle/bcprov-jdk15on/1.48/
bcprov-jdk15on-1.48.jar
Completed in 414 milliseconds