Abstract
The problem of accelerating the convergence rate of iterative schemes, as they apply to the solution of large-scale least-squares problems by means of different splittings, is addressed here. New convergence results, together with explicit expressions for the optimal factors and their corresponding spectral radii, are derived for certain schemes from the block Accelerated Overrelaxation (AOR) family. It is shown that, for a class of least-squares problems, the proposed optimal block iterative scheme converges unconditionally and asymptotically faster than the optimal block Successive Overrelaxation (SOR) method, while in all other cases the two schemes are competitive. Numerical examples are used to illustrate our results.
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.
