Barlow J.L.Aydoğan E.Erbay H.2020-06-252020-06-252013978331900950621945357https://doi.org/10.1007/978-3-319-00951-3_7https://hdl.handle.net/20.500.12587/2339AIRCC Publishing Corporation;CSITC;HAVELSAN;KTD3rd International Conference on Computational Science, Engineering and Information Technology, CCSEIT 2013 -- 7 June 2013 through 9 June 2013 -- Konya -- 98896A truncated ULV decomposition (TULV) of an m×n matrix X of rank k is a decomposition of the form X = U1LV T 1 + E, where U1 and V1 are left orthogonal matrices, L is a k × k non-singular lower triangular matrix and E is an error matrix. Only U1, V1, L, and ?E?F are stored. We propose algorithms for block updating the TULV based upon Block Classical Gram-Schmidt that in [4]. We also use a refinement algorithm that reduces ?E?F, detects rank degeneracy, corrects it and sharpens the approximation. © Springer International Publishing Switzerland 2013.eninfo:eu-repo/semantics/closedAccessBlock Classical Gram-SchmidtBlock UpdateTruncated ULVDConference Object2251737910.1007/978-3-319-00951-3_72-s2.0-84883016850N/A