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.
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.
Source: Wikipedia "Gram–Schmidt process" · CC BY-SA 4.0
Share this article: X · Bluesky