Editing QR decomposition (section)

{{Redirects here|QRD|the Maltese locality|Qrendi}}{{Short description|Matrix decomposition}}
In [[linear algebra]], a '''QR decomposition''', also known as a '''QR factorization''' or '''QU factorization''', is a [[matrix decomposition|decomposition]] of a [[matrix (mathematics)|matrix]] ''A'' into a product ''A''&nbsp;=&nbsp;''QR'' of an [[orthonormal matrix]] ''Q'' and an [[upper triangular matrix]] ''R''. QR decomposition is often used to solve the [[linear least squares (mathematics)|linear least squares]] (LLS) problem and is the basis for a particular [[eigenvalue algorithm]], the [[QR algorithm]].