Lines Matching full:rows
74 static const int Rows = Traits::RowsAtCompileTime;
81 typedef Matrix<ComplexScalar, Rows, Cols, Options, MaxRows, MaxCols> ComplexMatrix;
238 const Index rows = m_T.rows();
241 for (Index i=0; i<rows; ++i) {
253 for (Index j=i+1; j<rows; ++j) {
288 const Index rows = m_T.rows();
293 m_eivalToCluster.resize(rows);
296 for (Index i = 0; i < diag.rows(); ++i) {
310 m_blockStart.resize(m_clusterSize.rows());
312 for (Index i = 1; i < m_clusterSize.rows(); i++) {
322 m_permutation.resize(m_T.rows());
323 for (Index i = 0; i < m_T.rows(); i++) {
335 for (Index i = 0; i < p.rows() - 1; i++) {
337 for (j = i; j < p.rows(); j++) {
348 /** \brief Swap rows \a index and \a index+1 in Schur decomposition in #m_U and #m_T */
368 m_fT.resize(m_T.rows(), m_T.cols());
370 for (Index i = 0; i < m_clusterSize.rows(); ++i) {
392 for (Index diagIndex = 1; diagIndex < m_clusterSize.rows(); diagIndex++) {
393 for (Index blockIndex = 0; blockIndex < m_clusterSize.rows() - diagIndex; blockIndex++) {
437 eigen_assert(A.rows() == A.cols());
439 eigen_assert(B.rows() == B.cols());
441 eigen_assert(C.rows() == A.rows());
442 eigen_assert(C.cols() == B.rows());
444 Index m = A.rows();
445 Index n = B.rows();
527 Index rows() const { return m_A.rows(); }
552 eigen_assert(rows() == cols());
559 eigen_assert(rows() == cols());
567 eigen_assert(rows() == cols());
575 eigen_assert(rows() == cols());
583 eigen_assert(rows() == cols());
