{"title":"Wavelet matrix transform approach for the solution of electromagnetic integral equations","authors":"Ning Guan, K. Yashiro, S. Ohkawa","doi":"10.1109/APS.1999.789155","DOIUrl":null,"url":null,"abstract":"We analyze the electromagnetic scattering from an array of metal strips by using the wavelet matrix transform approach. Daubechies' (1988) wavelet bases are chosen to construct sparse wavelet matrices so that matrix-matrix multiplications necessary for the wavelet matrix transform cost only O(N/sup 2/). Resulting sparse matrix equations are treated effectively by a sparse linear system solver by which the cost of solving matrix equations is the order of O(NlogN). Finally, appropriate choice of the number of vanishing moments to obtain fast and accurate solution are studied through numerical experiments.","PeriodicalId":391546,"journal":{"name":"IEEE Antennas and Propagation Society International Symposium. 1999 Digest. Held in conjunction with: USNC/URSI National Radio Science Meeting (Cat. No.99CH37010)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Antennas and Propagation Society International Symposium. 1999 Digest. Held in conjunction with: USNC/URSI National Radio Science Meeting (Cat. No.99CH37010)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APS.1999.789155","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
We analyze the electromagnetic scattering from an array of metal strips by using the wavelet matrix transform approach. Daubechies' (1988) wavelet bases are chosen to construct sparse wavelet matrices so that matrix-matrix multiplications necessary for the wavelet matrix transform cost only O(N/sup 2/). Resulting sparse matrix equations are treated effectively by a sparse linear system solver by which the cost of solving matrix equations is the order of O(NlogN). Finally, appropriate choice of the number of vanishing moments to obtain fast and accurate solution are studied through numerical experiments.