| /external/ceres-solver/internal/ceres/ |
| evaluator.h | 60 num_eliminate_blocks(-1),
64 int num_eliminate_blocks; member in struct:ceres::internal::Evaluator::Options
|
| 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
83 int num_eliminate_blocks);
|
| visibility_test.cc | 55 int num_eliminate_blocks = 2; local
100 ComputeVisibility(bs, num_eliminate_blocks, &visibility);
101 ASSERT_EQ(visibility.size(), num_cols - num_eliminate_blocks);
135 int num_eliminate_blocks = 2; local
176 ComputeVisibility(bs, num_eliminate_blocks, &visibility);
177 ASSERT_EQ(visibility.size(), num_cols - num_eliminate_blocks);
|
| schur_complement_solver_test.cc | 60 num_eliminate_blocks = problem->num_eliminate_blocks;
101 options.elimination_groups.push_back(num_eliminate_blocks);
103 A->block_structure()->cols.size() - num_eliminate_blocks);
130 int num_eliminate_blocks; member in class:ceres::internal::SchurComplementSolverTest
|
| schur_eliminator_test.cc | 74 num_eliminate_blocks = problem->num_eliminate_blocks;
78 for (int i = 0; i < num_eliminate_blocks; ++i) {
117 for (int i = 0; i < num_eliminate_blocks; ++i) {
139 vector<int> blocks(num_col_blocks - num_eliminate_blocks, 0);
140 for (int i = num_eliminate_blocks; i < num_col_blocks; ++i) {
141 blocks[i - num_eliminate_blocks] = bs->cols[i].size;
152 options.elimination_groups.push_back(num_eliminate_blocks);
155 num_eliminate_blocks,
163 eliminator->Init(num_eliminate_blocks, A->block_structure())
195 int num_eliminate_blocks; member in class:ceres::internal::SchurEliminatorTest
[all...] |
| schur_complement_solver.cc | 109 const int num_eliminate_blocks = options().elimination_groups[0]; local
112 vector<int> blocks(num_col_blocks - num_eliminate_blocks, 0);
113 for (int i = num_eliminate_blocks, j = 0;
181 const int num_eliminate_blocks = options().elimination_groups[0]; local
185 blocks_.resize(num_col_blocks - num_eliminate_blocks, 0);
186 for (int i = num_eliminate_blocks; i < num_col_blocks; ++i) {
187 blocks_[i - num_eliminate_blocks] = bs->cols[i].size;
198 if (e_block_id >= num_eliminate_blocks) {
215 f_blocks.push_back(cell.block_id - num_eliminate_blocks);
232 CHECK_GE(row.cells.front().block_id, num_eliminate_blocks);
[all...] |
| solver_impl.cc | 401 const int num_eliminate_blocks = local
405 if (!LexicographicallyOrderResidualBlocks(num_eliminate_blocks,
575 // num_eliminate_blocks.
702 const int num_eliminate_blocks = ComputeSchurOrdering(*transformed_program, local
711 (i < num_eliminate_blocks) ? 0 : 1);
[all...] |
| visibility_based_preconditioner.cc | 257 const int num_eliminate_blocks = options_.elimination_groups[0]; local
275 if (e_block_id >= num_eliminate_blocks) {
292 const int f_block_id = cell.block_id - num_eliminate_blocks;
314 CHECK_GE(row.cells.front().block_id, num_eliminate_blocks);
316 const int block1 = row.cells[i].block_id - num_eliminate_blocks;
318 const int block2 = row.cells[j].block_id - num_eliminate_blocks;
|
