An adaptive preconditioned CRS algorithm
Gao Zhi-zhong
Abstract
Gao Zhi-zhong
Abstract
Conjugate residual squared algorithm(CRS) was popular Krylov subspace method for large,sparse and nonsymmetric linear systems.However,the CRS may suffer from irregular convergence,slow convergence or be stationary in some applications.In order to remedy this difficulty,we present an adaptive preconditioner,which is constructed in the iteration step of CRS,by several steps of GMRES(m).Finally,numerical experiments show the effectiveness of the new algorithm.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Conjugate residual squared algorithm(CRS) was popular Krylov subspace method for large,sparse and nonsymmetric linear systems.However,the CRS may suffer from irregular convergence,slow convergence or be stationary in some applications.In order to remedy this difficulty,we present an adaptive preconditioner,which is constructed in the iteration step of CRS,by several steps of GMRES(m).Finally,numerical experiments show the effectiveness of the new algorithm.
Key concepts: Generalized minimal residual method, Preconditioner, Krylov subspace, Convergence (economics), Conjugate residual method, Residual, Algorithm, Conjugate gradient method