Abstract

We discuss a simple, easily overlooked, explicit deflation procedure applied to Golub-Kahan-Lanczos Bidiagonalization (GKLB)-based methods to compute the next set of the largest singular triplets of a matrix from an already computed partial singular value decomposition. Our results here complement the vast literature on this topic, provide additional insight, and highlight the simplicity and the effectiveness of this procedure. We demonstrate how existing GKLB-based routines for the computation of the largest singular triplets can be easily adapted to take advantage of explicit deflation, thus making it more appealing to a wider range of users. Numerical examples are presented including an application of singular value thresholding.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call