Lines Matching full:cols
79 FullPivLU(Index rows, Index cols);
313 return cols() - rank();
326 return rank() == cols();
351 return isInjective() && (m_lu.rows() == m_lu.cols());
364 eigen_assert(m_lu.rows() == m_lu.cols() && "You can't take the inverse of a non-square matrix!");
366 (*this, MatrixType::Identity(m_lu.rows(), m_lu.cols()));
372 inline Index cols() const { return m_lu.cols(); }
392 FullPivLU<MatrixType>::FullPivLU(Index rows, Index cols)
393 : m_lu(rows, cols),
395 m_q(cols),
397 m_colsTranspositions(cols),
405 : m_lu(matrix.rows(), matrix.cols()),
407 m_q(matrix.cols()),
409 m_colsTranspositions(matrix.cols()),
424 const Index cols = matrix.cols();
429 m_colsTranspositions.resize(matrix.cols());
442 biggest_in_corner = m_lu.bottomRightCorner(rows-k, cols-k)
483 m_lu.block(k+1,k+1,rows-k-1,cols-k-1).noalias() -= m_lu.col(k).tail(rows-k-1) * m_lu.row(k).tail(cols-k-1);
493 m_q.setIdentity(cols);
505 eigen_assert(m_lu.rows() == m_lu.cols() && "You can't take the determinant of a non-square matrix!");
516 const Index smalldim = (std::min)(m_lu.rows(), m_lu.cols());
518 MatrixType res(m_lu.rows(),m_lu.cols());
550 const Index cols = dec().matrixLU().cols(), dimker = cols - rank();
585 // permuting the rows and cols to bring the nonnegligible pivots to the top of
590 m(dec().matrixLU().block(0, 0, rank(), cols));
594 m.row(i).tail(cols-i) = dec().matrixLU().row(pivots.coeff(i)).tail(cols-i);
615 for(Index i = rank(); i < cols; ++i) dst.row(dec().permutationQ().indices().coeff(i)).setZero();
675 const Index rows = dec().rows(), cols = dec().cols(),
678 const Index smalldim = (std::min)(rows, cols);
686 typename Rhs::PlainObject c(rhs().rows(), rhs().cols());
696 if(rows>cols)
698 c.bottomRows(rows-cols)
699 -= dec().matrixLU().bottomRows(rows-cols)
700 * c.topRows(cols);
712 for(Index i = nonzero_pivots; i < dec().matrixLU().cols(); ++i)
