Efficient solution of dense linear system of equations arising in the investigation of electromagnetic scattering by truncated periodic structures

J. Poirier, P. Borderies, E. Gimonet, R. Mittra, V. Varadarajan
{"title":"Efficient solution of dense linear system of equations arising in the investigation of electromagnetic scattering by truncated periodic structures","authors":"J. Poirier, P. Borderies, E. Gimonet, R. Mittra, V. Varadarajan","doi":"10.1109/APS.1997.630084","DOIUrl":null,"url":null,"abstract":"The problem of estimating the edge effects in a truncated periodic array is difficult because it requires the solution of a large, dense, linear systems of equations. In this paper we present an efficient numerical technique for solving the problem of one- and two-dimensional truncated array of scatterers. We utilize global impedance matrix compression, achieved by the reduced-rank representation of the off-diagonal blocks, together with partial-QR decomposition. The system with a compressed matrix is then solved by using an iterative method based on preconditioned transpose-free quasi minimal residual (PTFQMR) method, followed by further iterative refinements. Both the preconditioning and the compression steps are configured such that they can take advantage of the block structure of the matrix. A comparative evaluation of the performance of the present iterative technique is carried out vis-a-vis other matrix solution methods, both iterative and direct, with a view to demonstrating the superior computational efficiency of the present solver. We further show that a high matrix compression rate can be achieved without sacrificing the accuracy required by successive refinements. This not only leads to a saving in the memory requirements, and thus enables us to handle large problems which would otherwise be unmanageable, but also contributes to the numerical efficiency of the algorithm.","PeriodicalId":283897,"journal":{"name":"IEEE Antennas and Propagation Society International Symposium 1997. Digest","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Antennas and Propagation Society International Symposium 1997. Digest","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APS.1997.630084","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The problem of estimating the edge effects in a truncated periodic array is difficult because it requires the solution of a large, dense, linear systems of equations. In this paper we present an efficient numerical technique for solving the problem of one- and two-dimensional truncated array of scatterers. We utilize global impedance matrix compression, achieved by the reduced-rank representation of the off-diagonal blocks, together with partial-QR decomposition. The system with a compressed matrix is then solved by using an iterative method based on preconditioned transpose-free quasi minimal residual (PTFQMR) method, followed by further iterative refinements. Both the preconditioning and the compression steps are configured such that they can take advantage of the block structure of the matrix. A comparative evaluation of the performance of the present iterative technique is carried out vis-a-vis other matrix solution methods, both iterative and direct, with a view to demonstrating the superior computational efficiency of the present solver. We further show that a high matrix compression rate can be achieved without sacrificing the accuracy required by successive refinements. This not only leads to a saving in the memory requirements, and thus enables us to handle large problems which would otherwise be unmanageable, but also contributes to the numerical efficiency of the algorithm.
截断周期结构电磁散射研究中密集线性方程组的有效解
估计截断周期阵列中的边缘效应是一个困难的问题,因为它需要求解一个大的、密集的线性方程组。本文提出了一种求解一维和二维截短散射体阵列问题的有效数值方法。我们利用全局阻抗矩阵压缩,通过非对角线块的降阶表示和部分qr分解来实现。然后采用基于预条件无转置拟最小残差(PTFQMR)方法的迭代方法求解具有压缩矩阵的系统,并进行进一步的迭代细化。预处理和压缩步骤的配置使得它们可以利用矩阵的块结构。对比评价了本迭代法与其他矩阵求解方法的性能,包括迭代法和直接法,以证明本求解器具有优越的计算效率。我们进一步表明,在不牺牲连续改进所需的精度的情况下,可以实现高矩阵压缩率。这不仅可以节省内存需求,从而使我们能够处理否则无法管理的大型问题,而且还有助于提高算法的数值效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信