Abstract
In this paper, we study algorithms for Toeplitz matrix recovery. Inspired by the singular value thresholding (SVT) algorithm for matrix completion and the alternating directions iterative method, we first propose a new mean value algorithm for Toeplitz matrix recovery. Then we apply our idea to the augmented Lagrange multiplier (ALM) algorithm for matrix recovery and put forward four modified ALM algorithms for Toeplitz matrix recovery. Convergence analysis of the new algorithms is discussed. All the iterative matrices generated by the five algorithms keep a Toeplitz structure that ensures the fast singular value decomposition (SVD) of Toeplitz matrices. Compared with the original algorithms, our algorithms are far superior in the time of SVD, as well as the CPU time.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
