The Palindrome

The Palindrome

Share this post

The Palindrome
The Palindrome
Epsilons, no. 5: The QR decomposition
Copy link
Facebook
Email
Notes
More

Epsilons, no. 5: The QR decomposition

matrices + the Gram-Schmidt process = magic

Tivadar Danka's avatar
Tivadar Danka
May 09, 2023
∙ Paid
20

Share this post

The Palindrome
The Palindrome
Epsilons, no. 5: The QR decomposition
Copy link
Facebook
Email
Notes
More
Share

I start all my posts about matrix decompositions by saying that “matrix factorizations are the pinnacle results of linear algebra“. These few words perfectly express their place in mathematics, science, and engineering: it is hard to overestimate the practical importance of matrix decompositions.

Understanding mathematics is a superpower. Subscribing to The Palindrome will instantly unlock it for you. For sure. (Or at least help you get there, step by step.)

Behind (almost) every high-performance matrix operation, there is a matrix decomposition. This time, we’ll look at the one that enables us to iteratively find the eigenvalues of a matrix: the QR decomposition.

The QR decomposition

In essence, the QR decomposition factors an arbitrary matrix into the product of an orthogonal and an upper triangular matrix.

How does it work? We’ll illustrate everything with the 3 x 3 case, but everything works as is in general as well.

First, some notations. Every matrix can be thought of as a sequence of column vectors. Tru…

This post is for paid subscribers

Already a paid subscriber? Sign in
© 2025 Tivadar Danka
Privacy ∙ Terms ∙ Collection notice
Start writingGet the app
Substack is the home for great culture

Share

Copy link
Facebook
Email
Notes
More