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

  /external/ceres-solver/internal/ceres/
cxsparse.h 50 // explicity exist in CXSparse. The methods in the class are nonstatic because
52 class CXSparse {
54 CXSparse();
55 ~CXSparse();
134 class CXSparse {
cxsparse.cc 36 #include "ceres/cxsparse.h"
48 CXSparse::CXSparse() : scratch_(NULL), scratch_size_(0) {
51 CXSparse::~CXSparse() {
58 bool CXSparse::SolveCholesky(cs_di* A,
96 cs_dis* CXSparse::AnalyzeCholesky(cs_di* A) {
101 cs_dis* CXSparse::AnalyzeCholeskyWithNaturalOrdering(cs_di* A) {
106 cs_dis* CXSparse::BlockAnalyzeCholesky(cs_di* A,
167 cs_di CXSparse::CreateSparseMatrixTransposeView(CompressedRowSparseMatrix* A)
    [all...]
sparse_normal_cholesky_solver.h 43 #include "ceres/cxsparse.h"
91 CXSparse cxsparse_;
schur_complement_solver.h 43 #include "ceres/cxsparse.h"
187 CXSparse cxsparse_;
reorder_program.cc 37 #include "ceres/cxsparse.h"
117 // CXSparse works with J'J instead of J'. So compute the block
120 CXSparse cxsparse;
123 cxsparse.CreateSparseMatrix(
125 cs_di* block_jacobian = cxsparse.TransposeMatrix(block_jacobian_transpose);
127 cxsparse.MatrixMatrixMultiply(block_jacobian_transpose, block_jacobian);
128 cxsparse.Free(block_jacobian);
129 cxsparse.Free(block_jacobian_transpose);
131 cxsparse.ApproximateMinimumDegreeOrdering(block_hessian, ordering)
    [all...]
compressed_row_sparse_matrix_test.cc 36 #include "ceres/cxsparse.h"
495 CXSparse cxsparse; local
498 // Create a random matrix, compute its outer product using CXSParse
531 cs_di cs_matrix_transpose = cxsparse.CreateSparseMatrixTransposeView(matrix.get());
532 cs_di* cs_matrix = cxsparse.TransposeMatrix(&cs_matrix_transpose);
534 cxsparse.MatrixMatrixMultiply(&cs_matrix_transpose, cs_matrix);
545 cxsparse.CreateSparseMatrixTransposeView(outer_product.get());
565 cxsparse.Free(cs_matrix);
566 cxsparse.Free(expected_outer_product)
    [all...]

Completed in 4208 milliseconds