• Corpus ID: 18139862

Computing the Supremum of the Real Roots of a Parametric Univariate Polynomial ( extended abstract )

  title={Computing the Supremum of the Real Roots of a Parametric Univariate Polynomial ( extended abstract )},
  author={Changbo Chen and Marc Moreno Maza and Yuzhen Xie},
Given a bivariate polynomial p(W,X) we aim at computing the supremum of the real values x such that there exists a real value w satisfying p(w, x) = 0. We allow the coefficients of p to depend on real parameters. Our approach relies on the notion of border polynomial and takes advantage of triangular decomposition techniques. We report on the implementation of our algorithm and illustrate its effectiveness with problems from the theory of robust control. 


On Solving Parametric Polynomial Systems
The properties and computation of the non-properness locus of the canonical projection restricted at a parametric regular chain or at its saturated ideal at the border polynomial and discriminant variety systems are investigated.
Computing with semi-algebraic sets represented by triangular decomposition
In order to optimize triangular decompositions of semi-algebraic systems and algorithms for computing them, a technique is proposed, that is called relaxation, which can simplify the decomposition process and reduce the number of redundant components in the output.
Parametric optimization in control using the sum of roots for parametric polynomial spectral factorization
An algebraic approach for parametric optimization which can be utilized for various problems in signal processing and control is proposed and solves parametric polynomial spectral factorization by means of the sum of roots and the theory of Gröbner basis.
A regularity result for the singular values of a transfer matrix and a quadratically convergent algorithm for computing its L/sub infinity /-norm
The ith singular value of a transfer matrix, sigma /sub i/(H(j omega )), need not be a differential function of omega at frequencies where its multiplicity is greater than one. However, near a local
Solving semi-algebraic systems with the RegularChains library in Maple
It is well known that multivariate nonlinear polynomial systems are genuinely harder to solve than linear systems. This is intrinsic, as the solutions display features that do not manifest themselves
Nonlinear parametric optimization using cylindrical algebraic decomposition
The method is based on cylindrical algebraic decomposition (CAD) and constructs the corresponding CAD offline, extracting in advance all the relevant structural information, and an online procedure uses the precomputed information to efficiently evaluate the optimal solution of the original optimization problem.
A symbolic-numeric approach to multi-parametric programming for control design
  • H. Anai
  • Computer Science
    2009 ICCAS-SICE
  • 2009
In this paper we propose a new method which enables us to obtain exact parametric solutions for multi-parametric programming problems, that is the optimal solutions as a function of the varying
Parametric optimization and optimal control using algebraic geometry methods
Two algebraic methods to solve the parametric optimization problem that arises in non-linear model predictive control by moving most of the computational burden associated with the optimization problem off-line, by pre-computing certain algebraic objects.
Fast Algorithms for Solving H-infinity-Norm Minimization Problems
An efficient computation approach to minimize the H-infinity-norm of a transfer-function matrix depending affinely on a set of free parameters is proposed and numerical results illustrate the superiority of proposed approach over LMIs based techniques in solving zero order H-Infinity- norm approximation problems.