Polytope-based computation of polynomial ranges

DOI10.1016/j.cagd.2011.09.001zbMath1244.65071OpenAlexW2002910417MaRDI QIDQ426184

Sebti Foufou, Dominique Michelucci, Christoph Fünfzig

Publication date: 11 June 2012

Published in: Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cagd.2011.09.001

zbMATH Keywords

linear programmingpolytopesnumerical examplesBernstein polynomialspolynomial systemsmultivariate polynomialsinterval Newton solverspolynomial ranges

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Linear programming (90C05) Interval and finite arithmetic (65G30) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Numerical computation of roots of polynomial equations (65H04) Solving polynomial systems; resultants (13P15)

Related Items

The Bernstein polynomial basis: a centennial retrospective

Uses Software

• IbexOpt

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast construction of constant bound functions for sparse polynomials
• Subdivision algorithms converge quadratically
• On the numerical condition of polynomials in Bernstein form
• Computation of the solutions of nonlinear polynomial systems
• Lower bound functions for polynomials
• Comparison of interval methods for plotting algebraic curves
• Finding all solutions of nonlinear equations using the dual simplex method
• Investigation of a subdivision based algorithm for solving systems of polynomial equations.
• On the stability of transformations between power and Bernstein polynomial forms
• How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds
• Introduction to Interval Analysis
• Computation complexity of the range of a polynomial in several variables