Conjugate gradient methods form a class of iterative algorithms that are highly effective for solving large‐scale unconstrained optimisation problems. They achieve efficiency by constructing search ...

This is a preview. Log in through your library . Abstract A rate of convergence of the conjugate gradient method for minimizing the convex quadratic functionals in Hilbert space is investigated.

SIAM Journal on Numerical Analysis, Vol. 41, No. 2 (2004), pp. 589-604 (16 pages) We study the computation of the orthogonal spline collocation solution of a linear ...