Home
last modified time | relevance | path

Searched refs:num_eliminate_blocks (Results 1 – 25 of 25) sorted by relevance

/external/ceres-solver/internal/ceres/
Dschur_eliminator_test.cc67 num_eliminate_blocks = problem->num_eliminate_blocks; in SetupHelper()
71 for (int i = 0; i < num_eliminate_blocks; ++i) { in SetupHelper()
110 for (int i = 0; i < num_eliminate_blocks; ++i) { in ComputeReferenceSolution()
132 vector<int> blocks(num_col_blocks - num_eliminate_blocks, 0); in EliminateSolveAndCompare()
133 for (int i = num_eliminate_blocks; i < num_col_blocks; ++i) { in EliminateSolveAndCompare()
134 blocks[i - num_eliminate_blocks] = bs->cols[i].size; in EliminateSolveAndCompare()
145 options.elimination_groups.push_back(num_eliminate_blocks); in EliminateSolveAndCompare()
148 num_eliminate_blocks, in EliminateSolveAndCompare()
156 eliminator->Init(num_eliminate_blocks, A->block_structure()); in EliminateSolveAndCompare()
188 int num_eliminate_blocks; member in ceres::internal::SchurEliminatorTest
Dreorder_program.cc60 int num_eliminate_blocks) { in MinParameterBlock() argument
61 int min_parameter_block_position = num_eliminate_blocks; in MinParameterBlock()
181 bool LexicographicallyOrderResidualBlocks(const int num_eliminate_blocks, in LexicographicallyOrderResidualBlocks() argument
184 CHECK_GE(num_eliminate_blocks, 1) in LexicographicallyOrderResidualBlocks()
190 vector<int> residual_blocks_per_e_block(num_eliminate_blocks + 1); in LexicographicallyOrderResidualBlocks()
195 int position = MinParameterBlock(residual_block, num_eliminate_blocks); in LexicographicallyOrderResidualBlocks()
197 DCHECK_LE(position, num_eliminate_blocks); in LexicographicallyOrderResidualBlocks()
204 vector<int> offsets(num_eliminate_blocks + 1); in LexicographicallyOrderResidualBlocks()
243 for (int i = 0; i < num_eliminate_blocks; ++i) { in LexicographicallyOrderResidualBlocks()
324 const int num_eliminate_blocks = in ReorderProgramForSchurTypeLinearSolver() local
[all …]
Dschur_complement_solver.cc100 const int num_eliminate_blocks = options().elimination_groups[0]; in InitStorage() local
103 vector<int> blocks(num_col_blocks - num_eliminate_blocks, 0); in InitStorage()
104 for (int i = num_eliminate_blocks, j = 0; in InitStorage()
184 const int num_eliminate_blocks = options().elimination_groups[0]; in InitStorage() local
188 blocks_.resize(num_col_blocks - num_eliminate_blocks, 0); in InitStorage()
189 for (int i = num_eliminate_blocks; i < num_col_blocks; ++i) { in InitStorage()
190 blocks_[i - num_eliminate_blocks] = bs->cols[i].size; in InitStorage()
201 if (e_block_id >= num_eliminate_blocks) { in InitStorage()
218 f_blocks.push_back(cell.block_id - num_eliminate_blocks); in InitStorage()
235 CHECK_GE(row.cells.front().block_id, num_eliminate_blocks); in InitStorage()
[all …]
Dvisibility_test.cc60 int num_eliminate_blocks = 2; in TEST() local
105 ComputeVisibility(bs, num_eliminate_blocks, &visibility); in TEST()
106 ASSERT_EQ(visibility.size(), num_cols - num_eliminate_blocks); in TEST()
140 int num_eliminate_blocks = 2; in TEST() local
181 ComputeVisibility(bs, num_eliminate_blocks, &visibility); in TEST()
182 ASSERT_EQ(visibility.size(), num_cols - num_eliminate_blocks); in TEST()
Dlinear_least_squares_problems.h47 : A(NULL), b(NULL), D(NULL), num_eliminate_blocks(0), in LinearLeastSquaresProblem()
56 int num_eliminate_blocks; member
80 int num_eliminate_blocks);
Dblock_jacobian_writer.cc57 int num_eliminate_blocks, in BuildJacobianLayout() argument
78 if (parameter_block->index() < num_eliminate_blocks) { in BuildJacobianLayout()
109 if (parameter_block_index < num_eliminate_blocks) { in BuildJacobianLayout()
126 CHECK_GE(options.num_eliminate_blocks, 0) in BlockJacobianWriter()
130 options.num_eliminate_blocks, in BlockJacobianWriter()
Dvisibility.cc53 const int num_eliminate_blocks, in ComputeVisibility() argument
60 visibility->resize(block_structure.cols.size() - num_eliminate_blocks); in ComputeVisibility()
66 if (block_id >= num_eliminate_blocks) { in ComputeVisibility()
71 int camera_block_id = cells[j].block_id - num_eliminate_blocks; in ComputeVisibility()
Dschur_complement_solver_test.cc60 num_eliminate_blocks = problem->num_eliminate_blocks; in SetUpFromProblemId()
95 options.elimination_groups.push_back(num_eliminate_blocks); in ComputeAndCompareSolutions()
97 A->block_structure()->cols.size() - num_eliminate_blocks); in ComputeAndCompareSolutions()
128 int num_eliminate_blocks; member in ceres::internal::SchurComplementSolverTest
Devaluator_test.cc97 int num_eliminate_blocks, in EvaluatorTestOptions()
100 num_eliminate_blocks(num_eliminate_blocks), in EvaluatorTestOptions()
104 int num_eliminate_blocks; member
124 GetParam().num_eliminate_blocks); in CreateEvaluator()
129 options.num_eliminate_blocks = GetParam().num_eliminate_blocks; in CreateEvaluator()
603 options.num_eliminate_blocks = 0; in TEST()
Dlinear_least_squares_problems.cc190 problem->num_eliminate_blocks = 2; in LinearLeastSquaresProblem1()
293 problem->num_eliminate_blocks = 2; in LinearLeastSquaresProblem2()
427 problem->num_eliminate_blocks = 2; in LinearLeastSquaresProblem3()
511 int num_eliminate_blocks) { in DumpLinearLeastSquaresProblemToConsole() argument
550 int num_eliminate_blocks) { in DumpLinearLeastSquaresProblemToTextFile() argument
611 int num_eliminate_blocks) { in DumpLinearLeastSquaresProblem() argument
615 num_eliminate_blocks); in DumpLinearLeastSquaresProblem()
619 num_eliminate_blocks); in DumpLinearLeastSquaresProblem()
Diterative_schur_complement_solver.cc73 const int num_eliminate_blocks = options_.elimination_groups[0]; in SolveImpl() local
77 num_eliminate_blocks, in SolveImpl()
86 A->block_structure()->cols.size() - num_eliminate_blocks; in SolveImpl()
Devaluator.h63 num_eliminate_blocks(-1), in Options()
68 int num_eliminate_blocks; member
Dvisibility_based_preconditioner.cc254 const int num_eliminate_blocks = options_.elimination_groups[0]; in ComputeBlockPairsInPreconditioner() local
272 if (e_block_id >= num_eliminate_blocks) { in ComputeBlockPairsInPreconditioner()
289 const int f_block_id = cell.block_id - num_eliminate_blocks; in ComputeBlockPairsInPreconditioner()
311 CHECK_GE(row.cells.front().block_id, num_eliminate_blocks); in ComputeBlockPairsInPreconditioner()
313 const int block1 = row.cells[i].block_id - num_eliminate_blocks; in ComputeBlockPairsInPreconditioner()
315 const int block2 = row.cells[j].block_id - num_eliminate_blocks; in ComputeBlockPairsInPreconditioner()
Ddetect_structure.cc39 const int num_eliminate_blocks, in DetectStructure() argument
54 if (row.cells.front().block_id >= num_eliminate_blocks) { in DetectStructure()
Dschur_eliminator.h174 virtual void Init(int num_eliminate_blocks,
227 virtual void Init(int num_eliminate_blocks,
Ddetect_structure.h55 const int num_eliminate_blocks,
Dvisibility.h61 int num_eliminate_blocks,
Dreorder_program.h54 bool LexicographicallyOrderResidualBlocks(int num_eliminate_blocks,
Diterative_schur_complement_solver_test.cc72 num_eliminate_blocks_ = problem->num_eliminate_blocks; in SetUpProblem()
Dimplicit_schur_complement_test.cc68 num_eliminate_blocks_ = problem->num_eliminate_blocks; in SetUp()
Dschur_eliminator_impl.h81 Init(int num_eliminate_blocks, const CompressedRowBlockStructure* bs) { in Init() argument
82 CHECK_GT(num_eliminate_blocks, 0) in Init()
86 num_eliminate_blocks_ = num_eliminate_blocks; in Init()
Dpartitioned_matrix_view_test.cc60 num_eliminate_blocks_ = problem->num_eliminate_blocks; in SetUp()
Dcoordinate_descent_minimizer.cc115 evaluator_options_.num_eliminate_blocks = 0; in Init()
Dsolver_impl.cc895 evaluator_options.num_eliminate_blocks = in CreateEvaluator()
/external/ceres-solver/docs/source/
Dversion_history.rst542 options.num_eliminate_blocks = num_points;