Comparison of different bounding sets of polynomial functions defined in a given domain

MaRDI QIDQ3097337zbMATH OpenFDO

Authors Gun Srijuntongsiri

Publication date 15 November 2011

zbMATH Keywords

bounding setsintersection problemspolynomial equationssubdivision

Mathematics Subject Classification ID

Computer-aided design (modeling of curves and surfaces) (65D17) Computer science aspects of computer-aided design (68U07)

Recommendations

• A Comparison of Methods for the Computation of Affine Lower Bound Functions for Polynomials
• Methods for bounding the range of a polynomial
• Improved subdivision scheme for the root computation of univariate polynomial equations
• scientific article; zbMATH DE number 2068058
• A new method of evaluating compact geometric bounds for use in subdivision algorithms

Cited in

(3)

• Invariant sets for polynomials
• Comparison of interval methods for plotting algebraic curves
• A Comparison of Methods for the Computation of Affine Lower Bound Functions for Polynomials

This page was built for publication: Comparison of different bounding sets of polynomial functions defined in a given domain

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