Block classical Gram-Schmidt-based block updating in low-rank matrix approximation

Yükleniyor...
Küçük Resim

Tarih

2018

Dergi Başlığı

Dergi ISSN

Cilt Başlığı

Yayıncı

Scientific Technical Research Council Turkey-Tubitak

Erişim Hakkı

info:eu-repo/semantics/openAccess

Özet

Low-rank matrix approximations have recently gained broad popularity in scientific computing areas. They are used to extract correlations and remove noise from matrix-structured data with limited loss of information. Truncated singular value decomposition (SVD) is the main tool for computing low-rank approximation. However, in applications such as latent semantic indexing where document collections are dynamic over time, i.e. the term document matrix is subject to repeated updates, SVD becomes prohibitive due to the high computational expense. Alternative decompositions have been proposed for these applications such as low-rank ULV/URV decompositions and truncated ULV decomposition. Herein, we propose a BLAS-3 compatible block updating truncated ULV decomposition algorithm based on the block classical Gram-Schmidt process. The simulation results presented show that the block update algorithm is promising.

Açıklama

Erbay, Hasan/0000-0002-7555-541X; Horasan, Fahrettin/0000-0003-4554-9083; Varcin, Fatih/0000-0002-5100-3012; Horasan, Fahrettin/0000-0001-5118-0783

Anahtar Kelimeler

Truncated ULVD, block classical Gram-Schmidt, block update

Kaynak

Turkish Journal Of Mathematics

WoS Q Değeri

Q3

Scopus Q Değeri

Q2

Cilt

42

Sayı

4

Künye

Erbay, H., Biçer, C., Horasan, F., Varçın, F. (2018). Block classical Gram–Schmidt-based block updating in low-rank matrix approximation. Turkish Journal of Mathematics, 42(4), 1779 - 1794.