Skip to main content
SpringerLink
Log in

Computing the real roots of a polynomial by the exclusion algorithm

  • Published:
Numerical Algorithms Aims and scope Submit manuscript

Abstract

We describe a new algorithm for localizing the real roots of a polynomialP(x). This algorithm determines intervals on whichP(x) does not possess any root. The remainder set contains the real roots ofP(x) and can be arbitrarily small.

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

Access this article

Log in via an institution

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. Coleman, Algorithme de Weyl pour le calcul simultané des racines d'un polynôme, preprint, rapport de recherche, LMCIMAG, Université Joseph Fourier, Grenoble (1990).

    Google Scholar 

  2. J. Davenport, Computer algebra for cylindrical algebraic decomposition, TRITA-NA-8511, Department of Numerical Analysis and Computer Science, Royal Institute of Technology, S-100 44 Stockholm, Sweden.

  3. J.P. Dedieu and J.C. Yakoubsohn, Localisation d'une variété algébrique réelle par l'algorithme d'exclusion, C. R. Acad. Sci. (Paris) 312 (1991) 1013–1016, and to appear in AAECC.

    Google Scholar 

  4. R. Garus and T. Kuppert, Computation of the smallest positive eigenvalue of a quadratic λ-matrix, Numer. Math. 57 (1990) 393–403.

    Google Scholar 

  5. P. Henrici,Applied and Computational Complex Analysis, vol. 1 (Wiley, New York, 1974).

    Google Scholar 

  6. P. Henrici and I. Gargantini, Uniformly convergent algorithms for the simultaneous approximation of all zeros of a polynomial, in:Constructive Aspects of the Fundamental Theorem of Algebra, eds. B. Dejon and P. Henrici (Wiley Interscience, 1969).

  7. A.S. Householder,The Numerical Treatment of a Single Nonlinear Equation (McGraw-Hill, New-York, 1970).

    Google Scholar 

  8. G. Laureano, H. Lombardi, T. Recio and M.F. Roy, Spécialisation de la suite de Sturm et sousrésultants, to appear in J. Symb. Comput.

  9. M. Marden, The geometry of the zeros of a polynomial in a complex variable, AMS (1949).

  10. M. Petković,Iterative Methods for Simultaneous Inclusion of Polynomial Zeros, Lectures Notes 1387 (Springer, 1989).

  11. F. Ronga, Connecting points in the complement of a smooth hypersurface of ℝn, Preprint, Université de Genève, Suisse (1989).

    Google Scholar 

  12. H. Weyl, Randbemerkungen zu Hauptproblemen der Mathematik, 2. Fundamentalsatz der Algebra und Grundlagen der Mathematik, Math. Z. 20 (1924) 131–150.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d'Analyse Numérique, Université Paul Sabatier, 118, route de Narbonne, 31062, Toulouse Cedex, France

    Jean-Pierre Dedieu & Jean-Claude Yakoubsohn

Authors
  1. Jean-Pierre Dedieu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jean-Claude Yakoubsohn
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by C. Brezinski

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dedieu, JP., Yakoubsohn, JC. Computing the real roots of a polynomial by the exclusion algorithm. Numer Algor 4, 1–24 (1993). https://doi.org/10.1007/BF02142738

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02142738

Keywords

Subject classification

Search

Navigation