| /external/ceres-solver/internal/ceres/ |
| block_jacobi_preconditioner.cc | 77 const int row_block_size = bs->rows[r].block.size; local
82 row_block_size,
|
| 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) {
|
| 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));
|
| 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;
|
| 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 = block_structure_->rows[i].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...] |
| preconditioner.h | 53 row_block_size(Eigen::Dynamic),
92 int row_block_size; member in struct:ceres::internal::Preconditioner::Options
|
| linear_solver.h | 84 row_block_size(Eigen::Dynamic),
141 int row_block_size; member in struct:ceres::internal::LinearSolver::Options
|
| 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_size
283 const int row_block_size = bs->rows[r].block.size; local
[all...] |
| covariance_impl.cc | 357 const int row_block_size = problem->ParameterBlockLocalSize(row_block); local
374 for (int r = 0; r < row_block_size; ++r) {
|
