A Comparison of Three Basic Conjugate Direction Methods

DOI<473::AID-NLA85>3.0.CO;2-J 10.1002/(SICI)1099-1506(199611/12)3:6<473::AID-NLA85>3.0.CO;2-JzbMath0906.65030OpenAlexW2012493938MaRDI QIDQ4220443

Charles Broyden, Marco Antonio Boschetti

Publication date: 23 November 1998

Full work available at URL: https://doi.org/10.1002/(sici)1099-1506(199611/12)3:6<473::aid-nla85>3.0.co;2-j

zbMATH Keywords

convergencebiconjugate residual methodnon-symmetric linear systemsconjugate directionsbiconjugate gradient methodGalerkin algorithmblock conjugate gradient algorithm

Mathematics Subject Classification ID

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

Related Items (2)

Numerical Methods in the Kiko3D Three‐Dimensional Reactor Dynamics Code ⋮ An extension of the conjugate residual method to nonsymmetric linear systems

Cites Work

• Unnamed Item

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