Randomized Generalized Singular Value Decomposition

Wei Wei , Hui Zhang , Xi Yang , Xiaoping Chen

Communications on Applied Mathematics and Computation ›› 2020, Vol. 3 ›› Issue (1) : 137 -156.

PDF
Communications on Applied Mathematics and Computation ›› 2020, Vol. 3 ›› Issue (1) : 137 -156. DOI: 10.1007/s42967-020-00061-x
Original Paper

Randomized Generalized Singular Value Decomposition

Author information +
History +
PDF

Abstract

The generalized singular value decomposition (GSVD) of two matrices with the same number of columns is a very useful tool in many practical applications. However, the GSVD may suffer from heavy computational time and memory requirement when the scale of the matrices is quite large. In this paper, we use random projections to capture the most of the action of the matrices and propose randomized algorithms for computing a low-rank approximation of the GSVD. Serval error bounds of the approximation are also presented for the proposed randomized algorithms. Finally, some experimental results show that the proposed randomized algorithms can achieve a good accuracy with less computational cost and storage requirement.

Cite this article

Download citation ▾
Wei Wei, Hui Zhang, Xi Yang, Xiaoping Chen. Randomized Generalized Singular Value Decomposition. Communications on Applied Mathematics and Computation, 2020, 3(1): 137-156 DOI:10.1007/s42967-020-00061-x

登录浏览全文

4963

注册一个新账户 忘记密码

References

Funding

National Natural Science Foundation of China(No.11701409)

AI Summary AI Mindmap
PDF

215

Accesses

0

Citation

Detail

Sections
Recommended

AI思维导图

/