.png){kind=icon}
返回
A compression scheme for domain decomposition method in solving electromagnetic problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jcp.2024.112824.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A compression framework is presented for improving the domain decomposition method (DDM) in solving Maxwell's equations. Because the DDM heavily relies on the numerical computation at the subdomain interfaces, the proposed approach focuses on effectively generating the boundary and port solutions of the subdomains. In each subdomain, the original building block is decomposed into a number of subblocks by the nested dissection method. The boundary matrices of the subblocks are compressed as hierarchical matrices and merged into larger ones with respect to the partition tree. Combining with the finite element tearing and interconnecting technique, the original DDM system can be transformed into an interface relation enabling fast matrix operations. Moreover, the memory consumption of DDM is also reduced as only the interface unknowns are kept in the solution process. The accuracy and efficiency of the proposed method are studied and compared with direct DDM method through several numerical examples.
Keyword:
Maxwell's equations
Finite element method
Domain decomposition method
Matrix compression
期刊
IF:
3.8
论文数:
1.6W
被引数:
7.4W
机构
引用论文
Theoretical study of one- and two-photon absorption properties of olefin-linked paracyclophane oligomers烯烃连接的对环芳低聚物的单光子与双光子吸收性质的理论研究
PREAI
分享收藏
分享收藏
Effect of Exercise Training on the Mental and Physical Well-Being of Caregivers for Persons Living With Chronic Illnesses: A Systematic Review and Meta-Analysis运动训练对慢性病患者照顾者身心健康的影响: 系统综述和荟萃分析
PREAI
分享收藏A sparse matrix arithmetic based on H-matrices.: Part I :: Introduction to H-matrices.png)
COMPUTING
COMPUTINGIF2.8
PREAI
分享收藏
查看更多内容