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

Ahmed Zidna and Dominique Michel

Mathematics and Computers in Simulation (MATCOM), 2008, vol. 77, issue 2, 313-323

Abstract: The surface/curve intersection problem, through the resultants process results in a high degree (n≥100) polynomial equation on [0,1] in the Bernstein basis. The knowledge of multiplicities of the roots is critical for the topological coherence of the results. In this aim, we propose an original two-steps algorithm based on successive differentiations which separates any root (even multiple) and guarantees that the assumptions of Newton global convergence theorem are satisfied. The complexity is ϑ(n4) but the algorithm can easily be parallelized. Experimental results show its efficiency when facing ill-conditioned polynomials.

Keywords: Successive differentiation; Bernstein basis (search for similar items in EconPapers)
Date: 2008
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475407002479
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:77:y:2008:i:2:p:313-323

DOI: 10.1016/j.matcom.2007.08.016

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().