B. Carpentieri, Y. Jing, Tingzhu Huang, W. Pi, X. Sheng
{"title":"麦克斯韦方程组矩量离散法的一种新的迭代求解方法","authors":"B. Carpentieri, Y. Jing, Tingzhu Huang, W. Pi, X. Sheng","doi":"10.1109/CEM.2011.6047336","DOIUrl":null,"url":null,"abstract":"Boundary element discretizations of surface and hybrid surface/volume formulations of electromagnetic scattering problems generate large and dense systems of linear equations that are tough to solve by iterative techniques. The restarted generalized minimal residual (GMRES) method is virtually always used when the systems are non-Hermitian and indefinite. However, it may be prohibitively expensive especially for large scale out-of-core integral codes. We present experiments with a novel class of iterative methods that have constant, low memory and algorithmic cost per iteration. The results on some selected matrix problems arising from realistic radar-cross-section calculation indicate that the new family of algorithms is amazingly competitive with the most popular iterative techniques in use today for solving linear systems.","PeriodicalId":169588,"journal":{"name":"CEM'11 Computational Electromagnetics International Workshop","volume":"104 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A novel family of iterative solvers for method of moments discretizations of maxwell's equations\",\"authors\":\"B. Carpentieri, Y. Jing, Tingzhu Huang, W. Pi, X. Sheng\",\"doi\":\"10.1109/CEM.2011.6047336\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Boundary element discretizations of surface and hybrid surface/volume formulations of electromagnetic scattering problems generate large and dense systems of linear equations that are tough to solve by iterative techniques. The restarted generalized minimal residual (GMRES) method is virtually always used when the systems are non-Hermitian and indefinite. However, it may be prohibitively expensive especially for large scale out-of-core integral codes. We present experiments with a novel class of iterative methods that have constant, low memory and algorithmic cost per iteration. The results on some selected matrix problems arising from realistic radar-cross-section calculation indicate that the new family of algorithms is amazingly competitive with the most popular iterative techniques in use today for solving linear systems.\",\"PeriodicalId\":169588,\"journal\":{\"name\":\"CEM'11 Computational Electromagnetics International Workshop\",\"volume\":\"104 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"CEM'11 Computational Electromagnetics International Workshop\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEM.2011.6047336\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"CEM'11 Computational Electromagnetics International Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEM.2011.6047336","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A novel family of iterative solvers for method of moments discretizations of maxwell's equations
Boundary element discretizations of surface and hybrid surface/volume formulations of electromagnetic scattering problems generate large and dense systems of linear equations that are tough to solve by iterative techniques. The restarted generalized minimal residual (GMRES) method is virtually always used when the systems are non-Hermitian and indefinite. However, it may be prohibitively expensive especially for large scale out-of-core integral codes. We present experiments with a novel class of iterative methods that have constant, low memory and algorithmic cost per iteration. The results on some selected matrix problems arising from realistic radar-cross-section calculation indicate that the new family of algorithms is amazingly competitive with the most popular iterative techniques in use today for solving linear systems.