Lines Matching refs:Index
103 FullPivHouseholderQR(Index rows, Index cols)
246 inline Index rank() const
251 Index result = 0;
252 for(Index i = 0; i < m_nonzero_pivots; ++i)
263 inline Index dimensionOfKernel() const
318 inline Index rows() const { return m_qr.rows(); }
319 inline Index cols() const { return m_qr.cols(); }
385 inline Index nonzeroPivots() const
419 Index m_nonzero_pivots;
421 Index m_det_pq;
462 Index rows = m_qr.rows();
463 Index cols = m_qr.cols();
464 Index size = (std::min)(rows,cols);
475 Index number_of_transpositions = 0;
482 for (Index k = 0; k < size; ++k)
484 Index row_of_biggest_in_corner, col_of_biggest_in_corner;
500 for(Index i = k; i < size; i++)
532 for(Index k = 0; k < size; ++k)
545 const Index l_rank = rank();
558 for (Index k = 0; k < l_rank; ++k)
560 Index remainingSize = rows()-k;
571 for(Index i = 0; i < l_rank; ++i) dst.row(m_cols_permutation.indices().coeff(i)) = c.row(i);
572 for(Index i = l_rank; i < cols(); ++i) dst.row(m_cols_permutation.indices().coeff(i)).setZero();
615 const Index rows = m_qr.rows();
627 const Index rows = m_qr.rows();
628 const Index cols = m_qr.cols();
629 const Index size = (std::min)(rows, cols);
632 for (Index k = size-1; k >= 0; k--)
640 Index rows() const { return m_qr.rows(); }
641 Index cols() const { return m_qr.rows(); }
