Synthesis of Linear Discrete Acoustic Arrays

The synthesis of a linear array by a given directional pattern is considered under the only constraint that the number of array elements is specified. The formulation of the problem allows solving it with the help of the Newton method, which is the most efficient method of convex programming. It is shown that the possibility to vary the array element coordinates in the course of the array synthesis provides a much higher synthesis quality than that achieved with fixed-geometry arrays.