Improvement of preconditioned bi-Lanczos-type algorithms with residual norm minimization for the stable solution of systems of linear equations
Tóm tắt
In this paper, improved algorithms are proposed for preconditioned bi-Lanczos-type methods with residual norm minimization for the stable solution of systems of linear equations. In particular, preconditioned algorithms pertaining to the bi-conjugate gradient stabilized method (BiCGStab) and the generalized product-type method based on the BiCG (GPBiCG) have been improved. These algorithms are more stable compared to conventional alternatives. Further, a stopping criterion changeover is proposed for use with these improved algorithms. This results in higher accuracy (lower true relative error) compared to the case where no changeover is done. Numerical results confirm the improvements with respect to the preconditioned BiCGStab, the preconditioned GPBiCG, and stopping criterion changeover. These improvements could potentially be applied to other preconditioned algorithms based on bi-Lanczos-type methods.
Tài liệu tham khảo
Barrett, R., Berry, M., Chan, T.F., Demmel, J., Donato, J., Dongarra, J., Eijkhout, V., Pozo, R., Romine, C., Van der Vorst, H.A.: Templates for the solution of linear systems: Building Blocks for Iterative Methods. SIAM (1994)
Davis, T.A.: The University of Florida sparse matrix collection. http://www.cise.ufl.edu/research/sparse/matrices/
Fletcher, R.: Conjugate gradient methods for indefinite systems. In: Watson, G. (ed.) Numerical Analysis Dundee 1975. Lecture Notes in Mathematics, vol. 506, pp. 73–89. Springer, Berlin (1976)
Gutknecht, M.H.: Variants of BICGSTAB for matrices with complex spectrum. SIAM J. Sci. Comput. 14, 1020–1033 (1993)
Gutknecht, M.H.: Lanczos-type solvers for nonsymmetric linear systems of equations. Acta Numerica. 6, 271–397 (1997)
Itoh, S., Katagiri, T., Sakurai, T., Igai, M., Ohshima, S., Kuroda, H., Naono, K.: An improvement in preconditioned algorithm of BiCGStab method. IPSJ Trans. Adv. Comput. Syst. 5(3), 11–21 (2012). ((in Japanese))
Itoh, S., Sugihara, M.: Structure of the polynomials in preconditioned BiCG algorithms and the switching direction of preconditioned systems. arXiv:1603.00175 [math.NA]. (2016)
Itoh, S., Sugihara, M.: Structure of the preconditioned system in various preconditioned conjugate gradient squared algorithms. Results Appl. Math. 3, 100008 (2019)
Itoh, S., Sugihara, M.: Changing over stopping criterion for stable solving nonsymmetric linear equations by preconditioned conjugate gradient squared method. Appl. Math. Lett. 102, 106088 (2020)
Lanczos, C.: Solution of systems of linear equations by minimized iterations. J. Res. Nat. Bur. Stand. 49, 33–53 (1952)
Matrix Market project: http://math.nist.gov/MatrixMarket/
Meurant, G.: Computer Solution of Large Linear Systems. Elsevier (2005)
Satake, I.: Linear Algebra. Marcel Dekker, Inc. (1975)
Simoncini, V., Szyld, D.B.: Interpreting IDR as a Petrov–Galerkin Method. SIAM J. Sci. Comput. 32, 1898–1912 (2010)
Sleijpen, G.L.G., Fokkema, D.R.: BiCGstab( L) for linear equations involving unsymmetric matrices with complex spectrum. Elec. Trans. Numer. Anal. 1, 11–32 (1993)
SSI project: Lis: Library of iterative solvers for linear systems. http://www.ssisc.org/lis/
Tanio, M., Sugihara, M.: GBi-CGSTAB( s, L): IDR( s) with higher-order stabilization polynomials. J. Comput. Appl. Math. 235, 765–784 (2010)
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)
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)