Lines Matching refs:rank
25 * upper-triangular, and P and Q are permutation matrices. This is a rank-revealing LU
30 * the rank, invertibility, inverse, kernel, and determinant.
115 * \sa rank()
238 /** Allows to prescribe a threshold to be used by certain methods, such as rank(),
276 /** Returns the threshold that will be used by certain methods such as rank().
289 /** \returns the rank of the matrix of which *this is the LU decomposition.
295 inline Index rank() const
315 return cols() - rank();
328 return rank() == cols();
341 return rank() == rows();
556 const Index cols = dec().matrixLU().cols(), dimker = cols - rank();
582 Matrix<Index, Dynamic, 1, 0, MaxSmallDimAtCompileTime, 1> pivots(rank());
588 eigen_internal_assert(p == rank());
596 m(dec().matrixLU().block(0, 0, rank(), cols));
597 for(Index i = 0; i < rank(); ++i)
602 m.block(0, 0, rank(), rank());
603 m.block(0, 0, rank(), rank()).template triangularView<StrictlyLower>().setZero();
604 for(Index i = 0; i < rank(); ++i)
610 m.topLeftCorner(rank(), rank())
612 m.topRightCorner(rank(), dimker)
616 for(Index i = rank()-1; i >= 0; --i)
620 for(Index i = 0; i < rank(); ++i) dst.row(dec().permutationQ().indices().coeff(i)) = -m.row(i).tail(dimker);
621 for(Index i = rank(); i < cols; ++i) dst.row(dec().permutationQ().indices().coeff(i)).setZero();
622 for(Index k = 0; k < dimker; ++k) dst.coeffRef(dec().permutationQ().indices().coeff(rank()+k), k) = Scalar(1);
642 if(rank() == 0)
651 Matrix<Index, Dynamic, 1, 0, MaxSmallDimAtCompileTime, 1> pivots(rank());
657 eigen_internal_assert(p == rank());
659 for(Index i = 0; i < rank(); ++i)
