Gram–Schmidt process

In mathematics, particularly linear algebra and numerical analysis, the Gram–Schmidt process or Gram-Schmidt algorithm is a way of finding a set of two or more vectors that are perpendicular to each other. By technical definition, it is a method of constructing an orthonormal basis from a set of vectors in an inner product space, most commonly the Euclidean space R n {\displaystyle \mathbb {R} ^{n}} equipped with the standard inner product. The Gram–Schmidt process takes a finite, linearly independent set of vectors S = { v 1 , … , v k } {\displaystyle S=\{\mathbf {v} _{1},\ldots ,\mathbf {v} _{k}\}} for k ≤ n and generates an orthogonal set S ′ = { u 1 , … , u k } {\displaystyle S'=\{\mathbf {u} _{1},\ldots ,\mathbf {u} _{k}\}} that spans the same k {\displaystyle k} -dimensional subspace of R n {\displaystyle \mathbb {R} ^{n}} as S {\displaystyle S} . The method is named after Jørgen Pedersen Gram and Erhard Schmidt, but Pierre-Simon Laplace had been familiar with it before Gram and Schmidt. In the theory of Lie group decompositions, it is generalized by the Iwasawa decomposition. The application of the Gram–Schmidt process to the column vectors of a full column rank matrix yields the QR decomposition (it is decomposed into an orthogonal and a triangular matrix).