Concept information
Terme préférentiel
QR decomposition
Définition
-
In linear algebra, a QR decomposition, also known as a QR factorization or QU factorization, is a decomposition of a matrix A into a product A = QR of an orthonormal matrix Q and an upper triangular matrix R. QR decomposition is often used to solve the linear least squares (LLS) problem and is the basis for a particular eigenvalue algorithm, the QR algorithm.
(Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/QR_decomposition)
Concept générique
Synonyme(s)
- QR factorization
- QU factorization
Traductions
-
français
-
décomposition QU
-
factorisation QR
URI
http://data.loterre.fr/ark:/67375/PSR-F4F825C6-K
{{label}}
{{#each values }} {{! loop through ConceptPropertyValue objects }}
{{#if prefLabel }}
{{/if}}
{{/each}}
{{#if notation }}{{ notation }} {{/if}}{{ prefLabel }}
{{#ifDifferentLabelLang lang }} ({{ lang }}){{/ifDifferentLabelLang}}
{{#if vocabName }}
{{ vocabName }}
{{/if}}