Gain-Based Lower Bound for MU
Pete Seiler, Gary Balas and Andrew Packard

Collection of examples which compare the standard power iteration (SPI) to the gain-based lower bound (GBLB) for computation of lower bounds of the structured singular value (mu). All examples involve complex matrices. In most (but not all) cases, the GBLB yields better lower bounds than SPI, at the expense of longer computation times. A partial description of GBLB can be found in: Pete Seiler, Gary Balas and Andrew Packard, "A Gain-based lower bound algorithm for real and mixed mu problems," 2006 IEEE Conference on Decision and Control, pp. 3548-3553, December 2006.

M-file examples:

• DeGastonSafonov_SISOEx (1988 IEEE TAC)
• AckermannSienel_BusEx (1990 ACC)
• Dailey_RealMuEx (1990 ACC)
• AckermannSienel_MassSpringDamperEx (1990 CDC)
• Wise_MissileEx (1992 AIAA)
• Young_MixedMuEx (1993 PhD thesis)
• ChengDeMoor_HydraulicSys (1994 IEEE TCST)
• ElgersmaEtAl_RealMuEx (1996 IJNLRC, 1992 CDC)
• SafariShadEtAl_EngineEx (1997 IEEE TCST)
• Vadigepalli_FourTankEx (2001 Indu. Eng. Chem Research)
• Gu_DiskDriveEx (2005 Springer textbook)
• SeilerEtAl_FlightControlEx (2006 CDC)