A Convergence Analysis on URV Refinement
Abstract
Recently, Stewart gave an algorithm for computing a rank revealing URV decomposition of a rectangular matrix. His method makes use of a refinement iteration to achieve an improved estimate of the smallest singular value and its corresponding singular vectors of the matrix. Here, a new proof is given for the convergence of the refinement iteration. This analysis is carried out under slightly weaker assumptions than those of Mathias and Stewart.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.