By Topic

Data-sparse LU-decomposition preconditioning combined with multilevel fast multipole method for electromagnetic scattering problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Wan, T. ; Nanjing Univ. of Sci. & Technol., Nanjing, China ; Chen, R.S. ; Hu, X.Q.

Owing to the robust of the multilevel fast multipole method (MLFMM), large dense linear systems, arising from discretised electric field integral equations of electromagnetic scattering problems, are generally solved by a Krylov iterative solver. An efficient preconditioning technique based on hierarchical LU-decomposition (H-LU) is proposed to accelerate the convergence rate of the Krylov iterations. The H-LU preconditioner is constructed from the available sparse near-field matrix and provides a data-sparse way to approximate its LU-factors, which can be computed and stored in H-matrix arithmetic with almost linear complexity. The accuracy of the approximation is adjustable that will guarantee a bounded number of iterations. Some means are introduced to further lower the computational cost of the H-LU Numerical examples are provided to illustrate that the resulting H-LU preconditioner is effective and flexible with MLFMM to reduce both the iteration number and the overall simulation time significantly.

Published in:

Microwaves, Antennas & Propagation, IET  (Volume:5 ,  Issue: 11 )