In this paper, we present the preconditioned generalized accelerated overrelaxation (GAOR) method for solving linear systems based on a class of weighted linear least square problems. Two kinds of preconditioning are proposed, and each one contains three preconditioners. We compare the spectral radii of the iteration matrices of the preconditioned and the original methods. The comparison results show that the convergence rate of the preconditioned GAOR methods is indeed better than the rate of the original method, whenever the original method is convergent. Finally, a numerical example is presented in order to confirm these theoretical results. © 2008 Elsevier B.V. All rights reserved.
CITATION STYLE
Zhou, X., Song, Y., Wang, L., & Liu, Q. (2009). Preconditioned GAOR methods for solving weighted linear least squares problems. Journal of Computational and Applied Mathematics, 224(1), 242–249. https://doi.org/10.1016/j.cam.2008.04.034
Mendeley helps you to discover research relevant for your work.