DocumentCode :
1700235
Title :
Preconditioned Bi-conjugate Gradient Method of large-scale complex linear equations
Author :
Zhang, Yongjie ; Sun, Qin
Author_Institution :
Aeronaut. Sch., Northwestern Polytech. Univ., Xi´´an
fYear :
2008
Firstpage :
1
Lastpage :
4
Abstract :
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.
Keywords :
conjugate gradient methods; convergence of numerical methods; matrix decomposition; Cholesky decomposition preconditioner; ill-posed coefficient matrix; large-scale complex linear equation; numerical convergence; numerical divergence; preconditioned bi-conjugate gradient method; Convergence; Equations; Gradient methods; Iterative algorithms; Iterative methods; Large-scale systems; Matrix decomposition; Sun; Symmetric matrices; Vectors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Automation Congress, 2008. WAC 2008. World
Conference_Location :
Hawaii, HI
Print_ISBN :
978-1-889335-38-4
Electronic_ISBN :
978-1-889335-37-7
Type :
conf
Filename :
4699196
Link To Document :
بازگشت