| /external/ceres-solver/internal/ceres/ |
| partitioned_matrix_view.h | 79 virtual BlockSparseMatrix* CreateBlockDiagonalEtE() const = 0;
83 virtual BlockSparseMatrix* CreateBlockDiagonalFtF() const = 0;
91 BlockSparseMatrix* block_diagonal) const = 0;
99 BlockSparseMatrix* block_diagonal) const = 0;
109 const BlockSparseMatrix& matrix);
119 PartitionedMatrixView(const BlockSparseMatrix& matrix, int num_col_blocks_e);
126 virtual BlockSparseMatrix* CreateBlockDiagonalEtE() const;
127 virtual BlockSparseMatrix* CreateBlockDiagonalFtF() const;
128 virtual void UpdateBlockDiagonalEtE(BlockSparseMatrix* block_diagonal) const;
129 virtual void UpdateBlockDiagonalFtF(BlockSparseMatrix* block_diagonal) const
[all...] |
| implicit_schur_complement.h | 47 class BlockSparseMatrix;
113 void Init(const BlockSparseMatrix& A, const double* D, const double* b);
134 const BlockSparseMatrix* block_diagonal_EtE_inverse() const {
138 const BlockSparseMatrix* block_diagonal_FtF_inverse() const {
143 void AddDiagonalAndInvert(const double* D, BlockSparseMatrix* matrix);
152 scoped_ptr<BlockSparseMatrix> block_diagonal_EtE_inverse_;
153 scoped_ptr<BlockSparseMatrix> block_diagonal_FtF_inverse_;
|
| block_jacobi_preconditioner.h | 40 class BlockSparseMatrix;
46 // the preconditioner, create one by passing a BlockSparseMatrix "A"
57 explicit BlockJacobiPreconditioner(const BlockSparseMatrix& A);
67 virtual bool UpdateImpl(const BlockSparseMatrix& A, const double* D);
|
| block_sparse_matrix.h | 56 class BlockSparseMatrix : public SparseMatrix {
64 explicit BlockSparseMatrix(CompressedRowBlockStructure* block_structure);
66 BlockSparseMatrix();
67 virtual ~BlockSparseMatrix();
94 CERES_DISALLOW_COPY_AND_ASSIGN(BlockSparseMatrix);
|
| schur_eliminator.h | 173 // BlockSparseMatrix objects below.
188 virtual void Eliminate(const BlockSparseMatrix* A,
197 virtual void BackSubstitute(const BlockSparseMatrix* A,
229 virtual void Eliminate(const BlockSparseMatrix* A,
234 virtual void BackSubstitute(const BlockSparseMatrix* A,
276 const BlockSparseMatrix* A,
285 const BlockSparseMatrix* A,
296 void EBlockRowOuterProduct(const BlockSparseMatrix* A,
301 void NoEBlockRowsUpdate(const BlockSparseMatrix* A,
307 void NoEBlockRowOuterProduct(const BlockSparseMatrix* A
[all...] |
| iterative_schur_complement_solver.h | 42 class BlockSparseMatrix;
77 BlockSparseMatrix* A,
|
| schur_jacobi_preconditioner.h | 53 class BlockSparseMatrix;
94 virtual bool UpdateImpl(const BlockSparseMatrix& A, const double* D);
|
| cgnr_solver.h | 55 BlockSparseMatrix* A,
|
| block_sparse_matrix.cc | 45 BlockSparseMatrix::~BlockSparseMatrix() {}
47 BlockSparseMatrix::BlockSparseMatrix(
84 void BlockSparseMatrix::SetZero() {
88 void BlockSparseMatrix::RightMultiply(const double* x, double* y) const {
108 void BlockSparseMatrix::LeftMultiply(const double* x, double* y) const {
128 void BlockSparseMatrix::SquaredColumnNorm(double* x) const {
145 void BlockSparseMatrix::ScaleColumns(const double* scale) {
162 void BlockSparseMatrix::ToDenseMatrix(Matrix* dense_matrix) const
[all...] |
| visibility_based_preconditioner.h | 66 class BlockSparseMatrix;
146 virtual bool UpdateImpl(const BlockSparseMatrix& A, const double* D);
222 bool UpdateImpl(const BlockSparseMatrix& A, const double* D) {
|
| block_evaluate_preparer.cc | 64 down_cast<BlockSparseMatrix*>(jacobian)->mutable_values();
|
| preconditioner.h | 44 class BlockSparseMatrix;
85 // If the block sizes in a BlockSparseMatrix are fixed, then in
155 typedef TypedPreconditioner<BlockSparseMatrix> BlockSparseMatrixPreconditioner; // NOLINT
|
| iterative_schur_complement_solver_test.cc | 66 A_.reset(down_cast<BlockSparseMatrix*>(problem->A.release()));
114 scoped_ptr<BlockSparseMatrix> A_;
|
| schur_complement_solver.h | 57 class BlockSparseMatrix;
120 BlockSparseMatrix* A,
|
| partitioned_matrix_view_impl.h | 48 const BlockSparseMatrix& matrix,
231 // and return a BlockSparseMatrix with the this block structure. The
234 BlockSparseMatrix*
266 // Build a BlockSparseMatrix with the just computed block
268 return new BlockSparseMatrix(block_diagonal_structure);
272 BlockSparseMatrix*
275 BlockSparseMatrix* block_diagonal =
282 BlockSparseMatrix*
285 BlockSparseMatrix* block_diagonal =
301 BlockSparseMatrix* block_diagonal) const
[all...] |
| block_jacobi_preconditioner.cc | 44 const BlockSparseMatrix& A)
69 bool BlockJacobiPreconditioner::UpdateImpl(const BlockSparseMatrix& A,
|
| block_sparse_matrix_test.cc | 51 A_.reset(down_cast<BlockSparseMatrix*>(problem->A.release()));
62 scoped_ptr<BlockSparseMatrix> A_;
|
| cgnr_solver.cc | 54 BlockSparseMatrix* A,
|
| block_jacobian_writer.cc | 206 BlockSparseMatrix* jacobian = new BlockSparseMatrix(bs);
|
| implicit_schur_complement.cc | 55 void ImplicitSchurComplement::Init(const BlockSparseMatrix& A,
144 BlockSparseMatrix* block_diagonal) {
|
| implicit_schur_complement_test.cc | 62 A_.reset(down_cast<BlockSparseMatrix*>(problem->A.release()));
182 scoped_ptr<BlockSparseMatrix> A_;
|
| partitioned_matrix_view_test.cc | 65 *down_cast<BlockSparseMatrix*>(A_.get())));
146 scoped_ptr<BlockSparseMatrix>
160 scoped_ptr<BlockSparseMatrix>
|
| iterative_schur_complement_solver.cc | 66 BlockSparseMatrix* A,
|
| linear_least_squares_problems.cc | 177 // BlockSparseMatrix version of this problem.
284 // BlockSparseMatrix version
386 BlockSparseMatrix* A = new BlockSparseMatrix(bs);
418 // BlockSparseMatrix version
490 BlockSparseMatrix* A = new BlockSparseMatrix(bs);
|
| linear_solver.h | 154 // If the block sizes in a BlockSparseMatrix are fixed, then in
352 typedef TypedLinearSolver<BlockSparseMatrix> BlockSparseMatrixSolver; // NOLINT
|
