Lines Matching full:rows
79 FullPivLU(Index rows, Index cols);
198 * b.rows()==A.rows(), where A is the matrix of which *this is the LU decomposition.
339 return rank() == rows();
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()));
371 inline Index rows() const { return m_lu.rows(); }
392 FullPivLU<MatrixType>::FullPivLU(Index rows, Index cols)
393 : m_lu(rows, cols),
394 m_p(rows),
396 m_rowsTranspositions(rows),
405 : m_lu(matrix.rows(), matrix.cols()),
406 m_p(matrix.rows()),
408 m_rowsTranspositions(matrix.rows()),
423 const Index rows = matrix.rows();
427 // can't accumulate on-the-fly because that will be done in reverse order for the rows.
428 m_rowsTranspositions.resize(matrix.rows());
442 biggest_in_corner = m_lu.bottomRightCorner(rows-k, cols-k)
480 if(k<rows-1)
481 m_lu.col(k).tail(rows-k-1) /= m_lu.coeff(k,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);
489 m_p.setIdentity(rows);
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());
585 // permuting the rows and cols to bring the nonnegligible pivots to the top of
675 const Index rows = dec().rows(), cols = dec().cols(),
677 eigen_assert(rhs().rows() == rows);
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)
