A Hierarchical Singular Value Decomposition Algorithm for Low Rank Matrices

Abstract

Singular value decomposition (SVD) is a widely used technique for dimensionality reduction and computation of basis vectors. In many applications, especially in fluid mechanics and image processing the matrices are dense, but low-rank matrices. In these cases, a truncated SVD corresponding to the most significant singular values is sufficient. In this paper, we propose a tree based merge-and-truncate algorithm to obtain an approximate truncated SVD of the matrix. Unlike previous methods, our technique is not limited to "tall and skinny" or "short and fat" matrices and it can be used for matrices of arbitrary size. The matrix is partitioned into blocks and the truncated SVDs of blocks are merged to obtain the final SVD. If the matrices are low rank, this algorithm gives significant speedup over finding the truncated SVD, even when run on a single core. The error is typically less than 3\%.

eight Pages, fourteen figures

Cited by in corpus (5)

• Joint LED Selection and Precoding Optimization for Multiple-User Multiple-Cell VLC Systems
• Fully Decentralized Federated Learning Based Beamforming Design for UAV Communications
• Revisiting 2D Convolutional Neural Networks for Graph-based Applications
• Grouping-matrix based Graph Pooling with Adaptive Number of Clusters
• Ranky : An Approach to Solve Distributed SVD on Large Sparse Matrices