QR decomposition

Ever wondered how to solve puzzles with missing pieces?

Imagine you're trying to figure out the original picture from a torn-up photo. You have some pieces, but they're not in the right order.

Think of the QR decomposition as a way to rearrange those puzzle pieces (the matrix A) into a clearer picture (the product A = QR). The pieces are now neatly organized (Q is orthogonal) and easier to see the whole image (R is upper triangular).

Example

If you have a 2x2 matrix A like [[1, 2], [3, 4]], QR decomposition helps you rearrange it into a clearer form, Q with orthogonal columns and R with upper triangular elements.

Remember this

QR decomposition helps you organize data into a clearer, more manageable form.

Text adapted from Wikipedia, licensed under CC BY-SA 4.0.

Related concepts

LU decomposition

LU decomposition factors a matrix as the product of a lower triangular matrix and an upper triangular matrix

Shor's algorithm

Shor's algorithm factors integers in polynomial time on a quantum computer

Cholesky decomposition

Cholesky decomposition factors A = LL^T for symmetric positive definite matrices

orthogonal matrices preserve distances: O^T O = I means no stretching or squashing

How can you stretch or squash a square without changing its shape?

Singular value decomposition

Ever wondered how to compress images without losing quality?

Tensor network

Ever wondered how scientists manage massive data without endless storage?

Swipe through 100 ML concepts daily

Open Pocket Polymath