A Kaczmarz-Inspired Method for Orthogonalization

Rikhav Shah, Isabel Detherage

Published 2024-11-25, updated 2025-01-14Version 2

This paper asks if it is possible to orthogonalize a set of $n$ linearly independent unit vectors in $n$ dimensions by only considering random pairs of vectors at a time. In particular, at each step one accesses a random pair of vectors and can replace them with some different basis for their span. If one could instead deterministically decide which pair of vectors to access, one could run the Gram-Schmidt procedure. In our setting, however, the pair is selected at random, so the answer is less clear. We provide a positive answer to the question: given a pair of vectors at each iteration, replace one with its component perpendicular to the other, renormalized. This produces a sequence that almost surely converges to an orthonormal set. Quantitatively, we can measure the rate convergence in terms of the condition number $\kappa(A)$ of the square matrix $A$ formed by taking the $n$ vectors to be its columns. When the condition number is initially very large, we prove a rapidly decreasing upper bound on the expected logarithm of the condition number after $t$ iterations. The bound initially decreases by $O(1/n^2)$ each iteration, but the decrease tapers off as the condition number improves. We then show $O(n^4/\delta\varepsilon^2+n^3\log(\kappa(A))\log\log(\kappa(A)))$ iterations suffice to bring the condition number below $1+\varepsilon$ with probability $1-\delta$.