| /external/ceres-solver/internal/ceres/ |
| 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_test.cc | 57 int num_eliminate_blocks = 2; local
102 ComputeVisibility(bs, num_eliminate_blocks, &visibility);
103 ASSERT_EQ(visibility.size(), num_cols - num_eliminate_blocks);
137 int num_eliminate_blocks = 2; local
178 ComputeVisibility(bs, num_eliminate_blocks, &visibility);
179 ASSERT_EQ(visibility.size(), num_cols - num_eliminate_blocks);
|
| evaluator.h | 63 num_eliminate_blocks(-1),
67 int num_eliminate_blocks; member in struct:ceres::internal::Evaluator::Options
|
| 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
|
| schur_complement_solver.cc | 103 const int num_eliminate_blocks = options().elimination_groups[0]; local
106 vector<int> blocks(num_col_blocks - num_eliminate_blocks, 0);
107 for (int i = num_eliminate_blocks, j = 0;
178 const int num_eliminate_blocks = options().elimination_groups[0]; local
182 blocks_.resize(num_col_blocks - num_eliminate_blocks, 0);
183 for (int i = num_eliminate_blocks; i < num_col_blocks; ++i) {
184 blocks_[i - num_eliminate_blocks] = bs->cols[i].size;
195 if (e_block_id >= num_eliminate_blocks) {
212 f_blocks.push_back(cell.block_id - num_eliminate_blocks);
229 CHECK_GE(row.cells.front().block_id, num_eliminate_blocks);
[all...] |
| 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...] |
| visibility_based_preconditioner.cc | 236 const int num_eliminate_blocks = options_.elimination_groups[0]; local
254 if (e_block_id >= num_eliminate_blocks) {
271 const int f_block_id = cell.block_id - num_eliminate_blocks;
293 CHECK_GE(row.cells.front().block_id, num_eliminate_blocks);
295 const int block1 = row.cells[i].block_id - num_eliminate_blocks;
297 const int block2 = row.cells[j].block_id - num_eliminate_blocks;
|
| solver_impl.cc | 1597 const int num_eliminate_blocks = local
1671 const int num_eliminate_blocks = local
[all...] |
