Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Comparison of Various Methods for Computing Bounds for Positive Roots of Polynomials
 

Summary: A Comparison of Various Methods for Computing Bounds
for Positive Roots of Polynomials
Alkiviadis G. Akritas
(University of Thessaly, Greece
akritas@uth.gr)
Panagiotis S. Vigklas
(University of Thessaly, Greece
pviglas@uth.gr)
Abstract: The recent interest in isolating real roots of polynomials has revived inter-
est in computing sharp upper bounds on the values of the positive roots of polynomials.
Until now Cauchy's method was the only one widely used in this process. Słtefanescu's
recently published theorem offers an alternative, but unfortunately is of limited appli-
cability as it works only when there is an even number of sign variations (or changes)
in the sequence of coefficients of the polynomial under consideration. In this paper
we present a more general theorem that works for any number of sign variations pro-
vided a certain condition is met. We compare the method derived from our theorem
with the corresponding methods by Cauchy and by Lagrange for computing bounds on
the positive roots of polynomials. From the experimental results we conclude that it
would be advantageous to extend our theorem so that it works without any restrictive
conditions1

  

Source: Akritas, Alkiviadis G. - Department of Computer and Communication Engineering, University of Thessaly

 

Collections: Computer Technologies and Information Sciences