| /external/ceres-solver/internal/ceres/ |
| D | schur_eliminator_test.cc | 74 num_eliminate_blocks = problem->num_eliminate_blocks; in SetupHelper()
78 for (int i = 0; i < num_eliminate_blocks; ++i) { in SetupHelper()
117 for (int i = 0; i < num_eliminate_blocks; ++i) { in ComputeReferenceSolution()
139 vector<int> blocks(num_col_blocks - num_eliminate_blocks, 0); in EliminateSolveAndCompare()
140 for (int i = num_eliminate_blocks; i < num_col_blocks; ++i) { in EliminateSolveAndCompare()
141 blocks[i - num_eliminate_blocks] = bs->cols[i].size; in EliminateSolveAndCompare()
152 options.elimination_groups.push_back(num_eliminate_blocks); in EliminateSolveAndCompare()
155 num_eliminate_blocks, in EliminateSolveAndCompare()
163 eliminator->Init(num_eliminate_blocks, A->block_structure()); in EliminateSolveAndCompare()
195 int num_eliminate_blocks; member in ceres::internal::SchurEliminatorTest
|
| D | schur_complement_solver.cc | 109 const int num_eliminate_blocks = options().elimination_groups[0]; in InitStorage() local
112 vector<int> blocks(num_col_blocks - num_eliminate_blocks, 0); in InitStorage()
113 for (int i = num_eliminate_blocks, j = 0; in InitStorage()
181 const int num_eliminate_blocks = options().elimination_groups[0]; in InitStorage() local
185 blocks_.resize(num_col_blocks - num_eliminate_blocks, 0); in InitStorage()
186 for (int i = num_eliminate_blocks; i < num_col_blocks; ++i) { in InitStorage()
187 blocks_[i - num_eliminate_blocks] = bs->cols[i].size; in InitStorage()
198 if (e_block_id >= num_eliminate_blocks) { in InitStorage()
215 f_blocks.push_back(cell.block_id - num_eliminate_blocks); in InitStorage()
232 CHECK_GE(row.cells.front().block_id, num_eliminate_blocks); in InitStorage()
[all …]
|
| D | linear_least_squares_problems.cc | 118 problem->num_eliminate_blocks = 0; in CreateLinearLeastSquaresProblemFromFile()
120 problem->num_eliminate_blocks = problem_proto.num_eliminate_blocks(); in CreateLinearLeastSquaresProblemFromFile()
260 problem->num_eliminate_blocks = 2; in LinearLeastSquaresProblem1()
363 problem->num_eliminate_blocks = 2; in LinearLeastSquaresProblem2()
497 problem->num_eliminate_blocks = 2; in LinearLeastSquaresProblem3()
582 int num_eliminate_blocks) { in DumpLinearLeastSquaresProblemToConsole() argument
610 int num_eliminate_blocks) { in DumpLinearLeastSquaresProblemToProtocolBuffer() argument
633 lsqp.set_num_eliminate_blocks(num_eliminate_blocks); in DumpLinearLeastSquaresProblemToProtocolBuffer()
650 int num_eliminate_blocks) { in DumpLinearLeastSquaresProblemToProtocolBuffer() argument
677 int num_eliminate_blocks) { in DumpLinearLeastSquaresProblemToTextFile() argument
[all …]
|
| D | visibility_test.cc | 55 int num_eliminate_blocks = 2; in TEST() local
100 ComputeVisibility(bs, num_eliminate_blocks, &visibility); in TEST()
101 ASSERT_EQ(visibility.size(), num_cols - num_eliminate_blocks); in TEST()
135 int num_eliminate_blocks = 2; in TEST() local
176 ComputeVisibility(bs, num_eliminate_blocks, &visibility); in TEST()
177 ASSERT_EQ(visibility.size(), num_cols - num_eliminate_blocks); in TEST()
|
| D | linear_least_squares_problems.h | 47 : A(NULL), b(NULL), D(NULL), num_eliminate_blocks(0), in LinearLeastSquaresProblem()
56 int num_eliminate_blocks; member
83 int num_eliminate_blocks);
|
| D | schur_complement_solver_test.cc | 60 num_eliminate_blocks = problem->num_eliminate_blocks; in SetUpFromProblemId()
101 options.elimination_groups.push_back(num_eliminate_blocks); in ComputeAndCompareSolutions()
103 A->block_structure()->cols.size() - num_eliminate_blocks); in ComputeAndCompareSolutions()
130 int num_eliminate_blocks; member in ceres::internal::SchurComplementSolverTest
|
| D | block_jacobian_writer.cc | 57 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()
|
| D | visibility.cc | 46 const int num_eliminate_blocks, in ComputeVisibility() argument
53 visibility->resize(block_structure.cols.size() - num_eliminate_blocks); in ComputeVisibility()
59 if (block_id >= num_eliminate_blocks) { in ComputeVisibility()
64 int camera_block_id = cells[j].block_id - num_eliminate_blocks; in ComputeVisibility()
|
| D | solver_impl.cc | 401 const int num_eliminate_blocks = in Solve() local
405 if (!LexicographicallyOrderResidualBlocks(num_eliminate_blocks, in Solve()
702 const int num_eliminate_blocks = ComputeSchurOrdering(*transformed_program, in CreateReducedProgram() local
711 (i < num_eliminate_blocks) ? 0 : 1); in CreateReducedProgram()
935 int num_eliminate_blocks) { in MinParameterBlock() argument
936 int min_parameter_block_position = num_eliminate_blocks; in MinParameterBlock()
953 bool SolverImpl::LexicographicallyOrderResidualBlocks(const int num_eliminate_blocks, in LexicographicallyOrderResidualBlocks() argument
956 CHECK_GE(num_eliminate_blocks, 1) in LexicographicallyOrderResidualBlocks()
962 vector<int> residual_blocks_per_e_block(num_eliminate_blocks + 1); in LexicographicallyOrderResidualBlocks()
967 int position = MinParameterBlock(residual_block, num_eliminate_blocks); in LexicographicallyOrderResidualBlocks()
[all …]
|
| D | evaluator.h | 60 num_eliminate_blocks(-1), in Options()
64 int num_eliminate_blocks; member
|
| D | visibility_based_preconditioner.cc | 257 const int num_eliminate_blocks = options_.elimination_groups[0]; in ComputeBlockPairsInPreconditioner() local
275 if (e_block_id >= num_eliminate_blocks) { in ComputeBlockPairsInPreconditioner()
292 const int f_block_id = cell.block_id - num_eliminate_blocks; in ComputeBlockPairsInPreconditioner()
314 CHECK_GE(row.cells.front().block_id, num_eliminate_blocks); in ComputeBlockPairsInPreconditioner()
316 const int block1 = row.cells[i].block_id - num_eliminate_blocks; in ComputeBlockPairsInPreconditioner()
318 const int block2 = row.cells[j].block_id - num_eliminate_blocks; in ComputeBlockPairsInPreconditioner()
|
| D | detect_structure.cc | 39 const int num_eliminate_blocks, in DetectStructure() argument
54 if (row.cells.front().block_id >= num_eliminate_blocks) { in DetectStructure()
|
| D | schur_eliminator.h | 174 virtual void Init(int num_eliminate_blocks,
227 virtual void Init(int num_eliminate_blocks,
|
| D | detect_structure.h | 55 const int num_eliminate_blocks,
|
| D | visibility.h | 56 int num_eliminate_blocks,
|
| D | implicit_schur_complement.cc | 44 ImplicitSchurComplement::ImplicitSchurComplement(int num_eliminate_blocks, in ImplicitSchurComplement() argument
46 : num_eliminate_blocks_(num_eliminate_blocks), in ImplicitSchurComplement()
|
| D | implicit_schur_complement.h | 100 ImplicitSchurComplement(int num_eliminate_blocks, bool preconditioner);
|
| D | solver_impl.h | 91 const int num_eliminate_blocks,
|
| D | iterative_schur_complement_solver_test.cc | 72 num_eliminate_blocks_ = problem->num_eliminate_blocks; in SetUp()
|
| D | matrix.proto | 138 // bi-partite structure, then num_eliminate_blocks is the number of
142 optional int32 num_eliminate_blocks = 5; field
|
| D | implicit_schur_complement_test.cc | 68 num_eliminate_blocks_ = problem->num_eliminate_blocks; in SetUp()
|
| D | schur_eliminator_impl.h | 75 Init(int num_eliminate_blocks, const CompressedRowBlockStructure* bs) { in Init() argument
76 CHECK_GT(num_eliminate_blocks, 0) in Init()
80 num_eliminate_blocks_ = num_eliminate_blocks; in Init()
|
| D | partitioned_matrix_view_test.cc | 59 num_eliminate_blocks_ = problem->num_eliminate_blocks; in SetUp()
|
| D | coordinate_descent_minimizer.cc | 115 evaluator_options_.num_eliminate_blocks = 0; in Init()
|
| D | evaluator_test.cc | 163 options.num_eliminate_blocks = GetParam().second; in CreateEvaluator()
634 options.num_eliminate_blocks = 0; in TEST()
|