Skip to main content
SpringerLink
Log in

Estimations of positive roots of polynomials

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

We obtain new estimates for positive roots of univariate polynomials. We discuss their efficiency and study their numerical and computational aspects. Bibliography: 12 titles.

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

Reference

  1. S. A. Abramov, Lectures on Complexity of Algorithms [in Russian], MCCME, Moscow (2008).

    Google Scholar 

  2. A. Akritas, “Linear and quadratic complexity bounds on the values of the positive roots of polynomials,” Univ. J. Comput. Sci., 15, 523–537 (2009).

    MathSciNet  Google Scholar 

  3. M. Fujiwara, “Über die obere Schranke des absoluten Betrages der Wurzeln einer algebraischen Gleichung,” Tôhoku Math. J., 10, 167–171 (1916).

    MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  5. T. Kojima, “On the limits of the roots of an algebraic equation,” Tôhoku Math. J., 11, 119–127 (1917).

    MATH  Google Scholar 

  6. J.-L. Lagrange, Traité de la résolution des équations numériques, Paris (1798). Reprinted in (Euvres, t. VIII, Gauthier-Villars, Paris (1879).

  7. M. Mignotte and D. Ştefănescu, “On an estimation of polynomial roots by Lagrange,” Technical Report 025/2002, IRMA, Strasbourg (2002).

  8. M. Mignotte and D. Ştefănescu, Polynomials: an Algorithmic Approach, Springer, Singapore (1999).

    MATH  Google Scholar 

  9. D. Şteănescu, “New bounds for positive roots of polynomials,” Univ. J. Comput. Sci., 11, 2125–2131 (2005).

    Google Scholar 

  10. D. Ştefănescu, “Computation of dominant real roots of polynomials,” Program. Comput. Softw.,34, 69–74 (2008).

    MATH  MathSciNet  Google Scholar 

  11. V. Sharma, “Complexity of real root isolation sing continued fractions,” Theoret. Comput. Sci., 409, 292–310 (2008).

    Article  MATH  MathSciNet  Google Scholar 

  12. E. Tsigaridas and I. Emiris, “On the complexity of real root isolation using continued fractions,” Theoret. Comput. Sci., 392, 158–173 (2008).

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Bucharest, Bucharest, Romania

    D. Ştefănesu

  2. Laboratory of Information Technologies, Joint Institute for Nuclear Research, Dubna, Russia

    V. Gerdt & S. Yevlakov

Authors
  1. D. Ştefănesu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. Gerdt
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. Yevlakov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to D. Ştefănesu.

Additional information

Published in Zapiski Nauchnykh Seminarov POMI, Vol. 373, 2009, pp. 280–289.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ştefănesu, D., Gerdt, V. & Yevlakov, S. Estimations of positive roots of polynomials. J Math Sci 168, 468–474 (2010). https://doi.org/10.1007/s10958-010-9998-6

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-010-9998-6

Keywords

Search

Navigation