Gradient methods with improved convergence rate

A very simple modification is proposed for the steepest descent and minimum residual methods that makes it possible to substantially improve the convergence rate of these methods. The proposed approach is universal and does not require any adjustment to the spectrum of a matrix. Its efficiency is confirmed by numerous computational experiments.