| /external/ceres-solver/include/ceres/ |
| crs_matrix.h | 42 CRSMatrix() : num_rows(0), num_cols(0) {}
45 int num_cols; member in struct:ceres::CRSMatrix
|
| /external/ceres-solver/internal/ceres/ |
| block_jacobi_preconditioner.h | 64 virtual int num_cols() const { return num_rows_; } function in class:ceres::internal::BlockJacobiPreconditioner
|
| evaluator_test_utils.h | 40 int num_cols; member in struct:ceres::internal::ExpectedEvaluation
|
| visibility_test.cc | 56 int num_cols = 6; local
99 bs.cols.resize(num_cols);
103 ASSERT_EQ(visibility.size(), num_cols - num_eliminate_blocks);
136 int num_cols = 6; local
175 bs.cols.resize(num_cols);
179 ASSERT_EQ(visibility.size(), num_cols - num_eliminate_blocks);
|
| block_random_access_crs_matrix.h | 76 // Since the matrix is square, num_rows() == num_cols().
78 virtual int num_cols() const { return crsm_->num_cols(); } function in class:ceres::internal::BlockRandomAccessCRSMatrix
|
| block_random_access_dense_matrix.h | 48 // 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
|
| block_random_access_sparse_matrix.h | 78 // 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
|
| block_sparse_matrix.h | 79 virtual int num_cols() const { return num_cols_; } function in class:ceres::internal::BlockSparseMatrix
|
| cgnr_linear_operator.h | 98 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
|
| dense_normal_cholesky_solver.cc | 72 const int num_cols = A->num_cols(); local
75 Matrix lhs(num_cols, num_cols);
91 ConstVectorRef D(per_solve_options.D, num_cols);
99 VectorRef(x, num_cols) =
118 const int num_cols = A->num_cols(); local
119 Matrix lhs(num_cols, num_cols);
[all...] |
| dense_qr_solver.cc | 71 const int num_cols = A->num_cols(); local
114 VectorRef(x, num_cols) = rhs_.head(num_cols);
132 const int num_cols = A->num_cols(); local
142 num_rows + ((per_solve_options.D != NULL) ? num_cols : 0);
151 VectorRef(x, num_cols) = A->matrix().householderQr().solve(rhs_);
|
| partitioned_matrix_view.h | 104 int num_cols() const { return matrix_.num_cols(); } function in class:ceres::internal::PartitionedMatrixView
|
| block_random_access_sparse_matrix.cc | 56 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));
|
| conjugate_gradients_solver.cc | 76 CHECK_EQ(A->num_rows(), A->num_cols());
82 int num_cols = A->num_cols(); local
83 VectorRef xref(x, num_cols);
84 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);
|
| dense_sparse_matrix_test.cc | 50 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...] |
| implicit_schur_complement.cc | 130 ConstVectorRef Dref(D_ + A_->num_cols_e(), num_cols());
131 VectorRef(y, num_cols()) =
133 ConstVectorRef(x, num_cols()).array()).matrix();
135 VectorRef(y, num_cols()).setZero();
174 const int num_cols = A_->num_cols(); local
189 VectorRef(y, num_cols).setZero();
|
| low_rank_inverse_hessian.h | 90 virtual int num_cols() const { return num_parameters_; } function in class:ceres::internal::LowRankInverseHessian
|
| schur_complement_solver_test.cc | 58 num_cols = A->num_cols();
62 x.reset(new double[num_cols]);
63 sol.reset(new double[num_cols]);
64 sol_d.reset(new double[num_cols]);
72 A->num_cols(),
116 for (int i = 0; i < num_cols; ++i) {
120 for (int i = 0; i < num_cols; ++i) {
127 int num_cols; member in class:ceres::internal::SchurComplementSolverTest
|
| sparse_normal_cholesky_solver.cc | 105 const int num_cols = A->num_cols(); local
106 Vector Atb = Vector::Zero(num_cols);
112 CompressedRowSparseMatrix D(per_solve_options.D, num_cols);
116 VectorRef(x, num_cols).setZero();
133 A->DeleteRows(num_cols);
183 const int num_cols = A->num_cols(); local
185 Vector Atb = Vector::Zero(num_cols);
191 CompressedRowSparseMatrix D(per_solve_options.D, num_cols);
[all...] |
| block_random_access_crs_matrix.cc | 60 int num_cols = 0; local
62 col_layout_[i] = num_cols;
63 num_cols += blocks_[i];
76 VLOG(2) << "Matrix Size [" << num_cols
77 << "," << num_cols
80 crsm_.reset(new CompressedRowSparseMatrix(num_cols, num_cols, num_nonzeros));
98 int num_cols = 0; local
101 new CellInfo(values + num_cols);
103 num_cols += blocks_[it->second]
[all...] |
| compressed_row_sparse_matrix.h | 63 // 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
120 void set_num_cols(const int num_cols) { num_cols_ = num_cols; }
|
| dense_sparse_matrix.cc | 42 DenseSparseMatrix::DenseSparseMatrix(int num_rows, int num_cols)
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()) = m_.colwise().squaredNorm()
136 int DenseSparseMatrix::num_cols() const { function in class:ceres::internal::DenseSparseMatrix
[all...] |
| implicit_schur_complement.h | 130 virtual int num_cols() const { return A_->num_cols_f(); } function in class:ceres::internal::ImplicitSchurComplement
|
| preconditioner.h | 113 // LeftMultiply and num_cols are just calls to RightMultiply and
122 virtual int num_cols() const { function in class:ceres::internal::Preconditioner
|
| triplet_sparse_matrix.h | 49 TripletSparseMatrix(int num_rows, int num_cols, int max_num_nonzeros);
65 virtual int num_cols() const { return num_cols_; } function in class:ceres::internal::TripletSparseMatrix
|
