Home
last modified time | relevance | path

Searched refs:num_row_blocks (Results 1 – 9 of 9) sorted by relevance

/external/ceres-solver/internal/ceres/
Dcompressed_col_sparse_matrix_utils.cc49 const int num_row_blocks = row_blocks.size(); in CompressedColumnScalarMatrixToBlockMatrix() local
52 vector<int> row_block_starts(num_row_blocks); in CompressedColumnScalarMatrixToBlockMatrix()
53 for (int i = 0, cursor = 0; i < num_row_blocks; ++i) { in CompressedColumnScalarMatrixToBlockMatrix()
Dcxsparse.cc109 const int num_row_blocks = row_blocks.size(); in BlockAnalyzeCholesky() local
121 block_matrix.m = num_row_blocks; in BlockAnalyzeCholesky()
130 vector<int> block_ordering(num_row_blocks, -1); in BlockAnalyzeCholesky()
131 copy(ordering, ordering + num_row_blocks, &block_ordering[0]); in BlockAnalyzeCholesky()
Dcompressed_row_sparse_matrix_test.cc412 int num_row_blocks; member
424 for (int i = 0; i < options.num_row_blocks; ++i) { in CreateRandomCompressedRowSparseMatrix()
443 for (int r = 0; r < options.num_row_blocks; ++r) { in CreateRandomCompressedRowSparseMatrix()
502 for (int num_row_blocks = 1; in TEST() local
503 num_row_blocks < kMaxNumRowBlocks; in TEST()
504 ++num_row_blocks) { in TEST()
512 options.num_row_blocks = num_row_blocks; in TEST()
520 VLOG(2) << "num row blocks: " << options.num_row_blocks; in TEST()
Ddetect_structure.cc43 const int num_row_blocks = bs.rows.size(); in DetectStructure() local
50 for (int r = 0; r < num_row_blocks; ++r) { in DetectStructure()
Dsuitesparse.cc210 const int num_row_blocks = row_blocks.size(); in BlockAMDOrdering() local
226 block_matrix.nrow = num_row_blocks; in BlockAMDOrdering()
239 vector<int> block_ordering(num_row_blocks); in BlockAMDOrdering()
Dschur_complement_solver.cc186 const int num_row_blocks = bs->rows.size(); in InitStorage() local
199 while (r < num_row_blocks) { in InitStorage()
208 for (; r < num_row_blocks; ++r) { in InitStorage()
233 for (; r < num_row_blocks; ++r) { in InitStorage()
Dcompressed_row_sparse_matrix.cc222 int num_row_blocks = 0; in DeleteRows() local
224 while (num_row_blocks < row_blocks_.size() && num_rows < num_rows_) { in DeleteRows()
225 num_rows += row_blocks_[num_row_blocks]; in DeleteRows()
226 ++num_row_blocks; in DeleteRows()
229 row_blocks_.resize(num_row_blocks); in DeleteRows()
Dvisibility_based_preconditioner.cc253 const int num_row_blocks = bs.rows.size(); in ComputeBlockPairsInPreconditioner() local
270 while (r < num_row_blocks) { in ComputeBlockPairsInPreconditioner()
278 for (; r < num_row_blocks; ++r) { in ComputeBlockPairsInPreconditioner()
309 for (; r < num_row_blocks; ++r) { in ComputeBlockPairsInPreconditioner()
Dschur_eliminator_impl.h89 const int num_row_blocks = bs->rows.size(); in Init() local
111 while (r < num_row_blocks) { in Init()
126 while (r + chunk.size < num_row_blocks) { in Init()