| /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/ceres-solver/examples/ |
| quadratic.cc | 43 using ceres::Solve;
86 Solve(options, &problem, &summary);
|
| circle_fit.cc | 65 using ceres::Solve;
149 // Build and solve the problem.
154 Solve(options, &problem, &summary);
|
| /external/ceres-solver/internal/ceres/ |
| iterative_schur_complement_solver_test.cc | 90 qr->Solve(&dense_A, b_.get(), per_solve_options, reference_solution.data());
100 isc.Solve(A_.get(), b_.get(), per_solve_options, isc_sol.data());
|
| lapack.cc | 34 // C interface to the LAPACK Cholesky factorization and triangular solve.
87 LOG(INFO) << "Triangular solve (dpotrs) failed: " << info;
|
| compressed_col_sparse_matrix_utils.h | 64 // Solve the linear system
85 // Solve the linear system
106 // Given a upper triangular matrix R in compressed column form, solve
|
| iterative_schur_complement_solver.cc | 69 EventLogger event_logger("IterativeSchurComplementSolver::Solve");
160 cg_summary = cg_solver.Solve(schur_complement_.get(),
172 event_logger.AddEvent("Solve");
|
| schur_complement_solver_test.cc | 78 qr->Solve(&dense_A, b.get(), LinearSolver::PerSolveOptions(), sol.get());
83 qr->Solve(&dense_A, b.get(), per_solve_options, sol_d.get());
113 summary = solver->Solve(A.get(), b.get(), per_solve_options, x.get());
|
| symmetric_linear_solver_test.cc | 31 // Tests for linear solvers that solve symmetric linear systems. Some
72 solver.Solve(A.get(), b.data(), per_solve_options, x.data());
129 solver.Solve(A.get(), b.data(), per_solve_options, x.data());
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkQuadClipper.cpp | 38 /* Solve F(t) = y where F(t) := [0](1-t)^2 + 2[1]t(1-t) + [2]t^2
39 * We solve for t, using quadratic equation, hence we have to rearrange
|
| /external/eigen/Eigen/src/Cholesky/ |
| 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/test/ |
| product_trsolve.cpp | 17 (XB) = (TRI).solve(XB); \
26 (XB).transpose() = (TRI).transpose().template solve<OnTheRight>(XB.transpose()); \
|
| dontalign.cpp | 34 VERIFY_IS_APPROX(v, square * square.colPivHouseholderQr().solve(v));
|
| /external/skia/src/core/ |
| SkQuadClipper.cpp | 38 /* Solve F(t) = y where F(t) := [0](1-t)^2 + 2[1]t(1-t) + [2]t^2
39 * We solve for t, using quadratic equation, hence we have to rearrange
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.tests/src/com/android/ide/eclipse/tests/ |
| EclipseTestCollector.java | 62 // which is enough to create an error. To solve it, we cast into the
95 // which is enough to create an error. To solve it, we cast into the
|
| /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/chromium_org/third_party/opus/src/silk/fixed/ |
| solve_LS_FIX.c | 52 /* Solve Lx = b, when L is lower triangular and has ones on the diagonal */
60 /* Solve L^t*x = b, where L is lower triangular with ones on the diagonal */
203 /* Solve Lx = b, when L is lower triangular and has ones on the diagonal */
225 /* Solve L^t*x = b, where L is lower triangular with ones on the diagonal */
|
| /external/eigen/Eigen/ |
| SuperLUSupport | 51 #include "src/misc/Solve.h"
|
| /external/mesa3d/docs/ |
| MESA_resize_buffers.spec | 43 the new window size. This extension exports a new function to solve
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| RecursiveTask.java | 34 * sequentially solve rather than subdividing.
|
| /packages/apps/Camera/jni/feature_stab/db_vlvm/ |
| db_image_homography.h | 34 Solve for projective H such that xp~Hx. Prior normalization is not necessary,
51 Solve for affine H such that xp~Hx. Prior normalization is not necessary,
66 Solve for rotation R such that xp~Rx.
92 Solve for a homography H generated by a rotation R with a common unknown focal length f, i.e.
|
| /packages/apps/Camera2/jni/feature_stab/db_vlvm/ |
| db_image_homography.h | 34 Solve for projective H such that xp~Hx. Prior normalization is not necessary,
51 Solve for affine H such that xp~Hx. Prior normalization is not necessary,
66 Solve for rotation R such that xp~Rx.
92 Solve for a homography H generated by a rotation R with a common unknown focal length f, i.e.
|
| /packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/ |
| db_image_homography.h | 34 Solve for projective H such that xp~Hx. Prior normalization is not necessary,
51 Solve for affine H such that xp~Hx. Prior normalization is not necessary,
66 Solve for rotation R such that xp~Rx.
92 Solve for a homography H generated by a rotation R with a common unknown focal length f, i.e.
|
| /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...] |
