/external/ceres-solver/internal/ceres/ |
D | schur_eliminator.cc | 51 if ((options.row_block_size == 2) && in Create() 56 if ((options.row_block_size == 2) && in Create() 61 if ((options.row_block_size == 2) && in Create() 66 if ((options.row_block_size == 2) && in Create() 71 if ((options.row_block_size == 2) && in Create() 76 if ((options.row_block_size == 2) && in Create() 81 if ((options.row_block_size == 2) && in Create() 86 if ((options.row_block_size == 2) && in Create() 91 if ((options.row_block_size == 2) && in Create() 96 if ((options.row_block_size == 2) && in Create() [all …]
|
D | detect_structure.cc | 40 int* row_block_size, in DetectStructure() argument 44 *row_block_size = 0; in DetectStructure() 59 if (*row_block_size == 0) { in DetectStructure() 60 *row_block_size = row.block.size; in DetectStructure() 61 } else if (*row_block_size != Eigen::Dynamic && in DetectStructure() 62 *row_block_size != row.block.size) { in DetectStructure() 64 << *row_block_size << " to " in DetectStructure() 66 *row_block_size = Eigen::Dynamic; in DetectStructure() 97 const bool is_everything_dynamic = (*row_block_size == Eigen::Dynamic && in DetectStructure() 105 CHECK_NE(*row_block_size, 0) << "No rows found"; in DetectStructure() [all …]
|
D | block_sparse_matrix.cc | 64 int row_block_size = block_structure_->rows[i].block.size; in BlockSparseMatrix() local 65 num_rows_ += row_block_size; in BlockSparseMatrix() 71 num_nonzeros_ += col_block_size * row_block_size; in BlockSparseMatrix() 119 int row_block_size = block_structure_->rows[i].block.size; in RightMultiply() local 120 VectorRef yref(y + row_block_pos, row_block_size); in RightMultiply() 128 row_block_size, col_block_size); in RightMultiply() 140 int row_block_size = block_structure_->rows[i].block.size; in LeftMultiply() local 141 const ConstVectorRef xref(x + row_block_pos, row_block_size); in LeftMultiply() 149 row_block_size, col_block_size); in LeftMultiply() 159 int row_block_size = block_structure_->rows[i].block.size; in SquaredColumnNorm() local [all …]
|
D | partitioned_matrix_view.cc | 102 const int row_block_size = bs->rows[r].block.size; in RightMultiplyE() local 108 VectorRef yref(y + row_block_pos, row_block_size); in RightMultiplyE() 110 row_block_size, in RightMultiplyE() 126 const int row_block_size = bs->rows[r].block.size; in RightMultiplyF() local 127 VectorRef yref(y + row_block_pos, row_block_size); in RightMultiplyF() 138 row_block_size, in RightMultiplyF() 154 const int row_block_size = bs->rows[r].block.size; in LeftMultiplyE() local 159 ConstVectorRef xref(x + row_block_pos, row_block_size); in LeftMultiplyE() 162 row_block_size, in LeftMultiplyE() 178 const int row_block_size = bs->rows[r].block.size; in LeftMultiplyF() local [all …]
|
D | generate_eliminator_specialization.py | 151 def SpecializationFilename(prefix, row_block_size, e_block_size, f_block_size): argument 152 return "_".join([prefix] + map(SuffixForSize, (row_block_size, 164 for row_block_size, e_block_size, f_block_size in SPECIALIZATIONS: 166 row_block_size, 170 fptr.write(SPECIALIZATION_FILE % (row_block_size, 175 f.write(FACTORY_CONDITIONAL % (row_block_size, 178 row_block_size,
|
D | block_random_access_sparse_matrix.cc | 70 const int row_block_size = blocks_[it->first]; in BlockRandomAccessSparseMatrix() local 72 num_nonzeros += row_block_size * col_block_size; in BlockRandomAccessSparseMatrix() 89 const int row_block_size = blocks_[it->first]; in BlockRandomAccessSparseMatrix() local 93 pos += row_block_size * col_block_size; in BlockRandomAccessSparseMatrix() 102 const int row_block_size = blocks_[row_block_id]; in BlockRandomAccessSparseMatrix() local 106 for (int r = 0; r < row_block_size; ++r) { in BlockRandomAccessSparseMatrix()
|
D | implicit_schur_complement.cc | 152 const int row_block_size = block_diagonal_structure->rows[r].block.size; in AddDiagonalAndInvert() local 155 row_block_size, row_block_size); in AddDiagonalAndInvert() 158 ConstVectorRef d(D + row_block_pos, row_block_size); in AddDiagonalAndInvert() 165 .solve(Matrix::Identity(row_block_size, row_block_size)); in AddDiagonalAndInvert()
|
D | linear_solver.h | 81 row_block_size(Dynamic), in Options() 137 int row_block_size; member
|
D | block_jacobi_preconditioner.cc | 77 const int row_block_size = bs->rows[r].block.size; in Update() local 83 row_block_size, in Update()
|
D | detect_structure.h | 56 int* row_block_size,
|
D | schur_eliminator_test.cc | 156 &options.row_block_size, in EliminateSolveAndCompare()
|
D | schur_complement_solver.cc | 70 &options_.row_block_size, in SolveImpl()
|
D | visibility_based_preconditioner.cc | 340 &eliminator_options.row_block_size, in InitEliminator()
|