A note on zeros of univariate scalar Bernstein polynomials

DOI10.1016/J.CAGD.2018.09.001zbMATH Open1505.65197OpenAlexW2891649943MaRDI QIDQ668994FDOQ668994

Authors: Jinesh Machchhar, Gershon Elber 

Publication date: 20 March 2019

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

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

Recommendations

• Revisiting the problem of zeros of univariate scalar Béziers
• A two-steps algorithm for approximating real roots of a polynomial in Bernstein basis
• Division algorithms for Bernstein polynomials
• Publication:4888221
• Subdivision methods for solving polynomial equations

zbMATH Keywords

Bernstein polynomialspolynomial rootszero-setBernstein basispolynomial division

Mathematics Subject Classification ID

Numerical computation of roots of polynomial equations (65H04)

Cites Work

• Algorithms for polynomials in Bernstein form
• Loop detection in surface patch intersections
• Revisiting the problem of zeros of univariate scalar Béziers

Cited In (4)

• Revisiting the problem of zeros of univariate scalar Béziers
• Heterogeneous parametric trivariate fillets
• Scaled generalized Bernstein polynomials and containment regions for the zeros of polynomials
• Improved subdivision scheme for the root computation of univariate polynomial equations

Uses Software

• IRIT

This page was built for publication: A note on zeros of univariate scalar Bernstein polynomials

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