r/compsci • u/beeskness420 Algorithmic Evangelist • 5d ago
Research John Urschel ๐ proves sqrt(n) growth factor for partial pivots
https://arxiv.org/abs/2610.0678510
u/Benabik 5d ago
Is ๐ part of his name? Did he use some technique called ๐ proof?
23
u/CavemanKnuckles 5d ago
He's an MIT mathematician who played for the Baltimore Ravens. At least, if Wikipedia is to be believed
5
u/ImAFraidKn0t 5d ago
Damn this guy is fly as hell
8
u/beeskness420 Algorithmic Evangelist 5d ago
Anecdotally everyone I know who has met him in person says he's a really great guy too. His episode of My Favorite Theorem is fantastic.
2
1
u/algebratwurst 5d ago
He wonโt have time to get all the women
2
u/bythenumbers10 3d ago
He's married, with a daughter, to boot. Good for him!
Too busy swimming in theorems to drown in pussy. Leaves more for the rest of us in /r/compsci.
15
u/beeskness420 Algorithmic Evangelist 5d ago
Gaussian elimination is the oldest and most popular method for solving a linear system. Its numerical stability for a given matrix is controlled by the growth factor, a measure of how large entries can become during elimination. In this work, we prove a number of new results regarding the growth factor of random matrices.
First, we provide tight estimates for the growth factor of a matrix preconditioned by a Haar orthogonal matrix without pivoting and characterize the asymptotic distribution of the growth factor of Gaussian matrices without pivoting.
Second, and most notably, we prove that the growth factor of an nรn Gaussian matrix under partial pivoting is rarely much larger than sqrt(n), resolving an old conjecture of Nick Trefethen. The same techniques used to prove this conjecture also provide an improved smoothed analysis of the growth factor under partial pivoting.