By Topic

Efficient version of multilevel compressed block decomposition for finite-element-based analysis of electromagnetic 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
$33 $33
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

5 Author(s)
Z. Fan ; Nanjing University of Science and Technology, Nanjing, People's Republic of China ; Z. Jiang ; R. Chen ; T. Wan
more authors

This work investigates the feasibility of utilising the multilevel compressed block decomposition algorithm (MLCBD) to increase the efficiency of solving the matrix equation obtained from the finite-element method in the electromagnetic analysis. The MLCBD takes advantage of the low-rank approximation of each sub-matrix of the inverse matrix by truncating the information relative to the minor singular values. The choice of truncating tolerance will affect the accuracy and efficiency of the solution. Original MLCBD requires a small truncating threshold and uses a large amount of memory to yield a satisfying result. A novel technique is proposed to improve the solving efficiency by combining a less accurate truncating threshold in MLCBD with a rapid and cheap iterative refinement process. Numerical results are presented to demonstrate the accuracy and efficiency of the proposed technique.

Published in:

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