| /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/chromium_org/third_party/WebKit/Source/core/platform/graphics/ |
| UnitBezier.h | 109 double solve(double x, double epsilon) function in struct:WebCore::UnitBezier
|
| /external/eigen/Eigen/src/SparseCore/ |
| TriangularSolver.h | 186 SparseTriangularView<ExpressionType,Mode>::solve(const MatrixBase<OtherDerived>& other) const function in class:Eigen::SparseTriangularView
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| 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
|
| 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");
|
| 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);
|
| /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");
|
| /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/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/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/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/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
|
| /external/eigen/Eigen/src/Core/ |
| SolveTriangular.h | 165 /** "in-place" version of TriangularView::solve() where the result is written in \a other
170 * See TriangularView:solve() for the details.
216 TriangularView<Derived,Mode>::solve(const MatrixBase<Other>& other) const function in class:Eigen::TriangularView
|
| /external/eigen/Eigen/src/LU/ |
| PartialPivLU.h | 117 * \param b the right-hand-side of the equation to solve. Can be a vector or a matrix,
129 * \sa TriangularView::solve(), inverse(), computeInverse()
133 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::PartialPivLU
430 /***** Implementation of solve() *****************************************************/
|
| FullPivLU.h | 196 * \param b the right-hand-side of the equation to solve. Can be a vector or a matrix,
210 * \sa TriangularView::solve(), kernel(), inverse()
214 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::FullPivLU
657 /***** Implementation of solve() *****************************************************/
|
| /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/Eigen/src/QR/ |
| ColPivHouseholderQR.h | 107 * \param b the right-hand-side of the equation to solve.
123 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::ColPivHouseholderQR
391 // Note that not doing so does result in solve() sometimes returning inf/nan values
401 // repetitions of the unit test, with the result of solve() filled with large values of the order
|
| HouseholderQR.h | 94 * \param b the right-hand-side of the equation to solve.
110 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::HouseholderQR
|
| FullPivHouseholderQR.h | 119 * \param b the right-hand-side of the equation to solve.
135 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::FullPivHouseholderQR
|
| /external/eigen/Eigen/src/UmfPackSupport/ |
| UmfPackSupport.h | 113 * This class allows to solve for A.X = B sparse linear problems via a LU factorization
206 inline const internal::solve_retval<UmfPackLU, Rhs> solve(const MatrixBase<Rhs>& b) const function in class:Eigen::UmfPackLU
210 && "UmfPackLU::solve(): invalid number of rows of the right hand side matrix b");
219 // inline const internal::sparse_solve_retval<UmfPAckLU, Rhs> solve(const SparseMatrixBase<Rhs>& b) const
223 // && "UmfPAckLU::solve(): invalid number of rows of the right hand side matrix b");
|
| /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/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
|
