基于MLFMA和近似Schur预调节器的光子晶体问题分析

O. Ergul, T. Malas, Secil Kilinc, Serkan Sarıtaş, L. Gurel
{"title":"基于MLFMA和近似Schur预调节器的光子晶体问题分析","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":"{\"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}","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

摘要

我们考虑了三维光子晶体(PhCs)电磁学问题的快速和准确的解决方案。用组合切向公式(CTF)和用Rao-Wilton-Glisson函数离散的电流和磁场联合场积分方程(JMCFIE)来表示问题。采用多层快速多极算法迭代求解矩阵方程。由于PhC问题难以迭代求解,因此需要鲁棒预处理技术来加速迭代求解。我们表明,新的近似Schur预条件通过显著减少CTF和JMCFIE的迭代次数,能够有效地解决PhC问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Analysis of photonic-crystal problems with MLFMA and approximate Schur preconditioners
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信