Searched refs:m_P (Results 1 – 3 of 3) sorted by relevance
116 { return m_P; }149 s << " perm: " << ((total+=m_P.size() * sizeof(int)) >> 20) << "Mb" << "\n";164 if(m_P.size()>0)165 dest = m_P * b;178 if(m_P.size()>0)213 if(m_P.size()==0 && (UpLo&Upper)==Upper)220 tmp.template selfadjointView<Upper>() = a.template selfadjointView<UpLo>().twistedBy(m_P);259 PermutationMatrix<Dynamic,Dynamic,StorageIndex> m_P; // the permutation597 if(Base::m_P.size()>0)598 dest = Base::m_P * b;[all …]
176 x = m_P * x; in _solve_impl()197 PermutationMatrix<Dynamic,Dynamic,StorageIndex> m_P; // Fill-reducing permutation variable236 ordering(AtA,m_P); in analyzePattern()237 m_Pinv = m_P.inverse(); // cache the inverse permutation in analyzePattern()243 m_P = m_Pinv.inverse(); in analyzePattern()
456 …�=�]����ryt=�5 �1���i��_��ڮ?�[��y�ڌ�[̰�]�K �HC��X�e`���Xس�� 1��w�5�m_P}�|��~A����,���v�…