| /external/ceres-solver/internal/ceres/ |
| H A D | generate_eliminator_specialization.py | 155 FACTORY_CONDITIONAL = """ if ((options.row_block_size == %s) &&
165 << options.row_block_size << ","
182 def SpecializationFilename(prefix, row_block_size, e_block_size, f_block_size):
183 return "_".join([prefix] + map(SuffixForSize, (row_block_size,
196 for row_block_size, e_block_size, f_block_size in SPECIALIZATIONS:
198 row_block_size,
205 if (row_block_size == "Eigen::Dynamic" and
210 fptr.write(template % (row_block_size, e_block_size, f_block_size))
213 f.write(FACTORY_CONDITIONAL % (row_block_size,
216 row_block_size,
[all...] |
| H A D | schur_eliminator.cc | 53 if ((options.row_block_size == 2) &&
58 if ((options.row_block_size == 2) &&
63 if ((options.row_block_size == 2) &&
68 if ((options.row_block_size == 2) &&
73 if ((options.row_block_size == 2) &&
78 if ((options.row_block_size == 2) &&
83 if ((options.row_block_size == 2) &&
88 if ((options.row_block_size == 2) &&
93 if ((options.row_block_size == 2) &&
98 if ((options.row_block_size
[all...] |
| H A D | detect_structure.h | 56 int* row_block_size,
|
| H A D | detect_structure.cc | 40 int* row_block_size,
44 *row_block_size = 0;
59 if (*row_block_size == 0) {
60 *row_block_size = row.block.size;
61 } else if (*row_block_size != Eigen::Dynamic &&
62 *row_block_size != row.block.size) {
64 << *row_block_size << " to "
66 *row_block_size = Eigen::Dynamic;
97 const bool is_everything_dynamic = (*row_block_size == Eigen::Dynamic &&
105 CHECK_NE(*row_block_size,
38 DetectStructure(const CompressedRowBlockStructure& bs, const int num_eliminate_blocks, int* row_block_size, int* e_block_size, int* f_block_size) argument
[all...] |
| H A D | block_random_access_crs_matrix.cc | 71 const int row_block_size = blocks_[it->first]; local
73 num_nonzeros += row_block_size * col_block_size;
97 const int row_block_size = blocks_[row_block_id]; local
108 for (int j = 0; j < row_block_size; ++j) {
117 for (int r = 0; r < row_block_size; ++r) {
126 row_pos += row_block_size;
127 values += row_block_size * num_cols;
|
| H A D | block_sparse_matrix.cc | 64 int row_block_size = block_structure_->rows[i].block.size; local
65 num_rows_ += row_block_size;
71 num_nonzeros_ += col_block_size * row_block_size;
94 int row_block_size = block_structure_->rows[i].block.size; local
101 values_.get() + cells[j].position, row_block_size, col_block_size,
114 int row_block_size = block_structure_->rows[i].block.size; local
121 values_.get() + cells[j].position, row_block_size, col_block_size,
132 int row_block_size = block_structure_->rows[i].block.size; local
139 row_block_size, col_block_size);
149 int row_block_size local
171 int row_block_size = block_structure_->rows[i].block.size; local
194 int row_block_size = block_structure_->rows[i].block.size; local
224 const int row_block_size = block_structure_->rows[i].block.size; local
[all...] |
| H A D | block_random_access_sparse_matrix.cc | 70 const int row_block_size = blocks_[it->first]; local
72 num_nonzeros += row_block_size * col_block_size;
89 const int row_block_size = blocks_[it->first]; local
93 pos += row_block_size * col_block_size;
102 const int row_block_size = blocks_[row_block_id]; local
106 for (int r = 0; r < row_block_size; ++r) {
|
| H A D | partitioned_matrix_view.cc | 103 const int row_block_size = bs->rows[r].block.size; local
108 values + cell.position, row_block_size, col_block_size,
125 const int row_block_size = bs->rows[r].block.size; local
132 values + cells[c].position, row_block_size, col_block_size,
148 const int row_block_size = bs->rows[r].block.size; local
153 values + cell.position, row_block_size, col_block_size,
170 const int row_block_size = bs->rows[r].block.size; local
177 values + cells[c].position, row_block_size, col_block_size,
254 const int row_block_size = bs->rows[r].block.size; local
262 values + cell.position, row_block_size, col_block_siz
283 const int row_block_size = bs->rows[r].block.size; local
[all...] |
| H A D | implicit_schur_complement.cc | 152 const int row_block_size = block_diagonal_structure->rows[r].block.size; local
155 row_block_size, row_block_size);
158 ConstVectorRef d(D + row_block_pos, row_block_size);
165 .solve(Matrix::Identity(row_block_size, row_block_size));
|
| H A D | preconditioner.h | 53 row_block_size(Eigen::Dynamic),
92 int row_block_size; member in struct:ceres::internal::Preconditioner::Options
|
| H A D | block_jacobi_preconditioner.cc | 77 const int row_block_size = bs->rows[r].block.size; local
82 row_block_size,
|
| H A D | iterative_schur_complement_solver.cc | 114 preconditioner_options.row_block_size = options_.row_block_size;
|
| H A D | linear_solver.h | 84 row_block_size(Eigen::Dynamic),
141 int row_block_size; member in struct:ceres::internal::LinearSolver::Options
|
| H A D | schur_jacobi_preconditioner.cc | 85 &eliminator_options.row_block_size,
|
| H A D | schur_eliminator_test.cc | 149 &options.row_block_size,
|
| H A D | covariance_impl.cc | 357 const int row_block_size = problem->ParameterBlockLocalSize(row_block); local
374 for (int r = 0; r < row_block_size; ++r) {
|
| H A D | schur_complement_solver.cc | 69 &options_.row_block_size,
|
| H A D | visibility_based_preconditioner.cc | 318 &eliminator_options.row_block_size,
|