Parallel Branch and Bound Algorithm for Computing Maximal Structured Singular Value

Simple item page
dc.creatorChen, Xinjia
dc.creatorZhou, Kemin
dc.date2008-05-12
dc.date.accessioned2026-07-07T09:38:24Z
dc.date.available2026-07-07T09:38:24Z
dc.descriptionIn 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.
dc.description10 pages, 4 figures
dc.identifierhttps://arxiv.org/abs/0805.1669
dc.identifierhttp://arxiv.org/abs/0805.1669
dc.identifierpublished in IEE Proceedings--Control Theory and Applications, vol. 150, pp. 417-420, July 2003
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/160790
dc.subjectOptimization and Control
dc.subjectDynamical Systems
dc.titleParallel Branch and Bound Algorithm for Computing Maximal Structured Singular Value
dc.typetext

Files

Collections

arXiv