Lines Matching full:rows
119 * b.rows()==A.rows(), where A is the matrix of which *this is the LU decomposition.
150 (*this, MatrixType::Identity(m_lu.rows(), m_lu.cols()));
170 inline Index rows() const { return m_lu.rows(); }
203 : m_lu(matrix.rows(), matrix.rows()),
204 m_p(matrix.rows()),
205 m_rowsTranspositions(matrix.rows()),
241 const Index rows = lu.rows();
243 const Index size = (std::min)(rows,cols);
248 Index rrows = rows-k-1;
253 = lu.col(k).tail(rows-k).cwiseAbs().maxCoeff(&row_of_biggest_in_col);
277 if(k<rows-1)
284 * by the variables \a rows, \a cols, \a lu_data, and \a lu_stride using a
298 static Index blocked_lu(Index rows, Index cols, Scalar* lu_data, Index luStride, PivIndex* row_transpositions, PivIndex& nb_transpositions, Index maxBlockSize=256)
300 MapLU lu1(lu_data,StorageOrder==RowMajor?rows:luStride,StorageOrder==RowMajor?luStride:cols);
301 MatrixType lu(lu1,0,0,rows,cols);
303 const Index size = (std::min)(rows,cols);
325 Index trows = rows - k - bs; // trailing rows
332 BlockType A_0(lu,0,0,rows,k);
333 BlockType A_2(lu,0,k+bs,rows,tsize);
381 ::blocked_lu(lu.rows(), lu.cols(), &lu.coeffRef(0,0), lu.outerStride(), &row_transpositions.coeffRef(0), nb_transpositions);
391 eigen_assert(matrix.rows() == matrix.cols() && "PartialPivLU is only for square (and moreover invertible) matrices");
392 const Index size = matrix.rows();
449 eigen_assert(rhs().rows() == dec().matrixLU().rows());
