{"title":"Accurate evaluation of mutual coupling for array calibration","authors":"S. Henault, Y. Antar","doi":"10.1109/CEM.2009.5228109","DOIUrl":"https://doi.org/10.1109/CEM.2009.5228109","url":null,"abstract":"Calibration of receiving antenna arrays generally yields a square coupling matrix characterizing the array response. It is demonstrated in this paper that in the presence of strong structure scattering, the array response is better described by a non-square coupling matrix. Therefore, the calibration procedure must account for these new matrix dimensions. The different approaches providing accurate non-square coupling matrices are described, and important guidelines are given for the determination of the coupling matrix dimensions for obtaining the best performance.","PeriodicalId":416029,"journal":{"name":"2009 Computational Electromagnetics International Workshop","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123430505","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
J. M. Taboada, L. Landesa, F. Obelleiro, J. L. Rodríguez, J. Bértolo, J. C. Mouriño, A. Gómez
{"title":"Parallel FMM-FFT solver for the analysis of hundreds of millions of unknowns","authors":"J. M. Taboada, L. Landesa, F. Obelleiro, J. L. Rodríguez, J. Bértolo, J. C. Mouriño, A. Gómez","doi":"10.1109/CEM.2009.5228111","DOIUrl":"https://doi.org/10.1109/CEM.2009.5228111","url":null,"abstract":"An efficient parallel implementation of the fast multipole method (FMM) combined with the fast fourier transform (FFT) is presented. The good scaling properties of the FMM-FFT, combined with a careful parallelization strategy, has shown to be very effective when using large parallel high performance supercomputers. For the case of very large problems, with hundreds of millions of unknowns, a nested scheme has been derived that further reduces the memory consumption. A challenging problem with more than 0.5 billion unknowns has been solved using this implementation, which demonstrates the ability of the algorithm to take advantage of the availability of supercomputers for the analysis of large, leading-edge electromagnetic problems.","PeriodicalId":416029,"journal":{"name":"2009 Computational Electromagnetics International Workshop","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129813899","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A parallel hybrid sparse linear system solver","authors":"M. Manguoglu","doi":"10.1109/CEM.2009.5228110","DOIUrl":"https://doi.org/10.1109/CEM.2009.5228110","url":null,"abstract":"We present a parallel hybrid sparse linear system solver that is suitable for the solution of large sparse linear systems on parallel computing platforms. This study is motivated by the lack of robustness of Krylov subspace iterative schemes with “black-box” preconditioners, such as incomplete LU-factorizations and the lack of scalability of direct sparse system solvers. Our hybrid solver is as robust as direct solvers and as scalable as iterative solvers. Our method relies on weighted symmetric and nonsymmetric matrix reordering for bringing the largest elements on or closer to the main diagonal resulting in a very effective extracted banded preconditioner. Systems involving the extracted banded preconditioner are solved via a member of the recently developed SPIKE family of algorithms. The effectiveness of our method is demonstrated by solving large sparse linear systems that arise in various applications such as computational electromagnetics and nonlinear optimizations. We compare the performance and scalability of our solvers to well known direct and iterative solver packages such as ILUPACK and MUMPS. Finally, we present a highly accurate model for predicting the parallel scalability of our solver on architectures with more nodes than the platform on which our experiments have been performed.","PeriodicalId":416029,"journal":{"name":"2009 Computational Electromagnetics International Workshop","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132136478","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Power decomposition method for compression of the electric-field integral equation","authors":"L. Landesa, G. Gajardo-Silva, J. M. Taboada","doi":"10.1109/CEM.2009.5228102","DOIUrl":"https://doi.org/10.1109/CEM.2009.5228102","url":null,"abstract":"We focus on the problem of compression of farfield interactions in the matrices of the method of moments. We present a new point of view with respect to other alternatives: instead of compressing each block of the impedance matrix (corresponding to the mutual coupling between a pair of geometry groups), our hypothesis here is that this compression can be separately obtained inside of each group. In this manner each group is compressed only once, which allows us to obtain larger compression rates than the usual mutual-coupling based schemes. With this idea, we propose a recursive mechanism similar to that used in the multilevel fast multipole method, leading to a hi erarchical multilevel building of macro basis functions that finally provides a O(N logN) algorithm for computational electromagnetics. Moreover, the proposed calculation of compressed basis functions is completely independent on the excitation.","PeriodicalId":416029,"journal":{"name":"2009 Computational Electromagnetics International Workshop","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127498874","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Fast and accurate solutions of extremely large scattering problems involving three-dimensional canonical and complicated objects","authors":"O. Ergul, L. Gurel","doi":"10.1109/CEM.2009.5228112","DOIUrl":"https://doi.org/10.1109/CEM.2009.5228112","url":null,"abstract":"We present fast and accurate solutions of extremely large scattering problems involving three-dimensional metallic objects discretized with hundreds of millions of unknowns. Solutions are performed by the multilevel fast multipole algorithm, which is parallelized efficiently via a hierarchical partition strategy. Various examples involving canonical and complicated objects are presented in order to demonstrate the feasibility of accurately solving large-scale problems on relatively inexpensive computing platforms without resorting to approximation techniques.","PeriodicalId":416029,"journal":{"name":"2009 Computational Electromagnetics International Workshop","volume":"29 34","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133357614","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Rigorous solution by analytical regularization method to the problem of 2D E-Polarized wave diffraction by a set of PEC surfaces","authors":"H. Yiğit, F. Dikmen, O. Suvorova, Y. Tuchkin","doi":"10.1109/CEM.2009.5228107","DOIUrl":"https://doi.org/10.1109/CEM.2009.5228107","url":null,"abstract":"The analytical regularization method is applied to the problem of 2D E-Polarized wave diffraction by perfectly conductive surfaces consisting of a set of closed and unclosed surfaces. The electromagnetic boundary value problem is reduced to the infinite algebraic system of the second kind which in principal can be solved with any predetermined accuracy by means of truncation procedure. Numerical results, including condition number behavior, current density, and field's space distribution for obstacles are presented.","PeriodicalId":416029,"journal":{"name":"2009 Computational Electromagnetics International Workshop","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115605919","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Fully overlapping domain decomposition for fast optimization of small antennas in large-scale composite media","authors":"T. Peng, K. Sertel, J. Volakis","doi":"10.1109/CEM.2009.5228103","DOIUrl":"https://doi.org/10.1109/CEM.2009.5228103","url":null,"abstract":"A novel domain decomposition approach for modeling electrically small details within large computational domains is proposed. The approach tackles the conditioning issues associated with highly non-uniform finite element meshes resulting from direct discretization of fine geometrical details. The proposed method addresses this particular challenge, specifically for fast optimization tools, by separating the discretization of the detail region from that of the uniform background. The iterations between the two are carried out by proper field projections between the meshes. Due to two overlapping meshes being completely unstructured, the method avoids frequent re-meshing and matrix re-computation in optimization iterations. This aspect provides significant flexibility, compared to conventional finite element and domain decomposition methods.","PeriodicalId":416029,"journal":{"name":"2009 Computational Electromagnetics International Workshop","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126614522","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
W. C. Chew, J. Xiong, Z. Qian, M. Li, A. Hesford, F. Teixeira
{"title":"Computational electromagnetics: Casimir force, multiscale calculations, coordinate stretching","authors":"W. C. Chew, J. Xiong, Z. Qian, M. Li, A. Hesford, F. Teixeira","doi":"10.1109/CEM.2009.5228105","DOIUrl":"https://doi.org/10.1109/CEM.2009.5228105","url":null,"abstract":"This presentation summarizes some recent advances and applications of computational electromagnetics for complex structures in Casimir force calculation, and multiscale simulation in circuits and antennas. It discusses the concept of coordinate stretching and its relationship to transformation optics.","PeriodicalId":416029,"journal":{"name":"2009 Computational Electromagnetics International Workshop","volume":"155 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131426443","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
O. Ergul, T. Malas, Secil Kilinc, Serkan Sarıtaş, L. Gurel
{"title":"Analysis of photonic-crystal problems with MLFMA and approximate Schur preconditioners","authors":"O. Ergul, T. Malas, Secil Kilinc, Serkan Sarıtaş, L. Gurel","doi":"10.1109/CEM.2009.5228100","DOIUrl":"https://doi.org/10.1109/CEM.2009.5228100","url":null,"abstract":"We consider fast and accurate solutions of electromagnetics problems involving three-dimensional photonic crystals (PhCs). Problems are formulated with the combined tangential formulation (CTF) and the electric and magnetic current combined-field integral equation (JMCFIE) discretized with the Rao-Wilton-Glisson functions. Matrix equations are solved iteratively by the multilevel fast multipole algorithm. Since PhC problems are difficult to solve iteratively, robust preconditioning techniques are required to accelerate iterative solutions. We show that novel approximate Schur preconditioners enable efficient solutions of PhC problems by reducing the number of iterations significantly for both CTF and JMCFIE.","PeriodicalId":416029,"journal":{"name":"2009 Computational Electromagnetics International Workshop","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116009582","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Hybridizing physical optics with MLFMA for efficient scattering computations of three-dimensional complex targets","authors":"A. Manyas, O. Ergul, L. Gurel","doi":"10.1109/CEM.2009.5228101","DOIUrl":"https://doi.org/10.1109/CEM.2009.5228101","url":null,"abstract":"The multilevel fast multipole algorithm (MLFMA) provides accurate and efficient solutions of electromagnetic scattering problems involving large and complicated structures. On the other hand, whenever applicable, accelerations provided by approximation techniques can be useful to further improve the efficiency of solutions. In this paper, we present a hybrid technique, which combines the physical-optics (PO) method and MLFMA for efficient scattering computations of three-dimensional objects. We show that, with a careful choice of MLFMA and PO regions on the structure, the number of unknowns can be reduced and solutions can be accelerated significantly, without sacrificing the accuracy. The proposed hybrid technique is easy to implement by modifying existing MLFMA codes.","PeriodicalId":416029,"journal":{"name":"2009 Computational Electromagnetics International Workshop","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133221476","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}