Fast Construction of Hierarchically Low-Rank Matrices Using Randomized Sketching
Seminar · Recording · Feb 3, 2026
Sherry Xiaoye Li, Lawrence Berkeley National Laboratory
We use cookies for analytics.
Seminar, Hosted by Institute for Computational and Experimental Research in Mathematics (ICERM), Brown University
Temple University
Daniel Szyld analyzes rand-cholQR, a randomized method for tall-and-skinny QR factorization using one or two sketch matrices. For numerically full-rank inputs, its orthogonality error is bounded with high probability at the scale of unit roundoff. NVIDIA A100 experiments compare multisketching with CholeskyQR2, reporting comparable or better speed and stronger stability with little additional memory or computation. Joint work with Andrew Higgins, Erik Boman, and Ichitaro Yamazaki.