Robustness analysis of polynomials with polynomial parameter dependency using Bernstein expansion
Let the parameter set \(Q\) be an \(l\)-dimensional box \(Q = [\underline q_1,\overline q_1]\times\dots\times[\underline q_{ l}, \overline q_l],\) and let a family of polynomials be given by \[ p(s,\mathbf q) = a_0(\mathbf q)s^m +\dots +a_{m-1}(\mathbf q)s+ a_m(\mathbf q), \] \(\mathbf q = (q_1,\dots,q_l),\) where the coefficients \(a_k(\mathbf q)\) are depending polynomially on the parameters \(q_i\), \(a_k(\mathbf q)=\sum_{i_1,\dots,i_l=0}^da_{i_1\dots i_l}^{(k)}q_1^{i_1}\dots q_l^{i_l}.\) The robust stability problem is considered: Are the polynomials \(p(s,\mathbf q)\) robustly stable for all \(\mathbf q\in Q\)? Here stability is meant in the sense of Hurwitz or asymptotic stability. Two algorithms for checking robust stability are presented. The first one is based on the expansion of the Hurwitz determinant into Bernstein polynomials. This leads to a fast algorithm. The second one avoids the blowing up of the problem caused by using the Hurwitz determinant and profits from the convex hull property of the Bernstein expansion. The underlying idea of this algorithm is to watch for zero crossing over the imaginary axis by inspecting the so-called value set. Numerical results to real-world control problems are presented showing the efficiency of both algorithms.
- Efficient handling of universally quantified inequalities
- Fast construction of constant bound functions for sparse polynomials
- An efficient algorithm for range computation of polynomials using the Bernstein form
- Robust Schur stability of polynomials with polynomial parameter dependency
- Lower bound functions for polynomials
- Application of Bernstein expansion to the solution of control problems
- A flexible polynomial expansion method for response analysis with random parameters
- Stability and \(D\)-stability of the family of real polynomials
- Matrix methods for the tensorial Bernstein form
- An improved interval global optimization algorithm using higher-order inclusion function forms
- Guaranteed parameter set estimation for exponential sums: the three-terms case
- Generation of robust root loci for linear systems with parametric uncertainties in an ellipsoid
- scientific article; zbMATH DE number 4200109 (Why is no real title available?)
- Creating Transformations for Matrix Obfuscation
- scientific article; zbMATH DE number 4143309 (Why is no real title available?)
- scientific article; zbMATH DE number 18086 (Why is no real title available?)
- scientific article; zbMATH DE number 58443 (Why is no real title available?)
- The Bernstein polynomial basis: a centennial retrospective
- An improved Bernstein global optimization algorithm for MINLP problems with application in process industry
- scientific article; zbMATH DE number 804609 (Why is no real title available?)
- Solving Linear Systems with Polynomial Parameter Dependency with Application to the Verified Solution of Problems in Structural Mechanics
- Identification of multiple-input single-output Hammerstein models using Bézier curves and Bernstein polynomials
- The use of Routh array for testing the Hurwitz property of a segment of polynomials.
- On stability of parametrized families of polynomials and matrices
- Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm
- On different types of stability of linear polytopic systems
- On nonsingularity of a polytope of matrices
- Gauss-Lobatto to Bernstein polynomials transformation
- An algorithm for constrained global optimization of multivariate polynomials using the Bernstein form and John optimality conditions
This page was built for publication: Robustness analysis of polynomials with polynomial parameter dependency using Bernstein expansion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4396076)