OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:BlockSparseMatrix
(Results
1 - 20
of
20
) sorted by null
/external/ceres-solver/internal/ceres/
implicit_schur_complement.h
46
class
BlockSparseMatrix
;
134
const
BlockSparseMatrix
* block_diagonal_EtE_inverse() const {
138
const
BlockSparseMatrix
* block_diagonal_FtF_inverse() const {
143
void AddDiagonalAndInvert(const double* D,
BlockSparseMatrix
* matrix);
153
scoped_ptr<
BlockSparseMatrix
> block_diagonal_EtE_inverse_;
154
scoped_ptr<
BlockSparseMatrix
> block_diagonal_FtF_inverse_;
partitioned_matrix_view.h
80
BlockSparseMatrix
* CreateBlockDiagonalEtE() const;
83
BlockSparseMatrix
* CreateBlockDiagonalFtF() const;
90
void UpdateBlockDiagonalEtE(
BlockSparseMatrix
* block_diagonal) const;
97
void UpdateBlockDiagonalFtF(
BlockSparseMatrix
* block_diagonal) const;
107
BlockSparseMatrix
* CreateBlockDiagonalMatrixLayout(int start_col_block,
block_sparse_matrix.h
88
class
BlockSparseMatrix
: public BlockSparseMatrixBase {
96
explicit
BlockSparseMatrix
(CompressedRowBlockStructure* block_structure);
100
explicit
BlockSparseMatrix
(const SparseMatrixProto& proto);
103
BlockSparseMatrix
();
104
virtual ~
BlockSparseMatrix
();
138
CERES_DISALLOW_COPY_AND_ASSIGN(
BlockSparseMatrix
);
iterative_schur_complement_solver.h
42
class
BlockSparseMatrix
;
block_evaluate_preparer.cc
64
down_cast<
BlockSparseMatrix
*>(jacobian)->mutable_values();
block_sparse_matrix.cc
45
BlockSparseMatrix
::~
BlockSparseMatrix
() {}
47
BlockSparseMatrix
::
BlockSparseMatrix
(
85
BlockSparseMatrix
::
BlockSparseMatrix
(const SparseMatrixProto& outer_proto) {
109
void
BlockSparseMatrix
::SetZero() {
113
void
BlockSparseMatrix
::RightMultiply(const double* x, double* y) const {
134
void
BlockSparseMatrix
::LeftMultiply(const double* x, double* y) const {
155
void
BlockSparseMatrix
::SquaredColumnNorm(double* x) const
[
all
...]
partitioned_matrix_view_test.cc
70
PartitionedMatrixView m(*down_cast<
BlockSparseMatrix
*>(A_.get()),
81
PartitionedMatrixView m(*down_cast<
BlockSparseMatrix
*>(A_.get()),
106
PartitionedMatrixView m(*down_cast<
BlockSparseMatrix
*>(A_.get()),
131
PartitionedMatrixView m(*down_cast<
BlockSparseMatrix
*>(A_.get()),
157
PartitionedMatrixView m(*down_cast<
BlockSparseMatrix
*>(A_.get()),
160
scoped_ptr<
BlockSparseMatrix
>
174
PartitionedMatrixView m(*down_cast<
BlockSparseMatrix
*>(A_.get()),
177
scoped_ptr<
BlockSparseMatrix
>
block_jacobi_preconditioner.cc
46
*(down_cast<const
BlockSparseMatrix
*>(&A)->block_structure())) {
71
const
BlockSparseMatrix
& A = *(down_cast<const
BlockSparseMatrix
*>(&matrix));
iterative_schur_complement_solver_test.cc
66
A_.reset(down_cast<
BlockSparseMatrix
*>(problem->A.release()));
112
scoped_ptr<
BlockSparseMatrix
> A_;
partitioned_matrix_view.cc
199
// and return a
BlockSparseMatrix
with the this block structure. The
201
BlockSparseMatrix
* PartitionedMatrixView::CreateBlockDiagonalMatrixLayout(
232
// Build a
BlockSparseMatrix
with the just computed block
234
return new
BlockSparseMatrix
(block_diagonal_structure);
237
BlockSparseMatrix
* PartitionedMatrixView::CreateBlockDiagonalEtE() const {
238
BlockSparseMatrix
* block_diagonal =
244
BlockSparseMatrix
* PartitionedMatrixView::CreateBlockDiagonalFtF() const {
245
BlockSparseMatrix
* block_diagonal =
257
BlockSparseMatrix
* block_diagonal) const {
288
BlockSparseMatrix
* block_diagonal) const
[
all
...]
block_sparse_matrix_test.cc
52
A_.reset(down_cast<
BlockSparseMatrix
*>(problem->A.release()));
63
scoped_ptr<
BlockSparseMatrix
> A_;
120
BlockSparseMatrix
A2(proto);
block_jacobian_writer.cc
206
BlockSparseMatrix
* jacobian = new
BlockSparseMatrix
(bs);
implicit_schur_complement_test.cc
62
A_.reset(down_cast<
BlockSparseMatrix
*>(problem->A.release()));
179
scoped_ptr<
BlockSparseMatrix
> A_;
schur_complement_solver_test.cc
54
A.reset(down_cast<
BlockSparseMatrix
*>(problem->A.release()));
132
scoped_ptr<
BlockSparseMatrix
> A;
iterative_schur_complement_solver.cc
105
const_cast<
BlockSparseMatrix
*>(
linear_solver.h
128
// If the block sizes in a
BlockSparseMatrix
are fixed, then in
294
typedef TypedLinearSolver<
BlockSparseMatrix
> BlockSparseMatrixSolver; // NOLINT
schur_eliminator_test.cc
70
A.reset(down_cast<
BlockSparseMatrix
*>(problem->A.release()));
192
scoped_ptr<
BlockSparseMatrix
> A;
linear_least_squares_problems.cc
81
problem->A.reset(new
BlockSparseMatrix
(A));
247
//
BlockSparseMatrix
version of this problem.
354
//
BlockSparseMatrix
version
456
BlockSparseMatrix
* A = new
BlockSparseMatrix
(bs);
488
//
BlockSparseMatrix
version
560
BlockSparseMatrix
* A = new
BlockSparseMatrix
(bs);
implicit_schur_complement.cc
147
BlockSparseMatrix
* block_diagonal) {
visibility_based_preconditioner_test.cc
71
A_.reset(down_cast<
BlockSparseMatrix
*>(problem->A.release()));
228
scoped_ptr<
BlockSparseMatrix
> A_;
Completed in 99 milliseconds