Title of article
Linear recurrent sequences and polynomial roots
Author/Authors
Maurice Mignotte، نويسنده , , Dorustef anescu، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
13
From page
637
To page
649
Abstract
We consider the problem of the determination of the largest modulus of a root of a complex polynomial P. We obtain lower and upper bounds using properties of appropriate linear recurrent sequences associated with P. This allows giving the absolute value of a dominant root as the limit as in Bernoulli’s process. We finally discuss a rule of Jacobi in his refinement of Bernoulli’s method. Relevant examples are obtained through pari and maple procedures.
Keywords
Linear recurrent sequences , Polynomial roots , Bernoulli’s method
Journal title
Journal of Symbolic Computation
Serial Year
2003
Journal title
Journal of Symbolic Computation
Record number
805703
Link To Document