Complex Incomplete Cholesky Factorization Preconditioned Bi-conjugate Gradient Method

Authors

  • Y.J. Zhang School of Aeronautics Northwestern Polytechnical University, Xi’an, 710072, P.R. China
  • Q. Sun School of Aeronautics Northwestern Polytechnical University, Xi’an, 710072, P.R. China

Keywords:

Complex Incomplete Cholesky Factorization Preconditioned Bi-conjugate Gradient Method

Abstract

Linear systems generated by finite element method (FEM) always have a symmetrical sparse system matrix, which requires a large amount of computation and memory effort to access its zero elements. To address this problem, a fully-sparse storing scheme is proposed to store only nonzero symmetrical elements of the sparse system matrix. Meanwhile, for some illconditioned system matrixes, conventional iterative solution methods may incur such problems as slow convergence and even failure of convergence. To solve this problem, we further develop a fast convergent preconditioned biconjugate gradient method (PBCG) based on a real incomplete Cholesky factorization preconditioner. Numerical experiments show that the proposed method accelerates the convergence and is applicable for the large-scale complex linear systems.

Downloads

Download data is not yet available.

References

D. S. Kershaw, “The incomplete Cholesky

conjugate gradient method for the iterative solution

of systems of linear equation group,” J. of Comp.

Phys., vol. 26, pp. 43-65, 1978.

I. S. Duff and G.A. Meurant, “The effect of

ordering on preconditioned conjugate gradients,”

BIT., vol. 29, no. 4, pp. 635-657, 1989.

J. W. Watts III., “A conjugate gradient truncated

direct method for the iterative solution of the

reservoir simulation pressure equation,” Society of

Petroleum Engineer Journal, vol. 21, no. 3, pp.

-353, 1981.

Jin J M., The Finite Element Method in

Electromagnetics, 2nd ed. Wiley, New York, 2002.

I. Arany, “Solving systems of elastic bar structures

by preconditioned conjugate gradient method,”

Computers Math. Applic., vol. 38, no. 9, pp. 125-

, 1999.

P. Saint-Georges, G. Warzee, R. Beauwens and Y.

Notay, “High-performance PCG solvers for FEM

structural analysis,” Int. J. for Numer. Meth. In

Engng., vol. 39, pp. 1313-1340, 1996.

R. Beauwens and R. Wilmet, “Conditioning

analysis of positive definite matrices by

approximate factorizations,” J. Camp. and Appl.

Math., vol. 26, no. 3, pp. 257-269, 1989.

R. Beauwens, “Modified incomplete factorization

strategies,” Proceedings of a conference on

Preconditioned conjugate gradient methods, vol. 1,

pp. 1-16. 1990.

Y. Notay, “DRIC: A dynamic version of RIC

method. Numer,” Lin. Alg. with. Appl., vol. 1, no. 6,

pp. 511-532, 1994.

R. Beaumens, “Iterative solution methods,”

Applied numerical mathemetics, vol. 51, no. 4, pp.

-450, 2004.

J. P. Wu and Z. H. Wang, “Problems and

improvements to the incomplete Cholesky

factorization with thresholds,” Journal on

Numerical Methods and Computer Applications,

vol. 24, no. 3, pp. 207-214, 2003.

Y. J. Zhang and Q. Sun, “Improved ICCG method

for large scale sparse linear equation group,”

Journal of Computational Physics, vol. 24, no. 4,

pp. 581-584, 2007

Downloads

Published

2022-06-17

How to Cite

[1]
Y. . Zhang and Q. . Sun, “Complex Incomplete Cholesky Factorization Preconditioned Bi-conjugate Gradient Method”, ACES Journal, vol. 25, no. 9, pp. 750–754, Jun. 2022.

Issue

Section

General Submission