Lines Matching defs:eigenvalues

30   * \brief Computes eigenvalues and eigenvectors of selfadjoint matrices
38 * transpose. This class computes the eigenvalues and eigenvectors of a
40 * \f$ v \f$ such that \f$ Av = \lambda v \f$. The eigenvalues of a
42 * the eigenvalues on the diagonal, and \f$ V \f$ is a matrix with the
53 * Call the function compute() to compute the eigenvalues and eigenvectors of
56 * the eigenvalues and eigenvectors at construction time. Once the eigenvalue
57 * and eigenvectors are computed, they can be retrieved with the eigenvalues()
66 * \sa MatrixBase::eigenvalues(), class EigenSolver, class ComplexEigenSolver
94 /** \brief Type for vector of eigenvalues as returned by eigenvalues().
122 * eigenvalues and eigenvectors will be computed.
145 * eigenvalues of the matrix \p matrix. The eigenvectors are computed if
169 * This function computes the eigenvalues of \p matrix. The eigenvalues()
217 * to eigenvalue number \f$ k \f$ as returned by eigenvalues(). The
226 * \sa eigenvalues()
231 eigen_assert(m_eigenvectorsOk && "The eigenvectors have not been computed together with the eigenvalues.");
235 /** \brief Returns the eigenvalues of given matrix.
237 * \returns A const reference to the column vector containing the eigenvalues.
239 * \pre The eigenvalues have been computed before.
241 * The eigenvalues are repeated according to their algebraic multiplicity,
242 * so there are as many eigenvalues as rows in the matrix. The eigenvalues
248 * \sa eigenvectors(), MatrixBase::eigenvalues()
250 const RealVectorType& eigenvalues() const
260 * \pre The eigenvalues and eigenvectors of a positive-definite matrix
277 eigen_assert(m_eigenvectorsOk && "The eigenvectors have not been computed together with the eigenvalues.");
285 * \pre The eigenvalues and eigenvectors of a positive-definite matrix
302 eigen_assert(m_eigenvectorsOk && "The eigenvectors have not been computed together with the eigenvalues.");
453 // Sort eigenvalues and corresponding vectors.
504 // eigenvalues are the roots to this equation, all guaranteed to be
523 // Compute the eigenvalues by solving for the roots of the polynomial.
559 // compute the eigenvalues
639 // if so the last two eigenvalues are likely to ve very closed to each other
662 // 2x2 direct eigenvalues decomposition, code from Hauke Heibel
695 // Compute the eigenvalues