Hi, I am trying to solve the problem of finding eigenvalus for a general square symmetric matrix with the QR algorithm.(adsbygoogle = window.adsbygoogle || []).push({});

I have understood that this task is much easier if the matrix is in an Hessemberg form, so I have implemented a function that does that with the Housholder method, but I can't understand how to find the qr decomposition of the given matrix in a useful computational way. The algebric algorithm is clear for me but I don't know how to reproduce it in C since I'm not understanding how to work with the decomposition process.

Can someone explain this for me?

That is, given the original matrix A in an Hessemberg form, how can I find the two matrices Q (orthogonal) and R (upper triangular) so that A=Q*R?

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Finding eigenvalues with QR method

Tags:

**Physics Forums | Science Articles, Homework Help, Discussion**