A numerical synthesis algorithm for the synthesis of arbitrary discret
e arrays is given. The technique is based on the Olen and Compton algo
rithm, but employs a different iterative recursive algorithm yielding
an optimum convergence rate. It is shown that the new algorithm is abl
e to converge to the optimum solution in a significantly reduced numbe
r of iterations compared with the technique of Olen and Compton. Use o
f the technique is illustrated by applying the synthesis procedure to
a ten-element linear array and to a conformal array consisting of ten
dipoles located on a parabolic curve.