/external/eigen/doc/snippets/ |
ComplexEigenSolver_eigenvectors.cpp | 4 << endl << ces.eigenvectors().col(1) << endl;
|
EigenSolver_eigenvectors.cpp | 4 << endl << es.eigenvectors().col(1) << endl;
|
SelfAdjointEigenSolver_eigenvectors.cpp | 4 << endl << es.eigenvectors().col(1) << endl;
|
ComplexEigenSolver_compute.cpp | 7 cout << "The matrix of eigenvectors, V, is:" << endl << ces.eigenvectors() << endl << endl; 11 VectorXcf v = ces.eigenvectors().col(0); 16 << ces.eigenvectors() * ces.eigenvalues().asDiagonal() * ces.eigenvectors().inverse() << endl;
|
EigenSolver_EigenSolver_MatrixType.cpp | 6 cout << "The matrix of eigenvectors, V, is:" << endl << es.eigenvectors() << endl << endl; 10 VectorXcd v = es.eigenvectors().col(0); 15 MatrixXcd V = es.eigenvectors();
|
SelfAdjointEigenSolver_SelfAdjointEigenSolver_MatrixType.cpp | 7 cout << "The matrix of eigenvectors, V, is:" << endl << es.eigenvectors() << endl << endl; 11 VectorXd v = es.eigenvectors().col(0); 16 MatrixXd V = es.eigenvectors();
|
SelfAdjointEigenSolver_SelfAdjointEigenSolver_MatrixType2.cpp | 10 cout << "The matrix of eigenvectors, V, is:" << endl << es.eigenvectors() << endl << endl; 14 VectorXd v = es.eigenvectors().col(0);
|
/external/eigen/doc/examples/ |
TutorialLinAlgSelfAdjointEigenSolver.cpp | 15 cout << "Here's a matrix whose columns are eigenvectors of A \n" 17 << eigensolver.eigenvectors() << endl;
|
/external/eigen/test/ |
eigensolver_complex.cpp | 50 VERIFY_IS_APPROX(symmA * ei0.eigenvectors(), ei0.eigenvectors() * ei0.eigenvalues().asDiagonal()); 54 VERIFY_IS_APPROX(a * ei1.eigenvectors(), ei1.eigenvectors() * ei1.eigenvalues().asDiagonal()); 62 VERIFY_IS_EQUAL(ei2.eigenvectors(), ei1.eigenvectors()); 94 VERIFY_RAISES_ASSERT(eig.eigenvectors()); 99 VERIFY_RAISES_ASSERT(eig.eigenvectors());
|
eigensolver_generic.cpp | 42 VERIFY_IS_APPROX(a.template cast<Complex>() * ei1.eigenvectors(), 43 ei1.eigenvectors() * ei1.eigenvalues().asDiagonal()); 44 VERIFY_IS_APPROX(ei1.eigenvectors().colwise().norm(), RealVectorType::Ones(rows).transpose()); 50 VERIFY_IS_EQUAL(ei2.eigenvectors(), ei1.eigenvectors()); 78 VERIFY_RAISES_ASSERT(eig.eigenvectors()); 85 VERIFY_RAISES_ASSERT(eig.eigenvectors()); 120 V(0,0) = solver.eigenvectors()(0,0).real();
|
eigensolver_selfadjoint.cpp | 60 VERIFY((symmA.template selfadjointView<Lower>() * eiSymm.eigenvectors()).isApprox( 61 eiSymm.eigenvectors() * eiSymm.eigenvalues().asDiagonal(), largerEps)); 65 VERIFY((symmA.template selfadjointView<Lower>() * eiDirect.eigenvectors()).isApprox( 66 eiDirect.eigenvectors() * eiDirect.eigenvalues().asDiagonal(), largerEps)); 76 VERIFY((symmC.template selfadjointView<Lower>() * eiSymmGen.eigenvectors()).isApprox( 77 symmB.template selfadjointView<Lower>() * (eiSymmGen.eigenvectors() * eiSymmGen.eigenvalues().asDiagonal()), largerEps)); 82 VERIFY((symmB.template selfadjointView<Lower>() * (symmC.template selfadjointView<Lower>() * eiSymmGen.eigenvectors())).isApprox( 83 (eiSymmGen.eigenvectors() * eiSymmGen.eigenvalues().asDiagonal()), largerEps)); 88 VERIFY((symmC.template selfadjointView<Lower>() * (symmB.template selfadjointView<Lower>() * eiSymmGen.eigenvectors())).isApprox( 89 (eiSymmGen.eigenvectors() * eiSymmGen.eigenvalues().asDiagonal()), largerEps)) [all...] |
/external/apache-commons-math/src/main/java/org/apache/commons/math/linear/ |
EigenDecompositionImpl.java | 77 /** Eigenvectors. */ 78 private ArrayRealVector[] eigenvectors; field in class:EigenDecompositionImpl 162 final int m = eigenvectors.length; 165 cachedV.setColumnVector(k, eigenvectors[k]); 186 final int m = eigenvectors.length; 189 cachedVt.setRowVector(k, eigenvectors[k]); 223 return eigenvectors[i].copy(); 240 return new Solver(realEigenvalues, imagEigenvalues, eigenvectors); 252 /** Eigenvectors. */ 253 private final ArrayRealVector[] eigenvectors; field in class:EigenDecompositionImpl.Solver [all...] |
/external/eigen/test/eigen2/ |
eigen2_eigensolver.cpp | 67 VERIFY_IS_APPROX(_evec.cwise().abs(), eiSymm.eigenvectors().cwise().abs()); 77 MatrixType normalized_eivec = eiSymmGen.eigenvectors()*eiSymmGen.eigenvectors().colwise().norm().asDiagonal().inverse(); 88 VERIFY((symmA * eiSymm.eigenvectors()).isApprox( 89 eiSymm.eigenvectors() * eiSymm.eigenvalues().asDiagonal(), largerEps)); 92 VERIFY((symmA * eiSymmGen.eigenvectors()).isApprox( 93 symmB * (eiSymmGen.eigenvectors() * eiSymmGen.eigenvalues().asDiagonal()), largerEps)); 127 VERIFY_IS_APPROX(a.template cast<Complex>() * ei1.eigenvectors(), 128 ei1.eigenvectors() * ei1.eigenvalues().asDiagonal());
|
/external/eigen/unsupported/test/ |
matrix_functions.h | 29 result = (es.eigenvectors() * eivals.asDiagonal() * es.eigenvectors().inverse()).real();
|
mpreal_support.cpp | 48 VERIFY( (S.selfadjointView<Lower>() * eig.eigenvectors()).isApprox(eig.eigenvectors() * eig.eigenvalues().asDiagonal(), NumTraits<mpreal>::dummy_precision()*1e3) );
|
/external/eigen/lapack/ |
eigenvalues.cpp | 76 matrix(a,*n,*n,*lda) = eig.eigenvectors();
|
/external/eigen/Eigen/src/Eigen2Support/ |
LeastSquares.h | 158 result->normal() = eig.eigenvectors().col(0);
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/drawing/ |
layout.py | 389 """Position nodes using the eigenvectors of the graph Laplacian. 477 eigenvalues,eigenvectors=np.linalg.eig(L) 480 return np.real(eigenvectors[:,index]) 510 # return smallest k eigenvalues and eigenvectors 511 eigenvalues,eigenvectors=eigsh(L,k,which='SM',ncv=ncv) 513 return np.real(eigenvectors[:,index])
|
/external/eigen/bench/ |
benchEigenSolver.cpp | 61 acc += ei.eigenvectors().coeff(r,c); 75 acc += ei.eigenvectors().coeff(r,c);
|
eig33.cpp | 193 if(evecs.col(k).dot(eig.eigenvectors().col(k))<0) 195 std::cerr << evecs - eig.eigenvectors() << "\n\n";
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/link_analysis/ |
pagerank_alg.py | 281 eigenvalues,eigenvectors=np.linalg.eig(M.T) 284 largest=np.array(eigenvectors[:,ind[-1]]).flatten().real
|
/external/opencv/cv/src/ |
cvshapedescr.cpp | 788 double eigenvalues[6], eigenvectors[36]; local 797 CvMat _EIGVECS = cvMat(6,6,CV_64F,eigenvectors), _EIGVALS = cvMat(6,1,CV_64F,eigenvalues); 858 eigenvectors[i*6 + j] *= a; 890 _EIGVECS = cvMat( 6, 1, CV_64F, eigenvectors + 6*i ); 958 _EIGVECS = cvMat( 2, 2, CV_64F, eigenvectors ); 962 // exteract axis length from eigenvectors 967 box->angle = (float)(180 - atan2(eigenvectors[2], eigenvectors[3])*180/CV_PI); [all...] |
/external/eigen/Eigen/src/Eigenvalues/ |
ComplexEigenSolver.h | 24 * \brief Computes eigenvalues and eigenvectors of general complex matrices 30 * The eigenvalues and eigenvectors of a matrix \f$ A \f$ are scalars 33 * the diagonal, and \f$ V \f$ is a matrix with the eigenvectors as 39 * eigenvalues and eigenvectors of a given function. The 80 /** \brief Type for matrix of eigenvectors as returned by eigenvectors(). 119 * \param[in] computeEigenvectors If true, both the eigenvectors and the 136 /** \brief Returns the eigenvectors of given matrix. 138 * \returns A const reference to the matrix whose columns are the eigenvectors. 146 * This function returns a matrix whose columns are the eigenvectors. Colum 156 const EigenvectorType& eigenvectors() const function in class:Eigen::ComplexEigenSolver [all...] |
EigenSolver.h | 23 * \brief Computes eigenvalues and eigenvectors of general matrices 29 * The eigenvalues and eigenvectors of a matrix \f$ A \f$ are scalars 32 * \f$ V \f$ is a matrix with the eigenvectors as its columns, then \f$ A V = 36 * The eigenvalues and eigenvectors of a matrix may be complex, even when the 46 * Call the function compute() to compute the eigenvalues and eigenvectors of 49 * eigenvalues and eigenvectors at construction time. Once the eigenvalue and 50 * eigenvectors are computed, they can be retrieved with the eigenvalues() and 51 * eigenvectors() functions. The pseudoEigenvalueMatrix() and 99 /** \brief Type for matrix of eigenvectors as returned by eigenvectors(). 333 typename EigenSolver<MatrixType>::EigenvectorsType EigenSolver<MatrixType>::eigenvectors() const function in class:Eigen::EigenSolver [all...] |
/external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
MatrixSquareRoot.h | 145 = (es.eigenvectors() * es.eigenvalues().cwiseSqrt().asDiagonal() * es.eigenvectors().inverse()).real();
|