Abstract
In this paper, we study a kind of effective preconditioning technique, which interleaves the incomplete Cholesky (IC) factorization with an approximate minimum degree ordering. An IC factorization algorithm derived from IKJ-version Gaussian elimination is proposed and some details on implementation are presented. Then we discuss the ways to compute the degrees of the unnumbered nodes exactly and approximately using the concept of element absorbing. When used in conjunction with conjugate gradient algorithm, the new preconditioners usually lead to fast convergence. The numerical experiments show that the interleaving of symbolic ordering and numerical IC factorization will generate better preconditioners than those generated by the IC factorization without ordering or with purely symbolic ordering ahead of the factorization.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
