Parallel Branch and Bound Algorithm for Computing Maximal Structured Singular Value
classification
🧮 math.OC
math.DS
keywords
algorithmboundbranchmaximalparallelsingularstructuredvalue
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.