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.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Akritas, A.: Linear and quadratic complexity bounds on the values of the positive roots of polynomials. Univ. J. Comput. Sci. 15, 523–537 (2009)
Batra, P., Sharma, V.: Bounds of absolute positiveness of multivariate polynomials. J. Symb. Comput. 45, 617–628 (2010)
Hong, H.: Bounds for absolute positiveness of multivariate polynomials. J. Symb. Comp. 25, 571–585 (1998)
Kioustelidis, J.B.: Bounds for positive roots of polynomials. J. Comput. Appl. Math. 16, 241–244 (1986)
Mignotte, M., Ştefănescu, D.: On an estimation of polynomial roots by Lagrange. IRMA Strasbourg 025/2002, 1–17 (2002)
Ştefănescu, D.: New bounds for positive roots of polynomials. Univ. J. Comput. Sci. 11, 2125–2131 (2005)
Ş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)
Ştefănescu, D.: On some absolute positiveness bounds. Bull. Math. Soc. Sci. Math. Roumanie 53(101), 269–276 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights 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)