A gradient method for computing the optimal H/sub infinity / norm

A fast algorithm for computing the optimal H/sub infinity / norm is presented. The algorithm is based on certain explicit computations of gradients. Examples are given to show that the gradient method is much faster than the bisection method. The gradient method can be used without the upper and lower bound computations. This could be a substantial additional saving because computing these bounds requires the computation of the H/sub infinity / norm.<
>