A two-steps algorithm for approximating real roots of a polynomial in Bernstein basis

DOI10.1016/j.matcom.2007.08.016zbMath1135.65323OpenAlexW2044271352MaRDI QIDQ2479468

Ahmed Zidna, Dominique Michel

Publication date: 26 March 2008

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.matcom.2007.08.016

zbMATH Keywords

complexityglobal convergencenumerical examplesNewton methodBernstein basishigh degree polynomial equationsuccessive differentiationsurface/curve intersectiontwo-steps algorithm

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical computation of solutions to single equations (65H05) Real polynomials: location of zeros (26C10) Complexity and performance of numerical algorithms (65Y20)

Related Items

A general family of third order method for finding multiple roots ⋮ A New Approach Based on Interval Analysis and B-splines Properties for Solving Bivariate Nonlinear Equations Systems ⋮ Interval-Krawczyk Approach for Solving Nonlinear Equations Systems in B-spline Form ⋮ The Bernstein polynomial basis: a centennial retrospective

Uses Software

• MultRoot

Cites Work

• On the complexity of isolating real roots and computing with certainty the topological degree
• Algorithms for polynomials in Bernstein form
• Recursive de Casteljau bisection and rounding errors
• The evaluation of the zeros of ill-conditioned polynomials. I, II
• Calculation of Zeros of a Real Polynomial Through Factorization Using Euclid’s Algorithm
• Solving a Polynomial Equation: Some History and Recent Progress
• A Three-Stage Algorithm for Real Polynomials Using Quadratic Iteration
• A highly parallel algorithm for approximating all zeros of a polynomial with only real zeros