Searched refs:m_permutation (Results 1 - 5 of 5) sorted by relevance

/external/eigen/Eigen/src/Core/
H A DPermutationMatrix.h547 : m_permutation(perm), m_matrix(matrix)
564 Matrix<bool,PermutationType::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; member in struct:Eigen::internal::permut_matrix_product_retval
681 const PermutationType& m_permutation; member in class:Eigen::Transpose
[all...]
/external/eigen/Eigen/src/SparseCore/
H A DSparsePermutation.h49 : 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; member in struct:Eigen::internal::permut_sparsematrix_product_retval
/external/eigen/unsupported/Eigen/src/LevenbergMarquardt/
H A DLMonestep.h50 m_permutation = (qrfac.colsPermutation());
77 if (m_wa2[m_permutation.indices()[j]] != 0.)
78 m_gnorm = (std::max)(m_gnorm, abs( m_rfactor.col(j).head(j+1).dot(m_qtf.head(j+1)/m_fnorm) / m_wa2[m_permutation.indices()[j]]));
116 m_wa3 = m_rfactor.template triangularView<Upper>() * (m_permutation.inverse() *m_wa1);
H A DLevenbergMarquardt.h213 PermutationType permutation() {return m_permutation; }
249 PermutationType m_permutation; member in class:Eigen::LevenbergMarquardt
/external/eigen/unsupported/Eigen/src/MatrixFunctions/
H A DMatrixFunction.h170 IntVectorType m_permutation; /**< \brief Permutation which groups ei'vals in the same cluster together */ member in class:Eigen::MatrixFunction
318 /** \brief Compute #m_permutation using #m_eivalToCluster and #m_blockStart */
323 m_permutation.resize(m_T.rows());
326 m_permutation[i] = indexNextEntry[cluster];
331 /** \brief Permute Schur decomposition in #m_U and #m_T according to #m_permutation */
335 IntVectorType p = m_permutation;

Completed in 110 milliseconds