M. Zubair, M. Francavilla, M. Righero, G. Vecchi, L. Dal Negro
{"title":"非周期螺旋有序电大型等离子体阵列的快速分析","authors":"M. Zubair, M. Francavilla, M. Righero, G. Vecchi, L. Dal Negro","doi":"10.1109/COMPEM.2015.7052553","DOIUrl":null,"url":null,"abstract":"This work presents a fast analysis of electromagnetic scattering from arrays of metallic nano-particles with aperiodic spiral order. The reported method extends the integral equation fast Fourier transform (IE-FFT) algorithm to the method of moments solution of PMCHWT integral equation for aperiodic homogenous dielectric arrays. The algorithm relies on the interpolation of Greens function by Lagrangian polynomials on a uniform Cartesian grid. Hence, the matrix-vector product in the iterative solver can be computed via the fast Fourier transform. The memory requirement and the computational complexity of the algorithm tend to stay close to O(N) and O(NlogN), respectively, where N is the number of unknowns. Some numerical examples are included, which illustrate the accuracy and capability of the present method.","PeriodicalId":6530,"journal":{"name":"2015 IEEE International Conference on Computational Electromagnetics","volume":"1 1","pages":"53-55"},"PeriodicalIF":0.0000,"publicationDate":"2015-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Fast analysis of electrically large plasmonic arrays with aperiodic spiral order\",\"authors\":\"M. Zubair, M. Francavilla, M. Righero, G. Vecchi, L. Dal Negro\",\"doi\":\"10.1109/COMPEM.2015.7052553\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This work presents a fast analysis of electromagnetic scattering from arrays of metallic nano-particles with aperiodic spiral order. The reported method extends the integral equation fast Fourier transform (IE-FFT) algorithm to the method of moments solution of PMCHWT integral equation for aperiodic homogenous dielectric arrays. The algorithm relies on the interpolation of Greens function by Lagrangian polynomials on a uniform Cartesian grid. Hence, the matrix-vector product in the iterative solver can be computed via the fast Fourier transform. The memory requirement and the computational complexity of the algorithm tend to stay close to O(N) and O(NlogN), respectively, where N is the number of unknowns. Some numerical examples are included, which illustrate the accuracy and capability of the present method.\",\"PeriodicalId\":6530,\"journal\":{\"name\":\"2015 IEEE International Conference on Computational Electromagnetics\",\"volume\":\"1 1\",\"pages\":\"53-55\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-03-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE International Conference on Computational Electromagnetics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COMPEM.2015.7052553\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE International Conference on Computational Electromagnetics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMPEM.2015.7052553","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Fast analysis of electrically large plasmonic arrays with aperiodic spiral order
This work presents a fast analysis of electromagnetic scattering from arrays of metallic nano-particles with aperiodic spiral order. The reported method extends the integral equation fast Fourier transform (IE-FFT) algorithm to the method of moments solution of PMCHWT integral equation for aperiodic homogenous dielectric arrays. The algorithm relies on the interpolation of Greens function by Lagrangian polynomials on a uniform Cartesian grid. Hence, the matrix-vector product in the iterative solver can be computed via the fast Fourier transform. The memory requirement and the computational complexity of the algorithm tend to stay close to O(N) and O(NlogN), respectively, where N is the number of unknowns. Some numerical examples are included, which illustrate the accuracy and capability of the present method.