Linear recurrent sequences and polynomial roots (Q1394940): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / reviewed by
 
Property / reviewed by: Edward J. Barbeau / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Edward J. Barbeau / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3241280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding the largest root of a polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5528098 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton's Identities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimates for polynomial roots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4248250 / rank
 
Normal rank

Latest revision as of 18:00, 5 June 2024

scientific article
Language Label Description Also known as
English
Linear recurrent sequences and polynomial roots
scientific article

    Statements

    Linear recurrent sequences and polynomial roots (English)
    0 references
    0 references
    0 references
    25 June 2003
    0 references
    The authors obtain bounds on the roots (possibly several) of the largest absolute value of a complex polynomial by using recurrent sequences for which it is the characteristic polynomial. They conclude with a discussion of the effectiveness of a rule given in 1884 by Jacobi, in which he introduces the polynomial whose roots are the dominant roots of the given polynomial. Specific examples are given. [While Proposition 7 appears to be correct, a modification of the proof seems required to make it work].
    0 references
    0 references
    polynomial roots
    0 references
    linear recurrent sequences
    0 references
    Bernoulli's method
    0 references
    0 references
    0 references
    0 references
    0 references