Home
last modified time | relevance | path

Searched refs:per_solve_options (Results 1 – 24 of 24) sorted by relevance

/external/ceres-solver/internal/ceres/
Ddense_qr_solver.cc55 const LinearSolver::PerSolveOptions& per_solve_options, in SolveImpl() argument
58 return SolveUsingEigen(A, b, per_solve_options, x); in SolveImpl()
60 return SolveUsingLAPACK(A, b, per_solve_options, x); in SolveImpl()
67 const LinearSolver::PerSolveOptions& per_solve_options, in SolveUsingLAPACK() argument
74 if (per_solve_options.D != NULL) { in SolveUsingLAPACK()
77 A->AppendDiagonal(per_solve_options.D); in SolveUsingLAPACK()
84 if (per_solve_options.D != NULL) { in SolveUsingLAPACK()
125 const LinearSolver::PerSolveOptions& per_solve_options, in SolveUsingEigen() argument
132 if (per_solve_options.D != NULL) { in SolveUsingEigen()
135 A->AppendDiagonal(per_solve_options.D); in SolveUsingEigen()
[all …]
Ddense_normal_cholesky_solver.cc55 const LinearSolver::PerSolveOptions& per_solve_options, in SolveImpl() argument
58 return SolveUsingEigen(A, b, per_solve_options, x); in SolveImpl()
60 return SolveUsingLAPACK(A, b, per_solve_options, x); in SolveImpl()
67 const LinearSolver::PerSolveOptions& per_solve_options, in SolveUsingEigen() argument
90 if (per_solve_options.D != NULL) { in SolveUsingEigen()
91 ConstVectorRef D(per_solve_options.D, num_cols); in SolveUsingEigen()
118 const LinearSolver::PerSolveOptions& per_solve_options, in SolveUsingLAPACK() argument
122 if (per_solve_options.D != NULL) { in SolveUsingLAPACK()
125 A->AppendDiagonal(per_solve_options.D); in SolveUsingLAPACK()
144 if (per_solve_options.D != NULL) { in SolveUsingLAPACK()
Dlevenberg_marquardt_strategy.cc66 const TrustRegionStrategy::PerSolveOptions& per_solve_options, in ComputeStep() argument
90 solve_options.q_tolerance = per_solve_options.eta; in ComputeStep()
120 if (per_solve_options.dump_format_type == CONSOLE || in ComputeStep()
121 (per_solve_options.dump_format_type != CONSOLE && in ComputeStep()
122 !per_solve_options.dump_filename_base.empty())) { in ComputeStep()
123 if (!DumpLinearLeastSquaresProblem(per_solve_options.dump_filename_base, in ComputeStep()
124 per_solve_options.dump_format_type, in ComputeStep()
131 << " Filename base: " << per_solve_options.dump_filename_base; in ComputeStep()
Dsymmetric_linear_solver_test.cc67 LinearSolver::PerSolveOptions per_solve_options; in TEST() local
68 per_solve_options.r_tolerance = 1e-9; in TEST()
72 solver.Solve(A.get(), b.data(), per_solve_options, x.data()); in TEST()
124 LinearSolver::PerSolveOptions per_solve_options; in TEST() local
125 per_solve_options.r_tolerance = 1e-9; in TEST()
129 solver.Solve(A.get(), b.data(), per_solve_options, x.data()); in TEST()
Dsparse_normal_cholesky_solver.cc81 const LinearSolver::PerSolveOptions& per_solve_options, in SolveImpl() argument
88 if (per_solve_options.D != NULL) { in SolveImpl()
94 per_solve_options.D, A->col_blocks())); in SolveImpl()
97 per_solve_options.D, num_cols)); in SolveImpl()
105 summary = SolveImplUsingSuiteSparse(A, per_solve_options, x); in SolveImpl()
108 summary = SolveImplUsingCXSparse(A, per_solve_options, x); in SolveImpl()
111 summary = SolveImplUsingEigen(A, per_solve_options, x); in SolveImpl()
118 if (per_solve_options.D != NULL) { in SolveImpl()
127 const LinearSolver::PerSolveOptions& per_solve_options, in SolveImplUsingEigen() argument
224 const LinearSolver::PerSolveOptions& per_solve_options, in SolveImplUsingCXSparse() argument
[all …]
Diterative_schur_complement_solver_test.cc87 LinearSolver::PerSolveOptions per_solve_options; in TestSolver() local
88 per_solve_options.D = D; in TestSolver()
90 qr->Solve(&dense_A, b_.get(), per_solve_options, reference_solution.data()); in TestSolver()
99 per_solve_options.r_tolerance = 1e-12; in TestSolver()
100 isc.Solve(A_.get(), b_.get(), per_solve_options, isc_sol.data()); in TestSolver()
Dcgnr_solver.cc56 const LinearSolver::PerSolveOptions& per_solve_options, in SolveImpl() argument
66 LinearSolver::PerSolveOptions cg_per_solve_options = per_solve_options; in SolveImpl()
71 preconditioner_->Update(*A, per_solve_options.D); in SolveImpl()
77 CgnrLinearOperator lhs(*A, per_solve_options.D); in SolveImpl()
Dconjugate_gradients_solver.cc69 const LinearSolver::PerSolveOptions& per_solve_options, in Solve() argument
98 const double tol_r = per_solve_options.r_tolerance * norm_b; in Solve()
120 if (per_solve_options.preconditioner != NULL) { in Solve()
122 per_solve_options.preconditioner->RightMultiply(r.data(), z.data()); in Solve()
210 if (zeta < per_solve_options.q_tolerance) { in Solve()
215 per_solve_options.q_tolerance); in Solve()
Diterative_schur_complement_solver.cc68 const LinearSolver::PerSolveOptions& per_solve_options, in SolveImpl() argument
83 schur_complement_->Init(*A, per_solve_options.D, b); in SolveImpl()
108 cg_per_solve_options.r_tolerance = per_solve_options.r_tolerance; in SolveImpl()
109 cg_per_solve_options.q_tolerance = per_solve_options.q_tolerance; in SolveImpl()
153 preconditioner_->Update(*A, per_solve_options.D); in SolveImpl()
Dschur_complement_solver_test.cc81 LinearSolver::PerSolveOptions per_solve_options; in SetUpFromProblemId() local
82 per_solve_options.D = D.get(); in SetUpFromProblemId()
83 qr->Solve(&dense_A, b.get(), per_solve_options, sol_d.get()); in SetUpFromProblemId()
107 LinearSolver::PerSolveOptions per_solve_options; in ComputeAndCompareSolutions() local
110 per_solve_options.D = D.get(); in ComputeAndCompareSolutions()
113 summary = solver->Solve(A.get(), b.get(), per_solve_options, x.get()); in ComputeAndCompareSolutions()
Ddense_normal_cholesky_solver.h85 const LinearSolver::PerSolveOptions& per_solve_options,
91 const LinearSolver::PerSolveOptions& per_solve_options,
97 const LinearSolver::PerSolveOptions& per_solve_options,
Ddense_qr_solver.h90 const LinearSolver::PerSolveOptions& per_solve_options,
96 const LinearSolver::PerSolveOptions& per_solve_options,
102 const LinearSolver::PerSolveOptions& per_solve_options,
Ddogleg_strategy.cc78 const TrustRegionStrategy::PerSolveOptions& per_solve_options, in ComputeStep() argument
131 ComputeGaussNewtonStep(per_solve_options, jacobian, residuals); in ComputeStep()
515 const PerSolveOptions& per_solve_options, in ComputeGaussNewtonStep() argument
570 if (per_solve_options.dump_format_type == CONSOLE || in ComputeGaussNewtonStep()
571 (per_solve_options.dump_format_type != CONSOLE && in ComputeGaussNewtonStep()
572 !per_solve_options.dump_filename_base.empty())) { in ComputeGaussNewtonStep()
573 if (!DumpLinearLeastSquaresProblem(per_solve_options.dump_filename_base, in ComputeGaussNewtonStep()
574 per_solve_options.dump_format_type, in ComputeGaussNewtonStep()
582 << per_solve_options.dump_filename_base; in ComputeGaussNewtonStep()
Dlinear_solver.h290 const PerSolveOptions& per_solve_options,
323 const LinearSolver::PerSolveOptions& per_solve_options, in Solve() argument
329 return SolveImpl(down_cast<MatrixType*>(A), b, per_solve_options, x); in Solve()
344 const LinearSolver::PerSolveOptions& per_solve_options,
Dlevenberg_marquardt_strategy_test.cc67 const LinearSolver::PerSolveOptions& per_solve_options, in SolveImpl() argument
69 CHECK_NOTNULL(per_solve_options.D); in SolveImpl()
71 EXPECT_NEAR(per_solve_options.D[i], diagonal_[i], kTolerance) in SolveImpl()
72 << i << " " << per_solve_options.D[i] << " " << diagonal_[i]; in SolveImpl()
Dunsymmetric_linear_solver_test.cc62 LinearSolver::PerSolveOptions per_solve_options; in TestSolver() local
93 per_solve_options, in TestSolver()
99 per_solve_options.D = D_.get(); in TestSolver()
103 per_solve_options, in TestSolver()
Dtrust_region_minimizer.cc281 TrustRegionStrategy::PerSolveOptions per_solve_options; in Minimize() local
282 per_solve_options.eta = options_.eta; in Minimize()
287 per_solve_options.dump_format_type = in Minimize()
289 per_solve_options.dump_filename_base = in Minimize()
294 per_solve_options.dump_format_type = TEXTFILE; in Minimize()
295 per_solve_options.dump_filename_base.clear(); in Minimize()
299 strategy->ComputeStep(per_solve_options, in Minimize()
Ddogleg_strategy.h61 virtual Summary ComputeStep(const PerSolveOptions& per_solve_options,
83 const PerSolveOptions& per_solve_options,
Dconjugate_gradients_solver.h63 const LinearSolver::PerSolveOptions& per_solve_options,
Dcgnr_solver.h57 const LinearSolver::PerSolveOptions& per_solve_options,
Dlevenberg_marquardt_strategy.h53 const TrustRegionStrategy::PerSolveOptions& per_solve_options,
Dtrust_region_strategy.h133 virtual Summary ComputeStep(const PerSolveOptions& per_solve_options,
Dschur_complement_solver.cc63 const LinearSolver::PerSolveOptions& per_solve_options, in SolveImpl() argument
80 eliminator_->Eliminate(A, b, per_solve_options.D, lhs_.get(), rhs_.get()); in SolveImpl()
89 eliminator_->BackSubstitute(A, b, per_solve_options.D, reduced_solution, x); in SolveImpl()
Dschur_complement_solver.h122 const LinearSolver::PerSolveOptions& per_solve_options,