Searched defs:solve (Results 1 - 25 of 36) sorted by relevance

12

/external/eigen/Eigen/src/Eigen2Support/
H A DQR.h30 bool solve(const MatrixBase<OtherDerived>& b, ResultType *result) const function in class:Eigen::QR
32 *result = static_cast<const Base*>(this)->solve(b);
H A DLU.h52 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/Eigen/src/IterativeLinearSolvers/
H A DBasicPreconditioners.h18 * 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
H A DIterativeSolverBase.h148 /** \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);
H A DIncompleteLUT.h164 x = m_lu.template triangularView<UnitLower>().solve(x);
165 x = m_lu.template triangularView<Upper>().solve(x);
170 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::IncompleteLUT
174 && "IncompleteLUT::solve(): invalid number of rows of the right hand side matrix b");
/external/eigen/Eigen/src/SparseCore/
H A DTriangularSolver.h186 SparseTriangularView<ExpressionType,Mode>::solve(const MatrixBase<OtherDerived>& other) const function in class:Eigen::SparseTriangularView
/external/eigen/unsupported/Eigen/src/IterativeSolvers/
H A DIncompleteLU.h76 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");
H A DIncompleteCholesky.h100 x = m_L.template triangularView<UnitLower>().solve(x);
101 x = m_L.adjoint().template triangularView<Upper>().solve(x);
107 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::IncompleteCholesky
112 && "IncompleteLLT::solve(): invalid number of rows of the right hand side matrix b");
/external/chromium_org/third_party/WebKit/Source/platform/animation/
H A DUnitBezier.h140 double solve(double x, double epsilon) function in struct:blink::UnitBezier
/external/eigen/Eigen/src/Core/
H A DSolveTriangular.h165 /** "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
H A DTriangularMatrix.h330 solve(const MatrixBase<Other>& other) const;
337 solve(const MatrixBase<Other>& other) const function in class:Eigen::TriangularView
338 { return solve<OnTheLeft>(other); }
/external/eigen/Eigen/src/LU/
H A DPartialPivLU.h117 * \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
433 /***** Implementation of solve() *****************************************************/
H A DFullPivLU.h197 * \param b the right-hand-side of the equation to solve. Can be a vector or a matrix,
211 * \sa TriangularView::solve(), kernel(), inverse()
215 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::FullPivLU
664 /***** Implementation of solve() *****************************************************/
/external/eigen/Eigen/src/PardisoSupport/
H A DPardisoSupport.h175 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::PardisoImpl
179 && "PardisoImpl::solve(): invalid number of rows of the right hand side matrix b");
189 solve(const SparseMatrixBase<Rhs>& b) const function in class:Eigen::PardisoImpl
193 && "PardisoImpl::solve(): invalid number of rows of the right hand side matrix b");
375 // Pardiso cannot solve in-place
396 * This class allows to solve for A.X = B sparse linear problems via a direct LU factorization
418 using Base::solve;
446 * This class allows to solve for A.X = B sparse linear problems via a LL^T Cholesky factorization
472 using Base::solve;
505 * This class allows to solve fo
[all...]
/external/eigen/Eigen/src/QR/
H A DHouseholderQR.h106 * \param b the right-hand-side of the equation to solve.
122 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::HouseholderQR
H A DColPivHouseholderQR.h126 * \param b the right-hand-side of the equation to solve.
142 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::ColPivHouseholderQR
459 // Note that not doing so does result in solve() sometimes returning inf/nan values
469 // repetitions of the unit test, with the result of solve() filled with large values of the order
H A DFullPivHouseholderQR.h132 * \param b the right-hand-side of the equation to solve.
149 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::FullPivHouseholderQR
/external/eigen/unsupported/Eigen/src/Skyline/
H A DSkylineInplaceLU.h99 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/
H A DLDLT.h171 * This function also supports in-place solves using the syntax <tt>x = decompositionObject.solve(x)</tt> .
186 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::LDLT
190 && "LDLT::solve(): invalid number of rows of the right hand side matrix b");
196 bool solve(const MatrixBase<OtherDerived>& b, ResultType *result) const function in class:Eigen::LDLT
198 *result = this->solve(b);
532 /** \internal use x = ldlt_object.solve(x);
534 * This is the \em in-place version of solve().
543 * \sa LDLT::solve(), MatrixBase::ldlt()
552 bAndX = this->solve(bAndX);
H A DLLT.h32 * 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);
435 /** \internal use x = llt_object.solve(x);
437 * This is the \em in-place version of solve().
446 * \sa LLT::solve(), MatrixBase::llt()
/external/eigen/Eigen/src/CholmodSupport/
H A DCholmodSupport.h225 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::CholmodBase
229 && "CholmodDecomposition::solve(): invalid number of rows of the right hand side matrix b");
239 solve(const SparseMatrixBase<Rhs>& b) const function in class:Eigen::CholmodBase
243 && "CholmodDecomposition::solve(): invalid number of rows of the right hand side matrix b");
369 * This class allows to solve for A.X = B sparse linear problems via a simplicial LL^T Cholesky factorization
416 * This class allows to solve for A.X = B sparse linear problems via a simplicial LDL^T Cholesky factorization
461 * This class allows to solve for A.X = B sparse linear problems via a supernodal LL^T Cholesky factorization
506 * 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/PaStiXSupport/
H A DPaStiXSupport.h18 * 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");
171 * The statistics related to the different phases of factorization and solve are saved here as well
189 * The statistics related to the different phases of factorization and solve are saved here as well
229 solve(const SparseMatrixBase<Rhs>& b) const function in class:Eigen::PastixBase
233 && "PastixBase::solve(): invalid number of rows of the right hand side matrix b");
415 * This class is used to solve the linear systems A.X = B with a supernodal LU
530 * This class is used to solve the linear systems A.X = B via a LL^T supernodal Cholesky factorization
611 * This class is used to solve th
[all...]
/external/eigen/Eigen/src/SPQRSupport/
H A DSuiteSparseQRSupport.h40 * of sparse matrices. The result is then used to solve linear leasts_square systems.
135 inline const internal::solve_retval<SPQR, Rhs> solve(const MatrixBase<Rhs>& B) const function in class:Eigen::SPQR
139 && "SPQR::solve(): invalid number of rows of the right hand side matrix B");
154 y.topRows(rk) = this->matrixR().topLeftCorner(rk, rk).template triangularView<Upper>().solve(y.topRows(rk));
/external/eigen/unsupported/Eigen/src/NonLinearOptimization/
H A DHybridNonLinearSolver.h78 HybridNonLinearSolverSpace::Status solve(FVectorType &x);
138 return solve(x);
344 HybridNonLinearSolver<FunctorType,Scalar>::solve(FVectorType &x) function in class:Eigen::HybridNonLinearSolver
/external/eigen/unsupported/Eigen/src/SVD/
H A DJacobiSVD.h587 * \param b the right-hand-side of the equation to solve.
596 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::JacobiSVD
599 eigen_assert(SVDBase<MatrixType>::computeU() && SVDBase<MatrixType>::computeV() && "JacobiSVD::solve() requires both unitaries U and V to be computed (thin unitaries suffice).");

Completed in 292 milliseconds

12