Parallel Branch and Bound Algorithm for Computing Maximal Structured Singular Value

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
10 pages, 4 figures

Keywords

Optimization and Control, Dynamical Systems

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/160790

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0805.1669
 http://arxiv.org/abs/0805.1669
 published in IEE Proceedings--Control Theory and Applications, vol. 150, pp. 417-420, July 2003

Collections

arXiv