The generalized singular value decomposition (GSVD) is a powerful tool for solving discrete ill-posed problems. In this paper, we propose a two-sided uniformly randomized GSVD algorithm for solving the large-scale discrete ill-posed problem with the general Tikhonov regularization. Based on two-sided uniform random sampling, the proposed algorithm can improve the efficiency with less computing time and memory requirement and obtain expected accuracy. The error analysis for the proposed algorithm is also derived. Finally, we report some numerical examples to illustrate the efficiency of the proposed algorithm.

翻译：暂无翻译