| /external/chromium_org/third_party/WebKit/Source/platform/animation/ |
| D | UnitBezierTest.cpp | 38 EXPECT_EQ(0.875, bezier.solve(0.5, 0.005)); in TEST()
44 EXPECT_EQ(1.625, bezier.solve(0.5, 0.005)); in TEST()
50 EXPECT_EQ(-0.625, bezier.solve(0.5, 0.005)); in TEST()
56 EXPECT_EQ(0.0, bezier.solve(0.0, 0.005)); in TEST()
57 EXPECT_EQ(1.0, bezier.solve(1.0, 0.005)); in TEST()
63 EXPECT_EQ(-2.0, bezier.solve(-1.0, 0.005)); in TEST()
64 EXPECT_EQ(1.0, bezier.solve(2.0, 0.005)); in TEST()
70 EXPECT_EQ(-2.0, bezier.solve(-1.0, 1.0)); in TEST()
71 EXPECT_EQ(1.0, bezier.solve(2.0, 1.0)); in TEST()
77 EXPECT_EQ(-1.0, bezier.solve(-1.0, 0.005)); in TEST()
[all …]
|
| /external/eigen/test/ |
| D | sparse_solvers.cpp | 53 VERIFY_IS_APPROX(refMat2.template triangularView<Lower>().solve(vec2), in sparse_solvers()
54 m2.template triangularView<Lower>().solve(vec3)); in sparse_solvers()
58 VERIFY_IS_APPROX(refMat2.template triangularView<Upper>().solve(vec2), in sparse_solvers()
59 m2.template triangularView<Upper>().solve(vec3)); in sparse_solvers()
60 VERIFY_IS_APPROX(refMat2.conjugate().template triangularView<Upper>().solve(vec2), in sparse_solvers()
61 m2.conjugate().template triangularView<Upper>().solve(vec3)); in sparse_solvers()
66 VERIFY_IS_APPROX(refMat2.conjugate().template triangularView<Upper>().solve(vec2), in sparse_solvers()
67 mm2.conjugate().template triangularView<Upper>().solve(vec3)); in sparse_solvers()
72 VERIFY_IS_APPROX(refMat2.transpose().template triangularView<Upper>().solve(vec2), in sparse_solvers()
73 m2.transpose().template triangularView<Upper>().solve(vec3)); in sparse_solvers()
[all …]
|
| D | cholesky.cpp | 96 vecX = chollo.solve(vecB); in cholesky()
98 matX = chollo.solve(matB); in cholesky()
104 vecX = cholup.solve(vecB); in cholesky()
106 matX = cholup.solve(matB); in cholesky()
121 m2 += symmLo.template selfadjointView<Lower>().llt().solve(matB); in cholesky()
122 VERIFY_IS_APPROX(m2, m1 + symmLo.template selfadjointView<Lower>().llt().solve(matB)); in cholesky()
124 m2 -= symmLo.template selfadjointView<Lower>().llt().solve(matB); in cholesky()
125 VERIFY_IS_APPROX(m2, m1 - symmLo.template selfadjointView<Lower>().llt().solve(matB)); in cholesky()
127 m2.noalias() += symmLo.template selfadjointView<Lower>().llt().solve(matB); in cholesky()
128 VERIFY_IS_APPROX(m2, m1 + symmLo.template selfadjointView<Lower>().llt().solve(matB)); in cholesky()
[all …]
|
| D | nomalloc.cpp | 131 X = LLT.solve(B); in ctms_decompositions()
132 x = LLT.solve(b); in ctms_decompositions()
134 X = LDLT.solve(B); in ctms_decompositions()
135 x = LDLT.solve(b); in ctms_decompositions()
147 X = ppLU.solve(B); in ctms_decompositions()
148 x = ppLU.solve(b); in ctms_decompositions()
150 X = fpLU.solve(B); in ctms_decompositions()
151 x = fpLU.solve(b); in ctms_decompositions()
155 X = hQR.solve(B); in ctms_decompositions()
156 x = hQR.solve(b); in ctms_decompositions()
[all …]
|
| D | triangular.cpp | 73 …VERIFY(v2.isApprox(m3.adjoint() * (m1.adjoint().template triangularView<Lower>().solve(v2)), large… in triangular_square()
75 …VERIFY(v2.isApprox(m3.transpose() * (m1.transpose().template triangularView<Upper>().solve(v2)), l… in triangular_square()
77 VERIFY(v2.isApprox(m3 * (m1.template triangularView<Upper>().solve(v2)), largerEps)); in triangular_square()
79 …VERIFY(v2.isApprox(m3.conjugate() * (m1.conjugate().template triangularView<Lower>().solve(v2)), l… in triangular_square()
83 …VERIFY(m2.isApprox(m3.adjoint() * (m1.adjoint().template triangularView<Lower>().solve(m2)), large… in triangular_square()
85 …VERIFY(m2.isApprox(m3.transpose() * (m1.transpose().template triangularView<Upper>().solve(m2)), l… in triangular_square()
87 VERIFY(m2.isApprox(m3 * (m1.template triangularView<Upper>().solve(m2)), largerEps)); in triangular_square()
89 …VERIFY(m2.isApprox(m3.conjugate() * (m1.conjugate().template triangularView<Lower>().solve(m2)), l… in triangular_square()
104 VERIFY(m2.isApprox(m3 * (m1.template triangularView<UnitUpper>().solve(m2)), largerEps)); in triangular_square()
|
| D | jacobisvd.cpp | 89 SolutionType x = svd.solve(rhs); in jacobisvd_solve()
137 …mp = qr.matrixQR().topLeftCorner(rank,rank).template triangularView<Upper>().adjoint().solve(rhs2); in jacobisvd_solve()
143 SolutionType x22 = svd2.solve(rhs2); in jacobisvd_solve()
156 SolutionType x3 = svd3.solve(rhs3); in jacobisvd_solve()
258 VERIFY_RAISES_ASSERT(svd.solve(rhs)) in jacobisvd_verify_assert()
266 VERIFY_RAISES_ASSERT(svd.solve(rhs)) in jacobisvd_verify_assert()
273 VERIFY_RAISES_ASSERT(svd.solve(rhs)) in jacobisvd_verify_assert()
278 VERIFY_RAISES_ASSERT(svd.solve(rhs)) in jacobisvd_verify_assert()
302 VERIFY_IS_APPROX(m.jacobiSvd(ComputeFullU|ComputeFullV).solve(m), m); in jacobisvd_method()
|
| D | qr_colpivoting.cpp | 42 m2 = qr.solve(m3); in qr()
67 m2 = qr.solve(m3); in qr_fixedsize()
92 m2 = qr.solve(m3); in qr_invertible()
112 VERIFY_RAISES_ASSERT(qr.solve(tmp)) in qr_verify_assert()
|
| D | spqr_support.cpp | 47 x = solver.solve(b); in test_spqr_scalar()
55 refX = dA.colPivHouseholderQr().solve(b); in test_spqr_scalar()
|
| D | lu.cpp | 93 m2.block(0,0,m2.rows(),m2.cols()) = lu.solve(m3); in lu_non_invertible()
122 m2 = lu.solve(m3); in lu_invertible()
153 VERIFY_RAISES_ASSERT(lu.solve(tmp)) in lu_verify_assert()
165 VERIFY_RAISES_ASSERT(plu.solve(tmp)) in lu_verify_assert()
|
| D | qr.cpp | 49 m2 = qr.solve(m3); in qr_fixedsize()
74 m2 = qr.solve(m3); in qr_invertible()
94 VERIFY_RAISES_ASSERT(qr.solve(tmp)) in qr_verify_assert()
|
| /external/eigen/test/eigen2/ |
| D | eigen2_cholesky.cpp | 54 symm.llt().solve(vecB, &vecX); in cholesky()
73 ldlt.solve(vecB, &vecX); in cholesky()
75 ldlt.solve(matB, &matX); in cholesky()
83 chol.solve(vecB, &vecX); in cholesky()
85 chol.solve(matB, &matX); in cholesky()
|
| D | eigen2_sparse_solvers.cpp | 83 refMat2.llt().solve(b, &refX); in sparse_solvers()
127 refMat2.ldlt().solve(b, &refX); in sparse_solvers()
148 refLu.solve(b, &refX); in sparse_solvers()
161 if (slu.solve(b,&x)) { in sparse_solvers()
177 if (slu.solve(b,&x)) { in sparse_solvers()
|
| D | eigen2_lu.cpp | 69 lu.solve(m3, &m2); in lu_non_invertible()
103 lu.solve(m3, &m2); in lu_invertible()
107 VERIFY(lu.solve(m3, &m2)); in lu_invertible()
|
| /external/eigen/doc/snippets/ |
| D | Tutorial_solve_reuse_decomposition.cpp | 7 x = luOfA.solve(b);
11 x = luOfA.solve(b);
|
| /external/eigen/doc/examples/ |
| D | TutorialLinAlgComputeTwice.cpp | 17 cout << "The solution is:\n" << llt.solve(b) << endl; in main()
22 cout << "The solution is now:\n" << llt.solve(b) << endl; in main()
|
| /external/eigen/Eigen/src/Eigen2Support/ |
| D | LU.h | 52 bool solve(const MatrixBase<OtherDerived>& b, ResultType *result) const in solve() function
54 *result = static_cast<const Base*>(this)->solve(b); in solve()
61 solve(MatrixType::Identity(this->rows(), this->cols()), result); in computeInverse()
|
| D | QR.h | 30 bool solve(const MatrixBase<OtherDerived>& b, ResultType *result) const in solve() function
32 *result = static_cast<const Base*>(this)->solve(b); in solve()
|
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| D | MatrixLogarithm.h | 245 .template triangularView<Upper>().solve(TminusI); in computePade3()
261 .template triangularView<Upper>().solve(TminusI); in computePade4()
279 .template triangularView<Upper>().solve(TminusI); in computePade5()
297 .template triangularView<Upper>().solve(TminusI); in computePade6()
317 .template triangularView<Upper>().solve(TminusI); in computePade7()
337 .template triangularView<Upper>().solve(TminusI); in computePade8()
359 .template triangularView<Upper>().solve(TminusI); in computePade9()
381 .template triangularView<Upper>().solve(TminusI); in computePade10()
405 .template triangularView<Upper>().solve(TminusI); in computePade11()
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| D | IncompleteLU.h | 76 x = m_lu.template triangularView<UnitLower>().solve(b); in _solve()
77 x = m_lu.template triangularView<Upper>().solve(x); in _solve()
81 solve(const MatrixBase<Rhs>& b) const in solve() function
|
| D | DGMRES.h | 267 x = precond.solve(x);
318 tv2 = precond.solve(tv1);
322 tv2 = precond.solve(m_V.col(it)); // User's selected preconditioner
371 nrs = m_H.topLeftCorner(it,it).template triangularView<Upper>().solve(g.head(it));
378 x = x + precond.solve(tv2);
381 x = x + precond.solve(m_V.leftCols(it) * nrs);
492 MX.col(j) = precond.solve(tv1);
521 y = x + m_U.leftCols(m_r) * ( m_lambdaN * m_luT.solve(x1) - x1);
|
| /external/eigen/doc/ |
| D | A05_PortingFrom2To3.dox | 204 <tr><td>\code A.lu().solve(B,&X);\endcode</td>
205 <td>\code X = A.lu().solve(B);
206 X = A.fullPivLu().solve(B);\endcode</td>
208 <tr><td>\code A.llt().solve(B,&X);\endcode</td>
209 <td>\code X = A.llt().solve(B);
210 X = A.selfadjointView<Lower>.llt().solve(B);
211 X = A.selfadjointView<Upper>.llt().solve(B);\endcode</td>
216 <td>\code B = A.llt().solve(B);
217 B = A.selfadjointView<Lower>.llt().solve(B);
218 B = A.selfadjointView<Upper>.llt().solve(B);\endcode</td>
[all …]
|
| D | SparseLinearSystems.dox | 3 In Eigen, there are several methods available to solve linear systems when the coefficient matrix i…
62 // solve Ax = b
69 x = solver.solve(b);
74 // solve for another right hand side:
75 x1 = solver.solve(b1);
84 x = solver.compute(A).solve(b);
93 x1 = solver.solve(b1);
94 x2 = solver.solve(b2);
98 x1 = solver.solve(b1);
99 x2 = solver.solve(b2);
[all …]
|
| /external/llvm/test/Transforms/Inline/ |
| D | callgraph-update.ll | 3 declare void @solve()
12 call void @solve()
|
| /external/eigen/unsupported/test/ |
| D | svd_common.h | 97 SolutionType x = svd.solve(rhs); in svd_solve()
158 VERIFY_RAISES_ASSERT(svd.solve(rhs)) in svd_verify_assert()
165 VERIFY_RAISES_ASSERT(svd.solve(rhs)) in svd_verify_assert()
172 VERIFY_RAISES_ASSERT(svd.solve(rhs)) in svd_verify_assert()
176 VERIFY_RAISES_ASSERT(svd.solve(rhs)) in svd_verify_assert()
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| D | IterativeSolverBase.h | 167 solve(const MatrixBase<Rhs>& b) const in solve() function
181 solve(const SparseMatrixBase<Rhs>& b) const in solve() function
209 tx = derived().solve(tb); in _solve_sparse()
|