arrow
返回

Code verification for practically singular equations

delete2022-12-01
delete1
delete
OA
AI
B
Brian A. Freno *
N
Neil R. Matula
DOI:10.1016/j.jcp.2022.111581delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
The method-of-moments implementation of the electric-field integral equation (EFIE) yields many code-verification challenges due to the various sources of numerical error and their possible interactions [1,2]. Matters are further complicated by singular integrals, which arise from the presence of a Green's function. To address these singular integrals, an approach is presented in [1] wherein both the solution and Green's function are manufactured. Because the arising equations are poorly conditioned, they are reformulated as a set of constraints for an optimization problem that selects the solution closest to the manufactured solution. In this paper, we demonstrate how, for such practically singular systems of equations, computing the truncation error by inserting the exact solution into the discretized equations cannot detect certain orders of coding errors. On the other hand, the discretization error from the optimal solution [1] is a more sensitive metric that can detect orders less than those of the expected convergence rate.
Keyword:
Electric -field integral equation
Code verification
Manufactured solutions
Singular equations
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Journal of Computational Physics 封面图
Journal of Computational Physics
IF:
3.8
论文数:
1.6W
被引数:
8.9W

机构

U
united states department of energy (doe)
学者数:
11.3W
论文数: 9.6W
被引数: 17.6W
引用论文

引用论文

err分享
err收藏