Lines Matching full:rank
25 * are permutation matrices. This is a rank-revealing LU decomposition. The eigenvalues (diagonal
29 * the rank, invertibility, inverse, kernel, and determinant.
114 * \sa rank()
237 /** Allows to prescribe a threshold to be used by certain methods, such as rank(),
275 /** Returns the threshold that will be used by certain methods such as rank().
288 /** \returns the rank of the matrix of which *this is the LU decomposition.
294 inline Index rank() const
313 return cols() - rank();
326 return rank() == cols();
339 return rank() == rows();
550 const Index cols = dec().matrixLU().cols(), dimker = cols - rank();
576 Matrix<Index, Dynamic, 1, 0, MaxSmallDimAtCompileTime, 1> pivots(rank());
582 eigen_internal_assert(p == rank());
590 m(dec().matrixLU().block(0, 0, rank(), cols));
591 for(Index i = 0; i < rank(); ++i)
596 m.block(0, 0, rank(), rank());
597 m.block(0, 0, rank(), rank()).template triangularView<StrictlyLower>().setZero();
598 for(Index i = 0; i < rank(); ++i)
604 m.topLeftCorner(rank(), rank())
606 m.topRightCorner(rank(), dimker)
610 for(Index i = rank()-1; i >= 0; --i)
614 for(Index i = 0; i < rank(); ++i) dst.row(dec().permutationQ().indices().coeff(i)) = -m.row(i).tail(dimker);
615 for(Index i = rank(); i < cols; ++i) dst.row(dec().permutationQ().indices().coeff(i)).setZero();
616 for(Index k = 0; k < dimker; ++k) dst.coeffRef(dec().permutationQ().indices().coeff(rank()+k), k) = Scalar(1);
635 if(rank() == 0)
644 Matrix<Index, Dynamic, 1, 0, MaxSmallDimAtCompileTime, 1> pivots(rank());
650 eigen_internal_assert(p == rank());
652 for(Index i = 0; i < rank(); ++i)
