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 152 { return m_P; }
185 s << " perm: " << ((total+=m_P.size() * sizeof(int)) >> 20) << "Mb" << "\n";
200 if(m_P.size()>0)
201 dest = m_P * b;
214 if(m_P.size()>0)
261 ap.template selfadjointView<Upper>() = a.template selfadjointView<UpLo>().twistedBy(m_P);
297 PermutationMatrix<Dynamic,Dynamic,Index> m_P; // the permutation
626 if(Base::m_P.size()>0)
627 dest = Base::m_P * b;
650 if(Base::m_P.size()>0
    [all...]
  /external/eigen/Eigen/src/IterativeLinearSolvers/
IncompleteLUT.h 115 x = m_P * x;
150 PermutationMatrix<Dynamic,Dynamic,Index> m_P; // Fill-reducing permutation
231 internal::minimum_degree_ordering<Scalar, Index>(AtA, m_P); // Then compute the AMD ordering...
233 m_Pinv = m_P.inverse(); // ... and the inverse permutation

Completed in 365 milliseconds