Block Updates on Truncated ULV Decomposition

Basit Öğe Kaydı
dc.contributor.authorBarlow J.L.
dc.contributor.authorAydoğan E.
dc.contributor.authorErbay H.
dc.date.accessioned2020-06-25T15:17:23Z
dc.date.available2020-06-25T15:17:23Z
dc.date.issued2013
dc.departmentKırıkkale Üniversitesi
dc.descriptionAIRCC Publishing Corporation;CSITC;HAVELSAN;KTD
dc.description3rd International Conference on Computational Science, Engineering and Information Technology, CCSEIT 2013 -- 7 June 2013 through 9 June 2013 -- Konya -- 98896
dc.description.abstractA 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.en_US
dc.identifier.doi10.1007/978-3-319-00951-3_7
dc.identifier.endpage79en_US
dc.identifier.isbn9783319009506
dc.identifier.issn21945357
dc.identifier.issue1en_US
dc.identifier.scopus2-s2.0-84883016850
dc.identifier.scopusqualityN/A
dc.identifier.startpage73en_US
dc.identifier.urihttps://doi.org/10.1007/978-3-319-00951-3_7
dc.identifier.urihttps://hdl.handle.net/20.500.12587/2339
dc.identifier.volume225en_US
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherSpringer Verlagen_US
dc.relation.ispartofAdvances in Intelligent Systems and Computing
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectBlock Classical Gram-Schmidten_US
dc.subjectBlock Updateen_US
dc.subjectTruncated ULVDen_US
dc.titleBlock Updates on Truncated ULV Decompositionen_US
dc.typeConference Object

Dosyalar

Koleksiyon

Scopus İndeksli Yayınlar Koleksiyonu