{"references": ["F. Beik, N. Shams, \"Preconditioned generalized mixed-type splitting iterative method for solving weighted least squares problems\", International Journal of Computer Mathematics, 2013, DOI:10.1080/00207160.2013.810215.", "A.Berman, R.J. Plemmons,Nonnegative Matrices in the Mathematical Sciences, SIAM Press,Philadelphia, 1994.", "Z. I. Woznicki, \"Basic comparison theorems for weak and weaker matrix splitting\", Electron. J. Linear Algebra, 8 (2001) 53-59.", "R. S. Varga, Matrix Iterative Analysis, in: Springer Series in Computational Mathematics, vol. 27, Springer-Verlag, Berlin, 2000.", "Y. Saad, Iterative Methods for Sparse Linear Systems, 2nd ed., SIAM Press, Philadelphia, 2003."]}

In this paper, we present new preconditioned generalized mixed-type splitting (GMTS) methods for solving weighted linear least square problems. We compare the spectral radii of the iteration matrices of the preconditioned and the original methods. The comparison results show that the preconditioned GMTS methods converge faster than the GMTS method whenever the GMTS method is convergent. Finally, we give a numerical example to confirm our theoretical results.