| /packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/ |
| db_image_homography.cpp | 90 /*Solve for the nullvector*/
104 /*Solve for the nullvector*/
122 /*Solve for focal length using the equation
|
| db_rob_image_homography.h | 54 Solve for homography H such that xp~Hx
|
| /external/ceres-solver/internal/ceres/ |
| block_jacobi_preconditioner.h | 50 // Before each use of the preconditioner in a solve with conjugate gradients,
|
| conjugate_gradients_solver.h | 61 virtual Summary Solve(LinearOperator* A,
|
| coordinate_descent_minimizer.h | 67 void Solve(Program* program,
|
| cxsparse.cc | 62 // Solve using Cholesky factorization
|
| dense_normal_cholesky_solver.cc | 77 lhs.selfadjointView<Eigen::Upper>().ldlt().solve(rhs);
|
| dense_normal_cholesky_solver.h | 31 // Solve dense rectangular systems Ax = b by forming the normal
|
| dense_qr_solver.h | 31 // Solve dense rectangular systems Ax = b using the QR factorization.
|
| /external/clang/test/CodeGenCXX/ |
| constructors.cpp | 59 reference. That's a solvable problem, but let's not solve it right
|
| /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/webkit/PerformanceTests/SunSpider/hosted/ |
| sunspider.html | 48 the kinds of actual problems developers solve with JavaScript today,
|
| /external/webkit/Source/WebCore/platform/graphics/ |
| UnitBezier.h | 108 double solve(double x, double epsilon) function in struct:WebCore::UnitBezier
|
| /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
|
| /packages/apps/Camera/jni/feature_stab/db_vlvm/ |
| db_rob_image_homography.h | 54 Solve for homography H such that xp~Hx
|
| /packages/apps/Gallery2/jni_mosaic/feature_stab/db_vlvm/ |
| db_rob_image_homography.h | 54 Solve for homography H such that xp~Hx
|
