Gram-Schmidt process
Sign in to saveAlso known as Gram–Schmidt process, Gram-Schmidt orthonormalization, Gram–Schmidt orthonormalization, Gram–Schmidt method, Gram-Schmidt
method for orthonormalising a set of vectors
Wikidata facts
- Instance of
- algorithm
- Named after
- Erhard Schmidt
- Has use
- linear algebra
Show 2 more facts
- computes solution to
- orthogonalization
- maintained by WikiProject
- WikiProject Mathematics
Sources (1)
via Wikidata · CC0
~27 min read
Encyclopedic overview
The first two steps of the 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
Excerpted from Wikipedia’s “Gram-Schmidt process” article, available under the CC BY-SA 4.0 licence.