{"title":"A Storage Optimization Scheme for PITD Method Using Sparse Matrix-Vector Multiplication","authors":"Liang Ma;Xikui Ma;Mingjun Chi;Ru Xiang;Xiaojie Zhu","doi":"10.1109/LMWT.2024.3516877","DOIUrl":null,"url":null,"abstract":"An improved variant of the precise-integration time-domain (PITD) method is proposed to eliminate the inverse matrix calculation and optimize the storage burden with the help of sparse computation. First, the dimensional expanding (DE) scheme is incorporated into PITD to address the matrix inversion problem due to external sources. Then, the dense matrix exponential is absorbed in sparse matrix-vector multiplications (SpMVs) without explicit evaluation. This SpMV-based technique involves only one sparse matrix and can utilize sparse computation efficiently, so as to greatly reduce memory costs ascribed to the matrix exponential. Moreover, the theoretical analysis of the algorithm performance is presented. The numerical results verify the validity and efficiency of the proposed method.","PeriodicalId":73297,"journal":{"name":"IEEE microwave and wireless technology letters","volume":"35 2","pages":"145-148"},"PeriodicalIF":0.0000,"publicationDate":"2024-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE microwave and wireless technology letters","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10813408/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"0","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0
Abstract
An improved variant of the precise-integration time-domain (PITD) method is proposed to eliminate the inverse matrix calculation and optimize the storage burden with the help of sparse computation. First, the dimensional expanding (DE) scheme is incorporated into PITD to address the matrix inversion problem due to external sources. Then, the dense matrix exponential is absorbed in sparse matrix-vector multiplications (SpMVs) without explicit evaluation. This SpMV-based technique involves only one sparse matrix and can utilize sparse computation efficiently, so as to greatly reduce memory costs ascribed to the matrix exponential. Moreover, the theoretical analysis of the algorithm performance is presented. The numerical results verify the validity and efficiency of the proposed method.