Lines Matching refs:cols
80 FullPivLU(Index rows, Index cols);
315 return cols() - rank();
328 return rank() == cols();
353 return isInjective() && (m_lu.rows() == m_lu.cols());
366 eigen_assert(m_lu.rows() == m_lu.cols() && "You can't take the inverse of a non-square matrix!");
368 (*this, MatrixType::Identity(m_lu.rows(), m_lu.cols()));
374 inline Index cols() const { return m_lu.cols(); }
394 FullPivLU<MatrixType>::FullPivLU(Index rows, Index cols)
395 : m_lu(rows, cols),
397 m_q(cols),
399 m_colsTranspositions(cols),
407 : m_lu(matrix.rows(), matrix.cols()),
409 m_q(matrix.cols()),
411 m_colsTranspositions(matrix.cols()),
422 eigen_assert(matrix.rows()<=NumTraits<int>::highest() && matrix.cols()<=NumTraits<int>::highest());
429 const Index cols = matrix.cols();
434 m_colsTranspositions.resize(matrix.cols());
447 biggest_in_corner = m_lu.bottomRightCorner(rows-k, cols-k)
488 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);
498 m_q.setIdentity(cols);
510 eigen_assert(m_lu.rows() == m_lu.cols() && "You can't take the determinant of a non-square matrix!");
521 const Index smalldim = (std::min)(m_lu.rows(), m_lu.cols());
523 MatrixType res(m_lu.rows(),m_lu.cols());
556 const Index cols = dec().matrixLU().cols(), dimker = cols - rank();
591 // permuting the rows and cols to bring the nonnegligible pivots to the top of
596 m(dec().matrixLU().block(0, 0, rank(), cols));
600 m.row(i).tail(cols-i) = dec().matrixLU().row(pivots.coeff(i)).tail(cols-i);
621 for(Index i = rank(); i < cols; ++i) dst.row(dec().permutationQ().indices().coeff(i)).setZero();
682 const Index rows = dec().rows(), cols = dec().cols(),
685 const Index smalldim = (std::min)(rows, cols);
693 typename Rhs::PlainObject c(rhs().rows(), rhs().cols());
703 if(rows>cols)
705 c.bottomRows(rows-cols)
706 -= dec().matrixLU().bottomRows(rows-cols)
707 * c.topRows(cols);
719 for(Index i = nonzero_pivots; i < dec().matrixLU().cols(); ++i)
