Parallel Branch and Bound Algorithm for Computing Maximal Structured Singular Value
arXiv:0805.1669
Abstract
In this paper, we have developed a parallel branch and bound algorithm which computes the maximal structured singular value without tightly bounding for each frequency and thus significantly reduce the computational complexity.
10 pages, 4 figures