Let A 2 R mn be a matrix with known singular values and singular vectors, and let A 0 be the matrix obtained by appending a row to A. We present stable and fast algorithms for computing the singular values and the singular vectors of A 0 in O ? (m + n) min(m;n) log 2 2 oating point operations, where is the machine precision. Previous algorithms can be unstable and compute the singular values an...
