Parallel Branch and Bound Algorithm for Computing Maximal Structured Singular Value

Details Parallel Branch and Bound Algorithm for Computing Maximal Structured Singular Value Parallel Branch and Bound Algorithm for Computing Maximal Structured Singular Value

2008-05-12

arxiv.org/abs/0805.1669v1

published in IEE Proceedings--Control Theory and Applications, vol. 150, pp. 417-420, July 2003

Mathematics

Optimization and Control

10 pages, 4 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Parallel Branch and Bound Algorithm for Computing Maximal Structured Singular Value does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Parallel Branch and Bound Algorithm for Computing Maximal Structured Singular Value, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parallel Branch and Bound Algorithm for Computing Maximal Structured Singular Value will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-325889