Fast algorithm for optimal weight computation in linear array pattern synthesis having null constraints

A fast algorithm is given for computing the optimal weight vector in antenna array pattern synthesis having a set of null constraints. The algorithm requires only a UDUT decomposition of an m + 1 ¿¿ m + 1 real positive definite matrix and the computation of the first row of the inverse of a triangular matrix of the same dimension, where m is the number of null constraints.