KnowraQR decompositionLinked fromLinked fromThe 11 pages that link to QR decomposition, each with the reason it gives.All 11Broader topic 1Related 6Compared with 4Least squaresRelated: It solves linear least-squares problems stably without forming the normal equations.Gaussian eliminationCompared with: It is often preferred to direct elimination for numerically stable least-squares solutions.Numerical stabilityRelated: Orthogonal transformations often make QR-based computations more stable than alternatives.Singular value decompositionCompared with: QR is often cheaper to compute, while this decomposition exposes singular values directly.LU decompositionCompared with: QR often offers better numerical stability for least-squares problems than LU.Orthogonal matrixRelated: Its orthogonal factor supports stable solutions of linear systems.Lyapunov exponentRelated: Repeated orthogonalization prevents numerical overflow when computing several exponents.Direct methodRelated: It supports stable direct solutions of least-squares problems and linear systems.Matrix inverseCompared with: It offers a stable route to least-squares solutions without relying on explicit inversion.Matrix theoryBroader topic: It supports stable least-squares solutions and eigenvalue algorithms.Cartan–Dieudonné theoremRelated: Householder reflections compute the orthogonal factor through a sequence of simple transformations.