By Topic

A Smoothed Conjugate Residual Squared Algorithm for Solving Nonsymmetric Linear Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jing Zhao ; Dept. of Math., Anhui Sci. & Technol. Univ., Fengyang, China ; Jian-Hua Zhang

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.

Published in:

Information and Computing Science, 2009. ICIC '09. Second International Conference on  (Volume:3 )

Date of Conference:

21-22 May 2009