Regularity Theory and Superalgebraic Solvers for Wire Antenna Problems

Abstract

We consider the problem of evaluating the current distribution $J(z)$ that is induced on a straight wire antenna by a time-harmonic incident electromagnetic field. The scope of this paper is twofold. One of its main contributions is a regularity proof for a straight wire occupying the interval $[-1,1]$. In particular, for a smooth time-harmonic incident field this theorem implies that $J(z) = I(z)/\sqrt{1-z^2}$, where $I(z)$ is an infinitely differentiable function—the previous state of the art in this regard placed $I$ in the Sobolev space $W^{1,p}$, $p>1$. The second focus of this work is on numerics: we present three superalgebraically convergent algorithms for the solution of wire problems, two based on Hallén's integral equation and one based on the Pocklington integrodifferential equation. Both our proof and our algorithms are based on two main elements: (1) a new decomposition of the kernel of the form $G(z) = F_1(z) \ln\! |z| + F_2(z)$, where $F_1(z)$ and $F_2(z)$ are analytic functions on the real line; and (2) removal of the end-point square root singularities by means of a coordinate transformation. The Hallén- and Pocklington-based algorithms we propose converge superalgebraically: faster than $\mathcal{O}(N^{-m})$ and $\mathcal{O}(M^{-m})$ for any positive integer $m$, where $N$ and $M$ are the numbers of unknowns and the number of integration points required for construction of the discretized operator, respectively. In previous studies, at most the leading-order contribution to the logarithmic singular term was extracted from the kernel and treated analytically, the higher-order singular derivatives were left untreated, and the resulting integration methods for the kernel exhibit $\mathcal{O}(M^{-3})$ convergence at best. A rather comprehensive set of tests we consider shows that, in many cases, to achieve a given accuracy, the numbers $N$ of unknowns required by our codes are up to a factor of five times smaller than those required by the best solvers previously available; the required number $M$ of integration points, in turn, can be several orders of magnitude smaller than those required in previous methods. In particular, four-digit solutions were found in computational times of the order of four seconds and, in most cases, of the order of a fraction of a second on a contemporary personal computer; much higher accuracies result in very small additional computing times.

Files

Additional details