| /external/chromium_org/third_party/WebKit/Source/core/platform/graphics/ |
| UnitBezierTest.cpp | 38 EXPECT_EQ(0.875, bezier.solve(0.5, 0.005));
44 EXPECT_EQ(1.625, bezier.solve(0.5, 0.005));
50 EXPECT_EQ(-0.625, bezier.solve(0.5, 0.005));
56 EXPECT_EQ(0.0, bezier.solve(0.0, 0.005));
57 EXPECT_EQ(1.0, bezier.solve(1.0, 0.005));
63 EXPECT_EQ(0.0, bezier.solve(-1.0, 0.005));
64 EXPECT_EQ(1.0, bezier.solve(2.0, 0.005));
70 EXPECT_EQ(0.0, bezier.solve(-1.0, 1.0));
71 EXPECT_EQ(1.0, bezier.solve(2.0, 1.0));
|
| /external/eigen/doc/snippets/ |
| Tutorial_solve_reuse_decomposition.cpp | 7 x = luOfA.solve(b);
11 x = luOfA.solve(b);
|
| ColPivHouseholderQR_solve.cpp | 6 x = m.colPivHouseholderQr().solve(y);
|
| FullPivHouseholderQR_solve.cpp | 6 x = m.fullPivHouseholderQr().solve(y);
|
| FullPivLU_solve.cpp | 5 Matrix<float,3,2> x = m.fullPivLu().solve(y);
|
| LLT_solve.cpp | 5 // and let's solve samples * [x y]^T = elevations in least square sense:
7 = (samples.adjoint() * samples).llt().solve((samples.adjoint()*elevations));
|
| Tutorial_solve_multiple_rhs.cpp | 6 X = A.fullPivLu().solve(B);
|
| Tutorial_solve_singular.cpp | 8 x = A.lu().solve(b);
|
| Tutorial_solve_triangular.cpp | 7 Vector3f x = A.triangularView<Upper>().solve(b);
|
| HouseholderQR_solve.cpp | 7 x = m.householderQr().solve(y);
|
| JacobiSVD_basic.cpp | 9 cout << "A least-squares solution of m*x = rhs is:" << endl << svd.solve(rhs) << endl;
|
| PartialPivLU_solve.cpp | 5 MatrixXd X = A.lu().solve(B);
|
| /external/eigen/doc/examples/ |
| TutorialLinAlgComputeTwice.cpp | 17 cout << "The solution is:\n" << llt.solve(b) << endl;
22 cout << "The solution is now:\n" << llt.solve(b) << endl;
|
| TutorialLinAlgExComputeSolveError.cpp | 11 MatrixXd x = A.fullPivLu().solve(b);
|
| TutorialLinAlgExSolveColPivHouseholderQR.cpp | 15 Vector3f x = A.colPivHouseholderQr().solve(b);
|
| TutorialLinAlgExSolveLDLT.cpp | 14 Matrix2f x = A.ldlt().solve(b);
|
| TutorialLinAlgSVDSolve.cpp | 14 << A.jacobiSvd(ComputeThinU | ComputeThinV).solve(b) << endl;
|
| Tutorial_PartialLU_solve.cpp | 16 Vector3f x = A.lu().solve(b);
|
| /external/eigen/test/ |
| cholesky.cpp | 96 vecX = chollo.solve(vecB);
98 matX = chollo.solve(matB);
104 vecX = cholup.solve(vecB);
106 matX = cholup.solve(matB);
133 vecX = ldltlo.solve(vecB);
135 matX = ldltlo.solve(matB);
140 vecX = ldltup.solve(vecB);
142 matX = ldltup.solve(matB);
154 // check inplace solve
156 VERIFY_EVALUATION_COUNT(matX = ldltlo.solve(matX), 0)
[all...] |
| sparse_solvers.cpp | 53 VERIFY_IS_APPROX(refMat2.template triangularView<Lower>().solve(vec2),
54 m2.template triangularView<Lower>().solve(vec3));
58 VERIFY_IS_APPROX(refMat2.template triangularView<Upper>().solve(vec2),
59 m2.template triangularView<Upper>().solve(vec3));
60 VERIFY_IS_APPROX(refMat2.conjugate().template triangularView<Upper>().solve(vec2),
61 m2.conjugate().template triangularView<Upper>().solve(vec3));
66 VERIFY_IS_APPROX(refMat2.conjugate().template triangularView<Upper>().solve(vec2),
67 mm2.conjugate().template triangularView<Upper>().solve(vec3));
72 VERIFY_IS_APPROX(refMat2.transpose().template triangularView<Upper>().solve(vec2),
73 m2.transpose().template triangularView<Upper>().solve(vec3))
[all...] |
| nomalloc.cpp | 126 X = LLT.solve(B);
127 x = LLT.solve(b);
129 X = LDLT.solve(B);
130 x = LDLT.solve(b);
142 X = ppLU.solve(B);
143 x = ppLU.solve(b);
145 X = fpLU.solve(B);
146 x = fpLU.solve(b);
150 X = hQR.solve(B);
151 x = hQR.solve(b)
[all...] |
| /external/eigen/Eigen/src/Eigen2Support/ |
| QR.h | 30 bool solve(const MatrixBase<OtherDerived>& b, ResultType *result) const function in class:Eigen::QR
32 *result = static_cast<const Base*>(this)->solve(b);
|
| LU.h | 52 bool solve(const MatrixBase<OtherDerived>& b, ResultType *result) const function in class:Eigen::LU
54 *result = static_cast<const Base*>(this)->solve(b);
61 solve(MatrixType::Identity(this->rows(), this->cols()), result);
|
| /external/eigen/test/eigen2/ |
| eigen2_cholesky.cpp | 54 symm.llt().solve(vecB, &vecX);
73 ldlt.solve(vecB, &vecX);
75 ldlt.solve(matB, &matX);
83 chol.solve(vecB, &vecX);
85 chol.solve(matB, &matX);
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| IncompleteLU.h | 76 x = m_lu.template triangularView<UnitLower>().solve(b);
77 x = m_lu.template triangularView<Upper>().solve(x);
81 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::IncompleteLU
85 && "IncompleteLU::solve(): invalid number of rows of the right hand side matrix b");
|
