HomeSort by relevance Sort by last modified time
    Searched defs:colsPermutation (Results 1 - 5 of 5) sorted by null

  /external/eigen/Eigen/src/QR/
ColPivHouseholderQR.h 180 const PermutationType& colsPermutation() const
549 for(Index i = 0; i < nonzero_pivots; ++i) dst.row(dec().colsPermutation().indices().coeff(i)) = c.row(i);
550 for(Index i = nonzero_pivots; i < cols; ++i) dst.row(dec().colsPermutation().indices().coeff(i)).setZero();
FullPivHouseholderQR.h 170 const PermutationType& colsPermutation() const
534 for(Index i = 0; i < dec().rank(); ++i) dst.row(dec().colsPermutation().indices().coeff(i)) = c.row(i);
535 for(Index i = dec().rank(); i < cols; ++i) dst.row(dec().colsPermutation().indices().coeff(i)).setZero();
  /external/eigen/Eigen/src/SPQRSupport/
SuiteSparseQRSupport.h 43 * P is the column permutation. Use colsPermutation() to get it.
170 // colsPermutation() performs a copy of the permutation,
176 // dest = colsPermutation() * y.topRows(cols());
198 PermutationType colsPermutation() const
  /external/eigen/Eigen/src/SparseLU/
SparseLU.h 151 * \sa colsPermutation()
161 inline const PermutationType& colsPermutation() const
243 X.col(j) = colsPermutation().inverse() * X.col(j);
  /external/eigen/Eigen/src/SparseQR/
SparseQR.h 48 * rank-revealing permutations. Use colsPermutation() to get it.
152 const PermutationType& colsPermutation() const
183 if (m_perm_c.size()) dest = colsPermutation() * y.topRows(cols());

Completed in 131 milliseconds