Erbay, HasanAba, K.2020-06-252020-06-252009closedAccess0020-71601029-0265https://doi.org/10.1080/00207160701798756https://hdl.handle.net/20.500.12587/4570Erbay, Hasan/0000-0002-7555-541XThis article presents an URV-based matrix decomposition, the truncated URV decomposition, and an updating algorithm for it. The complexity of the updating is [image omitted] for an m-by- n matrix of rank r. The theoretical and numerical results presented shows that the decomposition can be a good alternative to the singular value decomposition.eninfo:eu-repo/semantics/closedAccessURV decompositionnumerical ranksubspace estimationrefinementArticle8671194120310.1080/002071607017987562-s2.0-70449592329Q2WOS:000273521400010Q4