A Storage Optimization Scheme for PITD Method Using Sparse Matrix-Vector Multiplication

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.

Authors

Institutions

Publication Details

Journal
IEEE Microwave and Wireless Technology Letters
Published
2024-12-24
DOI
https://doi.org/10.1109/lmwt.2024.3516877
Citations
1
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.36

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Storage Optimization Scheme for PITD Method Using Sparse Matrix-Vector Multiplication

Liang Ma, Xiaojie Zhu, Ru Xiang, Mingjun Chi et al.
1 citations
IEEE Microwave and Wireless Technology Letters
Matrix Theory and Algorithms
0.36
article

A Storage Optimization Scheme for PITD Method Using Sparse Matrix-Vector Multiplication

Liang Ma, Xiaojie Zhu, Ru Xiang, Mingjun Chi, Xikui Ma
article en
1 citations

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.

IEEE Microwave and Wireless Technology LettersVol. 35(2)
State Key Laboratory of Electrical Insulation and Power Equipment, Xi'an Jiaotong University (CN), Politecnico di Milano (IT)
National Natural Science Foundation of China
Openalex Percentile: Top 33%
Matrix Theory and Algorithms
0.36
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A Storage Optimization Scheme for PITD Method Using Sparse Matrix-Vector Multiplication — Liang Ma, Xiaojie Zhu, et al. · IEEE Microwave and Wireless Technology Letters (2024) | TGRS Research Map | TGRS