Parallel Branch and Bound Algorithm for Computing Maximal Structured Singular Value
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.