| /external/eigen/Eigen/src/SVD/ |
| H A D | JacobiSVD.h | 654 * \param b the right-hand-side of the equation to solve.
663 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::JacobiSVD
666 eigen_assert(computeU() && computeV() && "JacobiSVD::solve() requires both unitaries U and V to be computed (thin unitaries suffice).");
694 /** Allows to prescribe a threshold to be used by certain methods, such as rank() and solve(),
|
| /external/eigen/Eigen/src/SparseCholesky/ |
| H A D | SimplicialCholesky.h | 88 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::SimplicialCholeskyBase
92 && "SimplicialCholeskyBase::solve(): invalid number of rows of the right hand side matrix b");
102 solve(const SparseMatrixBase<Rhs>& b) const function in class:Eigen::SimplicialCholeskyBase
106 && "SimplicialCholesky::solve(): invalid number of rows of the right hand side matrix b");
|
| /external/eigen/Eigen/src/SparseLU/ |
| H A D | SparseLU.h | 53 * //Use the factors to solve the linear system
54 * x = solver.solve(b);
129 * The only operation available with this expression is the triangular solve
139 * The only operation available with this expression is the triangular solve
173 * \warning the destination matrix X in X = this->solve(B) must be colmun-major.
178 inline const internal::solve_retval<SparseLU, Rhs> solve(const MatrixBase<Rhs>& B) const function in class:Eigen::SparseLU
182 && "SparseLU::solve(): invalid number of rows of the right hand side matrix B");
191 inline const internal::sparse_solve_retval<SparseLU, Rhs> solve(const SparseMatrixBase<Rhs>& B) const function in class:Eigen::SparseLU
195 && "SparseLU::solve(): invalid number of rows of the right hand side matrix B");
446 * and division by zero will occur if it is used to solve
[all...] |
| /external/eigen/Eigen/src/SparseQR/ |
| H A D | SparseQR.h | 168 eigen_assert(this->rows() == B.rows() && "SparseQR::solve() : invalid number of rows in the right hand side matrix");
179 y.topRows(rank) = this->matrixR().topLeftCorner(rank, rank).template triangularView<Upper>().solve(b.topRows(rank));
207 inline const internal::solve_retval<SparseQR, Rhs> solve(const MatrixBase<Rhs>& B) const function in class:Eigen::SparseQR
210 eigen_assert(this->rows() == B.rows() && "SparseQR::solve() : invalid number of rows in the right hand side matrix");
214 inline const internal::sparse_solve_retval<SparseQR, Rhs> solve(const SparseMatrixBase<Rhs>& B) const function in class:Eigen::SparseQR
217 eigen_assert(this->rows() == B.rows() && "SparseQR::solve() : invalid number of rows in the right hand side matrix");
|
| /external/eigen/Eigen/src/UmfPackSupport/ |
| H A D | 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 function in class:Eigen::UmfPackLU
223 && "UmfPackLU::solve(): invalid number of rows of the right hand side matrix b");
384 eigen_assert(b.derived().data() != x.derived().data() && " Umfpack does not support inplace solve");
|
| /external/eigen/unsupported/Eigen/src/SVD/ |
| H A D | BDCSVD.h | 149 * \param b the right - hand - side of the equation to solve.
158 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::BDCSVD
162 "BDCSVD::solve() requires both unitaries U and V to be computed (thin unitaries suffice).");
|
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| H A D | RegAllocSolver.h | 152 Solution solve() { function in class:PBQP::RegAlloc::RegAllocSolverImpl
349 inline Solution solve(Graph& G) { function in namespace:PBQP::RegAlloc
353 return RegAllocSolver.solve();
|
| /external/eigen/Eigen/src/SuperLUSupport/ |
| H A D | SuperLUSupport.h | 344 inline const internal::solve_retval<SuperLUBase, Rhs> solve(const MatrixBase<Rhs>& b) const function in class:Eigen::SuperLUBase
348 && "SuperLU::solve(): invalid number of rows of the right hand side matrix b");
357 inline const internal::sparse_solve_retval<SuperLUBase, Rhs> solve(const SparseMatrixBase<Rhs>& b) const function in class:Eigen::SuperLUBase
361 && "SuperLU::solve(): invalid number of rows of the right hand side matrix b");
470 * This class allows to solve for A.X = B sparse linear problems via a direct LU factorization
810 * This class allows to solve for an approximate solution of A.X = B sparse linear problems via an incomplete LU factorization
|
| /external/llvm/lib/Analysis/ |
| H A D | LazyValueInfo.cpp | 381 void solve();
458 void LazyValueInfoCache::solve() { function in class:LazyValueInfoCache
500 // cache needs updating, i.e. if we have solve a new value or not.
918 solve();
932 solve();
946 // to solve now. We do NOT try to proactively update these values. Instead,
|
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| H A D | org.sat4j.core_2.2.0.v20100429.jar | ... public void log (java.lang.String) protected void solve (org.sat4j.specs.IProblem) throws org. ... |
| /external/chromium_org/third_party/android_platform/webview/ |
| H A D | frameworks.jar | META-INF/ META-INF/MANIFEST.MF android/ android/location/ android/location/Address$1.class ... |