Code Verification for Practically Singular Equations

DOI10.1016/J.JCP.2022.111581arXiv2204.01785MaRDI QIDQ6395669

Publication date: 4 April 2022

Abstract: 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. Matters are further complicated by singular integrals, which arise from the presence of a Green's function. To address these singular integrals, an approach was previously presented 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 is a more sensitive metric that can detect orders less than those of the expected convergence rate.

Mathematics Subject Classification ID

Numerical linear algebra (65Fxx) Basic methods for problems in optics and electromagnetic theory (78Mxx) General topics in optics and electromagnetic theory (78Axx)

This page was built for publication: Code Verification for Practically Singular Equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6395669)