Everything About ___
Live briefing

Everything about QR algorithm

Algorithm to calculate eigenvalues

In numerical linear algebra, the QR algorithm or QR iteration is an eigenvalue algorithm: that is, a procedure to calculate the eigenvalues and eigenvectors of a matrix. The QR algorithm was developed in the late 1950s by John G. F. Francis and by Vera N. Kublanovskaya, working independently. The basic idea is to perform a QR decomposition, writing the matrix as a product of an orthogonal matrix and an upper triangular matrix, multiply the factors in the reverse order, and iterate. Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: QR algorithmA 5-minute orientation
  2. Skim a recent paper: A Review of Yolo Algorithm DevelopmentsInfluential work since 2022
  3. Pick up a classic book: Convergence of the QR algorithmThe most-reprinted book on the subject
  4. Read the landmark paper: A fast and elitist multiobjective genetic algorithm: NSGA-IICited 45,300 times
  5. Go sideways: Inverse iterationA closely related topic
  6. Go sideways: Eigenvalue algorithmA closely related topic

📖 Definitions

No dictionary entry for this exact phrase.

🏆 Landmark papers (most cited)

🆕 Influential since 2022

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics