| /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
56 // Thus, cols is a vector of size num_cols + 1, and rows and values
|
| /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...] |
| linear_operator.h | 53 virtual int num_cols() const = 0;
|
| dense_qr_solver.cc | 54 const int num_cols = A->num_cols(); local
56 << num_rows << " x " << num_cols << " system."; local
65 const int augmented_num_rows = num_rows + ((per_solve_options.D != NULL) ? num_cols : 0);
73 VectorRef(x, num_cols) = A->matrix().colPivHouseholderQr().solve(rhs_);
|
| 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 | 55 const int num_cols = A->num_cols(); local
58 Matrix lhs(num_cols, num_cols);
72 ConstVectorRef D(per_solve_options.D, num_cols);
76 VectorRef(x, num_cols) =
|
| compressed_row_sparse_matrix_test.cc | 47 EXPECT_EQ(a->num_cols(), b->num_cols());
50 int num_cols = a->num_cols(); local
52 for (int i = 0; i < num_cols; ++i) {
53 Vector x = Vector::Zero(num_cols);
78 num_cols = tsm->num_cols();
82 int num_cols; member in class:ceres::internal::CompressedRowSparseMatrixTest
97 Vector b1 = Vector::Zero(num_cols);
[all...] |
| 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_sparse_matrix.h | 59 DenseSparseMatrix(int num_rows, int num_cols);
60 DenseSparseMatrix(int num_rows, int num_cols, bool reserve_diagonal);
76 virtual int num_cols() const;
|
| block_random_access_matrix.h | 126 virtual int num_cols() const = 0;
|
| 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));
|
| sparse_normal_cholesky_solver.cc | 108 const int num_cols = A->num_cols(); local
109 Vector Atb = Vector::Zero(num_cols);
115 CompressedRowSparseMatrix D(per_solve_options.D, num_cols);
119 VectorRef(x, num_cols).setZero();
136 A->DeleteRows(num_cols);
173 const int num_cols = A->num_cols(); local
176 Vector Atb = Vector::Zero(num_cols);
182 CompressedRowSparseMatrix D(per_solve_options.D, num_cols);
[all...] |
| 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);
|
| 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(),
118 for (int i = 0; i < num_cols; ++i) {
122 for (int i = 0; i < num_cols; ++i) {
129 int num_cols; member in class:ceres::internal::SchurComplementSolverTest
|
| dense_sparse_matrix.cc | 42 DenseSparseMatrix::DenseSparseMatrix(int num_rows, int num_cols)
46 m_.resize(num_rows, num_cols);
50 DenseSparseMatrix::DenseSparseMatrix(int num_rows, int num_cols, bool reserve_diagonal)
55 m_.resize(num_rows + num_cols, num_cols);
57 m_.resize(num_rows, num_cols);
63 : m_(Eigen::MatrixXd::Zero(m.num_rows(), m.num_cols())),
86 outer_proto.dense_matrix().num_cols())),
103 VectorRef(y, num_rows()) += matrix() * ConstVectorRef(x, num_cols());
107 VectorRef(y, num_cols()) +
167 int DenseSparseMatrix::num_cols() const { function in class:ceres::internal::DenseSparseMatrix
[all...] |
| schur_eliminator_test.cc | 146 const int num_cols = A->num_cols(); local
166 MatrixRef lhs_ref(lhs.mutable_values(), lhs.num_rows(), lhs.num_cols());
174 Vector sol(num_cols);
205 Vector zero(A->num_cols());
208 ComputeReferenceSolution(VectorRef(zero.data(), A->num_cols()));
209 EliminateSolveAndCompare(VectorRef(zero.data(), A->num_cols()), true, 1e-14);
210 EliminateSolveAndCompare(VectorRef(zero.data(), A->num_cols()), false, 1e-14);
212 ComputeReferenceSolution(VectorRef(D.get(), A->num_cols()));
213 EliminateSolveAndCompare(VectorRef(D.get(), A->num_cols()), true, 1e-14)
[all...] |
| block_random_access_sparse_matrix.h | 79 // Since the matrix is square, num_rows() == num_cols().
81 virtual int num_cols() const { return tsm_->num_cols(); } function in class:ceres::internal::BlockRandomAccessSparseMatrix
|
| block_sparse_matrix_test.cc | 59 CHECK_EQ(A_->num_cols(), B_->num_cols());
75 for (int i = 0; i < A_->num_cols(); ++i) {
76 Vector x = Vector::Zero(A_->num_cols());
85 Vector y_a = Vector::Zero(A_->num_cols());
86 Vector y_b = Vector::Zero(A_->num_cols());
97 Vector y_a = Vector::Zero(A_->num_cols());
98 Vector y_b = Vector::Zero(A_->num_cols());
|
| partitioned_matrix_view.h | 104 int num_cols() const { return matrix_.num_cols(); } function in class:ceres::internal::PartitionedMatrixView
|
| block_jacobi_preconditioner.h | 70 virtual int num_cols() const { return num_rows_; } function in class:ceres::internal::BlockJacobiPreconditioner
|
| 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
|
| sparse_matrix.h | 107 virtual int num_cols() const = 0;
|
| cgnr_solver.cc | 53 scoped_array<double> z(new double[A->num_cols()]);
54 std::fill(z.get(), z.get() + A->num_cols(), 0.0);
70 std::fill(x, x + A->num_cols(), 0.0);
|
| 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();
|
| /external/ceres-solver/include/ceres/internal/ |
| eigen.h | 52 template <int num_rows = Eigen::Dynamic, int num_cols = Eigen::Dynamic>
54 typedef Eigen::Matrix <double, num_rows, num_cols, RowMajor>
58 Eigen::Matrix<double, num_rows, num_cols, RowMajor> >
70 const Eigen::Matrix<double, num_rows, num_cols, RowMajor> >
|
