MODIFIED INCOMPLETE CHOLESKY FACTORIZATION FOR SOLVING ELECTROMAGNETIC SCATTERING PROBLEMS | Zendy

TingZhu Huang | Zendy; Yong Zhang | Zendy; Liang Li | Zendy; Wei Shao | Zendy; Sheng-Jian Lai | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

MODIFIED INCOMPLETE CHOLESKY FACTORIZATION FOR SOLVING ELECTROMAGNETIC SCATTERING PROBLEMS

Author(s) -

TingZhu Huang,

Yong Zhang,

Liang Li,

Wei Shao,

Sheng-Jian Lai

Publication year - 2009

Publication title -

progress in electromagnetics research b

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.208

H-Index - 47

ISSN - 1937-6472

DOI - 10.2528/pierb08112407

Subject(s) - cholesky decomposition , incomplete cholesky factorization , factorization , minimum degree algorithm , computer science , scattering , mathematics , mathematical optimization , physics , algorithm , optics , quantum mechanics , eigenvalues and eigenvectors

—In this paper, we study a class of modified incomplete Cholesky factorization preconditioners LL, with two control parame- ters including dropping rules. Before computing preconditioners, the modified incomplete Cholesky factorization algorithm allows to decide the sparsity of incomplete factorization preconditioners by two fill- in control parameters: (1) p, the number of the largest number p of nonzero entries in each row; (2) dropping tolerance. With RCM re- ordering 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 re- duced evidently for appropriate fill-in control parameters. Numerical tests on harmonic analysis for 2D and 3D scattering problems show the efficiency of our method.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research