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

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

Completed in 863 milliseconds