On quasi-minimal residual approach of iterative algorithms for solving nonsymmetric linear systems

References

• Brezinski , C. , Zaglia , M.R. and Sadok , H. 1992 . A breakdown-free Lanczos type algorithm for solving linear systems . Numer. Math , 63 : 29 – 38 .
   Web of Science ®Google Scholar
• Brezinski , C. and Sadok , H. 1991 . Avoiding breakdown in the CGS algorithm . Numer.Algorithm , 1 : 199 – 206 .
   Google Scholar
• Cao Z.H. Avoiding breakdown in variants of the BI-CGSTAB algorithm, LAA to appear
   Google Scholar
• Draux , A. “ Polyndmes orthogonaux formels ” . Berlin Heidelberg, New York : Springer-Verlag .
   Google Scholar
• Chan , T.F. , Gallopoulos , E. , Simoncini , V. , Szeto , T. and Tong , C H. 1994 . A quasi-minimal residual variant of the Bi-CGSTAB algorithm for nonsymmetric systems . SI AM J.Sci Compute , 15 : 338 – 347 .
   Web of Science ®Google Scholar
• Freund , R.W. and Nachtigal , N.M . 1991 . QMR: a quasi-minimal residual method for non-Hermitian linear systems . Numer.Math. , 60 : 315 – 339 .
   Web of Science ®Google Scholar
• Freund , R.W. 1993 . A transpose-free quasi-minimal residual algorithm for non-Hermitian linear systems . SI AM J.Sci.Comput. , 14 : 470 – 482 .
   Web of Science ®Google Scholar
• Gutknecht , M.H. 1992 . A completed theory of the unsymmetric Lanczos process and related algorithms.Part I . SI AM J, Matrix Anal.AppU , 13 : 594 – 639 .
   Web of Science ®Google Scholar
• Gutknecht , M.H. 1994 . A completed theory of the unsymmetric Lanczos process and related algorithms.Part II . SIAM J.Matrix Anal.Appl. , 15 : 15 – 58 .
   Google Scholar
• Gutknecht , M.H. 1993 . Variants of BICGSTAB for matrices with complex spectrum . SIAM J.Sci.Comput. , 14 : 1020 – 1033 .
   Web of Science ®Google Scholar
• Sonneveld , P. 1989 . CGS, a fast Lanczos-type solver for nonsymmetric linear systems . SIAM J.Sci, Compute , 10 : 36 – 52 .
   Web of Science ®Google Scholar
• Tong , C.H. 1994 . A family of quasi-minimal residual methods for nonsymmetric linear systems . SIAM J.Sci.Compute , 15 : 89 – 105 .
   Google Scholar
• Van Der Vorst , H.A. 1992 . Bi-CGSTAB: A fast and smoothing converging variant of Bi-CG for the solution of nonsymmetric linear systems . SIAM J.Sci.Comput. , 13 : 631 – 644 .
   Web of Science ®Google Scholar