Characteristic polynomial assignment for plants with semialgebraic uncertainty: A robust diophantine equation approach

DOI10.1002/RNC.3238MaRDI QIDQ3458169zbMATH OpenOpenAlexFDO

Authors Dario Piga, V. Cerone, D. Regruto

Publication date 8 December 2015

Published in International Journal of Robust and Nonlinear Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/rnc.3238

zbMATH Keywords

robust characteristic polynomial assignmentrobust coprimenesssemialgebraic uncertaintysum-of-square decomposition

Mathematics Subject Classification ID

Higher degree equations; Fermat's equation (11D41) Semidefinite programming (90C22) Sensitivity (robustness) (93B35)

Recommendations

• An algorithm for robust pole assignment via polynomial approach
• scientific article; zbMATH DE number 1342069
• Robust pole assignment
• Analysis and design of robust controllers using the interval Diophantine equation
• Assigning invariant polynomials over polytopes

Cites work

• A fast technique for the generation of the spectral set of a polytope of polynomials
• An Algorithm for Checking Regularity of Interval Matrices
• Analysis and design of robust controllers using the interval Diophantine equation
• Checking robust nonsingularity is NP-hard
• Enforcing stability constraints in set-membership identification of linear dynamic systems
• Global optimization with polynomials and the problem of moments
• scientific article; zbMATH DE number 527343 (Why is no real title available?)
• scientific article; zbMATH DE number 3997615 (Why is no real title available?)
• Improved parameter bounds for set-membership EIV problems
• On the value of information in system identification-bounded noise case
• Robust pole assignment
• Robust pole assignment via reflection coefficients of polynomials
• Robust stability and performance with fixed-order controllers
• Semidefinite programming relaxations for semialgebraic problems
• Set-Membership Error-in-Variables Identification Through Convex Relaxation Techniques
• Several NP-hard problems arising in robust stability analysis
• Solving quadratic distance problems: an LMI-based approach
• Strong stabilization over polytopes
• Sufficient Conditions for Regularity and Singularity of Interval Matrices

This page was built for publication: Characteristic polynomial assignment for plants with semialgebraic uncertainty: A robust diophantine equation approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3458169)