Changing the Norm in Conjugate Gradient Type Algorithms

DOI10.1137/0730003zbMath0851.65017OpenAlexW2030091402MaRDI QIDQ4032009

Martin H. Gutknecht

Publication date: 4 May 1993

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0730003

zbMATH Keywords

preconditioningconjugate gradient methodLR algorithmsmoothing algorithmconjugate residual methodorthogonal error method

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Related Items (13)

Minimal polynomial and reduced rank extrapolation methods are related ⋮ A framework for generalized conjugate gradient methods -- with special emphasis on contributions by Rüdiger Weiß ⋮ Breakdowns and stagnation in iterative methods ⋮ New insights in GMRES-like methods with variable preconditioners ⋮ Combination preconditioning of saddle point systems for positive definiteness ⋮ A theoretical overview of Krylov subspace methods ⋮ Finite section method in a space with two norms ⋮ Projection methods for linear systems ⋮ Complex conjugate gradient methods ⋮ Optimal left and right additive Schwarz preconditioning for minimal residual methods with Euclidean and energy norms ⋮ On the stable implementation of the generalized minimal error method ⋮ Restrictive preconditioners for conjugate gradient methods for symmetric positive definite linear systems ⋮ Revisiting \((k,\ell)\)-step methods

This page was built for publication: Changing the Norm in Conjugate Gradient Type Algorithms