Searched refs:elimination_groups (Results 1 - 12 of 12) sorted by relevance

/external/ceres-solver/internal/ceres/
H A Dschur_jacobi_preconditioner.cc52 CHECK_GT(options_.elimination_groups.size(), 1);
53 CHECK_GT(options_.elimination_groups[0], 0);
54 const int num_blocks = bs.cols.size() - options_.elimination_groups[0];
64 block_size_[i] = bs.cols[i + options_.elimination_groups[0]].size;
81 eliminator_options.elimination_groups = options_.elimination_groups;
84 DetectStructure(bs, options_.elimination_groups[0],
90 eliminator_->Init(options_.elimination_groups[0], &bs);
H A Diterative_schur_complement_solver.cc76 new ImplicitSchurComplement(options_.elimination_groups[0],
82 A->block_structure()->cols.size() - options_.elimination_groups[0];
117 preconditioner_options.elimination_groups = options_.elimination_groups;
H A Dvisibility_based_preconditioner.cc74 CHECK_GT(options_.elimination_groups.size(), 1);
75 CHECK_GT(options_.elimination_groups[0], 0);
79 num_blocks_ = bs.cols.size() - options_.elimination_groups[0];
87 block_size_[i] = bs.cols[i + options_.elimination_groups[0]].size;
138 ComputeVisibility(bs, options_.elimination_groups[0], &visibility);
156 ComputeVisibility(bs, options_.elimination_groups[0], &visibility);
236 const int num_eliminate_blocks = options_.elimination_groups[0];
314 eliminator_options.elimination_groups = options_.elimination_groups;
317 DetectStructure(bs, options_.elimination_groups[
[all...]
H A Diterative_schur_complement_solver_test.cc92 options.elimination_groups.push_back(num_eliminate_blocks_);
93 options.elimination_groups.push_back(0);
H A Dschur_complement_solver.h101 // respectively. LinearSolver::Options::elimination_groups[0] should be
107 CHECK_GT(options.elimination_groups.size(), 1);
108 CHECK_GT(options.elimination_groups[0], 0);
H A Dpreconditioner.h68 // For example if elimination_groups is a vector of size k, then
70 // parameter blocks 0 ... elimination_groups[0] - 1 first, and
71 // then elimination_groups[0] ... elimination_groups[1] - 1 and so
74 // solvers have differing requirements on elimination_groups.
81 vector<int> elimination_groups; member in struct:ceres::internal::Preconditioner::Options
H A Dschur_complement_solver_test.cc95 options.elimination_groups.push_back(num_eliminate_blocks);
96 options.elimination_groups.push_back(
H A Dschur_complement_solver.cc68 options_.elimination_groups[0],
73 eliminator_->Init(options_.elimination_groups[0], A->block_structure());
103 const int num_eliminate_blocks = options().elimination_groups[0];
178 const int num_eliminate_blocks = options().elimination_groups[0];
H A Dlinear_solver.h110 // For example if elimination_groups is a vector of size k, then
112 // parameter blocks 0 ... elimination_groups[0] - 1 first, and
113 // then elimination_groups[0] ... elimination_groups[1] - 1 and so
116 // solvers have differing requirements on elimination_groups.
123 vector<int> elimination_groups; member in struct:ceres::internal::LinearSolver::Options
H A Dimplicit_schur_complement_test.cc86 options.elimination_groups.push_back(num_eliminate_blocks_);
H A Dschur_eliminator_test.cc145 options.elimination_groups.push_back(num_eliminate_blocks);
H A Dsolver_impl.cc1267 linear_solver_options.elimination_groups.push_back(it->second.size());
1274 linear_solver_options.elimination_groups.size() == 1) {
1275 linear_solver_options.elimination_groups.push_back(0);

Completed in 317 milliseconds