Lines Matching full:matrix
26 * \tparam _MatrixType the type of the matrix of which we are
28 * instantiation of the Matrix class template.
30 * The eigenvalues and eigenvectors of a matrix \f$ A \f$ are scalars
32 * \f$. If \f$ D \f$ is a diagonal matrix with the eigenvalues on
33 * the diagonal, and \f$ V \f$ is a matrix with the eigenvectors as
34 * its columns, then \f$ A V = V D \f$. The matrix \f$ V \f$ is
78 typedef Matrix<ComplexScalar, ColsAtCompileTime, 1, Options&(~RowMajor), MaxColsAtCompileTime, 1> EigenvalueType;
80 /** \brief Type for matrix of eigenvectors as returned by eigenvectors().
82 * This is a square matrix with entries of type #ComplexScalar.
85 typedef Matrix<ComplexScalar, RowsAtCompileTime, ColsAtCompileTime, Options, MaxRowsAtCompileTime, MaxColsAtCompileTime> EigenvectorType;
116 /** \brief Constructor; computes eigendecomposition of given matrix.
118 * \param[in] matrix Square matrix whose eigendecomposition is to be computed.
125 ComplexEigenSolver(const MatrixType& matrix, bool computeEigenvectors = true)
126 : m_eivec(matrix.rows(),matrix.cols()),
127 m_eivalues(matrix.cols()),
128 m_schur(matrix.rows()),
131 m_matX(matrix.rows(),matrix.cols())
133 compute(matrix, computeEigenvectors);
136 /** \brief Returns the eigenvectors of given matrix.
138 * \returns A const reference to the matrix whose columns are the eigenvectors.
141 * ComplexEigenSolver(const MatrixType& matrix, bool) or the member
142 * function compute(const MatrixType& matrix, bool) has been called before
143 * to compute the eigendecomposition of a matrix, and
146 * This function returns a matrix whose columns are the eigenvectors. Column
149 * have (Euclidean) norm equal to one. The matrix returned by this
150 * function is the matrix \f$ V \f$ in the eigendecomposition \f$ A = V D
163 /** \brief Returns the eigenvalues of given matrix.
168 * ComplexEigenSolver(const MatrixType& matrix, bool) or the member
169 * function compute(const MatrixType& matrix, bool) has been called before
170 * to compute the eigendecomposition of a matrix.
175 * rows in the matrix. The eigenvalues are not sorted in any particular
187 /** \brief Computes eigendecomposition of given matrix.
189 * \param[in] matrix Square matrix whose eigendecomposition is to be computed.
195 * This function computes the eigenvalues of the complex matrix \p matrix.
200 * The matrix is first reduced to Schur form using the
206 * is the size of the matrix.
211 ComplexEigenSolver& compute(const MatrixType& matrix, bool computeEigenvectors = true);
238 ComplexEigenSolver<MatrixType>& ComplexEigenSolver<MatrixType>::compute(const MatrixType& matrix, bool computeEigenvectors)
241 assert(matrix.cols() == matrix.rows());
245 m_schur.compute(matrix, computeEigenvectors);
251 doComputeEigenvectors(matrix.norm());
267 // The matrix X is unit triangular.
