| /external/ceres-solver/internal/ceres/ |
| conjugate_gradients_solver.h | 61 virtual Summary Solve(LinearOperator* A,
|
| solver_test.cc | 106 Solve(options, &problem, &summary);
118 Solve(options, &problem, &summary);
167 Solve(options, &problem, &summary);
179 Solve(options, &problem, &summary);
193 Solve(options, &problem, &summary);
207 Solve(options, &problem, &summary);
222 Solve(options, &problem, &summary);
236 Solve(options, &problem, &summary);
|
| coordinate_descent_minimizer.h | 82 void Solve(Program* program,
|
| iterative_schur_complement_solver_test.cc | 90 qr->Solve(&dense_A, b_.get(), per_solve_options, reference_solution.data());
100 isc.Solve(A_.get(), b_.get(), per_solve_options, isc_sol.data());
|
| symmetric_linear_solver_test.cc | 31 // Tests for linear solvers that solve symmetric linear systems. Some
72 solver.Solve(A.get(), b.data(), per_solve_options, x.data());
129 solver.Solve(A.get(), b.data(), per_solve_options, x.data());
|
| linear_solver.h | 83 // information across solves. This means that calling Solve on the
90 // a particular Solve call.
168 // Options for the Solve method.
178 // that can solve rectangular linear systems.
181 // and a vector b, the linear solver will solve for
212 // of solving Ax = b, we solve the linear system AM^{-1} y = b
246 // solve the Newton step. This particular convergence test comes
261 // Summary of a call to the Solve method. We should move away from
287 // Solve Ax = b.
288 virtual Summary Solve(LinearOperator* A
[all...] |
| cgnr_solver.cc | 58 EventLogger event_logger("CgnrSolver::Solve");
75 // Solve (AtA + DtD)x = z (= Atb).
82 conjugate_gradient_solver.Solve(&lhs, z.data(), cg_per_solve_options, x);
83 event_logger.AddEvent("Solve");
|
| solver_impl.h | 55 static void Solve(const Solver::Options& options,
|
| solver_impl_test.cc | 88 SolverImpl::Solve(options, &problem, &summary);
97 // user state, instead of inside a random temporary vector made by Solve().
|
| schur_complement_solver_test.cc | 78 qr->Solve(&dense_A, b.get(), LinearSolver::PerSolveOptions(), sol.get());
83 qr->Solve(&dense_A, b.get(), per_solve_options, sol_d.get());
113 summary = solver->Solve(A.get(), b.get(), per_solve_options, x.get());
|
| c_api.cc | 186 ceres::Solve(options, problem, &summary);
|
| iterative_schur_complement_solver.cc | 70 EventLogger event_logger("IterativeSchurComplementSolver::Solve");
166 cg_summary = cg_solver.Solve(schur_complement_.get(),
176 event_logger.AddEvent("Solve");
|
| levenberg_marquardt_strategy.cc | 103 // Instead of solving Jx = -r, solve Jy = r.
107 linear_solver_->Solve(jacobian, residuals, solve_options, step);
|
| solver.cc | 269 << ", prevent bisection (0.5) scaling, continuing with solve regardless.";
312 void Solver::Solve(const Solver::Options& options,
326 internal::SolverImpl::Solve(options, problem_impl, summary);
331 void Solve(const Solver::Options& options,
335 solver.Solve(options, problem, summary);
343 message("ceres::Solve was not called."),
406 "Ceres Solver v" CERES_VERSION_STRING " Solve Report\n"
|
| suitesparse.h | 188 // Given a Cholesky factorization of a matrix A = LL^T, solve the
189 // linear system Ax = b, and return the result. If the Solve fails
193 cholmod_dense* Solve(cholmod_factor* L, cholmod_dense* b, string* message);
|
| /external/ceres-solver/examples/ |
| helloworld.cc | 43 using ceres::Solve;
59 // The variable to solve for with its initial value. It will be
77 Solve(options, &problem, &summary);
|
| helloworld_analytic_diff.cc | 43 using ceres::Solve;
84 // The variable to solve for with its initial value. It will be
100 Solve(options, &problem, &summary);
|
| helloworld_numeric_diff.cc | 42 using ceres::Solve;
55 // The variable to solve for with its initial value. It will be
73 Solve(options, &problem, &summary);
|
| circle_fit.cc | 65 using ceres::Solve;
149 // Build and solve the problem.
154 Solve(options, &problem, &summary);
|
| powell.cc | 56 using ceres::Solve;
145 Solve(options, &problem, &summary);
|
| curve_fitting.cc | 38 using ceres::Solve;
158 Solve(options, &problem, &summary);
|
| robot_pose_mle.cc | 144 using ceres::Solve;
310 Solve(solver_options, &problem, &summary);
|
| robust_curve_fitting.cc | 120 using ceres::Solve;
158 Solve(options, &problem, &summary);
|
| /external/ceres-solver/include/ceres/ |
| solver.h | 426 // Number of threads used by Ceres to solve the Newton
574 // linear in a_1 and a_2, i.e., Solve for the trust region step
577 // amounts to doing a single linear least squares solve. For
608 // in the early stages of the solve and then their contribution
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| SparsePropagation.h | 143 /// Solve - Solve for constants and executable blocks.
145 void Solve(Function &F);
|
