Loading...
Please wait, while we are loading the content...
Similar Documents
Speeding Up An Algorithm For Checking Robust Stability Of Polynomials (1998)
| Content Provider | CiteSeerX |
|---|---|
| Author | Garloff, Jürgen Graf, Birgit Zettler, Michael Konstanz, Fachhochschule |
| Description | : The paper considers the robust stability verification of polynomials with polynomial parameter dependency. A new algorithm is presented which relies on the expansion of a multivariate polynomial into Bernstein polynomials and is based on the inspection of the value set of the family of polynomials on the imaginary axis. It is shown how an initial interval on the imaginary axis through which zero crossing of members of the family is only possible is Obtained by applying known bounds for the positive zeros of a polynomial. This interval can be improved by using again Bernstein expansion, thereby speeding up the algorithm considerably. Keywords: Robust stability, nonlinear parameter variation, value set analysis, bounding method, zero set 1. INTRODUCTION In the past, robustness analysis of polynomials in the presence of parametric uncertainties has focused on the case of affine and multiaffine parameter dependency, see, e.g. (Ackermann, 1993; Barmish, 1994), and the reference... |
| File Format | |
| Language | English |
| Publisher | Elsevier Sci |
| Publisher Date | 1998-01-01 |
| Publisher Institution | In: Robust Control Design, Cs. B'any'asz |
| Access Restriction | Open |
| Subject Keyword | Value Set Bernstein Expansion Robust Stability Verification Checking Robust Stability Parametric Uncertainty New Algorithm Imaginary Axis Robust Stability Polynomial Parameter Dependency Positive Zero Nonlinear Parameter Variation Multiaffine Parameter Dependency Multivariate Polynomial Bernstein Polynomial Initial Interval Robustness Analysis |
| Content Type | Text |
| Resource Type | Article |