Parallel Branch and Bound Algorithm for Computing Maximal Structured Singular Value

arXiv0805.1669MaRDI QIDQ6209480FDOQ6209480

Authors: Xin-Jia Chen, Kemin Zhou 

Publication date: 12 May 2008

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 page was built for publication: Parallel Branch and Bound Algorithm for Computing Maximal Structured Singular Value

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6209480)