Minimization properties and short recurrences

  • Wagner B
  • Weiss R
  • 1


    Mendeley users who have this article in their library.
  • 1


    Citations of this article.


Two algorithms characterized by a short recurrence as well as a minimization property in the energy norm are derived by choosing suitable preconditioning matrices for certain step-dependent preconditioned conjugate Krylov subspace (CKS) algorithms. It is shown that the two methods are also equivalent to two special truncated generalized CG algorithms. Therefore, it is possible to state a minimization property for truncated generalized CG algorithms in a k-dimensional space. Numerical comparison with other generalized CG algorithms requiring the same amount of storage shows that the derived methods are competitive and for certain problems faster.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Boris Wagner

  • Rüdiger Weiss

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free