Abstract
GPBi-CG method is an attractive iterative method for the solution of a linear system of equations with nonsymmetric coefficient matrix. However, the popularity of GPBi-CG method has diminished over time except for the minority. In this paper, we consider a new algorithm based on minimization of the associate residual of 2-norm in place of reconstruction of the algorithm. We refer to a method with new algorithm as GPBiCG with Associate Residual (abbreviated as GPBiCG_AR) method. Moreover we will introduce preconditioned GPBiCG_AR (abbreviated as P_GPBiCG_AR). Then, we will support that GPBiCG_AR and P_GPBiCG_AR methods yield safety convergence through numerical experiments.
Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Saad, Y.: Iterative Methods for Sparse Linear Systems. SIAM, Philadelphia (2003)
Tim Davis’ sparse matrix collection of Florida University, http://www.cise.ufl.edu/research/sparse/matrices/
Fujino, S., Fujiwara, M., Yoshida, M.: BiCGSafe method based on minimization of associate residual, JSCES 2005 (2005), http://www.jstage.jst.go.jp/article/jsces/2005/0/20050028_pdf/-char/ja/ (in Japanese)
van der Vorst, H.A.: Bi-CGSTAB: A fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems. SIAM J. Sci. Stat. Comput. 13, 631–644 (1992)
van der Vorst, H.A.: Iterative Krylov preconditionings for large linear systems. Cambridge University Press, Cambridge (2003)
Zhang, S.-L.: GPBi-CG: Generalized product-type methods based on Bi-CG for solving nonsymmetric linear systems. SIAM J. Sci. Comput. 18, 537–551 (1997)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Thuthu, M., Fujino, S. (2008). Stability of GPBiCG_AR Method Based on Minimization of Associate Residual. In: Kapur, D. (eds) Computer Mathematics. ASCM 2007. Lecture Notes in Computer Science(), vol 5081. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87827-8_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-87827-8_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87826-1
Online ISBN: 978-3-540-87827-8
eBook Packages: Computer ScienceComputer Science (R0)