Robustness analysis of polynomials with polynomial parameter dependency using Bernstein expansion
From MaRDI portal
Recommendations
Cited in
(29)- 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)