Changing the Norm in Conjugate Gradient Type Algorithms

DOI10.1137/0730003zbMATH Open0851.65017OpenAlexW2030091402MaRDI QIDQ4032009FDOQ4032009

Authors: 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

Recommendations

• scientific article; zbMATH DE number 671954
• scientific article; zbMATH DE number 3881771
• Publication:3471625
• Publication:4864092
• Properties of generalized conjugate gradient methods

zbMATH Keywords

smoothing algorithmpreconditioningconjugate gradient methodconjugate residual methodLR algorithmorthogonal error method

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Cited In (13)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4032009)