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
- Read the overview: QR algorithmA 5-minute orientation
- Skim a recent paper: A Review of Yolo Algorithm DevelopmentsInfluential work since 2022
- Pick up a classic book: Convergence of the QR algorithmThe most-reprinted book on the subject
- Read the landmark paper: A fast and elitist multiobjective genetic algorithm: NSGA-IICited 45,300 times
- Go sideways: Inverse iterationA closely related topic
- Go sideways: Eigenvalue algorithmA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
A fast and elitist multiobjective genetic algorithm: NSGA-II
Maximum Likelihood from Incomplete Data Via the EM Algorithm
IQ-TREE: A Fast and Effective Stochastic Algorithm for Estimating Maximum-Likelihood Phylogenies
SPAdes: A New Genome Assembly Algorithm and Its Applications to Single-Cell Sequencing
An Algorithm for Least-Squares Estimation of Nonlinear Parameters
A Simple, Fast, and Accurate Algorithm to Estimate Large Phylogenies by Maximum Likelihood
The Whale Optimization Algorithm
A Fast Learning Algorithm for Deep Belief Nets
🆕 Influential since 2022
A Review of Yolo Algorithm Developments
Particle Swarm Optimization Algorithm and Its Applications: A Systematic Review
Dung beetle optimizer: a new meta-heuristic algorithm for global optimization
Reptile Search Algorithm (RSA): A nature-inspired meta-heuristic optimizer
Honey Badger Algorithm: New metaheuristic algorithm for solving optimization problems
📚 Books worth reading
Convergence of the QR algorithmBeresford Parlett · 1964
Pervasive Computing and the Networked WorldQiaohong Zu · 2013- 📕The minimal residual QR-factorization algorithm for reliably solving subset regression problemsM. H. Verhaegen · 1987
A parallel algorithm synthesis procedure for high-performance computer architecturesIan N. Dunn, Gerard G.L. Meyer · 2003
Adaptive and Natural Computing AlgorithmsMarco Tomassini · 2013
Total least squares and errors-in-variables modelingSabine van Huffel · 2002
High Performance Computing for Computational Science - VECPAR 2012Michel Daydé · 2013
Coding the MatrixPhilip N. Klein · 2013
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Inverse iteration In numerical analysis, inverse iteration (also known as the inverse power method) is an iterative eigenvalue algorithm. It allows one to find an approximate…
- Eigenvalue algorithm In numerical analysis, one of the most important problems is designing efficient and stable algorithms for finding the eigenvalues of a matrix. These eigenvalue…
- Eigendecomposition of a matrix In linear algebra, eigendecomposition (also known as eigenvalue decomposition or EVD) is a factorization of a matrix A into a canonical form given by A=QDQ−𝟣…
- Bidiagonal matrix In mathematics, a bidiagonal matrix is a banded matrix with non-zero entries along the main diagonal and either the diagonal above or the diagonal below…
- Singular value decomposition In linear algebra, the singular value decomposition (SVD) is a factorization of a real or complex matrix into a rotation, followed by a scaling, followed…
- Arnoldi iteration In numerical linear algebra, the Arnoldi iteration is an eigenvalue algorithm and an important example of an iterative method. Arnoldi finds an approximation…
- QR decomposition In linear algebra, a QR decomposition, also known as a QR factorization or QU factorization, is a decomposition of a matrix A into a product A = QR of…
- Numerical linear algebra Numerical linear algebra, sometimes called applied linear algebra, is the study of how matrix operations can be used to create computer algorithms which…