Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Gram-Schmidt Process

Numerical Algorithm

The Gram-Schmidt process is a method for constructing an orthonormal basis from a set of vectors in an inner product space, most commonly Euclidean space with the standard inner product. It takes a finite, linearly independent set of vectors and generates an orthogonal set spanning the same subspace, and it is named after Jorgen Pedersen Gram and Erhard Schmidt, though Pierre-Simon Laplace had been familiar with the method earlier; applying it to the columns of a full column rank matrix yields the QR decomposition.

Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.