statement theorem
QR decomposition
Statement
Let be an complex matrix. Then there are a unitary matrix and an upper triangular matrix with If is real, then and can be chosen real, with orthogonal. If is invertible and the diagonal entries of are required to be positive, then and are unique.
Remarks
For an invertible , the Gram–Schmidt process applied to the columns of gives the columns of . A rectangular matrix with has a decomposition with unitary and upper triangular . Householder reflections and Givens rotations compute it stably. It is used to solve least squares problems and in the QR algorithm for eigenvalues.
Explanations
L1 human
The QR decomposition writes a matrix as a rotation, possibly with reflections, times a triangular matrix. The columns of are orthonormal, and records how to rebuild the columns of from them. It is the matrix form of the Gram–Schmidt process.
What this node needs for W2
- edge about out: the concepts that the statement is about (0 of 1)
- edge proves in: at least one proof node (0 of 1)
- edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
- explanation L2 (0 of 1)
The writing levels say how complete the text of a node is. They do not measure its truth.
What this needs
To read this node, read these 17 nodes in this order. The foundations come first, and the list ends with this node.
- no evidence level
- Identity matrix object
- Matrix definition
- Vector space definition
- Square matrix definition
- Transpose definition
- Inner product definition
- Linear combination definition
- Linear subspace definition
- Upper triangular matrix definition
- Conjugate transpose definition
- Orthogonal vectors definition
- Linear independence definition
- Linear span definition
- Unitary matrix definition
- Orthonormal family definition
- Gram–Schmidt process concept
- QR decomposition statement
Sources
- Web https://en.wikipedia.org/wiki/QR_decomposition, Square matrix
What links here
No node links to this node yet.