Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

I am working on an eigensolver in PLAPACK, which has built-in functionality to find the QR decomposition of a general matrix of double precision floating point numbers. I am familiar with the concept of iterating QR to find the eigenvalues of a matrix $A$, and at every iteration, I will have access to the contents of $A$, $Q_i$, and $R_i$ for $i\geq 1$.

I was wondering if there's a convenient way to find the eigenvectors, rather than solving $(A-\lambda_i I)v = 0$ for each $\lambda_i$?

share|improve this question
    
Try posting this on SciComp –  Inquest Mar 12 '12 at 14:22

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.