Abstract
In this paper, we present a quasi-Chebyshev accelerated iteration method for solving a system of linear equations. Compared with the Chebyshev semi-iterative method, the main difference is that the parameter ω is not obtained by a Chebyshev polynomial but by optimization models. We prove that the quasi-Chebyshev accelerated iteration method is unconditionally convergent if the original iteration method is convergent, and also discuss the convergence rate. Finally, three numerical examples indicate that our method is more efficient than the Chebyshev semi-iterative method.
Sign-in/Register to access full text options 
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.
