Skip to main content
Springer Nature Link
Log in

Inequalities on Upper Bounds for Real Polynomial Roots

  • Conference paper
Computer Algebra in Scientific Computing (CASC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4194))

Included in the following conference series:

Abstract

In this paper we propose two methods for the computation of upper bounds of the real roots of univariate polynomials with real coefficients. Our results apply to polynomials having at least one negative coefficient. The upper bounds of the real roots are expressed as functions of the first positive coefficients and of the two largest absolute values of the negative ones.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Akritas, A.G., Strzeboński, A.W.: A comparative study of two real root isolation methods. Nonlin. Anal.: Modell. Control 10, 297–304 (2005)

    MATH  Google Scholar 

  2. Emiris, I.Z., Tsigaridas, E.P.: Univariate polynomial real root isolation: Continued fractions revisited (2006), http://arxiv.org/pdf/cs.SC/0604066

  3. Eve, J.: The evaluation of polynomials. Numer. Math. 6, 17–21 (1964)

    Article  MATH  MathSciNet  Google Scholar 

  4. Grinstein, L.S.: Upper limits to the real roots of polynomial equations. Amer. Math. Monthly 60, 608–615 (1953)

    Article  MATH  MathSciNet  Google Scholar 

  5. Herzberger, J.: Construction of bounds for the positive root of a general class of polynomials with applications. In: Inclusion Methods for Nonlinear Problems with Applications in Engineering, Economics and Physiscs (Munich, 2000). Comput. Suppl., vol. 16. Springer, Vienna (2003)

    Google Scholar 

  6. Kioustelidis, J.B.: Bounds for positive roots of polynomials. J. Comput. Appl. Math. 16, 241–244 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  7. Kjurkchiev, N.: Note on the estimation of the order of convergence of some iterative methods. BIT 32, 525–528 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  8. Mignotte, M., Ştefănescu, D.: Polynomials – An Algorithmic Approach. Springer, Heidelberg (1999)

    MATH  Google Scholar 

  9. Nuij, W.: A note on hyperbolic polynomials. Math. Scand. 23, 69–72 (1968)

    MATH  MathSciNet  Google Scholar 

  10. Rouiller, F., Zimmermann, P.: Efficient isolation of polynomials real roots. J. Comput. Appl. Math. 162, 33–50 (2004)

    Article  MathSciNet  Google Scholar 

  11. Ştefănescu, D.: New bounds for the positive roots of polynomials. J. Univ. Comp. Sc. 11, 2125–2131 (2005)

    MATH  Google Scholar 

  12. Yap, C.K.: Fundamental Problems of Algorithmic Algebra. Oxford University Press, Oxford (2000)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Bucharest, Romania

    Doru Ştefănescu

Authors
  1. Doru Ştefănescu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Informatics, Technische Universität München, Boltzmannstr. 3, 85748, Garching, Germany

    Victor G. Ganzha  & Ernst W. Mayr  & 

  2. Institute of Theoretical and Applied Mechanics, Russian Academy of Sciences, 630090, Novosibirsk, Russia

    Evgenii V. Vorozhtsov

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ştefănescu, D. (2006). Inequalities on Upper Bounds for Real Polynomial Roots. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds) Computer Algebra in Scientific Computing. CASC 2006. Lecture Notes in Computer Science, vol 4194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11870814_24

Download citation

  • DOI: https://doi.org/10.1007/11870814_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-45182-2

  • Online ISBN: 978-3-540-45195-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics