【作者单位】1 Institute of Applied Physics and Computational Mathematics, Beijing, 100094, PR China 2 Taiyuan Normal University, Jinzhong, 030619, PR China 3 Higher Education key laboratory of Engineering and Scientific Computing in Shanxi Province, Taiyuan Normal University, Jinzhong, 030619, PR China
【摘要】 In this paper, we propose two accelerated algorithms for the low-rank approximate method in Wang et al. for matrix completion. The main idea is to use the successive over-relaxation technique. Based on the successive over-relaxation method for the f...
