| /external/eigen/test/ |
| D | sparse_solver.h | 13 template<typename Solver, typename Rhs, typename DenseMat, typename DenseRhs>
14 void check_sparse_solving(Solver& solver, const typename Solver::MatrixType& A, const Rhs& b, const… in check_sparse_solving()
16 typedef typename Solver::MatrixType Mat; in check_sparse_solving()
72 template<typename Solver, typename Rhs>
73 void check_sparse_solving_real_cases(Solver& solver, const typename Solver::MatrixType& A, const Rh… in check_sparse_solving_real_cases()
75 typedef typename Solver::MatrixType Mat; in check_sparse_solving_real_cases()
111 template<typename Solver, typename DenseMat>
112 void check_sparse_determinant(Solver& solver, const typename Solver::MatrixType& A, const DenseMat&… in check_sparse_determinant()
114 typedef typename Solver::MatrixType Mat; in check_sparse_determinant()
130 template<typename Solver, typename DenseMat>
[all …]
|
| /external/ceres-solver/internal/ceres/ |
| D | solver_impl.h | 53 static void Solve(const Solver::Options& options,
55 Solver::Summary* summary);
64 static Program* CreateReducedProgram(Solver::Options* options,
74 static LinearSolver* CreateLinearSolver(Solver::Options* options,
97 const Solver::Options& options,
103 static void Minimize(const Solver::Options &options,
109 Solver::Summary* summary);
122 static bool IsOrderingValid(const Solver::Options& options,
131 const Solver::Options& options,
|
| D | solver.cc | 44 Solver::Options::~Options() { in ~Options()
49 Solver::~Solver() {} in ~Solver()
51 void Solver::Solve(const Solver::Options& options, in Solve()
53 Solver::Summary* summary) { in Solve()
62 void Solve(const Solver::Options& options, in Solve()
64 Solver::Summary* summary) { in Solve()
65 Solver solver; in Solve()
69 Solver::Summary::Summary() in Summary()
101 string Solver::Summary::BriefReport() const { in BriefReport()
127 string Solver::Summary::FullReport() const { in FullReport()
|
| D | solver_impl_test.cc | 281 Solver::Options options; in TEST()
343 Solver::Options options; in TEST()
417 Solver::Options options; in TEST()
500 Solver::Options options; in TEST()
508 Solver::Options options; in TEST()
519 Solver::Options options; in TEST()
530 Solver::Options options; in TEST()
541 Solver::Options options; in TEST()
561 Solver::Options options; in TEST()
576 Solver::Options options; in TEST()
[all …]
|
| D | minimizer.h | 54 Init(Solver::Options()); in Options()
57 explicit Options(const Solver::Options& options) { in Options()
61 void Init(const Solver::Options& options) { in Init()
143 Solver::Summary* summary) = 0;
|
| D | coordinate_descent_minimizer.h | 64 Solver::Summary* summary);
70 Solver::Summary* summary);
|
| D | coordinate_descent_minimizer.cc | 124 Solver::Summary* summary) { in Minimize()
179 Solver::Summary inner_summary; in Minimize()
205 Solver::Summary* summary) { in Solve()
206 *summary = Solver::Summary(); in Solve()
|
| D | system_test.cc | 124 vector<Solver::Summary> summaries(num_configurations); in RunSolversAndCheckTheyMatch()
131 Solver::Options& options = *(system_test_problem->mutable_solver_options()); in RunSolversAndCheckTheyMatch()
220 Solver::Options* mutable_solver_options() { return &options_; } in mutable_solver_options()
271 Solver::Options options_;
322 Solver::Options* mutable_solver_options() { return &options_; } in mutable_solver_options()
462 Solver::Options options_;
|
| D | solver_impl.cc | 145 void SolverImpl::Minimize(const Solver::Options& options, in Minimize()
151 Solver::Summary* summary) { in Minimize()
203 void SolverImpl::Solve(const Solver::Options& original_options, in Solve()
205 Solver::Summary* summary) { in Solve()
212 *CHECK_NOTNULL(summary) = Solver::Summary(); in Solve()
232 Solver::Options options(original_options); in Solve()
512 bool SolverImpl::IsOrderingValid(const Solver::Options& options, in IsOrderingValid()
660 Program* SolverImpl::CreateReducedProgram(Solver::Options* options, in CreateReducedProgram()
767 LinearSolver* SolverImpl::CreateLinearSolver(Solver::Options* options, in CreateLinearSolver()
1032 Evaluator* SolverImpl::CreateEvaluator(const Solver::Options& options, in CreateEvaluator()
[all …]
|
| D | trust_region_minimizer_test.cc | 190 Solver::Options solver_options; in IsTrustRegionSolveSuccessful()
225 Solver::Summary summary; in IsTrustRegionSolveSuccessful()
364 Solver::Options options; in TEST()
366 Solver::Summary summary; in TEST()
|
| /external/ceres-solver/include/ceres/ |
| D | solver.h | 49 class Solver {
51 virtual ~Solver();
644 Solver::Summary* summary);
648 void Solve(const Solver::Options& options,
650 Solver::Summary* summary);
|
| D | problem.h | 53 class Solver; variable
279 friend class Solver;
|
| /external/ceres-solver/examples/ |
| D | quadratic_auto_diff.cc | 44 using ceres::Solver;
78 Solver::Options options; in main()
82 Solver::Summary summary; in main()
|
| D | quadratic.cc | 42 using ceres::Solver;
81 Solver::Options options; in main()
85 Solver::Summary summary; in main()
|
| D | quadratic_numeric_diff.cc | 44 using ceres::Solver;
82 Solver::Options options; in main()
86 Solver::Summary summary; in main()
|
| D | data_fitting.cc | 37 using ceres::Solver;
154 Solver::Options options; in main()
159 Solver::Summary summary; in main()
|
| D | bundle_adjuster.cc | 123 void SetLinearSolver(Solver::Options* options) { in SetLinearSolver()
134 void SetOrdering(BALProblem* bal_problem, Solver::Options* options) { in SetOrdering()
221 void SetMinimizerOptions(Solver::Options* options) { in SetMinimizerOptions()
235 Solver::Options* options) { in SetSolverOptionsFromFlags()
315 Solver::Options options; in SolveProblem()
320 Solver::Summary summary; in SolveProblem()
|
| D | powell.cc | 55 using ceres::Solver;
129 Solver::Options options; in main()
134 Solver::Summary summary; in main()
|
| D | circle_fit.cc | 66 using ceres::Solver;
150 Solver::Options options; in main()
153 Solver::Summary summary; in main()
|
| D | nist.cc | 342 const ceres::Solver::Options& options) { in RegressionDriver()
350 std::vector<ceres::Solver::Summary> summaries(nist_problem.num_starts() + 1); in RegressionDriver()
376 const ceres::Solver::Summary& summary = summaries[start]; in RegressionDriver()
404 void SetMinimizerOptions(ceres::Solver::Options* options) { in SetMinimizerOptions()
427 ceres::Solver::Options options; in SolveNISTProblems()
|
| D | simple_bundle_adjuster.cc | 202 ceres::Solver::Options options; in main()
206 ceres::Solver::Summary summary; in main()
|
| /external/eigen/bench/spbench/ |
| D | spbenchsolver.h | 125 template<typename Solver, typename Scalar>
126 Stats call_solver(Solver &solver, const typename Solver::MatrixType& A, const Matrix<Scalar, Dynami… in call_solver()
179 template<typename Solver, typename Scalar>
180 Stats call_directsolver(Solver& solver, const typename Solver::MatrixType& A, const Matrix<Scalar, … in call_directsolver()
187 template<typename Solver, typename Scalar>
188 Stats call_itersolver(Solver &solver, const typename Solver::MatrixType& A, const Matrix<Scalar, Dy… in call_itersolver()
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | SCCP.cpp | 1559 SCCPSolver Solver(TD, TLI); in runOnFunction() local
1562 Solver.MarkBlockExecutable(F.begin()); in runOnFunction()
1566 Solver.markAnythingOverdefined(AI); in runOnFunction()
1571 Solver.Solve(); in runOnFunction()
1573 ResolvedUndefs = Solver.ResolvedUndefsIn(F); in runOnFunction()
1583 if (!Solver.isBlockExecutable(BB)) { in runOnFunction()
1601 LatticeVal IV = Solver.getLatticeValueFor(Inst); in runOnFunction()
1688 SCCPSolver Solver(TD, TLI); in runOnModule() local
1707 Solver.AddTrackedFunction(F); in runOnModule()
1716 Solver.AddArgumentTrackedFunction(F); in runOnModule()
[all …]
|
| /external/ceres-solver/docs/ |
| D | introduction.tex | 4 Ceres Solver\footnote{For brevity, in the rest of this document we will just use the term Ceres.} i…
14 \section{Contributing to Ceres Solver}
20 \section{Citing Ceres Solver}
25 Title = {Ceres Solver: Tutorial \& Reference},
42 Ceres Solver is licensed under the New BSD license, whose terms are as follows.
|
| /external/ceres-solver/ |
| D | README | 1 Ceres Solver - A non-linear least squares minimizer
|