Computing Eigenvalues Using the QR Algorithm

Let be a 4×4 matrix whose entries are the first 16 prime numbers with the main diagonal perturbed by some random noise. This Demonstration calculates the eigenvalues of using the QR iteration method and shows the convergence properties of the iteration method.
The QR iteration method is expressed as
, where , ,
where is the total number of iterations and and are the orthogonal and upper-triangular matrices obtained when the QR decomposition is performed on .
For a nonsymmetric matrix with real eigenvalues, the matrix approaches an upper-diagonal form as increases, with the diagonal elements approximating the desired eigenvalues. You can start the iteration using the original matrix or use the almost upper-triangular Hessenberg form of . With the two sliders, you can change the number of QR iterations or the seed number for generating the random noise. The "convergence" button shows the squared relative error, defined as
, ,
as a function of the number of iterations up to the selected iteration number . You can see the matrix by clicking the button "eigenvalues at iteration".


  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
  • [Snapshot]


[1] K. J. Beers, Numerical Methods for Chemical Engineering, Cambridge: Cambridge University Press, 2007.
[2] G. H. Golub and C. F. Van Loan, Matrix Computations, Baltimore: Johns Hopkins University Press, 1983.

    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.