HomeSort by relevance Sort by last modified time
    Searched refs:nonZeros (Results 1 - 25 of 36) sorted by null

1 2

  /external/eigen/Eigen/src/SparseCore/
SparseTranspose.h 26 inline Index nonZeros() const { return derived().nestedExpression().nonZeros(); }
SparseBlock.h 159 // and/or it is not at the end of the nonzeros of the underlying matrix.
165 Index nnz = tmp.nonZeros();
166 Index nnz_previous = nonZeros();
170 Index nnz_tail = matrix.nonZeros() - tail;
175 typename MatrixType::Storage newdata(m_matrix.nonZeros() - nnz_previous + nnz);
216 p += tmp.innerVector(k).nonZeros();
247 Index nonZeros() const
261 eigen_assert(nonZeros()>0);
SparseSparseProductWithPruning.h 42 Index estimated_nnz_prod = lhs.nonZeros() + rhs.nonZeros();
55 //double ratioColRes = (double(rhs.innerVector(j).nonZeros()) + double(lhs.nonZeros())/double(lhs.cols()))/double(lhs.rows());
SparseVector.h 105 * This insertion might be very costly if the number of nonzeros above \a i is large.
120 inline Index nonZeros() const { return static_cast<Index>(m_data.size()); }
249 for (Index i=0; i<m.nonZeros(); ++i)
313 Index nnz = other.nonZeros();
AmbiVector.h 39 Index nonZeros() const;
125 _Index AmbiVector<_Scalar,_Index>::nonZeros() const
ConservativeSparseSparseProduct.h 38 Index estimated_nnz_prod = lhs.nonZeros() + rhs.nonZeros();
SparseMatrixBase.h 155 inline Index nonZeros() const { return derived().nonZeros(); }
MappedSparseMatrix.h 104 inline Index nonZeros() const { return m_nnz; }
  /external/eigen/unsupported/Eigen/src/KroneckerProduct/
KroneckerTensorProduct.h 56 AB.reserve(A.nonZeros()*B.nonZeros());
  /external/eigen/unsupported/Eigen/src/Skyline/
SkylineMatrixBase.h 122 inline Index nonZeros() const {
123 return derived().nonZeros();
  /external/eigen/bench/
sparse_randomsetter.cpp 57 << " nnz=" << set1->nonZeros() << std::flush;
100 // << " nnz=" << set1.nonZeros() << "\n";getchar();
109 // << " nnz=" << set1.nonZeros() << "\n";getchar();
118 // << " nnz=" << set1.nonZeros() << "\n";getchar();
sparse_transpose.cpp 59 std::cout << "Non zeros: " << sm1.nonZeros()/float(sm1.rows()*sm1.cols())*100 << "%\n";
sparse_cholesky.cpp 73 std::cout << " nnz: " << sm1.nonZeros() << " => " << chol.matrixL().nonZeros() << "\n";
sparse_product.cpp 155 std::cout << "Eigen sparse\t" << sm1.nonZeros()/(float(sm1.rows())*float(sm1.cols()))*100 << "% * "
156 << sm2.nonZeros()/(float(sm2.rows())*float(sm2.cols()))*100 << "%\n";
189 std::cout << "Eigen dyn-sparse\t" << m1.nonZeros()/(float(m1.rows())*float(m1.cols()))*100 << "% * "
190 << m2.nonZeros()/(float(m2.rows())*float(m2.cols()))*100 << "%\n";
203 // std::cout << sm4.nonZeros() << " == " << sm1.nonZeros() << "\n";
sparse_dense_product.cpp 93 std::cout << "Eigen sparse\t" << sm1.nonZeros()/float(sm1.rows()*sm1.cols())*100 << "%\n";
106 // std::cout << "Eigen dyn-sparse\t" << m1.nonZeros()/float(m1.rows()*m1.cols())*100 << "%\n";
  /external/eigen/test/eigen2/
eigen2_sparse_vector.cpp 45 VERIFY(int(nonzerocoords.size()) == v1.nonZeros());
eigen2_sparse_basic.cpp 300 VERIFY(countFalseNonZero+countTrueNonZero == m2.nonZeros());
303 VERIFY(countTrueNonZero==m2.nonZeros());
  /external/eigen/unsupported/Eigen/src/SparseExtra/
BlockOfDynamicSparseMatrix.h 80 Index nonZeros() const
RandomSetter.h 124 * To reach optimal performance, this value should be adjusted according to the average number of nonzeros
216 mp_target->reserve(nonZeros());
308 Index nonZeros() const
  /external/eigen/unsupported/test/
kronecker_product.cpp 30 VERIFY_IS_EQUAL(ab.nonZeros(), 36);
75 VERIFY_IS_EQUAL(ab.nonZeros(), 3*2);
  /external/eigen/test/
sparse_basic.cpp 233 VERIFY(j==internal::real(m3.innerVector(j).nonZeros()));
240 VERIFY(j==internal::real(m3.innerVector(j).nonZeros()));
306 VERIFY(countFalseNonZero+countTrueNonZero == m2.nonZeros());
309 VERIFY(countTrueNonZero==m2.nonZeros());
sparse_vector.cpp 45 VERIFY(int(nonzerocoords.size()) == v1.nonZeros());
sparse_solvers.cpp 65 MappedSparseMatrix<Scalar> mm2(rows, cols, cm2.nonZeros(), cm2.outerIndexPtr(), cm2.innerIndexPtr(), cm2.valuePtr());
  /external/eigen/Eigen/src/SparseCholesky/
SimplicialCholesky.h 181 s << " L: " << ((total+=(m_matrix.cols()+1) * sizeof(int) + m_matrix.nonZeros()*(sizeof(int)+sizeof(Scalar))) >> 20) << "Mb" << "\n";
184 s << " nonzeros: " << ((total+=m_nonZerosPerCol.size() * sizeof(int)) >> 20) << "Mb" << "\n";
205 if(m_matrix.nonZeros()>0) // otherwise L==I
211 if (m_matrix.nonZeros()>0) // otherwise U==I
631 if(Base::m_matrix.nonZeros()>0) // otherwise L==I
642 if (Base::m_matrix.nonZeros()>0) // otherwise I==I
711 m_nonZerosPerCol[k] = 0; /* count of nonzeros in column k of L */
772 m_nonZerosPerCol[k] = 0; // count of nonzeros in column k of L
814 ++m_nonZerosPerCol[i]; /* increment count of nonzeros in col i */
  /external/eigen/Eigen/src/PaStiXSupport/
PaStiXSupport.h 96 for(i = 0; i < mat.nonZeros(); ++i)
111 for(i = 0; i < mat.nonZeros(); ++i)

Completed in 705 milliseconds

1 2