/external/ceres-solver/internal/ceres/ |
gradient_checking_cost_function_test.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer 3 // http://code.google.com/p/ceres-solver/
|
mutex.h | 1 // Ceres Solver - A fast non-linear least squares minimizer 3 // http://code.google.com/p/ceres-solver/
|
partitioned_matrix_view.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer 3 // http://code.google.com/p/ceres-solver/
|
linear_least_squares_problems.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer 3 // http://code.google.com/p/ceres-solver/
|
visibility_based_preconditioner.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer 3 // http://code.google.com/p/ceres-solver/
|
/external/ceres-solver/internal/ceres/miniglog/glog/ |
logging.h | 1 // Ceres Solver - A fast non-linear least squares minimizer 3 // http://code.google.com/p/ceres-solver/
|
/external/llvm/include/llvm/CodeGen/PBQP/ |
Graph.h | 213 /// Typically used by a PBQP solver to attach data to aid in solution. 237 /// Typically used by a PBQP solver to attach data to aid in solution.
|
/libcore/luni/src/main/java/java/util/concurrent/ |
CyclicBarrier.java | 28 * class Solver { 51 * public Solver(float[][] matrix) {
|
/external/clang/test/Analysis/ |
CFContainers.mm | 147 // TODO: The solver is probably not strong enough here.
|
/external/eigen/doc/ |
QuickReference.dox | 28 <tr><td>\link LU_Module LU \endlink</td><td>\code#include <Eigen/LU>\endcode</td><td>Inverse, determinant, LU decompositions with solver (FullPivLU, PartialPivLU)</td></tr> 29 <tr><td>\link Cholesky_Module Cholesky \endlink</td><td>\code#include <Eigen/Cholesky>\endcode</td><td>LLT and LDLT Cholesky factorization with solver</td></tr> 31 <tr><td>\link SVD_Module SVD \endlink</td><td>\code#include <Eigen/SVD>\endcode</td><td>SVD decomposition with least-squares solver (JacobiSVD)</td></tr> 32 <tr class="alt"><td>\link QR_Module QR \endlink</td><td>\code#include <Eigen/QR>\endcode</td><td>QR decomposition with solver (HouseholderQR, ColPivHouseholderQR, FullPivHouseholderQR)</td></tr>
|
TopicLinearAlgebraDecompositions.dox | 23 <th>Linear solver provided by Eigen</th>
|
UsingIntelMKL.dox | 64 Finally, the PARDISO sparse solver shipped with Intel MKL can be used through the \ref PardisoLU, \ref PardisoLLT and \ref PardisoLDLT classes of the \ref PARDISOSupport_Module.
|
/external/llvm/include/llvm/Analysis/ |
SparsePropagation.h | 112 /// SparseSolver - This class is a general purpose solver for Sparse Conditional
|
/external/ceres-solver/ |
CMakeLists.txt | 1 # Ceres Solver - A fast non-linear least squares minimizer 3 # http://code.google.com/p/ceres-solver/ 52 FILE(DOWNLOAD https://ceres-solver-review.googlesource.com/tools/hooks/commit-msg
|
/external/jmonkeyengine/engine/src/bullet/com/jme3/bullet/ |
PhysicsSpace.java | 84 // private ConstraintSolver solver; 167 // solver = new SequentialImpulseConstraintSolver(); 169 // dynamicsWorld = new DiscreteDynamicsWorld(dispatcher, broadphase, solver, collisionConfiguration); [all...] |
/external/jmonkeyengine/engine/src/jbullet/com/jme3/bullet/ |
PhysicsSpace.java | 101 private ConstraintSolver solver; field in class:PhysicsSpace 180 solver = new SequentialImpulseConstraintSolver(); 182 dynamicsWorld = new DiscreteDynamicsWorld(dispatcher, broadphase, solver, collisionConfiguration); [all...] |
/external/opencv/cv/src/ |
cvfundam.cpp | 526 CvLevMarq solver(8, 0, cvTermCriteria(CV_TERMCRIT_ITER+CV_TERMCRIT_EPS, maxIters, DBL_EPSILON)); 530 CvMat modelPart = cvMat( solver.param->rows, solver.param->cols, model->type, model->data.ptr ); 531 cvCopy( &modelPart, solver.param ); 539 if( !solver.updateAlt( _param, _JtJ, _JtErr, _errNorm )) 570 cvCopy( solver.param, &modelPart ); [all...] |
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
org.sat4j.pb_2.2.0.v20100429.jar | |
/external/eigen/Eigen/src/Core/ |
SolveTriangular.h | 25 // small helper struct extracting some traits on the underlying solver operation
|
/external/eigen/unsupported/Eigen/src/Skyline/ |
SkylineInplaceLU.h | 46 * useful to initialize an iterative solver.
|
/external/ceres-solver/include/ceres/internal/ |
autodiff.h | 1 // Ceres Solver - A fast non-linear least squares minimizer 3 // http://code.google.com/p/ceres-solver/
|
/external/ceres-solver/include/ceres/ |
rotation.h | 1 // Ceres Solver - A fast non-linear least squares minimizer 3 // http://code.google.com/p/ceres-solver/
|
jet.h | 1 // Ceres Solver - A fast non-linear least squares minimizer 3 // http://code.google.com/p/ceres-solver/
|
/external/llvm/lib/CodeGen/ |
RegAllocPBQP.cpp | 13 // solving this using a PBQP solver, and mapping the solution back to a 17 // The PBQP solver (pbqp.c) provided for this allocator uses a heuristic tuned
|
/external/eigen/Eigen/src/UmfPackSupport/ |
UmfPackSupport.h | 111 * \brief A sparse LU factorization and solver based on UmfPack
|