Numerical performance of hyperplane constrained method and its hybrid method for singular value decomposition (Q644867)

The authors consider the hyperplane constrained method proposed by \textit{K. Yadani, K. Kondo} and \textit{M. Iwasaki} [Appl. Math. Comput. 216, No. 3, 779--790 (2010; Zbl 1200.65029)] for computing the singular value decomposition (SVD) of a matrix. A new convergence theorem in finite arithmetic is presented. Numerical results show that the hyperplane constrained method combined with some other SVD method runs faster than the original one with almost the same accuracy.