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":null,"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.0000,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Computational Electromagnetics International Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEM.2009.5228100","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
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.