OPTIMIZATIONS FOR TENSORIAL BERNSTEIN–BASED SOLVERS BY USING POLYHEDRAL BOUNDS

DOI10.1142/S0218654310001304zbMath1264.65073OpenAlexW2031092060MaRDI QIDQ4923349

Sebti Foufou, Dominique Michelucci, Christoph Fünfzig

Publication date: 6 June 2013

Published in: International Journal of Shape Modeling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218654310001304

zbMATH Keywords

linear programmingBernstein polynomialssimplex algorithmalgebraic systemssubdivision solver

Mathematics Subject Classification ID

Computational aspects of higher-dimensional varieties (14Q15) General methods in interval analysis (65G40) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)

Cites Work

• Unnamed Item
• Subdivision methods for solving polynomial equations
• Investigation of a subdivision based algorithm for solving systems of polynomial equations.
• Methods for bounding the range of a polynomial
• Interval approximation of higher order to the ranges of functions

This page was built for publication: OPTIMIZATIONS FOR TENSORIAL BERNSTEIN–BASED SOLVERS BY USING POLYHEDRAL BOUNDS