Searched refs:l_rank (Results 1 – 2 of 2) sorted by relevance
545 const Index l_rank = rank();549 if(l_rank==0)558 for (Index k = 0; k < l_rank; ++k)567 m_qr.topLeftCorner(l_rank, l_rank)569 .solveInPlace(c.topRows(l_rank));571 for(Index i = 0; i < l_rank; ++i) dst.row(m_cols_permutation.indices().coeff(i)) = c.row(i);572 for(Index i = l_rank; i < cols(); ++i) dst.row(m_cols_permutation.indices().coeff(i)).setZero();
267 Index l_rank = rank(); in _solve_impl() local268 tmp.noalias() = m_matrixU.leftCols(l_rank).adjoint() * rhs; in _solve_impl()269 tmp = m_singularValues.head(l_rank).asDiagonal().inverse() * tmp; in _solve_impl()270 dst = m_matrixV.leftCols(l_rank) * tmp; in _solve_impl()