The conjugate gradient algorithm on well-conditioned Wishart matrices is almost deterministic

Source abstract

We prove that the number of iterations required to solve a random positive definite linear system with the conjugate gradient algorithm is almost deterministic for large matrices. We treat the case of Wishart matrices W = X X ∗ W = XX^* where X X is n × m n \times m and n / m ∼ d n/m \sim d for 0 > d > 1 0 > d > 1 . Precisely, we prove that for most choices of error tolerance, as the matrix increases in size, the probability that the iteration count deviates from an explicit deterministic value tends to zero. In addition, for a fixed iteration count, we show that the norm of the error vector and the norm of the residual converge exponentially fast in probability, converge in mean, and converge almost surely.