Multiple Recursion Conjugate Gradient Algorithms Part I: Sufficient Conditions

DOI10.1137/S089547989833245XMaRDI QIDQ4943658zbMATH OpenFDO

Authors Teri L. Barth, Thomas A. Manteuffel

Publication date 19 March 2000

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

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

zbMATH Keywords

conjugate gradient methodnonnormal matricesshort recurrencesystem of linear equations

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Recommendations

• scientific article; zbMATH DE number 992798
• scientific article; zbMATH DE number 839241
• Necessary and sufficient conditions for the simplification of generalized conjugate-gradient algorithms
• A Multipreconditioned Conjugate Gradient Algorithm
• A new taxonomy of conjugate gradient methods

Cited in

(12)

• Necessary and sufficient conditions for the simplification of generalized conjugate-gradient algorithms
• Revisiting \((k,\ell)\)-step methods
• scientific article; zbMATH DE number 992798 (Why is no real title available?)
• Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method
• A condensed representation of almost normal matrices
• On an economic Arnoldi method for \(BML\)-matrices
• Multiple search direction conjugate gradient method I: methods and their propositions
• A unitary similarity transform of a normal matrix to complex symmetric form
• On generating Sobolev orthogonal polynomials
• A numerical comparison of two minimal residual methods for linear polynomials in unitary matrices
• A numerical approach for the Poisson equation in a planar domain with a small inclusion
• SYMMLQ-like procedure for Ax=b where A is a special normal matrix

This page was built for publication: Multiple Recursion Conjugate Gradient Algorithms Part I: Sufficient Conditions

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