The Rank One Mixed mu Problem and 'Kharitonov-Type' Analysis

Abstract

The general mixed mu problem has been shown to be NP hard, so that the exact solution of the general problem is computationally intractable, except for small problems. In this paper we consider not the general problem, but a particular special case of this problem, the rank one mixed mu problem. We show that for this case the mixed mu problem is equivalent to its upper bound (which is convex), and it can in fact be computed easily (and exactly). This special case is shown to be equivalent to the so called `affine parameter variation" problem (for a polynomial with perturbed coefficients) which has been examined in detail in the literature, and for which several celebrated "Kharitonov-type" results have been proven.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 30, 1993
Accession Number
ADA465118

Entities

People

  • Peter M. Young

Organizations

  • California Institute of Technology

Tags

Communities of Interest

  • Air Platforms
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Coefficients
  • Complex Variables
  • Computations
  • Eigenvalues
  • Eigenvectors
  • Electrical Engineering
  • Engineering
  • Numbers
  • Perturbations
  • Polynomials
  • Real Numbers
  • Real Variables
  • Sequences
  • Standards
  • Theorems
  • Uncertainty

Fields of Study

  • Mathematics

Readers

  • Analytical Mechanics
  • Operations Research