Parallel Branch and Bound Algorithm for Computing Maximal Structured Singular Value

In this paper, we have developed a parallel branch and bound algorithm which computes the maximal structured singular value $mu$ without tightly bounding $mu$ for each frequency and thus significantly reduce the computational complexity.