HomeSort by relevance Sort by last modified time
    Searched full:solver (Results 51 - 75 of 341) sorted by null

1 23 4 5 6 7 8 91011>>

  /external/ceres-solver/internal/ceres/
wall_time.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
wall_time.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
implicit_schur_complement.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
31 // An iterative solver for solving the Schur complement/reduced camera
72 // The key operation in a conjugate gradient solver is the evaluation of the
82 // auxilliary bits needed to implement a CG solver on the Schur
112 // with the SchurComplement solver.
polynomial_solver.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
162 Eigen::EigenSolver<Matrix> solver(companion_matrix, false);
163 if (solver.info() != Eigen::Success) {
170 *real = solver.eigenvalues().real();
177 *imaginary = solver.eigenvalues().imag();
trust_region_strategy.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
67 // Linear solver used for actually solving the trust region step.
105 // Number of iterations used by the linear solver. If a linear
106 // solver was not called (e.g., DogLegStrategy after an
110 // Status of the linear solver used to solve the Newton system.
system_test.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
50 #include "ceres/solver.h"
64 // Struct used for configuring the solver.
104 // Templated function that given a set of solver configurations,
117 // Solver::Options* mutable_solver_options();
124 vector<Solver::Summary> summaries(num_configurations);
131 Solver::Options& options = *(system_test_problem->mutable_solver_options());
145 LOG(INFO) << "Running solver configuration: "
153 << "Solver configuration " << i << " failed."
    [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) {
179 Solver::Summary inner_summary;
205 Solver::Summary* summary) {
206 *summary = Solver::Summary();
solver_impl.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
115 // Basic callback to record the execution of the solver to a file for
145 void SolverImpl::Minimize(const Solver::Options& options,
151 Solver::Summary* summary) {
203 void SolverImpl::Solve(const Solver::Options& original_options,
205 Solver::Summary* summary) {
212 *CHECK_NOTNULL(summary) = Solver::Summary();
232 Solver::Options options(original_options);
258 " currently broken. Ignoring Solver::Options::lsqp_iterations_to_dump"
    [all...]
levenberg_marquardt_strategy.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
97 // the linear solver generated numerical garbage. This is known
98 // to happen for the DENSE_QR and then DENSE_SCHUR solver when
109 LOG(WARNING) << "Linear solver failure. Failed to compute a finite step.";
dense_qr_solver.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
80 // We always succeed, since the QR solver returns the best solution
gradient_checking_cost_function.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
46 // controlled with relative_step_size. See solver.h for a better explanation of
linear_solver.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
86 LOG(FATAL) << "Unknown linear solver type :"
array_utils.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
  /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/jmonkeyengine/engine/src/bullet-native/
jmePhysicsSpace.cpp 93 PosixThreadSupport::ThreadConstructionInfo solverConstructionInfo("solver", processCollisionTask,
141 btConstraintSolver* solver; local
151 // the default constraint solver. For parallel processing you can use a different solver (see Extras/BulletMultiThreaded)
154 solver = new btParallelConstraintSolver(solverThreads);
156 solver = new btSequentialImpulseConstraintSolver;
160 btDiscreteDynamicsWorld* world = new btDiscreteDynamicsWorld(dispatcher, broadphase, solver, collisionConfiguration);
164 //parallel solver requires the contacts to be in a contiguous pool, so avoid dynamic allocation
  /external/ceres-solver/examples/
powell.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
55 using ceres::Solver;
128 // Run the solver!
129 Solver::Options options;
134 Solver::Summary summary;
bundle_adjuster.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
118 DEFINE_string(solver_log, "", "File to record the solver execution to.");
123 void SetLinearSolver(Solver::Options* options) {
134 void SetOrdering(BALProblem* bal_problem, Solver::Options* options) {
221 void SetMinimizerOptions(Solver::Options* options) {
235 Solver::Options* options) {
315 Solver::Options options;
320 Solver::Summary summary;
circle_fit.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
66 using ceres::Solver;
150 Solver::Options options;
153 Solver::Summary summary;
CMakeLists.txt 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/docs/
ceres-solver.tex 63 \MakeLowercase{Ceres Solver: Tutorial \& Reference}
106 Despite our best efforts, this manual remains a work in progress and the source code for Ceres Solver remains the ultimate reference.
131 \bibliography{ceres-solver}
  /external/eigen/unsupported/Eigen/src/IterativeSolvers/
GMRES.h 219 * \brief A GMRES solver for sparse square problems
231 * This class can be used as the direct solver classes. Here is a typical usage example:
237 * GMRES<SparseMatrix<double> > solver(A);
238 * x = solver.solve(b);
239 * std::cout << "#iterations: " << solver.iterations() << std::endl;
240 * std::cout << "estimated error: " << solver.error() << std::endl;
242 * x = solver.solve(b);
251 * solver.setMaxIterations(1);
254 * x = solver.solveWithGuess(b,x);
255 * std::cout << i << " : " << solver.error() << std::endl
    [all...]
  /external/ceres-solver/cmake/
uninstall.cmake.in 1 # Ceres Solver - A fast non-linear least squares minimizer
3 # http://code.google.com/p/ceres-solver/
  /external/ceres-solver/include/ceres/
crs_matrix.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
  /external/ceres-solver/include/ceres/internal/
port.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/

Completed in 286 milliseconds

1 23 4 5 6 7 8 91011>>