A Convergence Analysis on URV Refinement
classification
🧮 math.NA
cs.NA
keywords
refinementanalysisconvergenceiterationmatrixsingularstewartachieve
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.