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 ...
Some algorithms based upon a projection process onto the Krylov subspace $K_m = \operatorname{Span}(r_0, Ar_0, \ldots, A^{m - 1}r_0)$ are developed, generalizing the ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback