Parallel Branch and Bound Algorithm for Computing Maximal Structured Singular Value

TL;DR

This paper introduces a parallel branch and bound algorithm that efficiently computes the maximal structured singular value $ without tight bounds at each frequency, reducing computational complexity.

Contribution

The paper presents a novel parallel algorithm that improves the efficiency of computing the maximal structured singular value $ compared to existing methods.

Findings

Significant reduction in computational complexity.

Effective parallelization of the branch and bound process.

Successful computation of $ in complex systems.

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.