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

  /external/eigen/Eigen/src/SparseCholesky/
SimplicialCholesky.h 118 { return m_Pinv; }
147 s << " perm^-1: " << ((total+=m_Pinv.size() * sizeof(int)) >> 20) << "Mb" << "\n";
176 dest = m_Pinv * dest;
238 PermutationMatrix<Dynamic,Dynamic,Index> m_Pinv; // the inverse permutation
596 dest = Base::m_Pinv * dest;
627 ordering(C,m_Pinv);
630 if(m_Pinv.size()>0)
631 m_P = m_Pinv.inverse();
  /external/eigen/Eigen/src/IterativeLinearSolvers/
IncompleteLUT.h 163 x = m_Pinv * b;
198 PermutationMatrix<Dynamic,Dynamic,Index> m_Pinv; // Inverse permutation
235 m_Pinv = m_P.inverse(); // ... and the inverse permutation
259 mat = amat.twistedBy(m_Pinv);

Completed in 30 milliseconds