Speaker
Kingsley Michael
(Baylor University)
Description
Golub-Kahan bidiagonalization procedure is well known for its role in computing singular values and solving least squares problems. We present a polynomial-preconditioned variant of this framework aimed at reducing the need for restarting and extensive orthogonalization. This talk outlines the formulation and motivation for the method and examines its potential to improve performance in practical settings.
Authors
Mr
Hayden Henson
(Baylor University)
Kingsley Michael
(Baylor University)
Mr
Nathaniel Morgan
(Baylor University)
Ron Morgan
(Baylor University)