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

  /external/eigen/doc/snippets/
class_FullPivLU.cpp 16 cout << lu.permutationP().inverse() * l * u * lu.permutationQ().inverse() << endl;
  /external/eigen/test/
lu.cpp 75 VERIFY_IS_APPROX(lu.permutationP() * m1 * lu.permutationQ(), l*u);
153 VERIFY_RAISES_ASSERT(lu.permutationP())
168 VERIFY_RAISES_ASSERT(plu.permutationP())
cholesky.cpp 277 VERIFY_RAISES_ASSERT(ldlt.permutationP())
  /external/eigen/Eigen/src/LU/
PartialPivLU.h 43 * The data of the LU decomposition can be directly accessed through the methods matrixLU(), permutationP().
108 inline const PermutationType& permutationP() const
452 dst = dec().permutationP() * rhs();
FullPivLU.h 37 * permutationP(), permutationQ().
131 inline const PermutationPType& permutationP() const
139 * \sa permutationP()
689 c = dec().permutationP() * rhs();
  /external/eigen/Eigen/src/UmfPackSupport/
UmfPackSupport.h 179 inline const IntColVectorType& permutationP() const
  /external/eigen/Eigen/src/SparseCholesky/
SimplicialCholesky.h 151 const PermutationMatrix<Dynamic,Dynamic,Index>& permutationP() const
155 * \sa permutationP() */
  /external/eigen/Eigen/src/SuperLUSupport/
SuperLUSupport.h 546 inline const IntColVectorType& permutationP() const

Completed in 355 milliseconds