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 would like to ask for a reference on the problem of computing the eigenvalues/eigenvectors of tridiagonal matrices (not necessarily with constant diagonals).

I have seen authors use continued fractions and generating functions. However, I have thus far been unable to really grasp the foundations of this idea. From what I can see, the idea is really to reduce it to a difference equations. Then, perhaps, my request is for a good book on difference equations. Moreover, is there any technique which is really of a broad scope; ie applicable to a broad range of problems.

Thank you all in advance,

Gabieel

share|improve this question
1  
A few notes: if the products of the corresponding subdiagonal and superdiagonal elements are positive, you can, through a similarity transformation, always reduce your tridiagonal eigenproblem to a symmetric tridiagonal eigenproblem, which is very much well studied. The unsymmetric eigenproblems that do not yield to this treatment are said to be a difficult case for the QR algorithm and related methods. –  J. M. Aug 20 '12 at 3:27
    
See Horn and Johnson: Topics in Matrix Analysis. This book is reference in matrix analysis. –  Elias Nov 15 '12 at 20:10
    
@Elias Great. Thank you very much. –  Gabriel Landi Nov 17 '12 at 2:19
    
@Elias Please consider converting your comment into an answer, so that this question gets removed from the unanswered tab. If you do so, it is helpful to post it to this chat room to make people aware of it (and attract some upvotes). For further reading upon the issue of too many unanswered questions, see here, here or here. –  Julian Kuelshammer Jun 22 '13 at 8:53
add comment

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.