Skip to main content
Top

2021 | OriginalPaper | Chapter

18. Algorithmic Methods for Computing Bounds for Polynomial Roots

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

We present some basic results concerning the evaluation of the absolute values of roots of univariate polynomials with complex or real coefficients. There are discussed classical and modern algorithmic methods and their computational efficiency.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference P. Batra, M. Mignotte, D. Ştefănescu, Improvements of Lagrange’s bound for polynomial roots. J. Symb. Comp. 82, 19–25 (2017)MathSciNetCrossRef P. Batra, M. Mignotte, D. Ştefănescu, Improvements of Lagrange’s bound for polynomial roots. J. Symb. Comp. 82, 19–25 (2017)MathSciNetCrossRef
2.
go back to reference A.-L. Cauchy, Exercices de Mathématiques, t. 4, Paris (1829) A.-L. Cauchy, Exercices de Mathématiques, t. 4, Paris (1829)
3.
4.
go back to reference I.Z. Emiris, E.P. Tsigaridas, Univariate polynomial real root isolation: continued fractions revisited, in Algorithms ESA 2006, ed. by Y. Azar, T. Erlebach. LNCS, vol. 4168 (Springer, Berlin, Heidelberg, 2006) I.Z. Emiris, E.P. Tsigaridas, Univariate polynomial real root isolation: continued fractions revisited, in Algorithms ESA 2006, ed. by Y. Azar, T. Erlebach. LNCS, vol. 4168 (Springer, Berlin, Heidelberg, 2006)
5.
go back to reference M. Fujiwara, Über die obere Schranke des absoluten Betrages der Wurzeln einer algebraischen Gleichung. Tôhoku Math. J. 10, 167–171 (1916)MATH M. Fujiwara, Über die obere Schranke des absoluten Betrages der Wurzeln einer algebraischen Gleichung. Tôhoku Math. J. 10, 167–171 (1916)MATH
6.
go back to reference J. Herzberger, 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 Physics (Munich, 2000), Comput. Suppl. 16, Springer, Vienna (2003) J. Herzberger, 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 Physics (Munich, 2000), Comput. Suppl. 16, Springer, Vienna (2003)
7.
9.
go back to reference J.-L. Lagrange, Traité de la résolution des équations numériques (Paris, 1798). (Reprinted in Œuvres, t. VIII, Gauthier–Villars, Paris, 1879) J.-L. Lagrange, Traité de la résolution des équations numériques (Paris, 1798). (Reprinted in Œuvres, t. VIII, Gauthier–Villars, Paris, 1879)
10.
go back to reference M. Mignotte, D. Ştefănescu, Polynomials: An Algorithmic Approach (Springer, 1999) M. Mignotte, D. Ştefănescu, Polynomials: An Algorithmic Approach (Springer, 1999)
12.
go back to reference M. Mignotte, D. Ştefănescu, Linear recurrent sequences and polynomial roots. J. Symb. Comput. 35, 637–649 (2003)MathSciNetCrossRef M. Mignotte, D. Ştefănescu, Linear recurrent sequences and polynomial roots. J. Symb. Comput. 35, 637–649 (2003)MathSciNetCrossRef
13.
go back to reference D. Ştefănescu, New bounds for the positive roots of polynomials. J. Univ. Comput. Sci. 11, 2125–2131 (2005)MathSciNetMATH D. Ştefănescu, New bounds for the positive roots of polynomials. J. Univ. Comput. Sci. 11, 2125–2131 (2005)MathSciNetMATH
14.
go back to reference D. Ştefănescu, Inequalities on Upper Bounds for Real Polynomials Roots. LNCS, vol. 4194 (Springer, 2006), pp. 284–294 D. Ştefănescu, Inequalities on Upper Bounds for Real Polynomials Roots. LNCS, vol. 4194 (Springer, 2006), pp. 284–294
Metadata
Title
Algorithmic Methods for Computing Bounds for Polynomial Roots
Author
Doru Ştefănescu
Copyright Year
2021
DOI
https://doi.org/10.1007/978-3-030-41196-1_18

Premium Partners