The combined Chebyshev−Least Squares iterative processes in the Krylov subspaces to solve symmetric and non-symmetric systems of linear algebraic equations (SLAEs) are proposed. This approach is a generalization of the Anderson acceleration of the Jacobi iterative method as an efficient alternative to the Krylov methods. The algorithms proposed are based on constructing some basis of the Krylov subspaces and a minimization of the residual vector norm by means of the least squares procedure. The general process includes periodical restarts and can be considered to be an implicit implementation of the Krylov procedure which can be efficiently parallelized. A comparative analysis of the methods proposed and the classic Krylov approaches is presented. A parallel implementation of the iterative methods on multi-processor computer systems is discussed. The efficiency of the algorithms is demonstrated via the results of numerical experiments on a set of model SLAEs.