| /external/ceres-solver/include/ceres/ |
| crs_matrix.h | 43 CRSMatrix() : num_rows(0), num_cols(0) {}
46 int num_cols; member in struct:ceres::CRSMatrix
|
| /external/ceres-solver/internal/ceres/ |
| normal_prior_test.cc | 59 for (int num_cols = 1; num_cols < 5; ++num_cols) {
60 Vector b(num_cols);
63 Matrix A(num_rows, num_cols);
66 double * x = new double[num_cols];
67 for (int i = 0; i < num_cols; ++i)
70 double * jacobian = new double[num_rows * num_cols];
78 (residuals - A * (VectorRef(x, num_cols) - b)).squaredNorm();
82 MatrixRef J(jacobian, num_rows, num_cols);
[all...] |
| blas.h | 46 int num_cols,
|
| linear_operator.h | 53 virtual int num_cols() const = 0;
|
| lapack.h | 66 static int EstimateWorkSizeForQR(int num_rows, int num_cols);
89 int 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...] |
| 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);
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...] |
| dynamic_compressed_row_sparse_matrix_test.cc | 49 num_cols = 4;
56 expected_num_nonzeros = num_rows * num_cols - min(num_rows, num_cols);
62 num_cols,
71 dense.resize(num_rows, num_cols);
74 for (int i = 0; i < (num_rows * num_cols); ++i) {
75 const int r = i / num_cols, c = i % num_cols;
87 for (int i = 0; i < (num_rows * num_cols); ++i) {
88 const int r = i / num_cols, c = i % num_cols
161 int num_cols; member in class:ceres::internal::DynamicCompressedRowSparseMatrixTest
[all...] |
| block_random_access_diagonal_matrix.cc | 52 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));
|
| blas.cc | 50 int num_cols,
61 int n = transpose ? num_cols : num_rows;
62 int k = transpose ? num_rows : num_cols;
|
| 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
|
| corrector.h | 78 int num_cols,
|
| evaluator_test_utils.h | 40 int num_cols; member in struct:ceres::internal::ExpectedEvaluation
|
| corrector.cc | 119 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] -
|
| 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...] |
| dense_sparse_matrix.h | 54 DenseSparseMatrix(int num_rows, int num_cols);
55 DenseSparseMatrix(int num_rows, int num_cols, bool reserve_diagonal);
68 virtual int num_cols() const;
|
| block_random_access_diagonal_matrix.h | 73 // 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
|
| block_sparse_matrix_test.cc | 58 CHECK_EQ(A_->num_cols(), B_->num_cols());
74 for (int i = 0; i < A_->num_cols(); ++i) {
75 Vector x = Vector::Zero(A_->num_cols());
84 Vector y_a = Vector::Zero(A_->num_cols());
85 Vector y_b = Vector::Zero(A_->num_cols());
96 Vector y_a = Vector::Zero(A_->num_cols());
97 Vector y_b = Vector::Zero(A_->num_cols());
|
| compressed_col_sparse_matrix_utils.h | 70 void SolveUpperTriangularInPlace(IntegerType num_cols,
75 for (IntegerType c = num_cols - 1; c >= 0; --c) {
91 void SolveUpperTriangularTransposeInPlace(IntegerType num_cols,
96 for (IntegerType c = 0; c < num_cols; ++c) {
117 void SolveRTRWithSparseRHS(IntegerType num_cols,
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);
|
| dense_qr_solver.cc | 72 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_);
|
| block_random_access_matrix.h | 126 virtual int num_cols() const = 0;
|
| 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
123 void set_num_cols(const int num_cols) { num_cols_ = num_cols; }
|
| dynamic_compressed_row_sparse_matrix.h | 67 int num_cols,
|
| sparse_matrix.h | 100 virtual int num_cols() const = 0;
|
| /external/ceres-solver/include/ceres/internal/ |
| eigen.h | 65 template <int num_rows = Eigen::Dynamic, int num_cols = Eigen::Dynamic>
67 typedef Eigen::Matrix <double, num_rows, num_cols, Eigen::RowMajor>
71 Eigen::Matrix<double, num_rows, num_cols, Eigen::RowMajor> >
83 const Eigen::Matrix<double, num_rows, num_cols, Eigen::RowMajor> >
|
