arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2501.04684math.NAcs.NAphysics.comp-ph
收藏

一种新颖的高并行性基于机器学习的方法:用于电磁散射问题积分方程快速求解

A Novel Highly Parallelizable Machine-Learning Based Method for the Fast Solution of Integral Equations for Electromagnetic Scattering Problems

Bilkent University(比尔肯特大学);The Ohio State University(俄亥俄州立大学)

Enes Koç, Mert Kalfa, Secil E. Dogan, Vakur B. Ertürk

AI总结:

本文提出了一种基于机器学习的高并行性方法,用于高效准确求解电磁散射问题中的积分方程,避免低频崩溃问题。

摘要:

我们提出了一种新颖的方法,用于高效且准确地求解用于大/多尺度电磁散射问题的频域积分方程(IEs)。所提出的方法使用了一种新颖的分组交互策略,在每次迭代的矩阵向量乘法过程中,通过一种称为单箱缓冲方案的框架,准确地评估远区相互作用。简而言之,用于在每个箱中建模散射体的子域基函数由固定数量的均匀分布且任意取向的赫兹线圈(称为均匀基函数)表示,然后通过使用机器学习算法以分组方式进行预测线圈到线圈的相互作用,从而展示出效率、强并行化能力以及准确性,而无需出现低频崩溃(LFB)问题。由于线圈表示与散射体的底层材料属性无关,所提出的方法适用于所有类型的IE(表面或体积)。此外,由于训练是在离线进行的,因此所得到的网络可以用于任何散射体下的任何IE,无需额外训练,只要保持箱的大小以及箱之间的距离。所提出方法的效率和准确性通过将其结果与传统多级快速多极算法在各种散射问题中得到的结果进行比较来评估。所提出方法的并行化性能通过可扩展性测试来展示,其对LFB的鲁棒性也得到了验证。

英文摘要:

We propose a novel method for the efficient and accurate iterative solution of frequency domain integral equations (IEs) that are used for large/multi-scale electromagnetic scattering problems. The proposed method uses a novel group-by-group interaction strategy to accurately evaluate far-zone interactions within the framework of the one-box-buffer scheme during the matrix-vector multiplication at each iteration. Briefly, subdomain basis functions that are used to model the scatterer at each box are represented by a fixed number of uniformly distributed and arbitrarily oriented Hertzian dipoles (referred to as uniform basis functions), and then the dipole-to-dipole interactions are predicted in a group-wise manner by employing machine learning algorithms, thereby showcasing efficiency, strong scalability for parallelization and accuracy without the low-frequency breakdown (LFB) problem. Since the dipole representation is independent of the underlying material properties of the scatterer, the proposed method is valid for all types of IEs (surface or volume). Moreover, because the training is performed offline, the resulting networks can be used for any scatterer under any IE, without extra training, as long as the size of, and the distances among the boxes are preserved. The efficiency and accuracy of the proposed method are assessed by comparing our results with those obtained from the conventional multilevel fast multipole algorithm for various scattering problems. The proposed method's parallelization performance is showcased through scalability tests, and its resilience to LFB is demonstrated.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑