Subdivision methods for solving polynomial equations - Archive ouverte HAL Access content directly
Journal Articles Journal of Symbolic Computation Year : 2009

Subdivision methods for solving polynomial equations

(1) , (1)
1

Abstract

This paper presents a new algorithm for solving a system of polynomials, in a domain of $ ^n$. It can be seen as an improvement of the Interval Projected Polyhedron algorithm proposed by Sherbrooke and Patrikalakis . It uses a powerful reduction strategy based on univariate root finder using Bernstein basis representation and Descarte's rule. We analyse the behavior of the method, from a theoretical point of view, shows that for simple roots, it has a local quadratic convergence speed and gives new bounds for the complexity of approximating real roots in a box of $ ^n$. The improvement of our approach, compared with classical subdivision methods, is illustrated on geometric modeling applications such as computing intersection points of implicit curves, self-intersection points of rational curves, and on the classical parallel robot benchmark problem.
Fichier principal
Vignette du fichier
RR-5658.pdf (355.86 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00070350 , version 1 (19-05-2006)

Identifiers

  • HAL Id : inria-00070350 , version 1

Cite

Bernard Mourrain, Jean-Pascal Pavone. Subdivision methods for solving polynomial equations. Journal of Symbolic Computation, 2009, 44 (3), pp.292-306. ⟨inria-00070350⟩
236 View
1163 Download

Share

Gmail Facebook Twitter LinkedIn More