大电场电磁散射问题存储高效解的CBFM约简矩阵稀疏化

I. Fenni, Z. Haddad, H. Roussel, R. Mittra
{"title":"大电场电磁散射问题存储高效解的CBFM约简矩阵稀疏化","authors":"I. Fenni, Z. Haddad, H. Roussel, R. Mittra","doi":"10.1109/USNC-URSI.2018.8602608","DOIUrl":null,"url":null,"abstract":"In this paper a sparsification approach is applied to the compressed matrix resulting from the Characteristic Basis Function Method (CBFM) process in order to significantly reduce the memory cost of this direct solver-based largely used numerical technique. Many efforts have been made in recent years to efficiently calculate this matrix but, all of them have focused on the time cost and have not dealt with the memory resources needed to store it. With the proposed sparsification approach, the present work aims to reduce the computational cost associated to the compressed matrix both in terms of CPU time and memory consumption.","PeriodicalId":203781,"journal":{"name":"2018 USNC-URSI Radio Science Meeting (Joint with AP-S Symposium)","volume":"14 3","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Sparsification of the Reduced Matrix of the CBFM for a Memory Efficient Solution of Electrically Large EM Scattering Problems\",\"authors\":\"I. Fenni, Z. Haddad, H. Roussel, R. Mittra\",\"doi\":\"10.1109/USNC-URSI.2018.8602608\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper a sparsification approach is applied to the compressed matrix resulting from the Characteristic Basis Function Method (CBFM) process in order to significantly reduce the memory cost of this direct solver-based largely used numerical technique. Many efforts have been made in recent years to efficiently calculate this matrix but, all of them have focused on the time cost and have not dealt with the memory resources needed to store it. With the proposed sparsification approach, the present work aims to reduce the computational cost associated to the compressed matrix both in terms of CPU time and memory consumption.\",\"PeriodicalId\":203781,\"journal\":{\"name\":\"2018 USNC-URSI Radio Science Meeting (Joint with AP-S Symposium)\",\"volume\":\"14 3\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 USNC-URSI Radio Science Meeting (Joint with AP-S Symposium)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/USNC-URSI.2018.8602608\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 USNC-URSI Radio Science Meeting (Joint with AP-S Symposium)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/USNC-URSI.2018.8602608","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文对特征基函数法(CBFM)过程产生的压缩矩阵采用稀疏化方法,以显著降低这种基于直接求解器的广泛使用的数值技术的存储开销。近年来,人们已经做了很多努力来有效地计算这个矩阵,但是,所有这些努力都集中在时间成本上,而没有处理存储它所需的内存资源。通过提出的稀疏化方法,本研究旨在降低与压缩矩阵相关的计算成本,包括CPU时间和内存消耗。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Sparsification of the Reduced Matrix of the CBFM for a Memory Efficient Solution of Electrically Large EM Scattering Problems
In this paper a sparsification approach is applied to the compressed matrix resulting from the Characteristic Basis Function Method (CBFM) process in order to significantly reduce the memory cost of this direct solver-based largely used numerical technique. Many efforts have been made in recent years to efficiently calculate this matrix but, all of them have focused on the time cost and have not dealt with the memory resources needed to store it. With the proposed sparsification approach, the present work aims to reduce the computational cost associated to the compressed matrix both in terms of CPU time and memory consumption.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信