Concept information
Preferred term
QR decomposition
Definition(s)
- 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 orthogonal matrix Q and an upper triangular matrix R. QR decomposition is often used to solve the linear least squares problem and is the basis for a particular eigenvalue algorithm, the QR algorithm. (Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/QR_decomposition)
Broader concept(s)
Synonym(s)
- QR factorisation
- QR factorization
In other languages
-
French
-
factorisation QR
URI
http://data.loterre.fr/ark:/67375/MDL-S927FBXT-W
{{label}}
{{#each values }} {{! loop through ConceptPropertyValue objects }}
{{#if prefLabel }}
{{/if}}
{{/each}}
{{#if notation }}{{ notation }} {{/if}}{{ prefLabel }}
{{#ifDifferentLabelLang lang }} ({{ lang }}){{/ifDifferentLabelLang}}
{{#if vocabName }}
{{ vocabName }}
{{/if}}