Parallel branch and bound algorithm for computing maximal structured singular value

In the paper, a parallel branch and bound algorithm has been developed, which computes the maximal structured singular value (mu) without tightly bounding (mu) for each frequency, and thus significantly reducing the computational complexity.