| /external/ceres-solver/internal/ceres/ |
| 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);
128 CompressedRowSparseMatrix* Transpose() const;
130 static CompressedRowSparseMatrix* CreateBlockDiagonalMatrix(
135 // and create a CompressedRowSparseMatrix corresponding to it.
148 static CompressedRowSparseMatrix* CreateOuterProductMatrixAndProgram
[all...] |
| incomplete_lq_factorization.h | 66 CompressedRowSparseMatrix* IncompleteLQFactorization(
67 const CompressedRowSparseMatrix& matrix,
85 CompressedRowSparseMatrix* matrix);
|
| sparse_normal_cholesky_solver.h | 52 class CompressedRowSparseMatrix;
63 CompressedRowSparseMatrix* A,
69 CompressedRowSparseMatrix* A,
75 CompressedRowSparseMatrix* A,
81 CompressedRowSparseMatrix* A,
101 scoped_ptr<CompressedRowSparseMatrix> outer_product_;
|
| covariance_impl.h | 47 class CompressedRowSparseMatrix;
71 const CompressedRowSparseMatrix* covariance_matrix() const {
83 scoped_ptr<CompressedRowSparseMatrix> covariance_matrix_;
|
| compressed_row_jacobian_writer.h | 42 class CompressedRowSparseMatrix;
54 // row_blocks for a CompressedRowSparseMatrix, based on the
60 // writers which use CompressedRowSparseMatrix (or derived types).
65 CompressedRowSparseMatrix* jacobian);
68 // before copying them into a CompressedRowSparseMatrix (or derived
76 // writers which use CompressedRowSparseMatrix (or derived types).
|
| dynamic_compressed_row_sparse_matrix.h | 37 // that the underlying `CompressedRowSparseMatrix` is consistent.
49 class DynamicCompressedRowSparseMatrix : public CompressedRowSparseMatrix {
52 // `CompressedRowSparseMatrix` and set the initial number of maximum non-zero
65 // `CompressedRowSparseMatrix` consistent.
83 // Make the underlying internal `CompressedRowSparseMatrix` data structures
85 // `CompressedRowSparseMatrix` can be reserved by specifying
87 // be appended to the `CompressedRowSparseMatrix` (e.g. appending a diagonal
|
| compressed_row_sparse_matrix.cc | 71 // This constructor gives you a semi-initialized CompressedRowSparseMatrix.
72 CompressedRowSparseMatrix::CompressedRowSparseMatrix(int num_rows,
90 CompressedRowSparseMatrix::CompressedRowSparseMatrix(
134 CompressedRowSparseMatrix::CompressedRowSparseMatrix(const double* diagonal,
154 CompressedRowSparseMatrix::~CompressedRowSparseMatrix() {
157 void CompressedRowSparseMatrix::SetZero()
[all...] |
| cxsparse.h | 45 class CompressedRowSparseMatrix;
69 cs_di CreateSparseMatrixTransposeView(CompressedRowSparseMatrix* A);
|
| sparse_normal_cholesky_solver.cc | 79 CompressedRowSparseMatrix* A,
91 scoped_ptr<CompressedRowSparseMatrix> regularizer;
93 regularizer.reset(CompressedRowSparseMatrix::CreateBlockDiagonalMatrix(
96 regularizer.reset(new CompressedRowSparseMatrix(
126 CompressedRowSparseMatrix* A,
161 CompressedRowSparseMatrix::CreateOuterProductMatrixAndProgram(
165 CompressedRowSparseMatrix::ComputeOuterProduct(
223 CompressedRowSparseMatrix* A,
259 CompressedRowSparseMatrix::CreateOuterProductMatrixAndProgram(
263 CompressedRowSparseMatrix::ComputeOuterProduct
[all...] |
| 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 | 78 crsm.reset(new CompressedRowSparseMatrix(*tsm));
96 scoped_ptr<CompressedRowSparseMatrix> crsm;
160 CompressedRowSparseMatrix crsm_appendage(tsm_appendage);
183 scoped_ptr<CompressedRowSparseMatrix> appendage(
184 CompressedRowSparseMatrix::CreateBlockDiagonalMatrix(
237 TEST(CompressedRowSparseMatrix, CreateBlockDiagonalMatrix) {
248 scoped_ptr<CompressedRowSparseMatrix> matrix(
249 CompressedRowSparseMatrix::CreateBlockDiagonalMatrix(
282 matrix_.reset(new CompressedRowSparseMatrix(4, 4, 7));
312 scoped_ptr<CompressedRowSparseMatrix> matrix_
[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);
|
| compressed_row_jacobian_writer.cc | 44 const Program* program, CompressedRowSparseMatrix* jacobian) {
106 CompressedRowSparseMatrix* jacobian =
107 new CompressedRowSparseMatrix(
112 // At this stage, the CompressedRowSparseMatrix is an invalid state. But this
182 CompressedRowSparseMatrix* jacobian =
183 down_cast<CompressedRowSparseMatrix*>(base_jacobian);
|
| suitesparse.h | 76 class CompressedRowSparseMatrix;
101 cholmod_sparse CreateSparseMatrixTransposeView(CompressedRowSparseMatrix* A);
|
| dynamic_compressed_row_sparse_matrix.cc | 41 : CompressedRowSparseMatrix(num_rows,
|
| preconditioner.h | 156 typedef TypedPreconditioner<CompressedRowSparseMatrix> CompressedRowSparseMatrixPreconditioner; // NOLINT
|
| dynamic_compressed_row_sparse_matrix_test.cc | 109 crsm.reset(new CompressedRowSparseMatrix(*tsm));
169 scoped_ptr<CompressedRowSparseMatrix> crsm;
|
| linear_solver.h | 353 typedef TypedLinearSolver<CompressedRowSparseMatrix> CompressedRowSparseMatrixSolver; // NOLINT
|
| unsymmetric_linear_solver_test.cc | 74 CompressedRowSparseMatrix* crsm = new CompressedRowSparseMatrix(*A_);
|
| cxsparse.cc | 167 cs_di CXSparse::CreateSparseMatrixTransposeView(CompressedRowSparseMatrix* A) {
|
| suitesparse.cc | 96 CompressedRowSparseMatrix* A) {
|
| schur_complement_solver.cc | 469 CompressedRowSparseMatrix crsm(*tsm);
|
| problem_impl.cc | 716 scoped_ptr<CompressedRowSparseMatrix> tmp_jacobian;
719 down_cast<CompressedRowSparseMatrix*>(evaluator->CreateJacobian()));
[all...] |
| covariance_impl.cc | 314 // blocks as they will occur in the CompressedRowSparseMatrix that
320 new CompressedRowSparseMatrix(num_rows, num_rows, num_nonzeros));
|
| covariance_test.cc | 101 const CompressedRowSparseMatrix* crsm = covariance_impl.covariance_matrix();
|
