| /external/ceres-solver/internal/ceres/ |
| H A D | 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);
|
| H A D | 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);
|
| H A D | detect_structure.cc | 39 const int num_eliminate_blocks,
54 if (row.cells.front().block_id >= num_eliminate_blocks) {
38 DetectStructure(const CompressedRowBlockStructure& bs, const int num_eliminate_blocks, int* row_block_size, int* e_block_size, int* f_block_size) argument
|
| H A D | evaluator.h | 63 num_eliminate_blocks(-1),
67 int num_eliminate_blocks; member in struct:ceres::internal::Evaluator::Options
|
| H A D | implicit_schur_complement.cc | 44 ImplicitSchurComplement::ImplicitSchurComplement(int num_eliminate_blocks, argument
46 : num_eliminate_blocks_(num_eliminate_blocks),
|
| H A D | 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
|
| H A D | visibility.cc | 50 const int num_eliminate_blocks,
57 visibility->resize(block_structure.cols.size() - num_eliminate_blocks);
63 if (block_id >= num_eliminate_blocks) {
68 int camera_block_id = cells[j].block_id - num_eliminate_blocks;
49 ComputeVisibility(const CompressedRowBlockStructure& block_structure, const int num_eliminate_blocks, vector< set<int> >* visibility) argument
|
| H A D | 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,
56 BuildJacobianLayout(const Program& program, int num_eliminate_blocks, vector<int*>* jacobian_layout, vector<int>* jacobian_layout_storage) argument
|
| H A D | 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);
507 DumpLinearLeastSquaresProblemToConsole(const SparseMatrix* A, const double* D, const double* b, const double* x, int num_eliminate_blocks) argument
545 DumpLinearLeastSquaresProblemToTextFile(const string& filename_base, const SparseMatrix* A, const double* D, const double* b, const double* x, int num_eliminate_blocks) argument
605 DumpLinearLeastSquaresProblem(const string& filename_base, DumpFormatType dump_format_type, const SparseMatrix* A, const double* D, const double* b, const double* x, int num_eliminate_blocks) argument
|
| H A D | 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...] |
| H A D | 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,
188 int num_eliminate_blocks; member in class:ceres::internal::SchurEliminatorTest
[all...] |
| H A D | schur_eliminator_impl.h | 78 Init(int num_eliminate_blocks, const CompressedRowBlockStructure* bs) { argument
79 CHECK_GT(num_eliminate_blocks, 0)
81 << "num_eliminate_blocks = 0.";
83 num_eliminate_blocks_ = num_eliminate_blocks;
|
| H A D | 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;
|
| H A D | solver_impl.cc | 971 // num_eliminate_blocks.
1283 // Parameter blocks that have indices greater than num_eliminate_blocks are
1284 // considered to have an index equal to num_eliminate_blocks.
1286 int num_eliminate_blocks) {
1287 int min_parameter_block_position = num_eliminate_blocks;
1305 const int num_eliminate_blocks,
1308 CHECK_GE(num_eliminate_blocks, 1)
1314 vector<int> residual_blocks_per_e_block(num_eliminate_blocks + 1);
1319 int position = MinParameterBlock(residual_block, num_eliminate_blocks);
1321 DCHECK_LE(position, num_eliminate_blocks);
1285 MinParameterBlock(const ResidualBlock* residual_block, int num_eliminate_blocks) argument
1304 LexicographicallyOrderResidualBlocks( const int num_eliminate_blocks, Program* program, string* error) argument
1597 const int num_eliminate_blocks = local
1671 const int num_eliminate_blocks = local
[all...] |