A composite step bi-conjugate gradient algorithm for nonsymmetric linear systems
- 1 March 1994
- journal article
- Published by Springer Nature in Numerical Algorithms
- Vol. 7 (1) , 1-16
- https://doi.org/10.1007/bf02141258
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- An analysis of the composite step biconjugate gradient methodNumerische Mathematik, 1993
- How Fast are Nonsymmetric Matrix Iterations?SIAM Journal on Matrix Analysis and Applications, 1992
- A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part ISIAM Journal on Matrix Analysis and Applications, 1992
- QMR: a quasi-minimal residual method for non-Hermitian linear systemsNumerische Mathematik, 1991
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systemsSIAM Journal on Scientific and Statistical Computing, 1989
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear SystemsSIAM Journal on Scientific and Statistical Computing, 1986
- Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient MethodSIAM Journal on Numerical Analysis, 1984
- The Lanczos Biorthogonalization Algorithm and Other Oblique Projection Methods for Solving Large Unsymmetric SystemsSIAM Journal on Numerical Analysis, 1982
- Conjugate gradient methods for indefinite systemsLecture Notes in Mathematics, 1976
- Solution of Sparse Indefinite Systems of Linear EquationsSIAM Journal on Numerical Analysis, 1975