B. L. G. Jonsson

Yevhen Ivanenko, Mats Gustafsson, B. L. G. Jonsson et al.

A passive approximation problem is formulated where the target function is an arbitrary complex valued continuous function defined on an approximation domain consisting of a finite union of closed and bounded intervals on the real axis. The norm used is a weighted $\text{L}^p$-norm where $1\leq p\leq\infty$. The approximating functions are Herglotz functions generated by a measure with Hölder continuous density in an arbitrary neighborhood of the approximation domain. Hence, the imaginary and the real parts of the approximating functions are Hölder continuous functions given by the density of the measure and its Hilbert transform, respectively. In practice, it is useful to employ finite B-spline expansions to represent the generating measure. The corresponding approximation problem can then be posed as a finite-dimensional convex optimization problem which is amenable for numerical solution. A constructive proof is given here showing that the convex cone of approximating functions generated by finite uniform B-spline expansions of fixed arbitrary order (linear, quadratic, cubic, etc) is dense in the convex cone of Herglotz functions which are locally Hölder continuous in a neighborhood of the approximation domain, as mentioned above. As an illustration, a typical physical application example is included regarding the passive approximation and optimization of a linear system having metamaterial characteristics.

B. L. G. Jonsson, Shuai Shi, Lei Wang et al.

This paper revisit and extend the interesting case of bounds on the Q-factor for a given directivity for a small antenna of arbitrary shape. A higher directivity in a small antenna is closely connected with a narrow impedance bandwidth. The relation between bandwidth and a desired directivity is still not fully understood, not even for small antennas. Initial investigations in this direction has related the radius of a circumscribing sphere to the directivity, and bounds on the Q-factor has also been derived for a partial directivity in a given direction. In this paper we derive lower bounds on the Q-factor for a total desired directivity for an arbitrarily shaped antenna in a given direction as a convex problem using semi-definite relaxation techniques (SDR). We also show that the relaxed solution is also a solution of the original problem of determining the lower Q-factor bound for a total desired directivity. SDR can also be used to relax a class of other interesting non-convex constraints in antenna optimization such as tuning, losses, front-to-back ratio. We compare two different new methods to determine the lowest Q-factor for arbitrary shaped antennas for a given total directivity. We also compare our results with full EM-simulations of a parasitic element antenna with high directivity.