Detecting rigid convexity of bivariate polynomials

DOI10.1016/J.LAA.2009.10.033zbMATH Open1183.65023OpenAlexW1982678715MaRDI QIDQ847211FDOQ847211

Authors Didier Henrion

Publication date 12 February 2010

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0801.3592

zbMATH Keywords

linear matrix inequalityreal algebraic geometrymultivariate polynomialssymbolic-numerical algorithmdetecting rigid convexity

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) Semidefinite programming (90C22) Miscellaneous inequalities involving matrices (15A45) Computational aspects of algebraic curves (14Q05) Real polynomials: location of zeros (26C10)

Abstract: Given a polynomial $xin{mathbbR}^{n}mapstop(x)$ in $n=2$ variables, a symbolic-numerical algorithm is first described for detecting whether the connected component of the plane sublevel set $mathcalP=x:p(x)geq0$ containing the origin is rigidly convex, or equivalently, whether it has a linear matrix inequality (LMI) representation, or equivalently, if polynomial $p(x)$ is hyperbolic with respect to the origin. The problem boils down to checking whether a univariate polynomial matrix is positive semidefinite, an optimization problem that can be solved with eigenvalue decomposition. When the variety $mathcalC=x:p(x)=0$ is an algebraic curve of genus zero, a second algorithm based on B'ezoutians is proposed to detect whether $mathcalP$ has an LMI representation and to build such a representation from a rational parametrization of $mathcalC$. Finally, some extensions to positive genus curves and to the case $n>2$ are mentioned.

Recommendations

• Obstructions to determinantal representability
• Computing linear matrix representations of Helton-Vinnikov curves
• LMI representations of the convex hulls of quadratic basic semialgebraic sets
• Noncommutative polynomials describing convex sets
• Matrix inequalities: A symbolic procedure to determine convexity automatically

Cites work

• scientific article; zbMATH DE number 4002266 (Why is no real title available?)
• scientific article; zbMATH DE number 4063264 (Why is no real title available?)
• scientific article; zbMATH DE number 3745549 (Why is no real title available?)
• scientific article; zbMATH DE number 3756646 (Why is no real title available?)
• scientific article; zbMATH DE number 108068 (Why is no real title available?)
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• scientific article; zbMATH DE number 194976 (Why is no real title available?)
• scientific article; zbMATH DE number 3416012 (Why is no real title available?)
• scientific article; zbMATH DE number 3028733 (Why is no real title available?)
• scientific article; zbMATH DE number 3031899 (Why is no real title available?)
• A Toeplitz algorithm for polynomial \(J\)-spectral factorization
• Algorithms in real algebraic geometry
• Automatic parameterization of rational curves and surfaces. III: Algebraic plane curves
• Computing Riemann matrices of algebraic curves
• Computing the Abel map
• Convex sets with semidefinite representation
• Determinantal hypersurfaces.
• Determinantal representations of smooth cubic surfaces
• Efficient algorithm for matrix spectral factorization
• How bad are Hankel matrices?
• Hyperbolic programs, and their derivative relaxations
• Introduction to the solution of polynomial systems
• Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
• Linear matrix inequality representation of sets
• Linear symmetric determinantal hypersurfaces
• New algorithms for polynomial \(J\)-spectral factorization
• Noncommutative convexity arises from linear matrix inequalities
• On polynomial matrix spectral factorization by symmetric extraction
• On the discriminant function of two commuting nonselfadjoint operators
• Optimization Problems over Positive Pseudopolynomial Matrices
• Polynomial J-spectral factorization
• Positive trigonometric polynomials and signal processing applications
• Positivity and linear matrix inequalities
• Rational parametrizations of algebraic curves using a canonical divisor
• Self-adjoint determinantal representations of real plane curves
• Sufficient and necessary conditions for semidefinite representability of convex hulls and sets
• Symbolic parametrization of curves
• The Lax conjecture is true
• The condition number of real Vandermonde, Krylov and positive definite Hankel matrices

Cited in

(15)

• Testing hyperbolicity of real polynomials
• LMI representations of convex semialgebraic sets and determinantal representations of algebraic hypersurfaces: past, present, and future
• Determinantal representations and the Hermite matrix
• Definite determinantal representations of multivariate polynomials
• Determinantal representations of closed orbits
• Definite determinantal representations via orthostochastic matrices
• Determinantal representation of trigonometric polynomial curves via Sylvester method
• Reduction of the \(c\)-numerical range to the classical numerical range
• Real stability testing
• Quartic curves and their bitangents
• Construction of determinantal representation of trigonometric polynomials
• Stable and real-zero polynomials in two variables
• Symmetric determinantal representation of polynomials
• Reduction of joint \(c\)-numerical ranges
• Determinantal representations of hyperbolic forms via weighted shift matrices

Describes a project that uses

Uses Software

• LFR-toolbox
• MULTIRES
• PolyX

This page was built for publication: Detecting rigid convexity of bivariate polynomials

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