Improved subdivision scheme for the root computation of univariate polynomial equations

DOI10.1016/J.AMC.2013.01.032MaRDI QIDQ2451335zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 3 June 2014

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2013.01.032

zbMATH Keywords

Bernstein basispolygonal boundroot computationsubdivisionunivariate polynomial equation

Mathematics Subject Classification ID

Numerical computation of roots of polynomial equations (65H04)

Recommendations

• Subdivision methods for solving polynomial equations
• Revisiting the problem of zeros of univariate scalar Béziers
• An adaptive subdivision method for root finding of univariate polynomials
• A note on zeros of univariate scalar Bernstein polynomials
• A fast and robust method for computing real roots of nonlinear equations

Cites work

• A reliable algorithm for computing the topological degree of a mapping in \(\mathbb R^{2}\)
• A simplification of Stenger's topological degree formula
• An efficient algorithm for determining the convex hull of a finite planar set
• An efficient degree-computation method for a generalized method of bisection
• An Optimal Complexity Algorithm for Computing the Topological Degree in Two Dimensions
• Computation of the solutions of nonlinear polynomial systems
• Computing roots of polynomials by quadratic clipping
• Computing the topological degree of a mapping in \(R^n\)
• Curve intersection using Bézier clipping
• scientific article; zbMATH DE number 1716506 (Why is no real title available?)
• scientific article; zbMATH DE number 491264 (Why is no real title available?)
• On the stability of transformations between power and Bernstein polynomial forms
• RESOLUTION OF MULTIPLE ROOTS OF NONLINEAR POLYNOMIAL SYSTEMS
• Sharp bounds on the approximation of a Bézier polynomial by its quasi-control polygon
• Sharp, quantitative bounds on the distance between a polynomial piece and its Bézier control polygon
• Subdivision methods for solving polynomial equations
• The Euclidean Algorithm and the Degree of the Gauss Map

Cited in

(6)

• Subdivision methods for solving polynomial equations
• Revisiting the problem of zeros of univariate scalar Béziers
• An adaptive subdivision method for root finding of univariate polynomials
• Faster numerical univariate polynomial root-finding by means of subdivision iterations
• Near optimal subdivision algorithms for real root isolation
• Comparison of different bounding sets of polynomial functions defined in a given domain

This page was built for publication: Improved subdivision scheme for the root computation of univariate polynomial equations

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