Estimation of spectral bounds in gradient algorithms (Q385581): Difference between revisions

One often uses the minimization of convex quadratic functions with the help of gradient algorithms to solve systems of linear equations whose coefficient matrix is symmetric positive-definite. In this paper, the authors give a nice estimate for spectral bounds which allow the construction of simple and cost-effective gradient algorithms with fast convergence.