Skip to main content
K
kmakhov1-Visitor
1-Visitor
February 28, 2020
Solved

Orthogonal left/right eigenvectors

  • February 28, 2020
  • 1 reply
  • 2731 views

Hello, community!

So far faced nonsymmetric matrix. Normally diagonalization of this kind matrices goes through transposed left and nontransposed right eigenvectors. With the command L=eigenvecs(A,"L") and R=eigenvecs(A,"R") we are supposed to get orthogonal eigen space. This functions do not provide orthogonality in some cases. But if restoring the eigenvectors by each eigenvalue, it is.

Left_Right_eigenvectors.JPG

Does anyone know if there is something special I'm missing about left-right eigenvectors commands?

Best answer by LucMeekes

I thinks this should do it.

First read the help on eigenvals en eigenvecs:

  • eigenvals(M)—Returns a vector whose elements are the eigenvalues of M.
  • eigenvec(M, z)—Returns a single normalized eigenvector associated with eigenvalue z of M. The eigenvector is normalized to unit length. The eigenvec functions uses an inverse iteration algorithm.
  • eigenvecs(M, ["L"])—Returns a matrix containing all normalized eigenvectors of the matrix M. The nth column of the returned matrix is an eigenvector corresponding to the nth eigenvalue returned by eigenvals. The right eigenvector is returned by default. The eigenvecs function can also return the left eigenvector, satisfying vH · M = z · vH, where H indicates conjugate transpose (of v in this case).

Further information on the 'conjugate transpose' is found in the help on the svds() function:

  • svds(A)—Returns a vector containing the singular values of A, the positive square roots of the eigenvalues of matrix AH·A, where AH is the conjugate transpose of A. You can compute AH using the transpose and complex conjugate operators as follows.

LucMeekes_0-1582999587019.png

 

See for more information the attached Prime 4 file

 

Success!
Luc

 

 

1 reply

L
LucMeekes23-Emerald IVAnswer
23-Emerald IV
February 29, 2020

I thinks this should do it.

First read the help on eigenvals en eigenvecs:

  • eigenvals(M)—Returns a vector whose elements are the eigenvalues of M.
  • eigenvec(M, z)—Returns a single normalized eigenvector associated with eigenvalue z of M. The eigenvector is normalized to unit length. The eigenvec functions uses an inverse iteration algorithm.
  • eigenvecs(M, ["L"])—Returns a matrix containing all normalized eigenvectors of the matrix M. The nth column of the returned matrix is an eigenvector corresponding to the nth eigenvalue returned by eigenvals. The right eigenvector is returned by default. The eigenvecs function can also return the left eigenvector, satisfying vH · M = z · vH, where H indicates conjugate transpose (of v in this case).

Further information on the 'conjugate transpose' is found in the help on the svds() function:

  • svds(A)—Returns a vector containing the singular values of A, the positive square roots of the eigenvalues of matrix AH·A, where AH is the conjugate transpose of A. You can compute AH using the transpose and complex conjugate operators as follows.

LucMeekes_0-1582999587019.png

 

See for more information the attached Prime 4 file

 

Success!
Luc

 

 

    K
    kmakhov1-VisitorAuthor
    1-Visitor
    March 6, 2020

    Dear Luc

     

    Thank you for the explanation. Indeed I was missing the point about the conjugate transpose when finding left eigenvectors.

    Normally when working with the dynamic analisys I diagonalized the matrices (with the symmetric ones you do it with the right eigenvectors only) easily for the convolution integral to get the responce of the structure to the certain force function. But now I see that for nonsymmetric things it turns to be much harder, since these matrices are not always (I would say almost never) diagonalized with the left/right eigenvectors. 

    I appreciate if you can give an idea about in which direction to think or a short practical case.

    I'm reading Wilkinson and the other literature for the dynamic analisys. But the math they provide seems to me very chalenging.

     

    Regards,

    Kirill

    Terms & ConditionsAccessibility statement