Premium
The modified multilevel compressed block decomposition algorithms for analyzing the scattering of objects in half space
Author(s) -
Ding Dazhi,
Shen Songge,
Jiang Zhaoneng,
Chen Rushan
Publication year - 2013
Publication title -
international journal of numerical modelling: electronic networks, devices and fields
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.249
H-Index - 30
eISSN - 1099-1204
pISSN - 0894-3370
DOI - 10.1002/jnm.1909
Subject(s) - block (permutation group theory) , algorithm , convergence (economics) , matrix (chemical analysis) , rate of convergence , computer science , decomposition , space (punctuation) , compressed sensing , scale (ratio) , matrix decomposition , mathematical optimization , mathematics , key (lock) , physics , geometry , eigenvalues and eigenvectors , ecology , materials science , computer security , quantum mechanics , economics , composite material , biology , economic growth , operating system
The convergence rate of iterative methods can vary in an unpredictable way. It is related to the matrix condition number, which is notoriously bad for the electric field integral equation in the large‐scale electromagnetic problems. Therefore, an efficient direct solution—a multilevel compressed block decomposition (MLCBD) algorithm based on the adaptive cross‐approximation algorithm—is applied to overcome this problem; it is very efficient for the monostatic problems. Simulation results of the objects up and below ground in half space demonstrate that the proposed MLCBD method is efficient for analyzing electromagnetic problems. Copyright © 2013 John Wiley & Sons, Ltd.