By Topic

Preconditioned Bi-conjugate Gradient Method of large-scale complex linear equations

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)
Zhang Yongjie ; Aeronaut. Sch., Northwestern Polytech. Univ., Xi''an ; Qin Sun

Bi-conjugate gradient method (BCG) has potential problems on slow convergence or divergence when complex linear equations are large-scale or coefficient matrix of complex linear equations is ill. Fortunately, appropriate preconditioning techniques can speed convergence by reducing condition number of ill matrix. Based on a real incomplete Cholesky decomposition preconditioner, a preconditioned method for complex linear equations is built in this paper, and then a preconditioned bi-conjugate gradient method (PBCG) is obtained by combining the preconditioner and bi-conjugate gradient method. Numerical examples show that the preconditioned bi-conjugate gradient method is speedy, high-performance and applicable to solve system of large-scale complex linear equations.

Published in:

Automation Congress, 2008. WAC 2008. World

Date of Conference:

Sept. 28 2008-Oct. 2 2008