Linear programming for Bernstein based solvers

DOI10.1007/978-3-642-21046-4_8MaRDI QIDQ3003233zbMATH OpenOpenAlexFDO

Authors Dominique Michelucci, Christoph Fünfzig

Publication date 26 May 2011

Published in Automated Deduction in Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-21046-4_8

zbMATH Keywords

geometric constraint solvingsubdivision solverBernstein polytopetensorial Bernstein basis

Mathematics Subject Classification ID

Linear programming (90C05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Polytope-based computation of polynomial ranges
• Optimizations for tensorial Bernstein-Based solvers by using polyhedral bounds
• scientific article; zbMATH DE number 804609
• Matrix methods for the tensorial Bernstein form
• Bernstein form is inclusion monotone

Cited in

(2)

• Polytope-based computation of polynomial ranges
• Optimizations for tensorial Bernstein-Based solvers by using polyhedral bounds

This page was built for publication: Linear programming for Bernstein based solvers

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