The eigenvalues, each repeated according to its multiplicity. The
eigenvalues are not necessarily ordered. The resulting array will be
of complex type, unless the imaginary part is zero in which case it
will be cast to a real type. When a is real the resulting eigenvalues
will be real (0 imaginary part) or occur in conjugate pairs
v : (…, M, M) array
The normalized (unit “length”) eigenvectors, such that the column
v[:,i] is the eigenvector corresponding to the eigenvalue w[i].
从那一页的笔记部分
This is implemented using the _geev LAPACK routines which compute the
eigenvalues and eigenvectors of general square arrays.
The number w is an eigenvalue of a if there exists a vector v such
that dot(a,v) = w * v. Thus, the arrays a, w, and v satisfy the
equations dot(a[:,:], v[:,i]) = w[i] * v[:,i] for i \in {0,...,M-1}.
The array v of eigenvectors may not be of maximum rank, that is, some
of the columns may be linearly dependent, although round-off error may
obscure that fact. If the eigenvalues are all different, then
theoretically the eigenvectors are linearly independent. Likewise, the
(complex-valued) matrix of eigenvectors v is unitary if the matrix a
is normal, i.e., if dot(a, a.H) = dot(a.H, a), where a.H denotes the
conjugate transpose of a.
Finally, it is emphasized that v consists of the right (as in
right-hand side) eigenvectors of a. A vector y satisfying dot(y.T, a)
= z * y.T for some number z is called a left eigenvector of a, and, in general, the left and right eigenvectors of a matrix are not
necessarily the (perhaps conjugate) transposes of each other.
从documentation
从那一页的笔记部分
相关问题 更多 >
编程相关推荐