Turkish Journal of Mathematics




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.

First Page


Last Page


Included in

Mathematics Commons