/external/ceres-solver/internal/ceres/ |
c_api.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer 3 // http://code.google.com/p/ceres-solver/ 43 #include "ceres/solver.h" 180 ceres::Solver::Options options; 185 ceres::Solver::Summary summary;
|
solver_impl.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer 3 // http://code.google.com/p/ceres-solver/ 68 const Solver::Options& options, 73 Solver::Summary* summary) { 138 const Solver::Options& options, 141 Solver::Summary* summary) { 184 void SolverImpl::Solve(const Solver::Options& options, 186 Solver::Summary* summary) { 203 void SolverImpl::TrustRegionSolve(const Solver::Options& original_options, 205 Solver::Summary* summary) [all...] |
coordinate_descent_minimizer.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer 3 // http://code.google.com/p/ceres-solver/ 48 #include "ceres/solver.h" 124 Solver::Summary* summary) { 180 Solver::Summary inner_summary; 206 Solver::Summary* summary) { 207 *summary = Solver::Summary();
|
system_test.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer 3 // http://code.google.com/p/ceres-solver/ 52 #include "ceres/solver.h" 66 // Struct used for configuring the solver. 109 // Templated function that given a set of solver configurations, 122 // Solver::Options* mutable_solver_options(); 136 Solver::Options& options = *(system_test_problem->mutable_solver_options()); 148 LOG(INFO) << "Running solver configuration: " 151 Solver::Summary summary; 165 << "Solver configuration " << i << " failed." [all...] |
trust_region_minimizer_test.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer 3 // http://code.google.com/p/ceres-solver/ 210 // if the solver converges to the optimal values or not. 213 Solver::Options solver_options; 248 Solver::Summary summary; 388 Solver::Options options; 390 Solver::Summary summary;
|
reorder_program_test.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer 3 // http://code.google.com/p/ceres-solver/ 37 #include "ceres/solver.h" 83 Solver::Options options;
|
/external/ceres-solver/examples/ |
denoising.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer 3 // http://code.google.com/p/ceres-solver/ 59 DEFINE_bool(verbose, false, "Prints information about the solver progress."); 143 ceres::Solver::Options options; 156 ceres::Solver::Summary summary;
|
simple_bundle_adjuster.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer 3 // http://code.google.com/p/ceres-solver/ 208 // standard solver, SPARSE_NORMAL_CHOLESKY, also works fine but it is slower 210 ceres::Solver::Options options; 214 ceres::Solver::Summary summary;
|
more_garbow_hillstrom.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer 3 // http://code.google.com/p/ceres-solver/ 283 Solver::Options options; 289 Solver::Summary summary; 314 Solver::Options options; 320 Solver::Summary summary;
|
ellipse_approximation.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer 3 // http://code.google.com/p/ceres-solver/ 359 bool SolveWithFullReport(ceres::Solver::Options options, 364 ceres::Solver::Summary summary; 436 ceres::Solver::Options options;
|
nist.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer 3 // http://code.google.com/p/ceres-solver/ 65 // solver had the highest LRE. 408 const ceres::Solver::Options& options) { 435 ceres::Solver::Summary summary; 475 void SetMinimizerOptions(ceres::Solver::Options* options) { 518 ceres::Solver::Options options;
|
libmv_homography.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer 3 // http://code.google.com/p/ceres-solver/ 353 ceres::Solver::Options solver_options; 363 ceres::Solver::Summary summary;
|
/external/ceres-solver/include/ceres/ |
problem.h | 1 // Ceres Solver - A fast non-linear least squares minimizer 3 // http://code.google.com/p/ceres-solver/ 55 class Solver; 289 // ordering, rendering the jacobian or residuals returned from the solver 300 // ordering, rendering the jacobian or residuals returned from the solver 462 friend class Solver;
|
/external/opencv3/modules/ml/src/ |
svm.cpp | 440 class Solver 445 typedef bool (Solver::*SelectWorkingSet)( int& i, int& j ); 446 typedef Qfloat* (Solver::*GetRow)( int i, Qfloat* row, Qfloat* dst, bool existed ); 447 typedef void (Solver::*CalcRho)( double& rho, double& r ); 477 Solver( const Mat& _samples, const vector<schar>& _y, [all...] |
/external/apache-commons-math/src/main/java/org/apache/commons/math/linear/ |
CholeskyDecompositionImpl.java | 187 return new Solver(lTData); 190 /** Specialized solver. */ 191 private static class Solver implements DecompositionSolver { 197 * Build a solver from decomposed matrix. 200 private Solver(final double[][] lTData) {
|
SingularValueDecompositionImpl.java | 268 return new Solver(singularValues, getUT(), getV(), getRank() == Math 272 /** Specialized solver. */ 273 private static class Solver implements DecompositionSolver { 282 * Build a solver from decomposed matrix. 292 private Solver(final double[] singularValues, final RealMatrix uT,
|
LUDecompositionImpl.java | 228 return new Solver(lu, pivot, singular); 231 /** Specialized solver. */ 232 private static class Solver implements DecompositionSolver { 244 * Build a solver from decomposed matrix. 249 private Solver(final double[][] lu, final int[] pivot, final boolean singular) {
|
QRDecompositionImpl.java | 248 return new Solver(qrt, rDiag); 251 /** Specialized solver. */ 252 private static class Solver implements DecompositionSolver { 266 * Build a solver from decomposed matrix. 270 private Solver(final double[][] qrt, final double[] rDiag) {
|
EigenDecompositionImpl.java | 240 return new Solver(realEigenvalues, imagEigenvalues, eigenvectors); 243 /** Specialized solver. */ 244 private static class Solver implements DecompositionSolver { 256 * Build a solver from decomposed matrix. 264 private Solver(final double[] realEigenvalues,
|
FieldLUDecompositionImpl.java | 219 return new Solver<T>(field, lu, pivot, singular); 222 /** Specialized solver. */ 223 private static class Solver<T extends FieldElement<T>> implements FieldDecompositionSolver<T> { 241 * Build a solver from decomposed matrix. 247 private Solver(final Field<T> field, final T[][] lu,
|
/external/llvm/lib/Transforms/Scalar/ |
SCCP.cpp | 154 /// SCCPSolver - This class is a general purpose solver for Sparse Conditional 238 /// AddTrackedFunction - If the SCCP solver is supposed to track calls into 263 /// method should be use to handle this. If this returns true, the solver [all...] |
/external/ceres-solver/scripts/ |
ceres-solver.spec | 1 Name: ceres-solver 11 URL: http://ceres-solver.org/ 34 Ceres Solver is a portable C++ library that allows for modeling and solving 50 Notable use of Ceres Solver is for the image alignment in Google Maps and for
|
/external/ceres-solver/jni/ |
Application.mk | 1 # Ceres Solver - A fast non-linear least squares minimizer 3 # http://code.google.com/p/ceres-solver/
|
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
org.sat4j.core_2.2.0.v20100429.jar | |
/external/ceres-solver/ |
Android.mk | 1 # Ceres Solver - A fast non-linear least squares minimizer 3 # http://code.google.com/p/ceres-solver/ 70 # Ceres Solver ships with a replacement for glog that provides a 177 $(CERES_SRC_PATH)/solver.cc \
|