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.