| /external/ceres-solver/internal/ceres/ |
| 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...] |
| 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);
|
| 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...] |
| 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,
|
| 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
|
| 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);
|
| visibility.cc | 46 const int num_eliminate_blocks,
53 visibility->resize(block_structure.cols.size() - num_eliminate_blocks);
59 if (block_id >= num_eliminate_blocks) {
64 int camera_block_id = cells[j].block_id - num_eliminate_blocks;
|
| linear_least_squares_problems.cc | 118 problem->num_eliminate_blocks = 0;
120 problem->num_eliminate_blocks = problem_proto.num_eliminate_blocks();
260 problem->num_eliminate_blocks = 2;
363 problem->num_eliminate_blocks = 2;
497 problem->num_eliminate_blocks = 2;
582 int num_eliminate_blocks) {
610 int num_eliminate_blocks) {
633 lsqp.set_num_eliminate_blocks(num_eliminate_blocks);
650 int 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.h | 50 // first num_eliminate_blocks columns blocks are e_blocks and the rest
56 int num_eliminate_blocks,
|
| solver_impl.h | 60 // options.num_eliminate_blocks set appropriately.
91 const int num_eliminate_blocks,
113 // num_eliminate_blocks, since removed parameters changes the point
|
| detect_structure.h | 55 const int num_eliminate_blocks,
|
| detect_structure.cc | 39 const int num_eliminate_blocks,
54 if (row.cells.front().block_id >= num_eliminate_blocks) {
|
| evaluator.h | 60 num_eliminate_blocks(-1),
64 int num_eliminate_blocks; member in struct:ceres::internal::Evaluator::Options
|
| implicit_schur_complement.h | 91 // num_eliminate_blocks is the number of E blocks in the matrix
100 ImplicitSchurComplement(int num_eliminate_blocks, bool preconditioner);
|
| matrix.proto | 138 // bi-partite structure, then num_eliminate_blocks is the number of
142 optional int32 num_eliminate_blocks = 5;
|
| evaluator_test.cc | 32 // solver and num_eliminate_blocks (for schur-based solvers).
160 << " and num_eliminate_blocks: " << GetParam().second;
163 options.num_eliminate_blocks = GetParam().second;
570 // argument is num_eliminate_blocks. Changing the num_eliminate_blocks only
573 // Try all values of num_eliminate_blocks that make sense given that in the
634 options.num_eliminate_blocks = 0;
|
| iterative_schur_complement_solver_test.cc | 72 num_eliminate_blocks_ = problem->num_eliminate_blocks;
|
| implicit_schur_complement.cc | 44 ImplicitSchurComplement::ImplicitSchurComplement(int num_eliminate_blocks,
46 : num_eliminate_blocks_(num_eliminate_blocks),
|
| 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;
|
| visibility_based_preconditioner.h | 133 // options.num_eliminate_blocks = num_points;
150 // LinearSolver::Options::num_eliminate_blocks should be set to the
|
| implicit_schur_complement_test.cc | 68 num_eliminate_blocks_ = problem->num_eliminate_blocks;
|
| partitioned_matrix_view_test.cc | 59 num_eliminate_blocks_ = problem->num_eliminate_blocks;
|
| schur_eliminator.h | 174 virtual void Init(int num_eliminate_blocks,
227 virtual void Init(int num_eliminate_blocks,
|
| coordinate_descent_minimizer.cc | 115 evaluator_options_.num_eliminate_blocks = 0;
|
