Implementation of Jacobi Rotations for Accurate Singular Value Computation in Floating Point Arithmetic

In this paper we con if {displaymath} 1 - m value decomposition (SVD) A=UΣ Vτ of A=[a₁,a₂]∈m× 2 accurately in floating point arithmetic. It is shown how the rotation angacobi rotation V (the right singular vector matrix) and how to compute AV=UΣ even if the floating point representation of V is the identity matrix. In the case a₁a₂, underflow can produce the identity matrix as the floating point value of V, even for a₁, a₂ that are far from being mutually orthogonal. This can cause loss of accuracy and failure of convergence of the floating point implementation of the Jacobi method for computing the SVD. The modified Jacobi method recommended in this paper can be implemented as a reliable and highly accurate procedure for computing the SVD of general real matrices whenever the exact singular values do not exceed the underflow or overflow limits.