Tensor Train Acceleration of Method of Moments Solution of Volume Integral Equation on Structured and Unstructured Meshes

Z. Chen, S. Zheng, V. Okhmatovski
{"title":"Tensor Train Acceleration of Method of Moments Solution of Volume Integral Equation on Structured and Unstructured Meshes","authors":"Z. Chen, S. Zheng, V. Okhmatovski","doi":"10.1109/ICEAA.2019.8879398","DOIUrl":null,"url":null,"abstract":"Method of Moments (MoM) discretization of the Integral Equations (IEs) of electromagnetics results in dense matrix equation. Such matrix equations require prohibitively large computational resources when the number of basis functions used in discretization reaches hundreds of thousands and higher. Tensor Train (TT) decomposition of the MoM dense matrix equations has been recently proposed [1] to drastically reduce both the memory use for matrix storage and the CPU time required for its multiplication with a vector. Toeplitz matrix resulting from MoM discretization of Volume Integral Equation (VIE) can be represented as a multi-dimensional matrix and stored as a product of smaller dimensional matrices (tensors). Such product of smaller dimensional matrices, also known as the tensor train (TT), can reduce the matrix storage from O(N2) to O(logN) at low frequencies and O(NlogN) at high frequencies. The product of the matrix in the TT form with a vector can be computed in O(NlogN) operations. In order to accelerate MoM solution of practical scattering problems we recently developed Conjugate-Gradient-Tensor-Train (CG-TT) [2] and Precorrected-Tensor-Train (P-TT) [3] algorithms.","PeriodicalId":237030,"journal":{"name":"2019 International Conference on Electromagnetics in Advanced Applications (ICEAA)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Conference on Electromagnetics in Advanced Applications (ICEAA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEAA.2019.8879398","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Method of Moments (MoM) discretization of the Integral Equations (IEs) of electromagnetics results in dense matrix equation. Such matrix equations require prohibitively large computational resources when the number of basis functions used in discretization reaches hundreds of thousands and higher. Tensor Train (TT) decomposition of the MoM dense matrix equations has been recently proposed [1] to drastically reduce both the memory use for matrix storage and the CPU time required for its multiplication with a vector. Toeplitz matrix resulting from MoM discretization of Volume Integral Equation (VIE) can be represented as a multi-dimensional matrix and stored as a product of smaller dimensional matrices (tensors). Such product of smaller dimensional matrices, also known as the tensor train (TT), can reduce the matrix storage from O(N2) to O(logN) at low frequencies and O(NlogN) at high frequencies. The product of the matrix in the TT form with a vector can be computed in O(NlogN) operations. In order to accelerate MoM solution of practical scattering problems we recently developed Conjugate-Gradient-Tensor-Train (CG-TT) [2] and Precorrected-Tensor-Train (P-TT) [3] algorithms.
结构网格和非结构网格体积积分方程矩解法的张量列加速度
电磁学积分方程离散化的矩量法得到密集矩阵方程。当离散化中使用的基函数数量达到数十万甚至更高时,这种矩阵方程需要大量的计算资源。最近提出了对MoM密集矩阵方程的张量列(Tensor Train, TT)分解[1],以大幅减少矩阵存储的内存使用以及与向量相乘所需的CPU时间。由体积积分方程(VIE)的MoM离散化得到的Toeplitz矩阵可以表示为一个多维矩阵,并存储为小维矩阵(张量)的乘积。这种较小维度矩阵的乘积,也称为张量序列(TT),可以将矩阵存储从O(N2)减少到O(logN),在低频时减少到O(NlogN),在高频时减少到O(NlogN)。TT形式的矩阵与向量的乘积可以在O(NlogN)次运算中计算出来。为了加速实际散射问题的MoM求解,我们最近开发了共轭梯度张量训练(CG-TT)[2]和预校正张量训练(P-TT)[3]算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信