Analysis of double-negative materials with surface integral equations and the multilevel fast multipole algorithm
CEM'11 Computational Electromagnetics International Workshop
57 - 60
Item Usage Stats
MetadataShow full item record
We present a fast and accurate analysis of double-negative materials (DNMs) with surface integral equations and the multilevel fast multipole algorithm (MLFMA). DNMs are commonly used as simplified models of metamaterials at resonance frequencies and are suitable to be formulated with surface integral equations. However, realistic metamaterials and their models are usually very large with respect to wavelength and their accurate solutions require fast algorithms, such as MLFMA. We consider iterative solutions of DNMs with MLFMA and we investigate the accuracy and efficiency of solutions when DNMs are formulated with two recently developed formulations, namely, the combined tangential formulation (CTF) and the electric and magnetic current combined-field integral equation (JMCFIE). Numerical results on canonical objects are consistent with previous results in the literature on ordinary objects. © 2011 IEEE.
Combined field integral equations
Double negative materials
Multi-level fast multi-pole algorithm
Multilevel fast multipole algorithms
Surface integral equations
Published Version (Please cite this version)http://dx.doi.org/10.1109/CEM.2011.6047330
Showing items related by title, author, creator and subject.
Tse, Savio S.H. (Springer, 2008-10)We study the online bicriteria load balancing problem in this paper. We choose a system of distributed homogeneous file servers located in a cluster as the scenario and propose two online approximate algorithms for balancing ...
Akçay, H. G.; Aksoy, S. (Institute of Electrical and Electronics Engineers, 2008-07)The object-based analysis of remotely sensed imagery provides valuable spatial and structural information that is complementary to pixel-based spectral information in classification. In this paper, we present novel methods ...
Sarıyüce, A. E.; Gedik, B.; Jacques-Silva, G.; Wu, Kun-Lung; Catalyurek, U.V. (Association for Computing Machinery, 2016)A k-core of a graph is a maximal connected subgraph in which every vertex is connected to at least k vertices in the subgraph. k-core decomposition is often used in large-scale network analysis, such as community detection, ...