Searched refs:m_Pinv (Results 1 – 2 of 2) sorted by relevance
121 { return m_Pinv; }150 s << " perm^-1: " << ((total+=m_Pinv.size() * sizeof(int)) >> 20) << "Mb" << "\n";179 dest = m_Pinv * dest;260 PermutationMatrix<Dynamic,Dynamic,StorageIndex> m_Pinv; // the inverse permutation622 dest = Base::m_Pinv * dest;663 ordering(C,m_Pinv);666 if(m_Pinv.size()>0) m_P = m_Pinv.inverse();674 m_Pinv.resize(0);
173 x = m_Pinv * b; in _solve_impl()198 PermutationMatrix<Dynamic,Dynamic,StorageIndex> m_Pinv; // Inverse permutation variable237 m_Pinv = m_P.inverse(); // cache the inverse permutation in analyzePattern()242 ordering(mat1,m_Pinv); in analyzePattern()243 m_P = m_Pinv.inverse(); in analyzePattern()271 mat = amat.twistedBy(m_Pinv); in factorize()