Skip to main content
SpringerLink
Log in

A New Polynomial Bound and Its Efficiency

  • Conference paper
  • First Online:
Computer Algebra in Scientific Computing (CASC 2015)

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

Included in the following conference series:

Abstract

We propose a new bound for absolute positiveness of univariate polynomials with real coefficients. We discuss its efficiency with respect to known such bounds and compare it with the threshold of absolute positiveness.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Google Scholar 

  2. Batra, P., Sharma, V.: Bounds of absolute positiveness of multivariate polynomials. J. Symb. Comput. 45, 617–628 (2010)

    Google Scholar 

  3. Hong, H.: Bounds for absolute positiveness of multivariate polynomials. J. Symb. Comp. 25, 571–585 (1998)

    Google Scholar 

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

    Google Scholar 

  5. Mignotte, M., Ştefănescu, D.: On an estimation of polynomial roots by Lagrange. IRMA Strasbourg 025/2002, 1–17 (2002)

    Google Scholar 

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

    Google Scholar 

  7. Ştefănescu, D.: Bounds for real roots and applications to orthogonal polynomials. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2007. LNCS, vol. 4770, pp. 377–391. Springer, Heidelberg (2007)

    Google Scholar 

  8. Ştefănescu, D.: On some absolute positiveness bounds. Bull. Math. Soc. Sci. Math. Roumanie 53(101), 269–276 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Bucharest, Bucharest, Romania

    Doru Ştefănescu

Authors
  1. Doru Ştefănescu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Doru Ştefănescu .

Editor information

Editors and Affiliations

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

    Vladimir P. Gerdt

  2. Institute for Mathematics, Universität Kassel, Kassel, Germany

    Wolfram Koepf

  3. Institut für Mathematik, Universität Kassel, Kassel, Hessen, Germany

    Werner M. Seiler

  4. Novosibirsk, Russia

    Evgenii V. Vorozhtsov

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Ştefănescu, D. (2015). A New Polynomial Bound and Its Efficiency. In: Gerdt, V., Koepf, W., Seiler, W., Vorozhtsov, E. (eds) Computer Algebra in Scientific Computing. CASC 2015. Lecture Notes in Computer Science(), vol 9301. Springer, Cham. https://doi.org/10.1007/978-3-319-24021-3_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-24021-3_33

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-24020-6

  • Online ISBN: 978-3-319-24021-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation