T. Schellenberg, Guang Xu, M. El-Arabied, M. Schneider
{"title":"Accelerated methods for computing internal inductances of rectangular conductors","authors":"T. Schellenberg, Guang Xu, M. El-Arabied, M. Schneider","doi":"10.1109/EMCEUROPE.2012.6396928","DOIUrl":null,"url":null,"abstract":"Methods for accelerating the computation of internal inductances of rectangular conductors for uniform discretization are presented and discussed. Significant improvements in both the speed of computation and in memory requirements are achieved by applying algorithms that take advantage of the symmetric Toeplitz block Toeplitz structure of the matrices involved in these calculations. The computational expense for the costliest operation is improved from near O(N3) to roughly O(N) and memory requirements are reduced from an order of N2 elements to N elements.","PeriodicalId":377100,"journal":{"name":"International Symposium on Electromagnetic Compatibility - EMC EUROPE","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on Electromagnetic Compatibility - EMC EUROPE","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EMCEUROPE.2012.6396928","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Methods for accelerating the computation of internal inductances of rectangular conductors for uniform discretization are presented and discussed. Significant improvements in both the speed of computation and in memory requirements are achieved by applying algorithms that take advantage of the symmetric Toeplitz block Toeplitz structure of the matrices involved in these calculations. The computational expense for the costliest operation is improved from near O(N3) to roughly O(N) and memory requirements are reduced from an order of N2 elements to N elements.