Abstract
AbstractIn 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.
Funder
Japan Society for the Promotion of Science
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,General Engineering
Reference19 articles.
1. 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)
2. Davis, T.A.: The University of Florida sparse matrix collection. http://www.cise.ufl.edu/research/sparse/matrices/
3. Lecture Notes in Mathematics;R Fletcher,1976
4. Gutknecht, M.H.: Variants of BICGSTAB for matrices with complex spectrum. SIAM J. Sci. Comput. 14, 1020–1033 (1993)
5. Gutknecht, M.H.: Lanczos-type solvers for nonsymmetric linear systems of equations. Acta Numerica. 6, 271–397 (1997)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献