Papalocal
Loading…
Papalocal · Things
Work

Gram-Schmidt process

Gram-Schmidt process is a method for orthonormalising a set of vectors.

All 3 facts, and where they come from

Facts

3 facts · 0 confirmed by two sources · 0 cited · 3 from one source

What it is
algorithm One source
Named after
Jørgen Pedersen Gram One source
Erhard Schmidt One source

Where this comes from

Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.

What Wikidata says · copied November 17, 2026 · revision 2569189236
Described as
method for orthonormalising a set of vectors
Other names
Gram–Schmidt process, Gram-Schmidt orthonormalization, Gram–Schmidt orthonormalization, Gram–Schmidt method, Gram-Schmidt
What it is
algorithm
Named after
Jørgen Pedersen Gram; Erhard Schmidt
Wikipedias with a page
37

Wikidata item Q475239 (wikidata.org/wiki/Q475239), public domain (CC0). Copied 2026-11-17.

What Wikipedia says · copied November 17, 2026 · revision 1382076934

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 ℝn equipped with the standard inner product. The Gram–Schmidt process takes a finite, linearly independent set of vectors S={𝐯1,…,𝐯k} for k ≤ n and generates an orthogonal set S′={𝐮1,…,𝐮k} that spans the same k-dimensional subspace of ℝn as 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).

From the Wikipedia article “Gram–Schmidt process” (en.wikipedia.org/wiki/Gram–Schmidt_process), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-17; not changed.

Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.

People connected 1

Known for it