/external/ceres-solver/internal/ceres/ |
D | schur_eliminator.cc | 53 if ((options.row_block_size == 2) && in Create() 58 if ((options.row_block_size == 2) && in Create() 63 if ((options.row_block_size == 2) && in Create() 68 if ((options.row_block_size == 2) && in Create() 73 if ((options.row_block_size == 2) && in Create() 78 if ((options.row_block_size == 2) && in Create() 83 if ((options.row_block_size == 2) && in Create() 88 if ((options.row_block_size == 2) && in Create() 93 if ((options.row_block_size == 2) && in Create() 98 if ((options.row_block_size == 2) && in Create() [all …]
|
D | partitioned_matrix_view.cc | 54 if ((options.row_block_size == 2) && in Create() 60 if ((options.row_block_size == 2) && in Create() 66 if ((options.row_block_size == 2) && in Create() 72 if ((options.row_block_size == 2) && in Create() 78 if ((options.row_block_size == 2) && in Create() 84 if ((options.row_block_size == 2) && in Create() 90 if ((options.row_block_size == 2) && in Create() 96 if ((options.row_block_size == 2) && in Create() 102 if ((options.row_block_size == 2) && in Create() 108 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 | generate_partitioned_matrix_view_specializations.py | 189 def SpecializationFilename(prefix, row_block_size, e_block_size, f_block_size): argument 190 return "_".join([prefix] + map(SuffixForSize, (row_block_size, 203 for row_block_size, e_block_size, f_block_size in SPECIALIZATIONS: 205 row_block_size, 212 if (row_block_size == "Eigen::Dynamic" and 217 fptr.write(template % (row_block_size, e_block_size, f_block_size)) 220 f.write(FACTORY_CONDITIONAL % (row_block_size, 223 row_block_size,
|
D | generate_eliminator_specialization.py | 188 def SpecializationFilename(prefix, row_block_size, e_block_size, f_block_size): argument 189 return "_".join([prefix] + map(SuffixForSize, (row_block_size, 202 for row_block_size, e_block_size, f_block_size in SPECIALIZATIONS: 204 row_block_size, 211 if (row_block_size == "Eigen::Dynamic" and 216 fptr.write(template % (row_block_size, e_block_size, f_block_size)) 219 f.write(FACTORY_CONDITIONAL % (row_block_size, 222 row_block_size,
|
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() 94 int row_block_size = block_structure_->rows[i].block.size; in RightMultiply() local 101 values_.get() + cells[j].position, row_block_size, col_block_size, in RightMultiply() 114 int row_block_size = block_structure_->rows[i].block.size; in LeftMultiply() local 121 values_.get() + cells[j].position, row_block_size, col_block_size, in LeftMultiply() 132 int row_block_size = block_structure_->rows[i].block.size; in SquaredColumnNorm() local 139 row_block_size, col_block_size); in SquaredColumnNorm() 149 int row_block_size = block_structure_->rows[i].block.size; in ScaleColumns() local [all …]
|
D | partitioned_matrix_view_impl.h | 108 const int row_block_size = bs->rows[r].block.size; in RightMultiplyE() local 113 values + cell.position, row_block_size, col_block_size, in RightMultiplyE() 133 const int row_block_size = bs->rows[r].block.size; in RightMultiplyF() local 140 values + cells[c].position, row_block_size, col_block_size, in RightMultiplyF() 148 const int row_block_size = bs->rows[r].block.size; in RightMultiplyF() local 155 values + cells[c].position, row_block_size, col_block_size, in RightMultiplyF() 174 const int row_block_size = bs->rows[r].block.size; in LeftMultiplyE() local 179 values + cell.position, row_block_size, col_block_size, in LeftMultiplyE() 199 const int row_block_size = bs->rows[r].block.size; in LeftMultiplyF() local 206 values + cells[c].position, row_block_size, col_block_size, in LeftMultiplyF() [all …]
|
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 | 149 const int row_block_size = block_diagonal_structure->rows[r].block.size; in AddDiagonalAndInvert() local 152 row_block_size, row_block_size); in AddDiagonalAndInvert() 155 ConstVectorRef d(D + row_block_pos, row_block_size); in AddDiagonalAndInvert() 162 .solve(Matrix::Identity(row_block_size, row_block_size)); in AddDiagonalAndInvert()
|
D | iterative_schur_complement_solver.cc | 78 &options_.row_block_size, in SolveImpl() 118 preconditioner_options.row_block_size = options_.row_block_size; in SolveImpl()
|
D | preconditioner.h | 55 row_block_size(Eigen::Dynamic), in Options() 94 int row_block_size; member
|
D | schur_jacobi_preconditioner.cc | 78 eliminator_options.row_block_size = options_.row_block_size; in InitEliminator()
|
D | linear_solver.h | 106 row_block_size(Eigen::Dynamic), in Options() 163 int row_block_size; member
|
D | block_jacobi_preconditioner.cc | 77 const int row_block_size = bs->rows[r].block.size; in UpdateImpl() local 82 row_block_size, in UpdateImpl()
|
D | detect_structure.h | 56 int* row_block_size,
|
D | visibility_based_preconditioner.cc | 336 eliminator_options.row_block_size = options_.row_block_size; in InitEliminator()
|
D | schur_eliminator_test.cc | 149 &options.row_block_size, in EliminateSolveAndCompare()
|
D | covariance_impl.cc | 343 const int row_block_size = problem->ParameterBlockLocalSize(row_block); in ComputeCovarianceSparsity() local 360 for (int r = 0; r < row_block_size; ++r) { in ComputeCovarianceSparsity()
|
D | schur_complement_solver.cc | 71 &options_.row_block_size, in SolveImpl()
|