Metraipolis › archive › dc_372a61d17558

Gram–Schmidt process — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Gram%E2%80%93Schmidt_process
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T11:22:31.802Z
SHA-256 of the archived text
65366053d2730fde00b04c401a74961976ec4f08cf6d626caea118c0df284dd1
Stable URL of this page
https://metraipolis.com/documento/dc_372a61d17558

How to cite

Gram–Schmidt process — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Gram%E2%80%93Schmidt_process (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_372a61d17558 (Metraipolis archive dc_372a61d17558, sha256 65366053d2730fde00b04c401a74961976ec4f08cf6d626caea118c0df284dd1)
BibTeX
@misc{dc372a61d17558,
  title = {Gram–Schmidt process — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Gram%E2%80%93Schmidt_process},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_372a61d17558; sha256 65366053d2730fde00b04c401a74961976ec4f08cf6d626caea118c0df284dd1},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Gram%E2%80%93Schmidt_process. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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).

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; categoria «Linear algebra»).
Fonte: Wikipedia in inglese, voce «Gram–Schmidt process» — https://en.wikipedia.org/wiki/Gram%E2%80%93Schmidt_process
Wikidata Q475239 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q475239
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Gram%E2%80%93Schmidt_process?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1375494788, consultata il 2026-10-07T11:15:31.876Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: b7bb02d42328a762f1478b2f69486993dfb50d6380780b4403d629dfaff21c01