| /external/eigen/Eigen/src/Eigen2Support/ |
| TriangularSolver.h | 30 return m_matrix.template triangularView<Added>().solve(other.derived());
|
| /external/eigen/doc/special_examples/ |
| Tutorial_sparse_example.cpp | 25 Eigen::VectorXd x = chol.solve(b); // use the factorization to solve for the given right hand side
|
| /external/eigen/unsupported/test/ |
| mpreal_support.cpp | 39 X = S.selfadjointView<Lower>().llt().solve(B);
43 X = A.lu().solve(B);
|
| /external/eigen/test/ |
| triangular.cpp | 73 VERIFY(v2.isApprox(m3.adjoint() * (m1.adjoint().template triangularView<Lower>().solve(v2)), largerEps));
75 VERIFY(v2.isApprox(m3.transpose() * (m1.transpose().template triangularView<Upper>().solve(v2)), largerEps));
77 VERIFY(v2.isApprox(m3 * (m1.template triangularView<Upper>().solve(v2)), largerEps));
79 VERIFY(v2.isApprox(m3.conjugate() * (m1.conjugate().template triangularView<Lower>().solve(v2)), largerEps));
83 VERIFY(m2.isApprox(m3.adjoint() * (m1.adjoint().template triangularView<Lower>().solve(m2)), largerEps));
85 VERIFY(m2.isApprox(m3.transpose() * (m1.transpose().template triangularView<Upper>().solve(m2)), largerEps));
87 VERIFY(m2.isApprox(m3 * (m1.template triangularView<Upper>().solve(m2)), largerEps));
89 VERIFY(m2.isApprox(m3.conjugate() * (m1.conjugate().template triangularView<Lower>().solve(m2)), largerEps));
102 // check solve with unit diagonal
104 VERIFY(m2.isApprox(m3 * (m1.template triangularView<UnitUpper>().solve(m2)), largerEps))
[all...] |
| lu.cpp | 94 m2.block(0,0,m2.rows(),m2.cols()) = lu.solve(m3);
124 m2 = lu.solve(m3);
157 VERIFY_RAISES_ASSERT(lu.solve(tmp))
169 VERIFY_RAISES_ASSERT(plu.solve(tmp))
|
| qr_colpivoting.cpp | 44 m2 = qr.solve(m3);
69 m2 = qr.solve(m3);
92 m2 = qr.solve(m3);
112 VERIFY_RAISES_ASSERT(qr.solve(tmp))
|
| jacobisvd.cpp | 87 SolutionType x = svd.solve(rhs);
159 VERIFY_RAISES_ASSERT(svd.solve(rhs))
167 VERIFY_RAISES_ASSERT(svd.solve(rhs))
174 VERIFY_RAISES_ASSERT(svd.solve(rhs))
179 VERIFY_RAISES_ASSERT(svd.solve(rhs))
203 VERIFY_IS_APPROX(m.jacobiSvd(ComputeFullU|ComputeFullV).solve(m), m);
|
| dontalign.cpp | 34 VERIFY_IS_APPROX(v, square * square.colPivHouseholderQr().solve(v));
|
| qr.cpp | 50 m2 = qr.solve(m3);
73 m2 = qr.solve(m3);
93 VERIFY_RAISES_ASSERT(qr.solve(tmp))
|
| qr_fullpivoting.cpp | 48 m2 = qr.solve(m3);
75 m2 = qr.solve(m3);
95 VERIFY_RAISES_ASSERT(qr.solve(tmp))
|
| sparse_solver.h | 19 DenseRhs refX = dA.lu().solve(db);
31 x = solver.solve(b);
51 x = solver.solve(b);
66 x.block(0,0,x.rows(),x.cols()) = solver.solve(b.block(0,0,b.rows(),b.cols()));
88 x = solver.solve(b);
|
| /external/eigen/test/eigen2/ |
| eigen2_sparse_solvers.cpp | 83 refMat2.llt().solve(b, &refX);
127 refMat2.ldlt().solve(b, &refX);
148 refLu.solve(b, &refX);
153 // // SparseLU<SparseMatrix<Scalar> > (m2).solve(b,&x);
161 if (slu.solve(b,&x)) {
173 // check solve
177 if (slu.solve(b,&x)) {
179 VERIFY(refX.isApprox(x,test_precision<Scalar>()) && "LU: umfpack"); // FIXME solve is not very stable for complex
|
| eigen2_lu.cpp | 69 lu.solve(m3, &m2);
71 /* solve now always returns true
73 VERIFY(!lu.solve(m3, &m2));
103 lu.solve(m3, &m2);
107 VERIFY(lu.solve(m3, &m2));
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| IterativeSolverBase.h | 148 /** \returns the number of iterations performed during the last solve */
155 /** \returns the tolerance error reached during the last solve */
167 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::IterativeSolverBase
171 && "IterativeSolverBase::solve(): invalid number of rows of the right hand side matrix b");
181 solve(const SparseMatrixBase<Rhs>& b) const function in class:Eigen::IterativeSolverBase
185 && "IterativeSolverBase::solve(): invalid number of rows of the right hand side matrix b");
209 tx = derived().solve(tb);
|
| BasicPreconditioners.h | 18 * This class allows to approximately solve for A.x = b problems assuming A is a diagonal matrix.
90 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::DiagonalPreconditioner
94 && "DiagonalPreconditioner::solve(): invalid number of rows of the right hand side matrix b");
144 inline const Rhs& solve(const Rhs& b) const { return b; } function in class:Eigen::IdentityPreconditioner
|
| /external/eigen/bench/ |
| sparse_lu.cpp | 62 ok = lu.solve(b,&x);
65 std::cout << " solve:\t" << timer.value() << endl;
67 std::cout << " solve:\t" << " FAILED" << endl;
107 lu.solve(b,&x);
109 std::cout << " solve:\t" << timer.value() << endl;
|
| /external/chromium_org/third_party/WebKit/Source/platform/animation/ |
| UnitBezier.h | 110 double solve(double x, double epsilon) function in struct:WebCore::UnitBezier
|
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixLogarithm.h | 254 .template triangularView<Upper>().solve(TminusI);
270 .template triangularView<Upper>().solve(TminusI);
288 .template triangularView<Upper>().solve(TminusI);
306 .template triangularView<Upper>().solve(TminusI);
326 .template triangularView<Upper>().solve(TminusI);
346 .template triangularView<Upper>().solve(TminusI);
368 .template triangularView<Upper>().solve(TminusI);
390 .template triangularView<Upper>().solve(TminusI);
414 .template triangularView<Upper>().solve(TminusI);
|
| /external/ceres-solver/internal/ceres/ |
| implicit_schur_complement_test.cc | 112 schur_solution = lhs->selfadjointView<Eigen::Upper>().llt().solve(*rhs);
159 lhs.selfadjointView<Eigen::Upper>().llt().solve(rhs);
|
| schur_eliminator_test.cc | 116 .solve(Matrix::Identity(block_size, block_size));
124 sol_expected = H.llt().solve(g);
164 .solve(rhs);
|
| block_jacobi_preconditioner.cc | 115 .solve(Matrix::Identity(size, size));
|
| dense_normal_cholesky_solver.cc | 69 EventLogger event_logger("DenseNormalCholeskySolver::Solve");
100 lhs.selfadjointView<Eigen::Upper>().llt().solve(rhs);
101 event_logger.AddEvent("Solve");
110 EventLogger event_logger("DenseNormalCholeskySolver::Solve");
146 event_logger.AddEvent("Solve");
|
| dense_qr_solver.cc | 68 EventLogger event_logger("DenseQRSolver::Solve");
109 event_logger.AddEvent("Solve");
129 EventLogger event_logger("DenseQRSolver::Solve");
150 // Solve the system.
151 VectorRef(x, num_cols) = A->matrix().householderQr().solve(rhs_);
152 event_logger.AddEvent("Solve");
|
| /external/eigen/Eigen/src/PardisoSupport/ |
| PardisoSupport.h | 174 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::PardisoImpl
178 && "PardisoImpl::solve(): invalid number of rows of the right hand side matrix b");
188 solve(const SparseMatrixBase<Rhs>& b) const function in class:Eigen::PardisoImpl
192 && "PardisoImpl::solve(): invalid number of rows of the right hand side matrix b");
218 // Pardiso cannot solve in-place,
226 tmp_res.leftCols(actualCols) = derived().solve(tmp_rhs.leftCols(actualCols));
397 // Pardiso cannot solve in-place
418 * This class allows to solve for A.X = B sparse linear problems via a direct LU factorization
440 using Base::solve;
468 * This class allows to solve for A.X = B sparse linear problems via a LL^T Cholesky factorizatio
[all...] |
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| GMRES.h | 75 VectorType r0 = precond.solve(p0);
104 v=precond.solve(t);
151 // solve upper triangular system
176 VectorType p1=precond.solve(p0);
221 * This class allows to solve for A.x = b sparse linear problems using a generalized minimal
238 * x = solver.solve(b);
241 * // update b, and solve again
242 * x = solver.solve(b);
322 && "GMRES::solve(): invalid number of rows of the right hand side matrix b");
|
