| /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 | 149 const int row_block_size = block_diagonal_structure->rows[r].block.size; local
152 row_block_size, row_block_size);
155 ConstVectorRef d(D + row_block_pos, row_block_size);
162 .solve(Matrix::Identity(row_block_size, row_block_size));
|
| 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 | 55 row_block_size(Eigen::Dynamic),
94 int row_block_size; member in struct:ceres::internal::Preconditioner::Options
|
| partitioned_matrix_view_impl.h | 108 const int row_block_size = bs->rows[r].block.size; local
113 values + cell.position, row_block_size, col_block_size,
133 const int row_block_size = bs->rows[r].block.size; local
140 values + cells[c].position, row_block_size, col_block_size,
148 const int row_block_size = bs->rows[r].block.size; local
155 values + cells[c].position, row_block_size, col_block_size,
174 const int row_block_size = bs->rows[r].block.size; local
179 values + cell.position, row_block_size, col_block_size,
199 const int row_block_size = bs->rows[r].block.size; local
206 values + cells[c].position, row_block_size, col_block_size
214 const int row_block_size = bs->rows[r].block.size; local
310 const int row_block_size = bs->rows[r].block.size; local
341 const int row_block_size = bs->rows[r].block.size; local
360 const int row_block_size = bs->rows[r].block.size; local
[all...] |
| linear_solver.h | 106 row_block_size(Eigen::Dynamic),
163 int row_block_size; member in struct:ceres::internal::LinearSolver::Options
|
| covariance_impl.cc | 343 const int row_block_size = problem->ParameterBlockLocalSize(row_block); local
360 for (int r = 0; r < row_block_size; ++r) {
|
