Synthesis of unequally spaced arrays as inverse problem

It is shown that applying the inverse problem technique to the synthesis of nonequally spaced arrays results in a practical and rapidly convergent algorithm. The resulting position increments are small in terms of lambda . The final array geometry depends on the initial guess. Achievable reduction of the number of array elements without deterioration of the resulting radiation pattern is on the order of 15-20%.<>