Skip to main content
Log in

Real Solving of Elementary-Algebraic Systems

  • Published:
Numerical Algorithms Aims and scope Submit manuscript

Abstract

In this paper we present a new method for enclosing all the real roots in a bounded box of a system of n elementary-algebraic equations depending on n variables. This system is denoted by h(x)=P(x,f 1(x 1),...,f k (x 1),f 1(x 2),...,f k (x n )), where x=(x 1,x 2,...,x n ) ∈ R n, P is a system of polynomials depending on n+kn variables and the univariate functions f i are “simple”. This method arises from the exclusion method of Dedieu and Yakoubsohn. We provide both a theoretical complexity bound and some numerical experiments.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. Benedetti and J.J. Risler, Real Algebraic and Semi-algebraic Sets (Hermann, Paris, 1990).

    Google Scholar 

  2. J.P. Dedieu and J.C. Yakoubsohn, Computing the real roots of a polynomial by the exclusion algorithm, Numer. Algorithms 4 (1993) 1–24.

    Google Scholar 

  3. J.P. Dedieu, X. Gourdon and J.C. Yakoubsohn, Computing the distance from a point to an algebraic hypersurface.

  4. O. Didrit, Analyse par intervalles pour l'automatique: Résolution globale et garantie de problèmes non linéaires en robotique et en commande robuste, Thèse de l'Université de Paris-Sud (1997).

  5. G.H. Gonnet and A. Bonadio, Partial inverse heuristic for the approximate solution of non-linear equations.

  6. A.G. Khovanskii, Fewnomials (Amer. Math. Soc., Providence, RI, 1991).

    Google Scholar 

  7. A. Maignan, Solving one-and two-dimensional exponential polynomial systems, in: ISSAC '98 (ACM Press, 1998) pp. 215–221.

  8. A. Maignan, Symbolic-numeric sinus-polynomial equations real solving, J. Complexity 16 (2000) 274–285.

    Google Scholar 

  9. A. Maignan, Résolution réelle d'équations et de systèmes d'équations algébro-élémentaires, Thesis of the University of Limoges (2000).

  10. D. Richardson, Finding roots of equations involving functions defined by first order algebraic differential equations, in: EffectiveMethods in Algebraic Geometry, eds. T. Mora and C. Traverso (Birkhäuser, Basel, 1991) pp. 427–440.

    Google Scholar 

  11. D. Richardson, Does a trigonometric curve cross an algebraic surface?, in: Eurographics Workshop, Santa Margherita, October 1991, to be published by Springer.

  12. D. Richardson, Towards computing non-algebraic cylindrical decompositions, in: ISSAC '91, pp. 247–255.

  13. D. Richardson, Computing the topology of a bounded non-algebraic curve in the plane, J. Symbolic Comput. 14 (1992) 629–643.

    Google Scholar 

  14. K. Roach, Symbolic-numeric nonlinear equation solving, in: ISSAC '94, pp. 278–284.

  15. J.C. Yakoubsohn, Approximating the zeros of analytic functions by the exclusion algorithm, Numer. Algorithms 6 (1994) 63–86.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Maignan, A. Real Solving of Elementary-Algebraic Systems. Numerical Algorithms 27, 153–167 (2001). https://doi.org/10.1023/A:1011881613933

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1011881613933

Navigation