Home
last modified time | relevance | path

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

123

/dports/graphics/blender/blender-2.91.0/extern/ceres/internal/ceres/
H A Ddense_qr_solver.cc53 const LinearSolver::PerSolveOptions& per_solve_options, in SolveImpl() argument
56 return SolveUsingEigen(A, b, per_solve_options, x); in SolveImpl()
58 return SolveUsingLAPACK(A, b, per_solve_options, x); in SolveImpl()
65 const LinearSolver::PerSolveOptions& per_solve_options, in SolveUsingLAPACK() argument
72 if (per_solve_options.D != NULL) { in SolveUsingLAPACK()
75 A->AppendDiagonal(per_solve_options.D); in SolveUsingLAPACK()
82 if (per_solve_options.D != NULL) { in SolveUsingLAPACK()
123 const LinearSolver::PerSolveOptions& per_solve_options, in SolveUsingEigen() argument
130 if (per_solve_options.D != NULL) { in SolveUsingEigen()
133 A->AppendDiagonal(per_solve_options.D); in SolveUsingEigen()
[all …]
H A Ddense_normal_cholesky_solver.cc54 const LinearSolver::PerSolveOptions& per_solve_options, in SolveImpl() argument
57 return SolveUsingEigen(A, b, per_solve_options, x); in SolveImpl()
59 return SolveUsingLAPACK(A, b, per_solve_options, x); in SolveImpl()
66 const LinearSolver::PerSolveOptions& per_solve_options, in SolveUsingEigen() argument
89 if (per_solve_options.D != NULL) { in SolveUsingEigen()
90 ConstVectorRef D(per_solve_options.D, num_cols); in SolveUsingEigen()
117 const LinearSolver::PerSolveOptions& per_solve_options, in SolveUsingLAPACK() argument
121 if (per_solve_options.D != NULL) { in SolveUsingLAPACK()
124 A->AppendDiagonal(per_solve_options.D); in SolveUsingLAPACK()
143 if (per_solve_options.D != NULL) { in SolveUsingLAPACK()
H A Dlevenberg_marquardt_strategy.cc68 const TrustRegionStrategy::PerSolveOptions& per_solve_options, in ComputeStep() argument
93 solve_options.q_tolerance = per_solve_options.eta; in ComputeStep()
126 if (per_solve_options.dump_format_type == CONSOLE || in ComputeStep()
127 (per_solve_options.dump_format_type != CONSOLE && in ComputeStep()
128 !per_solve_options.dump_filename_base.empty())) { in ComputeStep()
129 if (!DumpLinearLeastSquaresProblem(per_solve_options.dump_filename_base, in ComputeStep()
130 per_solve_options.dump_format_type, in ComputeStep()
137 << " Filename base: " << per_solve_options.dump_filename_base; in ComputeStep()
H A Dschur_complement_solver.h126 const LinearSolver::PerSolveOptions& per_solve_options,
140 const LinearSolver::PerSolveOptions& per_solve_options,
163 const LinearSolver::PerSolveOptions& per_solve_options,
179 const LinearSolver::PerSolveOptions& per_solve_options,
182 const LinearSolver::PerSolveOptions& per_solve_options,
H A Dconjugate_gradients_solver.cc68 const LinearSolver::PerSolveOptions& per_solve_options, in Solve() argument
97 const double tol_r = per_solve_options.r_tolerance * norm_b; in Solve()
117 if (per_solve_options.preconditioner != NULL) { in Solve()
119 per_solve_options.preconditioner->RightMultiply(r.data(), z.data()); in Solve()
212 if (zeta < per_solve_options.q_tolerance && in Solve()
219 per_solve_options.q_tolerance, in Solve()
H A Dsparse_normal_cholesky_solver.cc62 const LinearSolver::PerSolveOptions& per_solve_options, in SolveImpl() argument
78 if (per_solve_options.D != NULL) { in SolveImpl()
83 per_solve_options.D, A->block_structure()->cols)); in SolveImpl()
100 if (per_solve_options.D != NULL) { in SolveImpl()
/dports/misc/openmvg/openMVG-2.0/src/third_party/ceres-solver/internal/ceres/
H A 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 …]
H A 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()
H A Dlevenberg_marquardt_strategy.cc66 const TrustRegionStrategy::PerSolveOptions& per_solve_options, in ComputeStep() argument
91 solve_options.q_tolerance = per_solve_options.eta; in ComputeStep()
124 if (per_solve_options.dump_format_type == CONSOLE || in ComputeStep()
125 (per_solve_options.dump_format_type != CONSOLE && in ComputeStep()
126 !per_solve_options.dump_filename_base.empty())) { in ComputeStep()
127 if (!DumpLinearLeastSquaresProblem(per_solve_options.dump_filename_base, in ComputeStep()
128 per_solve_options.dump_format_type, in ComputeStep()
135 << " Filename base: " << per_solve_options.dump_filename_base; in ComputeStep()
H A Dconjugate_gradients_solver_test.cc63 LinearSolver::PerSolveOptions per_solve_options; in TEST() local
64 per_solve_options.r_tolerance = 1e-9; in TEST()
68 solver.Solve(A.get(), b.data(), per_solve_options, x.data()); in TEST()
120 LinearSolver::PerSolveOptions per_solve_options; in TEST() local
121 per_solve_options.r_tolerance = 1e-9; in TEST()
125 solver.Solve(A.get(), b.data(), per_solve_options, x.data()); in TEST()
H A 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()
H A Dschur_complement_solver.h123 const LinearSolver::PerSolveOptions& per_solve_options,
137 const LinearSolver::PerSolveOptions& per_solve_options,
159 const LinearSolver::PerSolveOptions& per_solve_options,
174 const LinearSolver::PerSolveOptions& per_solve_options,
177 const LinearSolver::PerSolveOptions& per_solve_options,
H A 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()
H A 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()
118 if (per_solve_options.preconditioner != NULL) { in Solve()
120 per_solve_options.preconditioner->RightMultiply(r.data(), z.data()); in Solve()
213 if (zeta < per_solve_options.q_tolerance && in Solve()
220 per_solve_options.q_tolerance, in Solve()
H A Dsparse_normal_cholesky_solver.cc63 const LinearSolver::PerSolveOptions& per_solve_options, in SolveImpl() argument
76 if (per_solve_options.D != NULL) { in SolveImpl()
81 per_solve_options.D, A->block_structure()->cols)); in SolveImpl()
100 if (per_solve_options.D != NULL) { in SolveImpl()
H A Dschur_complement_solver.cc123 const LinearSolver::PerSolveOptions& per_solve_options, in SolveImpl() argument
143 eliminator_->Eliminate(A, b, per_solve_options.D, lhs_.get(), rhs_.get()); in SolveImpl()
148 SolveReducedLinearSystem(per_solve_options, reduced_solution); in SolveImpl()
152 eliminator_->BackSubstitute(A, b, per_solve_options.D, reduced_solution, x); in SolveImpl()
182 const LinearSolver::PerSolveOptions& per_solve_options, in SolveReducedLinearSystem() argument
311 const LinearSolver::PerSolveOptions& per_solve_options, double* solution) { in SolveReducedLinearSystem() argument
313 return SolveReducedLinearSystemUsingConjugateGradients(per_solve_options, in SolveReducedLinearSystem()
351 const LinearSolver::PerSolveOptions& per_solve_options, in SolveReducedLinearSystemUsingConjugateGradients() argument
414 cg_per_solve_options.r_tolerance = per_solve_options.r_tolerance; in SolveReducedLinearSystemUsingConjugateGradients()
415 cg_per_solve_options.q_tolerance = per_solve_options.q_tolerance; in SolveReducedLinearSystemUsingConjugateGradients()
H A Diterative_schur_complement_solver.cc66 const LinearSolver::PerSolveOptions& per_solve_options, in SolveImpl() argument
81 schur_complement_->Init(*A, per_solve_options.D, b); in SolveImpl()
104 cg_per_solve_options.r_tolerance = per_solve_options.r_tolerance; in SolveImpl()
105 cg_per_solve_options.q_tolerance = per_solve_options.q_tolerance; in SolveImpl()
109 if (!preconditioner_->Update(*A, per_solve_options.D)) { in SolveImpl()
/dports/math/ceres-solver/ceres-solver-2.0.0/internal/ceres/
H A Ddense_qr_solver.cc54 const LinearSolver::PerSolveOptions& per_solve_options, in SolveImpl() argument
57 return SolveUsingEigen(A, b, per_solve_options, x); in SolveImpl()
59 return SolveUsingLAPACK(A, b, per_solve_options, x); in SolveImpl()
66 const LinearSolver::PerSolveOptions& per_solve_options, in SolveUsingLAPACK() argument
73 if (per_solve_options.D != NULL) { in SolveUsingLAPACK()
76 A->AppendDiagonal(per_solve_options.D); in SolveUsingLAPACK()
83 if (per_solve_options.D != NULL) { in SolveUsingLAPACK()
124 const LinearSolver::PerSolveOptions& per_solve_options, in SolveUsingEigen() argument
131 if (per_solve_options.D != NULL) { in SolveUsingEigen()
134 A->AppendDiagonal(per_solve_options.D); in SolveUsingEigen()
[all …]
H A Ddense_normal_cholesky_solver.cc54 const LinearSolver::PerSolveOptions& per_solve_options, in SolveImpl() argument
57 return SolveUsingEigen(A, b, per_solve_options, x); in SolveImpl()
59 return SolveUsingLAPACK(A, b, per_solve_options, x); in SolveImpl()
66 const LinearSolver::PerSolveOptions& per_solve_options, in SolveUsingEigen() argument
89 if (per_solve_options.D != NULL) { in SolveUsingEigen()
90 ConstVectorRef D(per_solve_options.D, num_cols); in SolveUsingEigen()
117 const LinearSolver::PerSolveOptions& per_solve_options, in SolveUsingLAPACK() argument
121 if (per_solve_options.D != NULL) { in SolveUsingLAPACK()
124 A->AppendDiagonal(per_solve_options.D); in SolveUsingLAPACK()
138 if (per_solve_options.D != NULL) { in SolveUsingLAPACK()
H A Dlevenberg_marquardt_strategy.cc67 const TrustRegionStrategy::PerSolveOptions& per_solve_options, in ComputeStep() argument
92 solve_options.q_tolerance = per_solve_options.eta; in ComputeStep()
125 if (per_solve_options.dump_format_type == CONSOLE || in ComputeStep()
126 (per_solve_options.dump_format_type != CONSOLE && in ComputeStep()
127 !per_solve_options.dump_filename_base.empty())) { in ComputeStep()
128 if (!DumpLinearLeastSquaresProblem(per_solve_options.dump_filename_base, in ComputeStep()
129 per_solve_options.dump_format_type, in ComputeStep()
136 << " Filename base: " << per_solve_options.dump_filename_base; in ComputeStep()
H A Dconjugate_gradients_solver_test.cc65 LinearSolver::PerSolveOptions per_solve_options; in TEST() local
66 per_solve_options.r_tolerance = 1e-9; in TEST()
70 solver.Solve(A.get(), b.data(), per_solve_options, x.data()); in TEST()
121 LinearSolver::PerSolveOptions per_solve_options; in TEST() local
122 per_solve_options.r_tolerance = 1e-9; in TEST()
126 solver.Solve(A.get(), b.data(), per_solve_options, x.data()); in TEST()
H A Diterative_schur_complement_solver_test.cc90 LinearSolver::PerSolveOptions per_solve_options; in TestSolver() local
91 per_solve_options.D = D; in TestSolver()
93 qr->Solve(&dense_A, b_.get(), per_solve_options, reference_solution.data()); in TestSolver()
102 per_solve_options.r_tolerance = 1e-12; in TestSolver()
103 isc.Solve(A_.get(), b_.get(), per_solve_options, isc_sol.data()); in TestSolver()
H A Dschur_complement_solver.h127 const LinearSolver::PerSolveOptions& per_solve_options,
141 const LinearSolver::PerSolveOptions& per_solve_options,
164 const LinearSolver::PerSolveOptions& per_solve_options,
180 const LinearSolver::PerSolveOptions& per_solve_options,
183 const LinearSolver::PerSolveOptions& per_solve_options, double* solution);
H A Dconjugate_gradients_solver.cc66 const LinearSolver::PerSolveOptions& per_solve_options, in Solve() argument
95 const double tol_r = per_solve_options.r_tolerance * norm_b; in Solve()
115 if (per_solve_options.preconditioner != NULL) { in Solve()
117 per_solve_options.preconditioner->RightMultiply(r.data(), z.data()); in Solve()
217 if (zeta < per_solve_options.q_tolerance && in Solve()
224 per_solve_options.q_tolerance, in Solve()
H A Dsparse_normal_cholesky_solver.cc62 const LinearSolver::PerSolveOptions& per_solve_options, in SolveImpl() argument
78 if (per_solve_options.D != NULL) { in SolveImpl()
83 per_solve_options.D, A->block_structure()->cols)); in SolveImpl()
100 if (per_solve_options.D != NULL) { in SolveImpl()

123