Home
last modified time | relevance | path

Searched defs:nnz (Results 1 – 10 of 10) sorted by relevance

/external/ceres-solver/internal/ceres/
Dlinear_least_squares_problems.cc196 int nnz = 0; in LinearLeastSquaresProblem1() local
304 int nnz = 0; in LinearLeastSquaresProblem2() local
438 int nnz = 0; in LinearLeastSquaresProblem3() local
Dtriplet_sparse_matrix_test.cc300 int nnz = 0; in TEST() local
Dcompressed_row_sparse_matrix.cc451 int nnz = 0; in CompressAndFillProgram() local
/external/eigen/Eigen/src/SparseCore/
DConservativeSparseSparseProduct.h47 Index nnz = 0; in conservative_sparse_sparse_product_impl() local
/external/eigen/Eigen/src/OrderingMethods/
DOrdering.h131 Index nnz = mat.nonZeros(); in operator() local
DEigen_Colamd.h264 inline Index colamd_recommended ( Index nnz, Index n_row, Index n_col) in colamd_recommended()
334 Index nnz ; /* nonzeros in A */ in colamd() local
/external/eigen/Eigen/src/SuperLUSupport/
DSuperLUSupport.h114 union {int nnz;int lda;}; member
/external/eigen/bench/
Dsparse_setter.cpp302 const int nnz, in coo_tocsr()
384 I nnz = 0; in csr_sum_duplicates() local
/external/eigen/unsupported/Eigen/src/IterativeSolvers/
DIncompleteCholesky.h147 Index nnz = m_L.nonZeros(); in factorize() local
/external/eigen/Eigen/src/SparseLU/
DSparseLU.h493 Index nnz = m_mat.nonZeros(); in factorize() local