Searched defs:num_cols (Results 1 - 25 of 54) sorted by relevance

123

/external/ceres-solver/include/ceres/
H A Dcrs_matrix.h43 CRSMatrix() : num_rows(0), num_cols(0) {}
46 int num_cols; member in struct:ceres::CRSMatrix
/external/ceres-solver/internal/ceres/
H A Dblas.cc50 int num_cols,
61 int n = transpose ? num_cols : num_rows;
62 int k = transpose ? num_rows : num_cols;
49 SymmetricRankKUpdate(int num_rows, int num_cols, const double* a, bool transpose, double alpha, double beta, double* c) argument
H A Devaluator_test_utils.h40 int num_cols; member in struct:ceres::internal::ExpectedEvaluation
H A Dvisibility_test.cc59 int num_cols = 6; local
102 bs.cols.resize(num_cols);
106 ASSERT_EQ(visibility.size(), num_cols - num_eliminate_blocks);
139 int num_cols = 6; local
178 bs.cols.resize(num_cols);
182 ASSERT_EQ(visibility.size(), num_cols - num_eliminate_blocks);
H A Dblock_jacobi_preconditioner.h64 virtual int num_cols() const { return num_rows_; } function in class:ceres::internal::BlockJacobiPreconditioner
H A Dblock_random_access_dense_matrix.h48 // num_rows x num_cols.
78 // structure, num_rows() = num_cols().
80 virtual int num_cols() const { return num_rows_; } function in class:ceres::internal::BlockRandomAccessDenseMatrix
H A Dblock_random_access_diagonal_matrix.h73 // Since the matrix is square, num_rows() == num_cols().
75 virtual int num_cols() const { return tsm_->num_cols(); } function in class:ceres::internal::BlockRandomAccessDiagonalMatrix
H A Dblock_sparse_matrix.h79 virtual int num_cols() const { return num_cols_; } function in class:ceres::internal::BlockSparseMatrix
H A Dcompressed_col_sparse_matrix_utils.h70 void SolveUpperTriangularInPlace(IntegerType num_cols, argument
75 for (IntegerType c = num_cols - 1; c >= 0; --c) {
91 void SolveUpperTriangularTransposeInPlace(IntegerType num_cols, argument
96 for (IntegerType c = 0; c < num_cols; ++c) {
117 void SolveRTRWithSparseRHS(IntegerType num_cols, argument
123 fill(solution, solution + num_cols, 0.0);
126 for (IntegerType c = rhs_nonzero_index + 1; c < num_cols; ++c) {
136 SolveUpperTriangularInPlace(num_cols, rows, cols, values, solution);
H A Dcorrector.cc119 const int num_cols,
127 VectorRef(jacobian, num_rows * num_cols) *= sqrt_rho1_;
143 for (int c = 0; c < num_cols; ++c) {
146 r_transpose_j += jacobian[r * num_cols + c] * residuals[r];
150 jacobian[r * num_cols + c] = sqrt_rho1_ *
151 (jacobian[r * num_cols + c] -
118 CorrectJacobian(const int num_rows, const int num_cols, double* residuals, double* jacobian) argument
H A Ddense_qr_solver.cc72 const int num_cols = A->num_cols(); local
115 VectorRef(x, num_cols) = rhs_.head(num_cols);
130 const int num_cols = A->num_cols(); local
140 num_rows + ((per_solve_options.D != NULL) ? num_cols : 0);
149 VectorRef(x, num_cols) = A->matrix().householderQr().solve(rhs_);
H A Dlapack.cc115 int LAPACK::EstimateWorkSizeForQR(int num_rows, int num_cols) { argument
127 &num_cols,
149 int num_cols,
161 int n = num_cols;
147 SolveInPlaceUsingQR( int num_rows, int num_cols, const double* in_lhs, int work_size, double* work, double* rhs_and_solution, string* message) argument
H A Dblock_random_access_sparse_matrix.h78 // Since the matrix is square, num_rows() == num_cols().
80 virtual int num_cols() const { return tsm_->num_cols(); } function in class:ceres::internal::BlockRandomAccessSparseMatrix
H A Dcgnr_linear_operator.h98 int n = A_.num_cols();
108 virtual int num_rows() const { return A_.num_cols(); }
109 virtual int num_cols() const { return A_.num_cols(); } function in class:ceres::internal::CgnrLinearOperator
H A Ddense_normal_cholesky_solver.cc72 const int num_cols = A->num_cols(); local
75 Matrix lhs(num_cols, num_cols);
91 ConstVectorRef D(per_solve_options.D, num_cols);
110 VectorRef(x, num_cols) = llt.solve(rhs);
128 const int num_cols = A->num_cols(); local
129 Matrix lhs(num_cols, num_cols);
[all...]
H A Ddense_sparse_matrix_test.cc50 EXPECT_EQ(a->num_cols(), b->num_cols());
53 int num_cols = a->num_cols(); local
55 for (int i = 0; i < num_cols; ++i) {
56 Vector x = Vector::Zero(num_cols);
81 num_cols = tsm->num_cols();
85 int num_cols; member in class:ceres::internal::DenseSparseMatrixTest
96 Vector a(num_cols);
[all...]
H A Ddynamic_compressed_row_sparse_matrix.cc39 int num_cols,
42 num_cols,
54 CHECK_LT(col, num_cols());
37 DynamicCompressedRowSparseMatrix( int num_rows, int num_cols, int initial_max_num_nonzeros) argument
H A Dlow_rank_inverse_hessian.h92 virtual int num_cols() const { return num_parameters_; } function in class:ceres::internal::LowRankInverseHessian
H A Dpartitioned_matrix_view.h106 virtual int num_cols() const = 0;
135 virtual int num_cols() const { return matrix_.num_cols(); } function in class:ceres::internal::PartitionedMatrixView
H A Dsparse_normal_cholesky_solver.cc84 const int num_cols = A->num_cols(); local
85 VectorRef(x, num_cols).setZero();
97 per_solve_options.D, num_cols));
119 A->DeleteRows(num_cols);
327 const int num_cols = A->num_cols();
362 cholmod_dense* rhs = ss_.CreateDenseVector(rhs_and_solution, num_cols, num_cols);
368 memcpy(rhs_and_solution, solution->x, num_cols * sizeo
[all...]
H A Dblock_random_access_diagonal_matrix.cc52 int num_cols = 0; local
56 col_layout.push_back(num_cols);
57 num_cols += blocks_[i];
61 VLOG(1) << "Matrix Size [" << num_cols
62 << "," << num_cols
65 tsm_.reset(new TripletSparseMatrix(num_cols, num_cols, num_nonzeros));
H A Dblock_random_access_sparse_matrix.cc56 int num_cols = 0; local
59 col_layout.push_back(num_cols);
60 num_cols += blocks_[i];
75 VLOG(1) << "Matrix Size [" << num_cols
76 << "," << num_cols
79 tsm_.reset(new TripletSparseMatrix(num_cols, num_cols, num_nonzeros));
H A Dcompressed_row_sparse_matrix.h63 // num_rows, num_cols and max_num_nonzeros.
71 int num_cols,
90 virtual int num_cols() const { return num_cols_; } function in class:ceres::internal::CompressedRowSparseMatrix
123 void set_num_cols(const int num_cols) { num_cols_ = num_cols; } argument
H A Dconjugate_gradients_solver.cc74 CHECK_EQ(A->num_rows(), A->num_cols());
81 const int num_cols = A->num_cols(); local
82 VectorRef xref(x, num_cols);
83 ConstVectorRef bref(b, num_cols);
93 Vector r(num_cols);
94 Vector p(num_cols);
95 Vector z(num_cols);
96 Vector tmp(num_cols);
H A Ddense_sparse_matrix.cc42 DenseSparseMatrix::DenseSparseMatrix(int num_rows, int num_cols) argument
45 m_.resize(num_rows, num_cols);
50 int num_cols,
56 m_.resize(num_rows + num_cols, num_cols);
58 m_.resize(num_rows, num_cols);
64 : m_(Eigen::MatrixXd::Zero(m.num_rows(), m.num_cols())),
88 VectorRef(y, num_rows()) += matrix() * ConstVectorRef(x, num_cols());
92 VectorRef(y, num_cols()) +=
97 VectorRef(x, num_cols())
49 DenseSparseMatrix(int num_rows, int num_cols, bool reserve_diagonal) argument
136 int DenseSparseMatrix::num_cols() const { function in class:ceres::internal::DenseSparseMatrix
[all...]

Completed in 239 milliseconds

123