A Comparison of Three Basic Conjugate Direction Methods

DOI10.1002/(SICI)1099-1506(199611/12)3:6%3C473::AID-NLA85%3E3.0.CO;2-JMaRDI QIDQ4220443zbMATH OpenOpenAlexFDO

Authors C. G. Broyden, Marco A. Boschetti

Publication date 23 November 1998

Full work available at URL https://doi.org/10.1002/(sici)1099-1506(199611/12)3:6%3C473::aid-nla85%3E3.0.co;2-j

zbMATH Keywords

biconjugate gradient methodbiconjugate residual methodblock conjugate gradient algorithmconjugate directionsconvergenceGalerkin algorithmnon-symmetric linear systems

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Computational methods for sparse matrices (65F50) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• An extension of the conjugate residual method to nonsymmetric linear systems
• scientific article; zbMATH DE number 4092656
• ILUBCG2-11: Solution of 11-banded nonsymmetric linear equation systems by a preconditioned biconjugate gradient routine
• scientific article; zbMATH DE number 4139190
• Retooling the method of block conjugate gradients

Cited in

(4)

• An extension of the conjugate residual method to nonsymmetric linear systems
• Numerical Methods in the Kiko3D Three‐Dimensional Reactor Dynamics Code
• scientific article; zbMATH DE number 6604147 (Why is no real title available?)
• Implementation of different computational variations of biconjugate residual methods

This page was built for publication: A Comparison of Three Basic Conjugate Direction Methods

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