Continued fraction expansion of real roots of polynomial systems

Authors:
Angelos Mantzaflaris;Bernard Mourrain;Elias Tsigaridas
Affiliations:
INRIA, Sophia-Antipolis, France;INRIA, Sophia-Antipolis, France;INRIA, Sophia-Antipolis, France
Venue:
Proceedings of the 2009 conference on Symbolic numeric computation
Year:
2009

Citing 11
Cited 4

Computation of the solutions of nonlinear polynomial systems

Computer Aided Geometric Design
Fast algorithms for Taylor shifts and certain difference equations

ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Solving a Polynomial Equation: Some History and Recent Progress

SIAM Review
Fundamental problems of algorithmic algebra

Fundamental problems of algorithmic algebra
Geometric constraint solver using multivariate rational spline functions

Proceedings of the sixth ACM symposium on Solid modeling and applications
Univariate polynomials: nearly optimal algorithms for numerical factorization and root-finding

Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
Almost tight recursion tree bounds for the Descartes method

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Computing roots of polynomials by quadratic clipping

Computer Aided Geometric Design
On the complexity of real root isolation using continued fractions

Theoretical Computer Science
Complexity of real root isolation using continued fractions

Theoretical Computer Science
Subdivision methods for solving polynomial equations

Journal of Symbolic Computation

The DMM bound: multivariate (aggregate) separation bounds

Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers

Theoretical Computer Science
Deflation and certified isolation of singular zeros of polynomial systems

Proceedings of the 36th international symposium on Symbolic and algebraic computation
Global solutions of well-constrained transcendental systems using expression trees and a single solution test

Computer Aided Geometric Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new algorithm for isolating the real roots of a system of multivariate polynomials, given in the monomial basis. It is inspired by existing subdivision methods in the Bernstein basis; it can be seen as generalization of the univariate continued fraction algorithm or alternatively as a fully analog of Bernstein subdivision in the monomial basis. The representation of the subdivided domains is done through homographies, which allows us to use only integer arithmetic and to treat efficiently unbounded regions. We use univariate bounding functions, projection and preconditionning techniques to reduce the domain of search. The resulting boxes have optimized rational coordinates, corresponding to the first terms of the continued fraction expansion of the real roots. An extension of Vincent's theorem to multivariate polynomials is proved and used for the termination of the algorithm. New complexity bounds are provided for a simplified version of the algorithm. Examples computed with a preliminary C++ implementation illustrate the approach.