Preconditioning without a preconditioner using block Krylov subspace methods
Linear Algebra seminar by Tyler Chen, JPMorganChase
Hosted by Institute for Computational and Experimental Research in Mathematics (ICERM), Brown University
Thursday 12:00 New York (GMT-5)
Recording available
Providence, RI, USA · In person
Abstract
Tyler Chen presents randomized block conjugate gradient for one positive-definite linear system. The method can provably outperform conjugate gradient with a broad class of Nyström preconditioners while avoiding explicit preconditioner construction. Its analysis also yields guarantees for new Nyström-preconditioned variants. Applications include computing a complete ridge-regression regularization path and drawing multiple independent samples from a high-dimensional Gaussian distribution.
Topics
krylov linear solversrandomized algorithms