Computing Low-Rank Approximations of Large-Scale Matrices with the Tensor Network Randomized SVD
We propose a new algorithm for the computation of a singular value decomposition (SVD) low-rank approximation of a matrix in the matrix product operator (MPO) format, also called the tensor train matrix format. Our tensor network randomized SVD (TNrSVD) algorithm is an MPO implementation of the rand...
Main Authors: | Batselier, Kim, Yu, Wenjian, Daniel, Luca, Wong, Ngai |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | English |
Published: |
Society for Industrial & Applied Mathematics (SIAM)
2019
|
Online Access: | https://hdl.handle.net/1721.1/121552 |
Similar Items
-
Fast and Accurate Tensor Completion with Total Variation Regularized Tensor Trains
by: Ko, Ching-Yun, et al.
Published: (2021) -
Tensor Computation: A New Framework for High-Dimensional Problems in EDA
by: Zhang, Zheng, et al.
Published: (2017) -
STAVES: Speedy tensor-aided Volterra-based electronic simulator
by: Xiong, Xiaoyan Y. Z., et al.
Published: (2017) -
SVD-gorank: Recommender system algorithm using SVD and gower's ranking
by: Saifudin, Ilham, et al.
Published: (2025) -
Recommendation Algorithm Using SVD and Weight Point Rank (SVD-WPR)
by: Widiyaningtyas, Triyanna, et al.
Published: (2022)