Searched refs:permutationQ (Results 1 – 5 of 5) sorted by relevance
142 inline const PermutationQType& permutationQ() const in permutationQ() function628 …for(Index i = 0; i < rank(); ++i) dst.row(dec().permutationQ().indices().coeff(i)) = -m.row(i).tai…629 for(Index i = rank(); i < cols; ++i) dst.row(dec().permutationQ().indices().coeff(i)).setZero();630 …for(Index k = 0; k < dimker; ++k) dst.coeffRef(dec().permutationQ().indices().coeff(rank()+k), k) …668 dst.col(i) = originalMatrix().col(dec().permutationQ().indices().coeff(pivots.coeff(i)));726 dst.row(dec().permutationQ().indices().coeff(i)) = c.row(i);728 dst.row(dec().permutationQ().indices().coeff(i)).setZero();
16 cout << lu.permutationP().inverse() * l * u * lu.permutationQ().inverse() << endl;
74 VERIFY_IS_APPROX(lu.permutationP() * m1 * lu.permutationQ(), l*u); in lu_non_invertible()156 VERIFY_RAISES_ASSERT(lu.permutationQ()) in lu_verify_assert()
195 inline const IntRowVectorType& permutationQ() const
552 inline const IntRowVectorType& permutationQ() const