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

  /external/eigen/Eigen/src/SparseCholesky/
SimplicialCholesky.h 113 { return m_P; }
146 s << " perm: " << ((total+=m_P.size() * sizeof(int)) >> 20) << "Mb" << "\n";
161 if(m_P.size()>0)
162 dest = m_P * b;
175 if(m_P.size()>0)
201 ap.template selfadjointView<Upper>() = a.template selfadjointView<UpLo>().twistedBy(m_P);
237 PermutationMatrix<Dynamic,Dynamic,Index> m_P; // the permutation
571 if(Base::m_P.size()>0)
572 dest = Base::m_P * b;
595 if(Base::m_P.size()>0
    [all...]
  /external/eigen/Eigen/src/IterativeLinearSolvers/
IncompleteLUT.h 166 x = m_P * x;
197 PermutationMatrix<Dynamic,Dynamic,Index> m_P; // Fill-reducing permutation
233 internal::minimum_degree_ordering<Scalar, Index>(AtA, m_P); // Then compute the AMD ordering...
235 m_Pinv = m_P.inverse(); // ... and the inverse permutation

Completed in 654 milliseconds