| /external/ceres-solver/internal/ceres/ |
| schur_jacobi_preconditioner.cc | 132 .solve(ConstVectorRef(x, block_size));
|
| implicit_schur_complement.cc | 165 .solve(Matrix::Identity(row_block_size, row_block_size));
|
| polynomial.cc | 294 return lhs.fullPivLu().solve(rhs);
|
| /external/eigen/test/eigen2/ |
| eigen2_svd.cpp | 50 svd.solve(b, &x);
|
| /external/chromium_org/third_party/mesa/src/docs/ |
| MESA_resize_buffers.spec | 43 the new window size. This extension exports a new function to solve
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| BiCGSTAB.h | 22 * \param precond A preconditioner being able to efficiently solve for an
68 y = precond.solve(p);
75 z = precond.solve(s);
108 * This class allows to solve for A.x = b sparse linear problems using a bi conjugate gradient
126 * x = solver.solve(b);
129 * // update b, and solve again
130 * x = solver.solve(b);
197 && "BiCGSTAB::solve(): invalid number of rows of the right hand side matrix b");
|
| ConjugateGradient.h | 21 * \param precond A preconditioner being able to efficiently solve for an
46 p = precond.solve(residual); //initial search direction
66 z = precond.solve(residual); // approximately solve for "A z = residual"
98 * This class allows to solve for A.x = b sparse linear problems using a conjugate gradient algorithm.
118 * x = cg.solve(b);
121 * // update b, and solve again
122 * x = cg.solve(b);
193 && "ConjugateGradient::solve(): invalid number of rows of the right hand side matrix b");
|
| IncompleteLUT.h | 113 x = m_lu.template triangularView<UnitLower>().solve(x);
114 x = m_lu.template triangularView<Upper>().solve(x);
119 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::IncompleteLUT
123 && "IncompleteLUT::solve(): invalid number of rows of the right hand side matrix b");
|
| /external/eigen/test/ |
| product_trsolve.cpp | 17 (XB) = (TRI).solve(XB); \
26 (XB).transpose() = (TRI).transpose().template solve<OnTheRight>(XB.transpose()); \
|
| /external/mesa3d/docs/ |
| MESA_resize_buffers.spec | 43 the new window size. This extension exports a new function to solve
|
| /external/eigen/bench/spbench/ |
| spbenchsolver.h | 145 x = solver.solve(b);
229 cout<< "SOLVE TIME : " << stat[solver_id].solve_time<< " \n";
248 ostringstream compute,solve,total,error; local
259 solve << markup << stat[i].solve_time;
268 solve << " <TD> -" ;
280 + "<TR><TH>Solve Time " + solve.str() + "\n"
483 * and solve the associated linear system.
484 * The results of each solve are printed in the standard output
|
| /external/eigen/Eigen/src/Cholesky/ |
| LDLT.h | 161 * This function also supports in-place solves using the syntax <tt>x = decompositionObject.solve(x)</tt> .
176 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::LDLT
180 && "LDLT::solve(): invalid number of rows of the right hand side matrix b");
186 bool solve(const MatrixBase<OtherDerived>& b, ResultType *result) const function in class:Eigen::LDLT
188 *result = this->solve(b);
519 /** \internal use x = ldlt_object.solve(x);
521 * This is the \em in-place version of solve().
530 * \sa LDLT::solve(), MatrixBase::ldlt()
540 bAndX = this->solve(bAndX);
|
| LLT.h | 32 * While the Cholesky decomposition is particularly useful to solve selfadjoint problems like D^*D x = b,
122 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::LLT
126 && "LLT::solve(): invalid number of rows of the right hand side matrix b");
132 bool solve(const MatrixBase<OtherDerived>& b, ResultType *result) const function in class:Eigen::LLT
134 *result = this->solve(b);
433 /** \internal use x = llt_object.solve(x);
435 * This is the \em in-place version of solve().
444 * \sa LLT::solve(), MatrixBase::llt()
|
| /external/eigen/Eigen/src/SparseCore/ |
| SparseTriangularView.h | 54 solve(const MatrixBase<OtherDerived>& other) const;
|
| /external/eigen/bench/btl/libs/ublas/ |
| ublas_interface.hh | 136 X = solve(L, B, ublas::lower_tag ());
|
| /external/eigen/unsupported/Eigen/src/Splines/ |
| SplineFitting.h | 144 ControlPointVectorType ctrls = qr.solve(MatrixType(pts.transpose())).transpose();
|
| /external/eigen/bench/btl/libs/eigen3/ |
| eigen3_interface.hh | 194 X = L.template triangularView<Lower>().solve(B);
198 X = L.template triangularView<Upper>().solve(B);
|
| /external/eigen/unsupported/Eigen/src/Skyline/ |
| SkylineInplaceLU.h | 99 bool solve(const MatrixBase<BDerived> &b, MatrixBase<XDerived>* x,
307 bool SkylineInplaceLU<MatrixType>::solve(const MatrixBase<BDerived> &b, MatrixBase<XDerived>* x, const int transposed) const { function in class:Eigen::SkylineInplaceLU
|
| /external/eigen/Eigen/src/PaStiXSupport/ |
| PaStiXSupport.h | 18 * This class is used to solve the linear systems A.X = B via the PaStix library.
149 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::PastixBase
153 && "PastixBase::solve(): invalid number of rows of the right hand side matrix b");
176 tmp.leftCols(actualCols) = derived().solve(tmp.leftCols(actualCols));
192 * The statistics related to the different phases of factorization and solve are saved here as well
210 * The statistics related to the different phases of factorization and solve are saved here as well
250 solve(const SparseMatrixBase<Rhs>& b) const function in class:Eigen::PastixBase
254 && "PastixBase::solve(): invalid number of rows of the right hand side matrix b");
406 /* Solve the system */
436 * This class is used to solve the linear systems A.X = B with a supernodal LU
[all...] |
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixSquareRoot.h | 179 sqrtT.template block<1,2>(i,j).transpose() = A.fullPivLu().solve(rhs.transpose());
193 sqrtT.template block<2,1>(i,j) = A.fullPivLu().solve(rhs);
243 result = coeffMatrix.fullPivLu().solve(rhs);
|
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| HybridNonLinearSolver.h | 78 HybridNonLinearSolverSpace::Status solve(FVectorType &x);
138 return solve(x);
342 HybridNonLinearSolver<FunctorType,Scalar>::solve(FVectorType &x) function in class:Eigen::HybridNonLinearSolver
|
| /external/eigen/Eigen/src/CholmodSupport/ |
| CholmodSupport.h | 218 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::CholmodBase
222 && "CholmodDecomposition::solve(): invalid number of rows of the right hand side matrix b");
232 solve(const SparseMatrixBase<Rhs>& b) const function in class:Eigen::CholmodBase
236 && "CholmodDecomposition::solve(): invalid number of rows of the right hand side matrix b");
341 * This class allows to solve for A.X = B sparse linear problems via a simplicial LL^T Cholesky factorization
388 * This class allows to solve for A.X = B sparse linear problems via a simplicial LDL^T Cholesky factorization
433 * This class allows to solve for A.X = B sparse linear problems via a supernodal LL^T Cholesky factorization
478 * This class allows to solve for A.X = B sparse linear problems via a LL^T or LDL^T Cholesky factorization
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_generators.py | 1116 def solve(self): member in class:Queens
1141 # solve() will set up succs[i] to be a list of square #i's
1303 def solve(self): member in class:Knights
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_generators.py | 1116 def solve(self): member in class:Queens
1141 # solve() will set up succs[i] to be a list of square #i's
1303 def solve(self): member in class:Knights
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/platform/animation/ |
| TimingFunction.h | 146 return m_bezier->solve(fraction, accuracy);
|
