HomeSort by relevance Sort by last modified time
    Searched refs:CompressedRowSparseMatrix (Results 1 - 23 of 23) sorted by null

  /external/ceres-solver/internal/ceres/
incomplete_lq_factorization.h 66 CompressedRowSparseMatrix* IncompleteLQFactorization(
67 const CompressedRowSparseMatrix& matrix,
85 CompressedRowSparseMatrix* matrix);
compressed_row_sparse_matrix.h 49 class CompressedRowSparseMatrix : public SparseMatrix {
57 explicit CompressedRowSparseMatrix(const TripletSparseMatrix& m);
70 CompressedRowSparseMatrix(int num_rows,
76 CompressedRowSparseMatrix(const double* diagonal, int num_rows);
78 virtual ~CompressedRowSparseMatrix();
101 void AppendRows(const CompressedRowSparseMatrix& m);
125 CompressedRowSparseMatrix* Transpose() const;
127 static CompressedRowSparseMatrix* CreateBlockDiagonalMatrix(
146 CERES_DISALLOW_COPY_AND_ASSIGN(CompressedRowSparseMatrix);
sparse_normal_cholesky_solver.h 47 class CompressedRowSparseMatrix;
58 CompressedRowSparseMatrix* A,
64 CompressedRowSparseMatrix* A,
71 CompressedRowSparseMatrix* A,
compressed_row_sparse_matrix.cc 70 // This constructor gives you a semi-initialized CompressedRowSparseMatrix.
71 CompressedRowSparseMatrix::CompressedRowSparseMatrix(int num_rows,
89 CompressedRowSparseMatrix::CompressedRowSparseMatrix(
133 CompressedRowSparseMatrix::CompressedRowSparseMatrix(const double* diagonal,
153 CompressedRowSparseMatrix::~CompressedRowSparseMatrix() {
156 void CompressedRowSparseMatrix::SetZero()
    [all...]
block_random_access_crs_matrix.h 81 const CompressedRowSparseMatrix* matrix() const { return crsm_.get(); }
82 CompressedRowSparseMatrix* mutable_matrix() { return crsm_.get(); }
100 scoped_ptr<CompressedRowSparseMatrix> crsm_;
covariance_impl.h 47 class CompressedRowSparseMatrix;
71 const CompressedRowSparseMatrix* covariance_matrix() const {
83 scoped_ptr<CompressedRowSparseMatrix> covariance_matrix_;
cxsparse.h 43 class CompressedRowSparseMatrix;
67 cs_di CreateSparseMatrixTransposeView(CompressedRowSparseMatrix* A);
incomplete_lq_factorization.cc 45 inline double NormalizeRow(const int row, CompressedRowSparseMatrix* matrix) {
65 inline double RowDotProduct(const CompressedRowSparseMatrix& a,
67 const CompressedRowSparseMatrix& b,
118 CompressedRowSparseMatrix* matrix) {
164 CompressedRowSparseMatrix* IncompleteLQFactorization(
165 const CompressedRowSparseMatrix& matrix,
176 CompressedRowSparseMatrix* l =
177 new CompressedRowSparseMatrix(num_rows,
182 CompressedRowSparseMatrix q(num_rows, num_cols, q_level_of_fill * num_rows);
compressed_row_sparse_matrix_test.cc 75 crsm.reset(new CompressedRowSparseMatrix(*tsm));
85 scoped_ptr<CompressedRowSparseMatrix> crsm;
142 CompressedRowSparseMatrix crsm_appendage(tsm_appendage);
178 TEST(CompressedRowSparseMatrix, CreateBlockDiagonalMatrix) {
189 scoped_ptr<CompressedRowSparseMatrix> matrix(
190 CompressedRowSparseMatrix::CreateBlockDiagonalMatrix(
223 matrix_.reset(new CompressedRowSparseMatrix(4, 4, 7));
253 scoped_ptr<CompressedRowSparseMatrix> matrix_;
275 TEST(CompressedRowSparseMatrix, Transpose) {
282 CompressedRowSparseMatrix matrix(5, 6, 30)
    [all...]
incomplete_lq_factorization_test.cc 42 void ExpectMatricesAreEqual(const CompressedRowSparseMatrix& expected,
43 const CompressedRowSparseMatrix& actual,
58 CompressedRowSparseMatrix matrix(1, 1, 1);
64 scoped_ptr<CompressedRowSparseMatrix> l(
83 CompressedRowSparseMatrix matrix(10, 10, 100);
102 scoped_ptr<CompressedRowSparseMatrix> lmatrix(
122 CompressedRowSparseMatrix matrix(10, 10, 100);
sparse_normal_cholesky_solver.cc 76 CompressedRowSparseMatrix* A,
97 CompressedRowSparseMatrix* A,
112 CompressedRowSparseMatrix D(per_solve_options.D, num_cols);
164 CompressedRowSparseMatrix* A,
177 CompressedRowSparseMatrix* A,
191 CompressedRowSparseMatrix D(per_solve_options.D, num_cols);
239 CompressedRowSparseMatrix* A,
compressed_row_jacobian_writer.cc 68 CompressedRowSparseMatrix* jacobian =
69 new CompressedRowSparseMatrix(
159 CompressedRowSparseMatrix* jacobian =
160 down_cast<CompressedRowSparseMatrix*>(base_jacobian);
171 // copying them into the CompressedRowSparseMatrix. Just because a cost
suitesparse.h 73 class CompressedRowSparseMatrix;
98 cholmod_sparse CreateSparseMatrixTransposeView(CompressedRowSparseMatrix* A);
preconditioner.h 146 typedef TypedPreconditioner<CompressedRowSparseMatrix> CompressedRowSparseMatrixPreconditioner; // NOLINT
unsymmetric_linear_solver_test.cc 74 CompressedRowSparseMatrix* crsm = new CompressedRowSparseMatrix(*A_);
linear_solver.h 322 typedef TypedLinearSolver<CompressedRowSparseMatrix> CompressedRowSparseMatrixSolver; // NOLINT
block_random_access_crs_matrix.cc 80 crsm_.reset(new CompressedRowSparseMatrix(num_cols, num_cols, num_nonzeros));
block_random_access_crs_matrix_test.cc 89 const CompressedRowSparseMatrix* crsm = m.matrix();
cxsparse.cc 164 cs_di CXSparse::CreateSparseMatrixTransposeView(CompressedRowSparseMatrix* A) {
problem_impl.cc 648 scoped_ptr<CompressedRowSparseMatrix> tmp_jacobian;
651 down_cast<CompressedRowSparseMatrix*>(evaluator->CreateJacobian()));
suitesparse.cc 92 CompressedRowSparseMatrix* A) {
covariance_impl.cc 328 // blocks as they will occur in the CompressedRowSparseMatrix that
334 new CompressedRowSparseMatrix(num_rows, num_rows, num_nonzeros));
covariance_test.cc 101 const CompressedRowSparseMatrix* crsm = covariance_impl.covariance_matrix();

Completed in 232 milliseconds