ZHANG Yongjie, SUN Qin. Preconditioned Bi-conjugate Gradient Method of Large-scale Sparse Complex Linear Equation Group[J]. Chinese Journal of Electronics, 2011, 20(1): 192-194.
Citation: ZHANG Yongjie, SUN Qin. Preconditioned Bi-conjugate Gradient Method of Large-scale Sparse Complex Linear Equation Group[J]. Chinese Journal of Electronics, 2011, 20(1): 192-194.

Preconditioned Bi-conjugate Gradient Method of Large-scale Sparse Complex Linear Equation Group

  • Received Date: 2008-08-01
  • Rev Recd Date: 2010-05-01
  • Publish Date: 2011-01-05
  • In solving the large-scale sparse complex linear equation group, a lot of CPU operational time and computer memory is consumed to access zero elements of sparse coefficient matrix. As an effective solution, a fullysparse storing scheme is proposed to store only nonzero elements of symmetrical part by chain pattern. For some illconditioned coefficient matrixes, iterative solution methods may incur such problems as slow convergence and even failure of convergence. Fortunately, some valid preconditioning techniques can improve the convergence by reducing condition number of ill-conditioned matrix. Based on a real incomplete Cholesky factorization preconditioner, we develop a fast convergent preconditioned Bi-conjugate gradient method (BCG) to solve the large-scale sparse complex linear equation group. Numerical experiments show that the new incomplete Cholesky factorization preconditioner accelerates the convergence and preconditioned biconjugate gradient method is available for the large-scale complex linear equation group.
  • loading
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (604) PDF downloads(1388) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return