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

  /external/eigen/Eigen/src/SparseCholesky/
SimplicialCholesky.h 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 permutation
597 if(Base::m_P.size()>0)
598 dest = Base::m_P * b
    [all...]
  /external/eigen/Eigen/src/IterativeLinearSolvers/
IncompleteLUT.h 176 x = m_P * x;
197 PermutationMatrix<Dynamic,Dynamic,StorageIndex> m_P; // Fill-reducing permutation
236 ordering(AtA,m_P);
237 m_Pinv = m_P.inverse(); // cache the inverse permutation
243 m_P = m_Pinv.inverse();

Completed in 123 milliseconds