/external/eigen/Eigen/src/Core/util/ |
Constants.h | 267 * Enum for specifying whether to apply or solve on the left or right. */ 336 * solve the generalized eigenproblem \f$ Ax = \lambda B x \f$. */ 339 * solve the generalized eigenproblem \f$ ABx = \lambda x \f$. */ 342 * solve the generalized eigenproblem \f$ BAx = \lambda x \f$. */
|
/external/eigen/Eigen/src/IterativeLinearSolvers/ |
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/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() *****************************************************/
|
/external/eigen/bench/btl/actions/ |
action_lu_solve.hh | 91 // LU solve
|
/external/eigen/blas/ |
BandTriangularSolver.h | 16 * Solve Ax=b with A a band triangular matrix
|
/external/eigen/test/eigen2/ |
eigen2_svd.cpp | 50 svd.solve(b, &x);
|
/external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
qrsolv.h | 73 /* solve the triangular system for z. if the system is */
|
/external/grub/ |
TODO | 89 Nope. Improving the `find' command would solve this problem.
|
/external/qemu/distrib/sdl-1.2.15/include/ |
SDL_thread.h | 55 * To solve this, we make a little hack here.
|
/external/webrtc/src/system_wrappers/source/ |
aligned_malloc.cc | 35 // http://stackoverflow.com/questions/227897/solve-the-memory-alignment-in-c-interview-question-that-stumped-me
|
trace_impl.h | 25 // file. Increasing the buffer will not solve anything. Sooner or
|
/ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/utility/ |
base_from_member.hpp | 60 // Dietmar Kuehl from ideas by Ron Klatcho to solve the problem of a
|
/packages/apps/Camera/jni/feature_stab/db_vlvm/ |
db_rob_image_homography.h | 54 Solve for homography H such that xp~Hx
|
/packages/apps/Camera2/jni/feature_stab/db_vlvm/ |
db_rob_image_homography.h | 54 Solve for homography H such that xp~Hx
|
/packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/ |
db_rob_image_homography.h | 54 Solve for homography H such that xp~Hx
|
/prebuilts/tools/darwin-x86/sdl/include/SDL/ |
SDL_thread.h | 55 * To solve this, we make a little hack here.
|
/prebuilts/tools/linux-x86/sdl/include/SDL/ |
SDL_thread.h | 55 * To solve this, we make a little hack here.
|
/prebuilts/tools/windows/sdl/include/SDL/ |
SDL_thread.h | 55 * To solve this, we make a little hack here.
|
/external/ceres-solver/examples/ |
curve_fitting.cc | 38 using ceres::Solve; 158 Solve(options, &problem, &summary);
|
data_fitting.cc | 38 using ceres::Solve; 160 Solve(options, &problem, &summary);
|
robust_curve_fitting.cc | 120 using ceres::Solve; 158 Solve(options, &problem, &summary);
|
/external/ceres-solver/include/ceres/ |
iteration_callback.h | 135 // Number of iterations taken by the linear solver to solve for the 148 // Time (in seconds) since the user called Solve().
|
solver.h | 407 // Number of threads used by Ceres to solve the Newton 543 // linear in a_1 and a_2, i.e., Solve for the trust region step 546 // amounts to doing a single linear least squares solve. For 577 // in the early stages of the solve and then their contribution 739 // When the user calls Solve, before the actual optimization [all...] |
/external/ceres-solver/internal/ceres/ |
conjugate_gradients_solver.cc | 68 LinearSolver::Summary ConjugateGradientsSolver::Solve( 198 // solve the Newton step. This particular convergence test comes
|
/external/eigen/doc/ |
UsingIntelMKL.dox | 93 v1 = m1.lu().solve(v2); 98 v1 = m2.selfadjointView<Upper>().llt().solve(v2);
|