Block Updates on Truncated ULV Decomposition

Jesse Louis Barlow, Ebru Aydoǧan, Hasan Erbay

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Abstract

A 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.

Original languageEnglish (US)
Title of host publicationAdvances in Computational Science, Engineering and Information Technology - Proceedings of the Third International Conf. on Computational Science,Engineering and Information Technology, CCSEIT-2013
PublisherSpringer Verlag
Pages73-79
Number of pages7
Edition1
ISBN (Print)9783319009506
DOIs
StatePublished - Jan 1 2013
Event3rd International Conference on Computational Science, Engineering and Information Technology, CCSEIT 2013 - Konya, Turkey
Duration: Jun 7 2013Jun 9 2013

Publication series

NameAdvances in Intelligent Systems and Computing
Number1
Volume225
ISSN (Print)2194-5357

Other

Other3rd International Conference on Computational Science, Engineering and Information Technology, CCSEIT 2013
CountryTurkey
CityKonya
Period6/7/136/9/13

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Block Updates on Truncated ULV Decomposition'. Together they form a unique fingerprint.

Cite this