A Smoothed Conjugate Residual Squared Algorithm for Solving Nonsymmetric Linear Systems

Author

Zhao, Jing ; Zhang, Jian-Hua

Author_Institution

Dept. of Math., Anhui Sci. & Technol. Univ., Fengyang, China

Volume

3

fYear

2009

fDate

21-22 May 2009

Firstpage

364

Lastpage

367

Abstract

Recently the conjugate residual squared (CRS) method has been proposed as an attractive variant of the bi-conjugate residual method. However, in many situations, the CRS algorithm exhibits an irregular convergence behavior. To overcome the disadvantage, we apply a smoothing technique to the CRS algorithm and derived the smoothed CRS algorithm. Numerical experiments indicate that the new method give smoother convergence behavior than CRS and compete with well-known BiCGSTAB method.

Keywords

conjugate gradient methods; convergence of numerical methods; linear systems; BiCGSTAB method; bi-conjugate residual method; irregular convergence behavior; nonsymmetric linear systems; smoothed conjugate residual squared algorithm; smoothing technique; Character generation; Chromium; Convergence of numerical methods; Equations; Linear systems; Mathematics; Polynomials; Smoothing methods; Symmetric matrices; Thyristors; Bi-CR; CGS; CRS; krylov su-bspace methods; nonsymmetric linear systems;

fLanguage

English

Publisher

ieee

Conference_Titel

Information and Computing Science, 2009. ICIC '09. Second International Conference on

Conference_Location

Manchester

Print_ISBN

978-0-7695-3634-7

Type

conf

DOI

10.1109/ICIC.2009.297

Filename

5168880