Toeplitz matrix completion via a low-rank approximation algorithm

Toeplitz matrix completion via a low-rank approximation algorithm

Abstract 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 fe...

Full description

Bibliographic Details
Main Authors: Ruiping Wen, Yaru Fu
Format: Article
Language:English
Published: SpringerOpen 2020-03-01
Series:Journal of Inequalities and Applications
Subjects:
Matrix completion
Toeplitz matrix
Low-rank
Mean projection operator
Online Access:http://link.springer.com/article/10.1186/s13660-020-02340-w

Internet

http://link.springer.com/article/10.1186/s13660-020-02340-w

Similar Items