Lines Matching defs:rank
44 * \brief Sparse left-looking rank-revealing QR factorization
46 * This class implements a left-looking rank-revealing QR decomposition
52 * rank-revealing permutations. Use colsPermutation() to get it.
58 * R is the sparse triangular or trapezoidal matrix. The later occurs when A is rank-deficient.
59 * matrixR().topLeftCorner(rank(), rank()) always returns a triangular factor of full rank.
149 Index rank() const
197 Index rank = this->rank();
206 y.topRows(rank) = this->matrixR().topLeftCorner(rank, rank).template triangularView<Upper>().solve(b.topRows(rank));
207 y.bottomRows(y.rows()-rank).setZero();
283 PermutationType m_pivotperm; // The permutation for rank revealing
396 * Tim Davis, "Algorithm 915, SuiteSparseQR: Multifrontal Multithreaded Rank-Revealing
414 // Left looking rank-revealing QR factorization: compute a column of R and Q at a time
426 // all the nodes (with indexes lower than rank) reachable through the column elimination tree (etree) rooted at node k.
