Searched refs:m_Pinv (Results 1 – 2 of 2) sorted by relevance
118 { return m_Pinv; } in permutationPinv()147 s << " perm^-1: " << ((total+=m_Pinv.size() * sizeof(int)) >> 20) << "Mb" << "\n"; in dumpMemory()176 dest = m_Pinv * dest; in _solve()238 PermutationMatrix<Dynamic,Dynamic,Index> m_Pinv; // the inverse permutation variable596 dest = Base::m_Pinv * dest;627 ordering(C,m_Pinv);630 if(m_Pinv.size()>0)631 m_P = m_Pinv.inverse();
162 x = m_Pinv * b; in _solve()197 PermutationMatrix<Dynamic,Dynamic,Index> m_Pinv; // Inverse permutation variable234 m_Pinv = m_P.inverse(); // ... and the inverse permutation in analyzePattern()260 mat = amat.twistedBy(m_Pinv); in factorize()