The authors present an algorithm to compute the singular value decomposition of a bidiagonal matrix \(B\) with an error bound depending on the relative gap. It is also shown that this algorithm computes the singular vectors as well as singular values to this accuracy. A Hamiltonian interpretation of the algorithm is also given, and differential equation methods are used to prove many of the basic facts. Numerical experiments are also presented for illustration.