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

zbMATH Open1240.68443MaRDI QIDQ3097337FDOQ3097337

Authors: Gun Srijuntongsiri 

Publication date: 15 November 2011

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

zbMATH Keywords

subdivisionpolynomial equationsintersection problemsbounding sets

Mathematics Subject Classification ID

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

Cited In (2)

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

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)