Answers are grounded in this paper and cite their sources.
Abstract—In this paper, we study a class of modified incomplete Cholesky factorization preconditioners LL T with two control parameters including dropping rules. Before computing preconditioners, the modified incomplete Cholesky factorization algorithm allows to decide the sparsity of incomplete factorization preconditioners by two fillin control parameters: (1) p, the number of the largest number p of nonzero entries in each row; (2) dropping tolerance. With RCM reordering scheme as a crucial operation for incomplete factorization preconditioners, our numerical results show that both the number of PCOCG and PCG iterations and the total computing time are reduced evidently for appropriate fill-in control parameters. Numerical tests on harmonic analysis for 2D and 3D scattering problems show the efficiency of our method. 1.
No takes yet. Share an insight, caveat, or question.
Huang et al. (2009) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: