View PDF HTML (experimental)

Abstract:The generalized Krylov subspace (GKS) method is an effective projection technique for large-scale Tikhonov regularization with a general regularization matrix. As the subspace expands, however, two computational bottlenecks limit scalability: the thin QR factorizations of the tall projected matrices formed by the forward operator and the regularization matrix applied to the basis, and the full reorthogonalization of each new basis vector against all previous columns.
We propose a sketched variant, named sGKS, that addresses both bottlenecks. The QR factorizations are performed on compressed matrices of much smaller row dimension, maintained incrementally via rank-one updates. Moreover, we observe that explicit reorthogonalization can be skipped entirely without compromising the quality of the approximation subspace, since no step of GKS relies intrinsically on the orthogonality of the basis. The resulting algorithm is independent of the choice of sketching operator and preserves the approximation quality of the original method: we show that, in the absence of sketching in the projected solve, sGKS produces iterates identical to those of standard GKS, and that the sketched projected solve delivers quasi-optimal residual norms controlled by the embedding quality. For more challenging problems where the loss of basis orthogonality becomes significant, we show that incorporating a small number of iterative refinement steps in the projected solve restores the spectral properties of the basis and recovers the full accuracy of the unsketched method. Numerical experiments on image deblurring, X-ray computerized tomography, seismic travel-time tomography, and dynamic computerized tomography demonstrate that sGKS matches the reconstruction quality of standard GKS while significantly reducing per-iteration costs and overall wall-clock time.

Submission history

From: Davide Palitta [view email]
[v1] Tue, 16 Jun 2026 15:41:17 UTC (4,839 KB)