Searched refs:m_P (Results 1 – 2 of 2) sorted by relevance
113 { return m_P; } in permutationP()146 s << " perm: " << ((total+=m_P.size() * sizeof(int)) >> 20) << "Mb" << "\n"; in dumpMemory()161 if(m_P.size()>0) in _solve()162 dest = m_P * b; in _solve()175 if(m_P.size()>0) in _solve()201 ap.template selfadjointView<Upper>() = a.template selfadjointView<UpLo>().twistedBy(m_P); in factorize()237 PermutationMatrix<Dynamic,Dynamic,Index> m_P; // the permutation variable571 if(Base::m_P.size()>0)572 dest = Base::m_P * b;595 if(Base::m_P.size()>0)[all …]
165 x = m_P * x; in _solve()196 PermutationMatrix<Dynamic,Dynamic,Index> m_P; // Fill-reducing permutation variable232 internal::minimum_degree_ordering<Scalar, Index>(AtA, m_P); // Then compute the AMD ordering... in analyzePattern()234 m_Pinv = m_P.inverse(); // ... and the inverse permutation in analyzePattern()