| /external/ceres-solver/internal/ceres/ |
| detect_structure.h | 55 const int num_eliminate_blocks,
|
| linear_least_squares_problems.h | 47 : A(NULL), b(NULL), D(NULL), num_eliminate_blocks(0),
56 int num_eliminate_blocks; member in struct:ceres::internal::LinearLeastSquaresProblem
80 int num_eliminate_blocks);
|
| visibility.h | 55 // first num_eliminate_blocks columns blocks are e_blocks and the rest
61 int num_eliminate_blocks,
|
| schur_eliminator_test.cc | 67 num_eliminate_blocks = problem->num_eliminate_blocks;
71 for (int i = 0; i < num_eliminate_blocks; ++i) {
110 for (int i = 0; i < num_eliminate_blocks; ++i) {
132 vector<int> blocks(num_col_blocks - num_eliminate_blocks, 0);
133 for (int i = num_eliminate_blocks; i < num_col_blocks; ++i) {
134 blocks[i - num_eliminate_blocks] = bs->cols[i].size;
145 options.elimination_groups.push_back(num_eliminate_blocks);
148 num_eliminate_blocks,
156 eliminator->Init(num_eliminate_blocks, A->block_structure())
188 int num_eliminate_blocks; member in class:ceres::internal::SchurEliminatorTest
[all...] |
| reorder_program.cc | 57 // Parameter blocks that have indices greater than num_eliminate_blocks are
58 // considered to have an index equal to num_eliminate_blocks.
60 int num_eliminate_blocks) {
61 int min_parameter_block_position = num_eliminate_blocks;
181 bool LexicographicallyOrderResidualBlocks(const int num_eliminate_blocks,
184 CHECK_GE(num_eliminate_blocks, 1)
190 vector<int> residual_blocks_per_e_block(num_eliminate_blocks + 1);
195 int position = MinParameterBlock(residual_block, num_eliminate_blocks);
197 DCHECK_LE(position, num_eliminate_blocks);
204 vector<int> offsets(num_eliminate_blocks + 1)
324 const int num_eliminate_blocks = local
362 const int num_eliminate_blocks = local
[all...] |
| reorder_program.h | 54 bool LexicographicallyOrderResidualBlocks(int num_eliminate_blocks,
|
| visibility.cc | 53 const int num_eliminate_blocks,
60 visibility->resize(block_structure.cols.size() - num_eliminate_blocks);
66 if (block_id >= num_eliminate_blocks) {
71 int camera_block_id = cells[j].block_id - num_eliminate_blocks;
|
| evaluator.h | 63 num_eliminate_blocks(-1),
68 int num_eliminate_blocks; member in struct:ceres::internal::Evaluator::Options
|
| block_jacobian_writer.cc | 51 // the first num_eliminate_blocks parameter blocks as indicated by the parameter
55 // instead of num_eliminate_blocks.
57 int num_eliminate_blocks,
78 if (parameter_block->index() < num_eliminate_blocks) {
109 if (parameter_block_index < num_eliminate_blocks) {
126 CHECK_GE(options.num_eliminate_blocks, 0)
127 << "num_eliminate_blocks must be greater than 0.";
130 options.num_eliminate_blocks,
|
| iterative_schur_complement_solver.cc | 73 const int num_eliminate_blocks = options_.elimination_groups[0]; local
77 num_eliminate_blocks,
86 A->block_structure()->cols.size() - num_eliminate_blocks;
|
| schur_complement_solver.cc | 100 const int num_eliminate_blocks = options().elimination_groups[0]; local
103 vector<int> blocks(num_col_blocks - num_eliminate_blocks, 0);
104 for (int i = num_eliminate_blocks, j = 0;
184 const int num_eliminate_blocks = options().elimination_groups[0]; local
188 blocks_.resize(num_col_blocks - num_eliminate_blocks, 0);
189 for (int i = num_eliminate_blocks; i < num_col_blocks; ++i) {
190 blocks_[i - num_eliminate_blocks] = bs->cols[i].size;
201 if (e_block_id >= num_eliminate_blocks) {
218 f_blocks.push_back(cell.block_id - num_eliminate_blocks);
235 CHECK_GE(row.cells.front().block_id, num_eliminate_blocks);
[all...] |
| detect_structure.cc | 39 const int num_eliminate_blocks,
54 if (row.cells.front().block_id >= num_eliminate_blocks) {
|
| schur_eliminator.h | 174 virtual void Init(int num_eliminate_blocks,
227 virtual void Init(int num_eliminate_blocks,
|
| visibility_test.cc | 60 int num_eliminate_blocks = 2; local
105 ComputeVisibility(bs, num_eliminate_blocks, &visibility);
106 ASSERT_EQ(visibility.size(), num_cols - num_eliminate_blocks);
140 int num_eliminate_blocks = 2; local
181 ComputeVisibility(bs, num_eliminate_blocks, &visibility);
182 ASSERT_EQ(visibility.size(), num_cols - num_eliminate_blocks);
|
| schur_complement_solver_test.cc | 60 num_eliminate_blocks = problem->num_eliminate_blocks;
95 options.elimination_groups.push_back(num_eliminate_blocks);
97 A->block_structure()->cols.size() - num_eliminate_blocks);
128 int num_eliminate_blocks; member in class:ceres::internal::SchurComplementSolverTest
|
| evaluator_test.cc | 32 // solver and num_eliminate_blocks (for schur-based solvers).
97 int num_eliminate_blocks,
100 num_eliminate_blocks(num_eliminate_blocks),
104 int num_eliminate_blocks; member in struct:ceres::internal::EvaluatorTestOptions
123 StringAppendF(&report, " and num_eliminate_blocks: %d",
124 GetParam().num_eliminate_blocks);
129 options.num_eliminate_blocks = GetParam().num_eliminate_blocks;
537 // argument is num_eliminate_blocks. Changing the num_eliminate_blocks onl
[all...] |
| linear_least_squares_problems.cc | 190 problem->num_eliminate_blocks = 2;
293 problem->num_eliminate_blocks = 2;
427 problem->num_eliminate_blocks = 2;
511 int num_eliminate_blocks) {
550 int num_eliminate_blocks) {
611 int num_eliminate_blocks) {
615 num_eliminate_blocks);
619 num_eliminate_blocks);
|
| visibility_based_preconditioner.cc | 254 const int num_eliminate_blocks = options_.elimination_groups[0]; local
272 if (e_block_id >= num_eliminate_blocks) {
289 const int f_block_id = cell.block_id - num_eliminate_blocks;
311 CHECK_GE(row.cells.front().block_id, num_eliminate_blocks);
313 const int block1 = row.cells[i].block_id - num_eliminate_blocks;
315 const int block2 = row.cells[j].block_id - num_eliminate_blocks;
|
| iterative_schur_complement_solver_test.cc | 72 num_eliminate_blocks_ = problem->num_eliminate_blocks;
|
| implicit_schur_complement_test.cc | 68 num_eliminate_blocks_ = problem->num_eliminate_blocks;
|
| coordinate_descent_minimizer.cc | 115 evaluator_options_.num_eliminate_blocks = 0;
|
| partitioned_matrix_view_test.cc | 60 num_eliminate_blocks_ = problem->num_eliminate_blocks;
|
| schur_eliminator_impl.h | 81 Init(int num_eliminate_blocks, const CompressedRowBlockStructure* bs) {
82 CHECK_GT(num_eliminate_blocks, 0)
84 << "num_eliminate_blocks = 0.";
86 num_eliminate_blocks_ = num_eliminate_blocks;
|
| solver_impl.cc | [all...] |
