Block AOR iterative schemes for large scale least squares problemsBlock AOR iterative schemes for large scale least squares problems Peer-Reviewed Journal Publication Δημοσίευση σε Περιοδικό με Κριτές 2015-10-161989enThe 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. http://creativecommons.org/licenses/by/4.0/SIAM Journal on Numerical Analysis326637–660 Saridakis Ioannis Σαριδακης Ιωαννης Papatheodorou, Théodore Papadopoúlou, Elénē Society for Industrial and Applied Mathematics Greek mathematics mathematics greek greek mathematics Squares problems