QR Decomposition Task

A QR Decomposition Task is a matrix decomposition task that can create a QR decomposition structure.

• Context:
  • It can be solved by a QR Decomposition System (that implements a QR decomposition algorithm).
  • …
• Counter-Example(s):
  • a SVD Decomposition Task.
  • a Cholesky Decomposition Task.
• See: Upper Triangular Matrix, Linear Least Squares, Eigenvalue Algorithm.

---

---

References

2017

• (Wikipedia, 2017) ⇒ https://en.wikipedia.org/wiki/QR_decomposition Retrieved:2017-11-15.
  • In linear algebra, a QR decomposition (also called a QR factorization) of a matrix 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.

---