Abstract
For fast solving weighted Toeplitz least-squares problems from image restoration, we establish an accelerated GNHSS (AGNHSS) method based on the Hermitian and skew-Hermitian splitting. The convergence of the new iteration method is established theoretically and its quasi-optimal iteration parameters are discussed. It is seen that the AGNHSS method converges faster when proper parameters are chosen. In particular, the convergence conditions of the AGNHSS method, the optimal parameters and some comparisons between AGNHSS and NSHSS are given when it is used for solving the linear image restoration problems. Meanwhile, the spectral properties of the preconditioned matrix are investigated. Experimental results further demonstrate that the new method is effective and confirm that our theoretical results are correct.
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.
