Toeplitz matrix completion via a low-rank approximation algorithm

Journal of inequalities and applications

article

Ruiping Wen¹  Yaru Fu³ 

[1] Key Laboratory of Engineering & Computing Science, Shanxi Provincial Department of Education;Department of Mathematics, Taiyuan Normal University;College of Information Technology, The University of Suwon;School of Mathematics and Statistics, Linyi University

关键词: Matrix completion;    Toeplitz matrix;    Low-rank;    Mean projection operator;   

DOI  :  10.1186/s13660-020-02340-w

学科分类：电力

来源: SpringerOpen

【 摘 要 】

In this paper, we propose a low-rank matrix approximation algorithm for solving the Toeplitz matrix completion (TMC) problem. The approximation matrix was obtained by the mean projection operator on the set of feasible Toeplitz matrices for every iteration step. Thus, the sequence of the feasible Toeplitz matrices generated by iteration is of Toeplitz structure throughout the process, which reduces the computational time of the singular value decomposition (SVD) and approximates well the solution. On the theoretical side, we provide a convergence analysis to show that the matrix sequences of iterates converge. On the practical side, we report the numerical results to show that the new algorithm is more effective than the other algorithms for the TMC problem.

【 授权许可】

CC BY