Modified Richardson iteration is an iterative method for solving a system of linear equations. Richardson iteration was proposed by Lewis Fry Richardson in his work dated 1910. It is similar to the Jacobi and Gauss–Seidel method. We seek the solution to a set of linear equations, expressed in matrix terms as The Richardson iteration is where \omega is a scalar parameter that has to be chosen such that the sequence x^{(k)} converges. It is easy to see that the method has the correct fixed points, because if it converges, then and x^{(k)} has to approximate a solution of A x = b.

Convergence

Subtracting the exact solution x, and introducing the notation for the error, we get the equality for the errors Thus, for any vector norm and the corresponding induced matrix norm. Thus, if, the method converges. Suppose that A is symmetric positive definite and that are the eigenvalues of A. The error converges to 0 if for all eigenvalues \lambda_j. If, e.g., all eigenvalues are positive, this can be guaranteed if \omega is chosen such that. The optimal choice, minimizing all, is , which gives the simplest Chebyshev iteration. This optimal choice yields a spectral radius of where \kappa(A) is the condition number. If there are both positive and negative eigenvalues, the method will diverge for any \omega if the initial error e^{(0)} has nonzero components in the corresponding eigenvectors.

Equivalence to gradient descent

Consider minimizing the function. Since this is a convex function, a sufficient condition for optimality is that the gradient is zero which gives rise to the equation Define and. Because of the form of A, it is a positive semi-definite matrix, so it has no negative eigenvalues. A step of gradient descent is which is equivalent to the Richardson iteration by making t=\omega.