Lines Matching refs:Index
129 typedef typename MatrixType::Index Index;
135 typedef Matrix<Index, Traits::RowsAtCompileTime, 1> IntVectorType;
136 typedef Matrix<Index, Dynamic, 1> DynamicIntVectorType;
155 void swapEntriesInSchur(Index index);
157 Block<MatrixType> block(MatrixType& A, Index i, Index j);
169 DynamicIntVectorType m_blockStart; /**< \brief Row index at which block corresponding to i-th cluster starts */
239 const Index rows = m_T.rows();
242 for (Index i=0; i<rows; ++i) {
254 for (Index j=i+1; j<rows; ++j) {
289 const Index rows = m_T.rows();
291 const Index numClusters = static_cast<Index>(m_clusters.size());
295 Index clusterIndex = 0;
297 for (Index i = 0; i < diag.rows(); ++i) {
313 for (Index i = 1; i < m_clusterSize.rows(); i++) {
324 for (Index i = 0; i < m_T.rows(); i++) {
325 Index cluster = m_eivalToCluster[i];
336 for (Index i = 0; i < p.rows() - 1; i++) {
337 Index j;
342 for (Index k = j-1; k >= i; k--) {
349 /** \brief Swap rows \a index and \a index+1 in Schur decomposition in #m_U and #m_T */
351 void MatrixFunction<MatrixType,AtomicType,1>::swapEntriesInSchur(Index index)
354 rotation.makeGivens(m_T(index, index+1), m_T(index+1, index+1) - m_T(index, index));
355 m_T.applyOnTheLeft(index, index+1, rotation.adjoint());
356 m_T.applyOnTheRight(index, index+1, rotation);
357 m_U.applyOnTheRight(index, index+1, rotation);
371 for (Index i = 0; i < m_clusterSize.rows(); ++i) {
378 Block<MatrixType> MatrixFunction<MatrixType,AtomicType,1>::block(MatrixType& A, Index i, Index j)
393 for (Index diagIndex = 1; diagIndex < m_clusterSize.rows(); diagIndex++) {
394 for (Index blockIndex = 0; blockIndex < m_clusterSize.rows() - diagIndex; blockIndex++) {
400 for (Index k = blockIndex + 1; k < blockIndex + diagIndex; k++) {
445 Index m = A.rows();
446 Index n = B.rows();
449 for (Index i = m - 1; i >= 0; --i) {
450 for (Index j = 0; j < n; ++j) {
494 typedef typename Derived::Index Index;
528 Index rows() const { return m_A.rows(); }
529 Index cols() const { return m_A.cols(); }
