No title
This BSc thesis looks into the Golub-Kahan method for computing Singular Value Decompositions (SVD). Computing an SVD is expensive but can be worth it in some cases. This decomposition shows any near rank deficiency that might cause problems when solving Least Squares problems. The Golub-Kahan algorithm exploits the implicit symmetric QR algorithm to efficiently compute an SVD. A matrix is first b
