Abstract
An elementary proof of the Kharitonov theorem is presented. The proof is based on the concept of a Bezoutian matrix. Generally, exploiting the special structure of such matrices (e.g., Bezoutians, Toeplitz, Hankel or Vandermonde matrices, etc.) can be interesting, e.g., leading to unified approaches in different cases, as well as to further generalizations. Here the concept of the Bezoutian matrix is used to provide a unified derivation of the Kharitonov-like theorems for the continuous-time and discrete-time settings. Finally, the (block) Anderson-Jury Bezoutians are used to propose a possible technique to attack an difficult open problem related to the robust stability in the MIMO case.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 285-297 |
| Number of pages | 13 |
| Journal | Linear Algebra and Its Applications |
| Volume | 399 |
| Issue number | 1-3 |
| DOIs | |
| State | Published - Apr 1 2005 |
| Externally published | Yes |
| Event | International Meeting on Matrix Analysis and Applications - Ft. Lauderdale, Fl, United States Duration: Dec 14 2003 → Dec 16 2003 |
Keywords
- Bezoutian
- Kharitonov theorem
- Stability
ASJC Scopus subject areas
- Algebra and Number Theory
- Numerical Analysis
- Geometry and Topology
- Discrete Mathematics and Combinatorics
Fingerprint
Dive into the research topics of 'Kharitonov's theorem and Bezoutians'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS