Searched refs:m_permutation (Results 1 – 5 of 5) sorted by relevance
547 : m_permutation(perm), m_matrix(matrix)564 …ationType::RowsAtCompileTime,1,0,PermutationType::MaxRowsAtCompileTime> mask(m_permutation.size());567 while(r < m_permutation.size())570 while(r<m_permutation.size() && mask[r]) r++;571 if(r>=m_permutation.size())577 for(Index k=m_permutation.indices().coeff(k0); k!=k0; k=m_permutation.indices().coeff(k))593 (dst, ((Side==OnTheLeft) ^ Transposed) ? m_permutation.indices().coeff(i) : i)598 (m_matrix, ((Side==OnTheRight) ^ Transposed) ? m_permutation.indices().coeff(i) : i);604 const PermutationType& m_permutation;640 Transpose(const PermutationType& p) : m_permutation(p) {}[all …]
49 : m_permutation(perm), m_matrix(matrix)63 Index jp = m_permutation.indices().coeff(j);69 Index jp = m_permutation.indices().coeff(j);84 perm = m_permutation;86 perm = m_permutation.transpose();100 const PermutationType& m_permutation;
50 m_permutation = (qrfac.colsPermutation()); in minimizeOneStep()77 if (m_wa2[m_permutation.indices()[j]] != 0.) in minimizeOneStep()78 … abs( m_rfactor.col(j).head(j+1).dot(m_qtf.head(j+1)/m_fnorm) / m_wa2[m_permutation.indices()[j]])… in minimizeOneStep()116 m_wa3 = m_rfactor.template triangularView<Upper>() * (m_permutation.inverse() *m_wa1); in minimizeOneStep()
213 PermutationType permutation() {return m_permutation; } in permutation()249 PermutationType m_permutation; variable
170 …IntVectorType m_permutation; /**< \brief Permutation which groups ei'vals in the same cluster toge… variable323 m_permutation.resize(m_T.rows()); in constructPermutation()326 m_permutation[i] = indexNextEntry[cluster]; in constructPermutation()335 IntVectorType p = m_permutation; in permuteSchur()